Abstract
We solve the millionaires problem in the semi-trusted model with homomorphic encryption without using intermediate decryptions. This leads to the computationally least expensive solution with homomorphic encryption so far, with a low bandwidth and very low storage complexity. The number of modular multiplications needed is less than the number of modular multiplications needed for one Pallier encryption. The output of the protocol can be either publicly known, encrypted, or secret-shared. The private input of the first player is computationally secure towards the second player, and the private input of the second player is even unconditionally secure towards the first player. We also introduce an efficient client-server solution for the millionaires problem with similar security properties.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference24 articles.
1. Encrypted signal processing for privacy protection: Conveying the utility of homomorphic encryption and multiparty computation
2. Probabilistic encryption and how to play mental poker keeping secret all partial information;Goldwasser,1982
3. Probabilistic encryption
4. Public-key cryptosystems based on composite degree residuosity classes;Paillier,1999
5. Efficient and Secure Comparison for On-Line Auctions;Damgård,2007
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献