An Efficient Solution to the Millionaires’ Problem Based on Homomorphic Encryption
We proposed a two-round protocol for solving the Millionaires’ Problem in the setting of semi-honest parties. Our protocol uses either multiplicative or additive homomorphic encryptions. Previously proposed protocols used additive or XOR homomorphic encryption schemes only. The computation and communication costs of our protocol are in the same asymptotic order as those of the other efficient protocols. Nevertheless, since multiplicative homomorphic encryption scheme is more efficient than an additive one practically, our construction saves computation time and communication bandwidth in practicality.
Keywordssecure computation the greater than problem the socialist millionaires’ problem homomorphic encryption
Unable to display preview. Download preview PDF.
- [GMW87]Goldreich, O., Micali, S., Wigderson, A.: How to play and mental game. In: Proceedings of the 16th Annual ACM Symposium on the Theory of Computing (STOC 1987), pp. 218–229. ACM, New York (1987)Google Scholar
- [IG03]Ioannidis, I., Grama, A.: An efficient protocol for yao’s millionaires’ problem. In: Proceedings of the 36th Hawaii Internatinal Conference on System Sciences 2003 (2003)Google Scholar