Distance Computation between Two Private Preference Functions - ICT Systems Security and Privacy Protection (SEC 2014) Access content directly
Conference Papers Year : 2014

Distance Computation between Two Private Preference Functions

Alberto Blanco
  • Function : Author
  • PersonId : 986117
Josep Domingo-Ferrer
  • Function : Author
  • PersonId : 986115
Oriol Farràs
  • Function : Author
  • PersonId : 989435
David Sánchez
  • Function : Author
  • PersonId : 959371


We consider the following problem: two parties have each a private function, for example one that outputs the party’s preferences on a set of alternatives; they wish to compute the distance between their functions without any of the parties revealing its function to the other. The above problem is extremely important in the context of social, political or business networks, whenever one wishes to find friends or partners with similar interests without having to disclose one’s interests to everyone. We provide protocols that solve the above problem for several types of functions. Experimental work demonstrates that privacy preservation does not significantly distort the computed distances.
Fichier principal
Vignette du fichier
978-3-642-55415-5_39_Chapter.pdf (4 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01370400 , version 1 (22-09-2016)





Alberto Blanco, Josep Domingo-Ferrer, Oriol Farràs, David Sánchez. Distance Computation between Two Private Preference Functions. 29th IFIP International Information Security Conference (SEC), Jun 2014, Marrakech, Morocco. pp.460-470, ⟨10.1007/978-3-642-55415-5_39⟩. ⟨hal-01370400⟩
224 View
95 Download



Gmail Facebook X LinkedIn More