Non-interactive private auctions

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

Volumn 2339, Issue , 2002, Pages 364-377

  Baudron, Olivier ^a   Stern, Jacques ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

Auctions; Bidding; Homomorphic encryption; Secure circuit evaluation

Indexed keywords

CHROMIUM COMPOUNDS; COMMERCE;

AUCTION PROTOCOLS; AUCTIONS; BIDDING; EFFICIENT COMPUTATION; ELECTRONIC TRANSACTION; HO-MOMORPHIC ENCRYPTIONS; SECURE CIRCUITS; SEMI-TRUSTED THIRD PARTIES;

CRYPTOGRAPHY;

EID: 84949207060     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46088-8_28     Document Type: Conference Paper

References (23)

1. C. Beam and A. Segev. Auctions on the internet: A field study. Working Paper 98-WP-103, Fisher Center for Management and Information Technology, Haas School of Business, University of California, Berkeley, 1998.
2. M. Ben-Or, S. Goldwasser, and A. Widgerson. Completeness theorems for noncryptographic fault-tolerant distributed computing. In Proceedings of the 20th STOC, ACM, pages 1-10, 1988.
3. C. Cachin. Efficient Private Bidding and Auctions with an Oblivious Third Party. IBM research Report RZ 3131, 1999.
4. J. Camenisch and M. Michels. Proving that a Number Is the Product of Two Safe Primes. In Eurocrypt’99, LNCS 1592, pages 107-122. Springer-Verlag, 1999.
5. J. Camenish and M. Stadler. Efficient group signature schemes for large groups. In Crypto’97, LNCS 1294, pages 17-21. Springer-Verlag, 1997.
6. D. Chaum, C. Crepeau, and I. Damgaard. Multiparty unconditionally secure protocols. In Proceedings of the 20th STOC, ACM, pages 11-19, 1988.
7. R. Cramer, I. Damgård, and B. Schoenmakers. Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. Technical report, CWI, 1994. CSR9413.
8. A. de Santis, L. di Crescenzo, G. Persiano, and M. Yung. On Monotone Formula Closure of SZK. In Proc. of the 35th FOCS, pages 454-465. IEEE, 1994.
9. Z. Galil, S. Haber, and M. Yung. Secure Fault-tolerant Protocols and the Public-Key Model. In Crypto’87. Springer-Verlag, 1987.
10. O. Goldreich, S. Micali, and A. Widgerson. How to play any mental game. In Proceedings of the 19th STOC, ACM, pages 218-229, 1987.
11. O. Goldreich and R. Vainish. How to Solve any Protocol Problem-An efficiency Improvement. In Crypto’87. Springer-Verlag, 1987.
12. S. Goldwasser and S. Micali. Probabilistic Encryption. Journal of Computer and System Sciences, 28:270-299, 1984.
13. L. C. Guillou and J.-J. Quisquater. A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory. In Eurocrypt’88, LNCS 330, pages 123-128. Springer-Verlag, 1988.
14. L. Harkavy, D. Tygar, and H. Kikuchi. Electronic Auctions with private bids. In Proc. 3rd USENIX Workshop on Electronic Commerce (Boston), 1998.
15. M. Kumar and S.I. Feldman. Internet Auctions. In Proc. 3rd USENIX Workshop on Electronic Commerce (Boston), 1998.
16. D. Naccache and J. Stern. A New Public-Key Cryptosystem. In Eurocrypt’97, LNCS 1233, pages 27-36. Springer-Verlag, 1997.
17. T. Okamoto and S. Uchiyama. A New Public Key Cryptosystem as Secure as Factoring. In Eurocrypt’98, LNCS 1403, pages 308-318. Springer-Verlag, 1998.
18. P. Paillier. Public-Key Cryptosystems Based on Discrete Logarithms Residues. In Eurocrypt’99, LNCS. Springer-Verlag, 1999.
19. B. Pinkas, M. Naor, and R. Sumner. Pricacy Preserving Auctions Mechanism Design. In Proceedings of the 1st conf. on Electronic Commerce, ACM, November 1999.
20. G. Poupard and J. Stern. Security Analysis of a Practical “on the fly” Authentication and Signature Generation. In Eurocrypt’98, LNCS 1403, pages 422-436. Springer-Verlag, 1998.
21. T. Sander, A. Young, and M. Yung. Non-Interactive CryptoComputing for NC1. In Proceedings of the 31st STOC, ACM, 1999.
22. A. Shamir. How to Share a Secret. Communications of the ACM, 22:612-613, November 1979.
23. A. Yao. How to generate and exchange secrets. In Proc. of the 27th FOCS, pages 162-167. IEEE, 1986.