Abstract
A new scheme for electronic sealed-bid auctions that preserves losing bids is presented. By this scheme, the computational complexity of the opening phase can be reduced to O(log ℓ); previous works required O(N⁗ℓ) or O(N⁗log ℓ) where the number of bidders is N and the range of bids is ℓ. The proposed scheme has two technical points. One is that computational complexity is independent of the number of bidders. The other is a new efficient value-comparing method. These techniques allow our auction scheme to be more than five hundred times faster than previous schemes. Furthermore, our auction scheme can be eleven million times faster than previous schemes if it is assured that auctioneers do not conspire.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
D. Boneh, “The Decision Diffie-Hellman Problem,” Proc. of ANTS-III, LNCS 1423, Springer-Verlag, pp. 48–63, 1998.
C. Cachin, “Efficient Private Bidding and Auctions with an Oblivious Third Party,” Proc. of ACM-CCS’99, 1999.
W. Diffie and M. Hellman, “NewDirections in Cryptography,” IEEE Trans. on Information Theory, IT-22, 6, pp. 644–654, 1976.
M. Jakobsson, M. Yung, “Proving Without Knowing: On Oblivious, Agnostic and Blindfolded Provers,” Proc. of CRYPTO 96, LNCS 1109, Springer-Verlag, pp. pp. 186–200, 1996.
H. Kikuchi, M. Harkavy and D. Tygar, “Multi-Round Anonymous Auction Protocols,” IEICE Trans. Inf. & Syst., Vol. E82-D, No.4, pp. 769–777, 1999.
M. Naor and B. Pinkas, “Oblivious Transfer and Polynomial Evaluation,” Proc. of 31st STOC, pp. 245–254, 1999.
M. Naor, B. Pinkas and R. Sumner, “Privacy Preserving Auctions and Mechanism Design,” ACM Workshop on E-Commerce, 1999.
M. Naor and O. Reingold, “Number-Theoretic Constructions of Efficient Pseudo-Random Functions,” Extended abstract in: Proc. of 38th FOCS, pp. 458–467, 1997.
R. L. Rivest and A. Shamir, “PayWord and MicroMint-Two simple micropayment schemes,” Proc. of 1996 International Workshop on Security Protocols, LNCS 1189, pp. 69–87, 1996.
K. Sako, “An auction protocol which hides bids of losers,” Proc. of PKC’2000, pp. 422–432, 2000.
A.C. Yao, “Protocols for Secure Computations,” Proc. of FOCS, pp. 160–164, 1982.
A.C. Yao, “How to Generate and Exchange Secrets,” Proc. of FOCS, pp. 162–167, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chida, K., Kobayashi, K., Morita, H. (2001). Efficient Sealed-Bid Auctions for Massive Numbers of Bidders with Lump Comparison. In: Davida, G.I., Frankel, Y. (eds) Information Security. ISC 2001. Lecture Notes in Computer Science, vol 2200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45439-X_28
Download citation
DOI: https://doi.org/10.1007/3-540-45439-X_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42662-2
Online ISBN: 978-3-540-45439-7
eBook Packages: Springer Book Archive