Efficient solution to Yao's Millionaires' problem

Tien Tzu Hsueh Pao/Acta Electronica Sinica

Volumn 33, Issue 5, 2005, Pages 769-773

  Li, Shun Dong ^a   Dai, Yi Qi ^a   You, Qi You ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

Computational complexity; Millionaires' problem; Oblivious transfer; Secure multi party computation

Indexed keywords

COMPUTATIONAL COMPLEXITY; FUNCTIONS; NETWORK PROTOCOLS; PROBLEM SOLVING; SECURITY OF DATA;

COMPUTATIONAL EFFICIENCY; LENGTH FUNCTIONS; MILLIONAIRES PROBLEM; OBLIVIOUS TRANSFER; SECURE MULTI PARTY COMPUTATION;

CRYPTOGRAPHY;

EID: 22844441340     PISSN: 03722112     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (13)

1. A Yao. Protocols for secure computations[A]. Proceeding of the 23rd IEEE Symposium on Foundations of Computer Science[C]. Los Alamitos, CA: IEEE Computer Society Press, 1982. 160-164.
2. C Cachin. Efficient private bidding and auction with an obvious third party[A]. Proceeding of the 6th ACM conference on computer and communication security[C]. New York: ACM Press, 1999. 120-127.
3. Oded Goldreich, Silvio Micali, Avi Wigderson. How to play ANY mental game[A]. Proceedings of the nineteenth annual ACM conference on Theory of computing[C]. New York: ACM Press, 1987. 218-229.
4. O Goldreich. Secure multi-party computation (working draft)[OL]. http://www.wisdom.weizmann.ac.il/home/oded/public_html/foc.html, 2002.
5. S Goldwasser. Multi-party computations: Past and present[A]. Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing[C]. New York: ACM Press, 1997. 21-24.
6. Wenliang Du, Atallah J. Secure multi-party computation problems and their applications: A review and open problems[A]. New Security Paradigms Workshop 2001[C]. Cloudcroft, New Mexico, USA, Sep. 11-13, 2001, 11-20.
7. Mikhail J Atallah, Wenliang Du. Secure multi-party computational geometry[A]. In Seventh International Workshop on Algorithms and Data Structures (WADS 2001), Lecture Note in Computer Science 2125[C]. New York: Springer-verlag, 2001. 165-179.
8. Y Lindell, B Pinkas. Privacy preserving data mining[J]. Journal of Cryptology, 2002, 15(3): 177-206.
9. Ronald Fagin, Moni Naor, Peter Einkler. Comparing information without leaking it[J]. Communications of the ACM, 1996, 39(5): 77-85.
10. M Rabin. How to exchange secrets by oblivious transfer[R]. Technical Report TR-81, Aiken Computation Laboratory, Harvard Univ, 1981.
11. M Naor, B Pinkas. Efficient oblivious transfer protocols[A]. Proc 12th Ann Symp Discrete Algorithms[C]. New York: ACM Press, 2001. 448-457.
12. Wen-Guey Tzeng. Efficient 1-out-of-n oblivious transfer schemes with universally usable parameters[J]. IEEE TRANSACTIONS ON COMPUTERS, 2004, 53(2): 232-240.
13. William Stallings. Cryptography and Network Security: Principles and Practice (2nd ed)[M]. Beijing: Tsinghua University Press, 2003. 264-269.