An efficient and verifiable solution to the millionaire problem

Lecture Notes in Computer Science

Volumn 3506, Issue , 2005, Pages 51-66

  Peng, Kun ^a   Boyd, Colin ^a   Dawson, Ed ^a   Lee, Byoungcheon ^a,b  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

^b Joongbu University   (South Korea)

Author keywords

Batch equation; Efficiency; Millionaire problem; Verifiability; Zero test

Indexed keywords

COMPUTER SCIENCE; CRYPTOGRAPHY; EFFICIENCY; INFORMATION RETRIEVAL; INTEGER PROGRAMMING; SECURITY OF DATA;

BATCH EQUATION; MILLIONARIE PROBLEM; VERIFIABILITY; ZERO TEST;

PROBLEM SOLVING;

EID: 24944554813     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11496618_6     Document Type: Conference Paper

References (32)

1. Riza Aditya, Kun Peng, Colin Boyd, and Ed Dawson. Batch verification for equality of discrete logarithms and threshold decryptions. In Second conference of Applied Cryptography and Network Security, ACNS 04, volume 3089 of Lecture Notes in Computer Science, pages 494-508, Berlin, 2004. Springer-Verlag.
2. D. Beaver. Minimal-latency secure function evaluation. In EUROCRYPT '00, Bruges, Belgium, May 14-18, 2000, Proceeding, volume 1807 of Lecture Notes in Computer Science, pages 335-350. Springer, 2000.
3. Michael Ben-Or, Shafi Goldwasser, Joe Killian, and Avi Wigderson. Multi-prover interactive proofs: How to remove intractability assumptions. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC1988, pages 113-131, 1988.
4. Christian Cachin. Efficient private bidding and auctions with an oblivious third party. In the 6th ACM Conference on Computer and Communications Security, 1999. Available at http://www.tml.hut.fi/~helger/crypto/link/ protocols/auctions.html.
5. Christian Cachin and Jan Camenisch. Optimistic fair secure computation (extended abstract). In CRYPTO '00, pages 94-112, Berlin, 2000. Springer-Verlag. Lecture Notes in Computer Science 1880.
6. D. Chaum, I. B. Damgård, and J. van de Graaf. Multiparty computations ensuring privacy of each party's input and correctness of the result. In CRYPTO '87, pages 87-119, Berlin, 1987. Springer-Verlag. Lecture Notes in Computer Science Volume 293.
7. D. Chaum and T. P. Pedersen. Wallet databases with observers. In CRYPTO '92, pages 89-105, Berlin, 1992. Springer-Verlag. Lecture Notes in Computer Science Volume 740.
8. David Chaum, Claude Crepeau, and Ivan Damgård. Multiparty unconditionally secure protocols (extended abstract). In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC1988, pages 11-19, 1988.
9. Ronald Cramer, Ivan Damgård, Stefan Dziembowski, Martin Hirt, and Tal Rabin. Efficient multiparty computations secure against an adaptive adversary. In EUROCRYPT '99, volume 1592 of Lecture Notes in Computer Science, pages 311-326. Springer, 1999.
10. Ronald Cramer, Ivan Damgård, and Jesper Buus Nielsen. Multiparty computation from threshold homomorphic encryption. In EUROCRYPT '01, Innsbruck, Austria, May 6-10, 2001, Proceeding, volume 2045 of Lecture Notes in Computer Science, pages 280-299. Springer, 2001.
11. P Feldman. A practical scheme for non-interactive verifiable secret sharing. In 28th Annual Symposium on Foundations of Computer Science, pages 427-437, 1987.
12. Marc Fischlin. A cost-effective pay-per-multiplication comparison method for millionaires. In Topics in Cryptology - CT-RSA 2001, The Cryptographer's Track at RSA Conference 2001, San Francisco, CA, USA, April 8-12, 2001, Proceedings, volume 2020 of Lecture Notes in Computer Science, pages 457-472. Springer, 2001.
13. Matthew K. Franklin and Stuart Haber. Joint encryption and message-efficient secure computation. Journal of Cryptology 9(4), pages 217-232, 1996.
14. R Gennaro, S Jarecki, H Krawczyk, and T Rabin. Secure distributed key generation for discrete-log based cryptosystems. In EUROCRYPT '99, pages 123-139, Berlin, 1999. Springer-Verlag. Lecture Notes in Computer Science Volume 1592.
15. Rosario Gennaro, Michael O. Rabin, and Tal Rabin. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing, PODC'98, pages 101-111, 1987.
16. Oded Goldreich, Silvio Micali, and Avi Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC 1987, pages 218-229, 1987.
17. Philippe Golle, Sheng Zhong, Dan Boneh, Markus Jakobsson, and Ari Juels. Optimistic mixing for exit-polls. In ASIACRYPT '02, pages 451-465, Berlin, 2002. Springer-Verlag. Lecture Notes in Computer Science Volume 1592.
18. Jens Groth. A verifiable secret shuffle of homomorphic encryptions. In Public Key Cryptography 2003, pages 145-160, Berlin, 2003. Springer-Verlag. Lecture Notes in Computer Science Volume 2567.
19. M Jakobsson and A Juels. Mix and match: Secure function evaluation via ciphertexts. In ASIACRYPT '00, pages 143-161, Berlin, 2000. Springer-Verlag. Lecture Notes in Computer Science Volume 1976.
20. A. Juels and M. Szydlo. An two-server auction protocol. In Proc. of Financial Cryptography, pages 329-340, 2002.
21. Kaoru Kurosawa and Wakaha Ogata. Bit-slice auction circuit. In 7th European Symposium on Research in Computer Security, ESORICS2002, volume 2502 of Lecture Notes in Computer Science Volume 2339, pages 24 - 38, Berlin, 2002. Springer-Verlag.
22. H. Lipmaa. Verifiable homomorphic oblivious transfer and private equality test. In ASIACRYPT '03, volume 2894 of Lecture Notes in Computer Science, pages 416-433, Berlin, 2003. Springer.
23. A. Menezes, P. van Oorschot, and S. Vanstone. Handbook of Applied Cryptography. CRC press, 1996.
24. Moni Naor, Benny Pinkas, and Reuben Sumner. Privacy perserving auctions and mechanism design. In ACM Conference on Electronic Commerce 1999, pages 129-139, 1999.
25. P Paillier. Public key cryptosystem based on composite degree residuosity classes. In EUROCRYPT '99, pages 223-238, Berlin, 1999. Springer-Verlag. Lecture Notes in Computer Science Volume 1592.
26. C. Park, K. Itoh, and K. Kurosawa. Efficient anonymous channel and all/nothing election scheme. In EUROCRYPT '93, pages 248-259, Berlin, 1993. Springer-Verlag. Lecture Notes in Computer Science Volume 765.
27. Torben P. Pedersen. A threshold cryptosystem without a trusted party. In EUROCRYPT '91, pages 522-526, Berlin, 1991. Springer-Verlag. Lecture Notes in Computer Science Volume 547.
28. Torben P. Pedersen. Distributed Provers and Verifiable Secret Sharing Based on the Discrete Logarithm Problem. PhD thesis, Computer Science Department, Aarhus University,Aarhus, Denmark, 1992.
29. Kun Peng, Colin Boyd, Edward Dawson, and Kapali Viswanathan. Efficient implementation of relative bid privacy in sealed-bid auction. In The 4th International Workshop on Information Security Applications, WISA2003, volume 2908 of Lecture Notes in Computer Science, pages 244-256, Berlin, 2003. Springer-Verlag.
30. Kun Peng, Colin Boyd, Edward Dawson, and Kapali Viswanathan. A correct, private and efficient mix network. In 2004 International Workshop on Practice and Theory in Public Key Cryptography, pages 439-454, Berlin, 2004. Springer-Verlag.
31. 1. In 40th Annual Symposium on Foundations of Computer Science, New York, NY, USA, FOCS '99, pages 554-567, 1999.
32. C Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4, 1991, pages 161-174, 1991.