| HAL-Inria | Publications, software ... of Inria's scientists |
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.
Cited literature [16 references]
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
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