Skip to Main content Skip to Navigation
Conference papers

Distance Computation between Two Private Preference Functions

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/hal-01370400
Contributor : Hal Ifip <>
Submitted on : Thursday, September 22, 2016 - 2:38:09 PM
Last modification on : Tuesday, September 8, 2020 - 3:54:02 PM

File

978-3-642-55415-5_39_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

307

Files downloads

221