A two-server, sealed-bid auction protocol

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2357, Issue , 2003, Pages 72-86

  Juels, Ari ^a   Szydlo, Michael ^a  

^a RSA   (United States)

Author keywords

Auction; Oblivious transfer; Sealed bid auction; Secure function evaluation; Secure multiparty computation

Indexed keywords

CRYPTOGRAPHY;

AUCTION; OBLIVIOUS TRANSFER; SEALED-BID AUCTIONS; SECURE FUNCTION EVALUATION; SECURE MULTI-PARTY COMPUTATION;

CHROMIUM COMPOUNDS;

EID: 84957011768     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36504-4_6     Document Type: Conference Paper

References (26)

1. O. Baudron and J. Stern. Non-interactive private auctions. In S. Haber, editor, Financial Cryptography '01, pages 303-313, 2001.
2. D. Beaver. Minimal-latency secure function evaluation. In B. Preneel, editor. Advances in Cryptology - Eurocrypt '00, pages 335-350. Springer-Verlag, 2000. LNCS no. 1807.
3. M. Bellare, S. Micali, and P. Rogaway. The round complexity of secure protocols. In ACM CCS '90, pages 503-513. ACM Press, 1990.
4. M. Blum and S. Goldwasser. An efficient probabilistic public-key encryption scheme which hides all partial information. In G.R Blakely ajtid D. Chaum, editors, Advances in Cryptology - Crypto '84, pages 289-299. Springer-Verlag, 1985. LNCS No. 196.
5. C. Cachin. Efficient private bidding and auctions with an oblivious third party. In G. Tsudik, editor, ACM CCS '99, pages 120-127. ACM Press, 1999.
6. C. Cachin and J. Camenisch. Optimistic fair secure computation. In M. Bellare, editor. Advances in Cryptology - Crypto '00, pages 94-112. Springer-Verlag, 2000. LNCS no. 1880.
7. C. Cachin, J. Camenisch, J. Kilian, and J. Muller. One-round secure computation and secure autonomous mobile agents, 2000.
8. R. Cramer, I. Damgard, and J.B. Nielsen. Multiparty computation from threshold homomorphic encryption. In B. Pfitzmann, editor, Advances in Cryptology -Eurocrypt '01, pages 280-300. Springer-Verlag, 2001. LNCS no. 2045.
9. Claude Crepeau. Verifiable disclosure of secrets and applications. In J.J. Quisquater and J. Vandewalle, editors, Advances in Cryptology - Eurocrypt '89, pages 181-191. Springer-Verlag, 1990. LNCS no. 434.
10. Claude Crejjeau, van de Graaf, Jeroen, and Alain Tapp. Committed oblivious transfer and private multi-party computation. In D. Coppersmith, editor, Advances in Cryptology - Crypto '95, pages 110-123. Springer-Verlag, 1995. LNCS No. 963.
11. G. Di Crescenzo. Private selective pajonent protocols. In P. Syverson, editor, Financial Cryptography '00, 2000.
12. M. Franklin and M. Reiter. The design and implementation of a secure auction server. IEEE Transactions on Information Theory, 22(5):302-312, 1996.
13. M. Franklin and M. Yung. Varieties of secure distributed computing. In Proc. Sequences II, Methods in Communications, Security and Computer Science, pages 392-417, 1991.
14. T. El Gajnal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31:469-472, 1985.
15. O. Goldreich, S. Micaii, and A. Wigderson. How to play any mental game. In STOC '87, pages 218-229. ACM Press, 1987.
16. S. Goldwasser and S. Micaii. Probabilistic encryption. J. Comp. Sys. Sci, 28(1):270-299, 1984.
17. M. Harkavy, J.D. Tygar, and H. Kikuchi. Electronic auctions with private bids. In 3rd USENIX Workshop on Electronic Commerce, pages 61-73, 1999.
18. M. Hirt, U. Maurer, and B. Przydatek. Efficient secure multi-party computation. In T. Okamoto, editor, Advances in Cryptology - Asiacrypt '00, pages 143-161. Springer-Verlag, 2000. LNCS No. 1976.
19. M. Jakobsson and A. Juels. Mix and match: Secure function evaluation via ciphertexts. In T. Okamoto, editor, Advances in Cryptology - Asiacrypt '00, pages 162-177. Springer-Verlag, 2000. LNCS No. 1976.
20. M. Naor, B. Pinkas, and R. Sumner. Privacy preserving auctions and mechanism design. In 1st ACM Conf. On Electronic Commerce, pages 129-139. ACM Press, 1999.
21. M. Rabin. How to exchange secrets by oblivious transfer, 1991. Tech. Memo TR-81 Aiken Computation Laboratory, Harvard University.
22. R. L. Rivest. Unconditionally secure commitment and oblivious transfer schemes using private channels and a trusted initializer, 1999.
23. R. L. Rivest, A. Shamir, and L. M. Adelman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21:120-126, 1977.
24. K. Sako. An auction protocol which hides bids of losers. In H. Imai and Y. Zheng, editors, PKC '00, pages 422-432. Springer-Verlag, 2000. LNCS no. 1751.
25. Stuart G. Stubblebine and Paul P. Syverson. Fair on-line auctions without special trusted parties. In Financial Cryptography, pages 230-240, 1999.
26. A.C. Yao. Protocols for secure computations (extended abstract). In FOCS '82, pages 160-164. IEEE Computer Society, 1982.