An efficient protocol for Yao's millionaires' problem

Proceedings of the 36th Annual Hawaii International Conference on System Sciences, HICSS 2003

Volumn , Issue , 2003, Pages

  Ioannidis, I ^a   Grama, A ^a  

^a Purdue University   (United States)

Author keywords

on line bidding; secure multiparty computations; Yao's millionaires' problem

Indexed keywords

COMMERCE; ELECTRONIC COMMERCE;

ASYMPTOTICALLY OPTIMAL; COMMUNICATION OVERHEADS; E-COMMERCE APPLICATIONS; EXPERIMENTAL EVIDENCE; ON-LINE BIDDING; PUBLIC KEY CRYPTOGRAPHIC SYSTEMS; SECURE MULTI-PARTY COMPUTATION; YAO'S MILLIONAIRES' PROBLEM;

CRYPTOGRAPHY;

EID: 84969524054     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HICSS.2003.1174464     Document Type: Conference Paper

References (12)

1. Andrew C.-C. Yao, Protocols for secure computation, Proc. 23rd IEEE Symposium on Foundations of Computer Science (FOCS), 1982, pp 160 - 164.
2. D. Beaver and S. Goldwasser, Multiparty computation with faulty majority, in Proc. 30th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 468-473, 1989.
3. D. Beaver, S. Micali, and P. Rogaway, The round complexity of secure protocols, in Proc. 22nd Annual ACM Symposium on Theory of Computing (STOC), pp. 503-513, 1990.
4. Christian Cachin, Efficient Private Bidding and Auctions with an Oblivious Third Party, Proc. 6th ACM Conference on Computer and Communications Security (CCS), 1999. p. 120-126
5. Christian Cachin and Jan Camenisch, Optimistic Fair Secure Computation, In Mihir Bellare, editor, Advances in Cryptology: CRYPTO 2000, Vol. 1880, Lecture Notes in Computer Science, pages 94-112. Springer, 2000.
6. D. Chaum, I. Damgard, and J. van de Graaf, Multiparty computations ensuring privacy of each party's input and correctness of the result, in Advances in Cryptology: CRYPTO '87 (C. Pomerance, ed.), Vol. 293, Lecture Notes in Computer Science, Springer, 1988.
7. U. Feige, J. Kilian, and M. Naor, A minimal model for secure computation, in Proc. 26th Annual ACM Symposium on Theory of Computing (STOC), pp. 554-563, 1994.
8. Oded Goldreich, Silvio Micali and Avi Wigderson, How to play any mental game or a completeness theorem for protocols with honest majority, Proc. 19th Annual ACM Symposium on Theory of Computing (STOC), 1987, pp. 218-229.
9. S. Goldwasser and L. Levin, Fair computation of general functions in presence of immoral majority, in Advances in Cryptology: CRYPTO '90 (A. J. Menezes and S. A. Vanstone, eds.), Vol. 537, Lecture Notes in Computer Science, Springer, 1991.
10. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proceedings of the 2000 SIGMOD International Conference on Management of Data, pages 1-12, Dallas, Texas, May 2000.
11. M. Rabin, "How to exchange secrets by oblivious transfer", Technical report TR-81, Aiken Computation Laboratory, Harvard University, 1981.
12. http://www.eskimo.com/ weidai/cryptlib.html