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.
Nora Cuppens-Boulahia; Frédéric Cuppens; Sushil Jajodia; Anas Abou El Kalam; Thierry Sans. 29th IFIP International Information Security Conference (SEC), Jun 2014, Marrakech, Morocco. Springer, IFIP Advances in Information and Communication Technology, AICT-428, pp.460-470, 2014, ICT Systems Security and Privacy Protection. 〈10.1007/978-3-642-55415-5_39〉
https://hal.inria.fr/hal-01370400
Contributeur : Hal Ifip
<>
Soumis le : jeudi 22 septembre 2016 - 14:38:09
Dernière modification le : jeudi 22 septembre 2016 - 15:05:42
Alberto Blanco, Josep Domingo-Ferrer, Oriol Farràs, David Sánchez. Distance Computation between Two Private Preference Functions. Nora Cuppens-Boulahia; Frédéric Cuppens; Sushil Jajodia; Anas Abou El Kalam; Thierry Sans. 29th IFIP International Information Security Conference (SEC), Jun 2014, Marrakech, Morocco. Springer, IFIP Advances in Information and Communication Technology, AICT-428, pp.460-470, 2014, ICT Systems Security and Privacy Protection. 〈10.1007/978-3-642-55415-5_39〉. 〈hal-01370400〉
