[PET] Homomorphic hashing?
Zekeriya Erkin - EWI
Z.Erkin at tudelft.nl
Thu Nov 3 09:10:01 GMT 2011
This problem is known as Yao's Millionaires Problem. You can find efficient solutions in terms of computation in the following papers.
Z. Erkin, M. Franz, J. Guajardo, S. Katzenbeisser, R. L. Lagendijk and T. Toft, Privacy- Preserving Face Recognition, 9th International Syposium on Privacy Enhancing Tech- nologies, LNCS 5672, pp. 235-253, August 2009.
Efficient Privacy-Preserving Face Recognition, Ahmad-Reza Sadeghi, Thomas Schneider, Immo Wehrenberg, - 12th International Conference on Information Security and Cryptology (ICISC'09), December 2-4, Seoul, Korea.
On Oct 31, 2011, at 3:04 PM, R. J. Cronk wrote:
> I'd like to be able to take two numbers and do a greater than comparison x < y. However, I'd like to be able to do this without knowing x and y. This might be useful in blind bidding where I want to compare two bids without actually revealing the bid. Is there such a thing or can anybody suggest an alternative method?
> PET mailing list
> PET at lists.links.org
More information about the PET