Abstract
We describe a new auction protocol that enjoys the following properties: the biddings are submitted non-interactively and no information beyond the result is disclosed. The protocol is efficient for a logarithmic number of players. Our solution uses a semi-trusted third party T who learns no information provided that he does not collude with any participant. The robustness against active cheating players is achieved through an extra mechanism for fair encryption of a bit which is of independent interest. The scheme is based on homomorphic encryption but differs from general techniques of secure circuit evaluation by taking into account the level of each gate and allowing efficient computation of unbounded logical gates. In a scenario with a small numbers of players, we believe that our work may be of practical significance, especially for electronic transactions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
M. Ben-Or, S. Goldwasser, and A. Widgerson. Completeness theorems for non-cryptographic fault-tolerant distributed computing. In Proceedings of the 20th STOC, ACM, pages 1–10, 1988.
C. Cachin. Efficient Private Bidding and Auctions with an Oblivious Third Party. IBM research Report RZ 3131, 1999.
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.
J. Camenish and M. Stadler. Efficient group signature schemes for large groups. In Crypto’97, LNCS 1294, pages 17–21. Springer-Verlag, 1997.
D. Chaum, C. Crepeau, and I. Damgaard. Multiparty unconditionally secure protocols. In Proceedings of the 20th STOC, ACM, pages 11–19, 1988.
R. Cramer, I. Damgård, and B. Schoenmakers. Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. Technical report, CWI, 1994. CS-R9413.
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.
Z. Galil, S. Haber, and M. Yung. Secure Fault-tolerant Protocols and the Public-Key Model. In Crypto’87. Springer-Verlag, 1987.
O. Goldreich, S. Micali, and A. Widgerson. How to play any mental game. In Proceedings of the 19th STOC, ACM, pages 218–229, 1987.
O. Goldreich and R. Vainish. How to Solve any Protocol Problem-An efficiency Improvement. In Crypto’87. Springer-Verlag, 1987.
S. Goldwasser and S. Micali. Probabilistic Encryption. Journal of Computer and System Sciences, 28:270–299, 1984.
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.
L. Harkavy, D. Tygar, and H. Kikuchi. Electronic Auctions with private bids. In Proc. 3rd USENIX Workshop on Electronic Commerce (Boston), 1998.
M. Kumar and S.I. Feldman. Internet Auctions. In Proc. 3rd USENIX Workshop on Electronic Commerce (Boston), 1998.
D. Naccache and J. Stern. A New Public-Key Cryptosystem. In Eurocrypt’97, LNCS 1233, pages 27–36. Springer-Verlag, 1997.
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.
P. Paillier. Public-Key Cryptosystems Based on Discrete Logarithms Residues. In Eurocrypt’99, LNCS. Springer-Verlag, 1999.
B. Pinkas, M. Naor, and R. Sumner. Pricacy Preserving Auctions Mechanism Design. In Proceedings of the 1st conf. on Electronic Commerce, ACM, November 1999.
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.
T. Sander, A. Young, and M. Yung. Non-Interactive CryptoComputing for NC 1. In Proceedings of the 31st STOC, ACM, 1999.
A. Shamir. How to Share a Secret. Communications of the ACM, 22:612–613, November 1979.
A. Yao. How to generate and exchange secrets. In Proc. of the 27th FOCS, pages 162–167. IEEE, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baudron, O., Stern, J. (2002). Non-interactive Private Auctions. In: Syverson, P. (eds) Financial Cryptography. FC 2001. Lecture Notes in Computer Science, vol 2339. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46088-8_28
Download citation
DOI: https://doi.org/10.1007/3-540-46088-8_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44079-6
Online ISBN: 978-3-540-46088-6
eBook Packages: Springer Book Archive