An efficient solution to the millionaires' problem based on homomorphic encryption

Lecture Notes in Computer Science

Volumn 3531, Issue , 2005, Pages 456-466

  Lin, Hsiao Ying ^a   Tzeng, Wen Guey ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Secure computation; The greater than problem; The socialist millionaires' problem homomorphic encryption

Indexed keywords

BANDWIDTH; COMPUTATIONAL METHODS; COSTS; NETWORK PROTOCOLS; PROBLEM SOLVING;

SECURE COMPUTATION; THE GREATER THAN PROBLEM; THE SOCIALIST MILLIONAIRES' PROBLEM HOMOMORPHIC ENCRYPTION;

CRYPTOGRAPHY;

EID: 26444581774     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11496137_31     Document Type: Conference Paper

References (9)

1. [BK04] Ian F. Blake and Vladimir Kolesnikov. Strong conditional oblivious transfer and computing on intervals. In Proceedings of Advances in Cryptology - ASIACRYPT '04, volume 3329 of LNCS, pages 515-529. Springer-Verlag, 2004.
2. [Cac99] Christian Cachin. Efficient private bidding and auctions with an oblivious third party. In Proceedings of the 6th ACM conference on Computer and communications security - CCS '99, pages 120-127. ACM Press, 1999.
3. [Fis01] Marc Fischlin. A cost-effective pay-per-multiplication comparison method for millionaires. In Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA, volume 2020 of LNCS, pages 457-472. Springer-Verlag, 2001.
4. [FNP04] Michael J. Freedman, Kobbi Nissim, and Benny Pinkas. Efficient private matching and set intersection. In Proceedings of Advances in Cryptology - EUROCRYPT '04, volume 3027 of LNCS, pages 1-19. Springer-Verlag, 2004.
5. [GMW87] O. Goldreich, S. Micali, and A. Wigderson. How to play and mental game. In Proceedings of the 16th Annual ACM Symposium on the Theory of Computing (STOC '87), pages 218-229. ACM, 1987.
6. [IG03] Ioannis Ioannidis and Ananth Grama. An efficient protocol for yao's millionaires' problem. In Proceedings of the 36th Hawaii Internatinal Conference on System Sciences 2003, 2003.
7. [ST04] Berry Schoenmakers and Pim Tuyls. Pratical two-party computation based on the conditional gate. In Proceedings of Advances in Cryptology - ASIACRYPT '04, volume 3329 of LNCS, pages 119-136. Springer-Verlag, 2004.
8. [Yao82] A. C. Yao. Protocols for secure computations. In Proceedings of 23th Annual Symposium on Foundations of Computer Science (FOCS '82), pages 160-164. IEEE, 1982.
9. [Yao86] A. C. Yao. How to generate and exchange secrets. In Proceedings of 27th Annual Symposium on Foundations of Computer Science (FOCS '86), pages 162-167. IEEE, 1986.