Abstract
This paper points out the risk of bid-rigging in electronic sealed-bid auctions and provides a receipt-free sealed-bid auction scheme to prevent it. The scheme enjoys receipt-freeness, secrecy of bidding price and public verifiability and uses a chameleon bit-commitment technique. It requires a bidding booth and a one-way untappable channel from eachbidding boothto eachauctioneer.
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.
Similar content being viewed by others
References
M. Abe and K. Suzuki, “M+1-st Price Auction using Homomorphic Encryption”, Proceedings of Public Key Cryptography 2002, LNCS 2274, pp. 115–124, (2002).
F. Brandt, “A verifiable, bidder-resolved Auction Protocol”, Proceedings of workshop on “Deception, Fraud and Trust in Agent Societies” in Autonomous Agents and Multi-Agent Systems 2002, workshop proceedings, (2002).
O. Baudron and J. Stern, “Non-interactive Private Auctions”, Proceedings of Financial Cryptography 2001, to be published, (2001).
C. Cachin, “Efficient Private Bidding and Auctions with an Oblivious Third Party”, Proceedings of 6th ACM Conference on Computer and Communications Security, pp. 120–127, (1999).
K. Chida, K. Kobayashi and H. Morita, “Efficient Sealed-bid Auctions for Massive Numbers of Bidders withLump Comparison”, Proceedings of ISC 2001, LNCS 2200, pp. 408–419, (2001).
M. Harkavy, J. D. Tygar and H. Kikuchi, “Electronic Auctions with Private Bids”, Proceedings of Third USENIX Workshop on Electronic Commerce, pp. 61–74, (1998).
H. Kikuchi, M. Harkavy and J. D. Tygar, “Multi-round Anonymous Auction Protocols”, Proceedings of first IEEE Workshop on Dependable and Real-Time E-Commerce Systems, pp. 62–69, (1998).
A. Juels and M. Szydlo, “A Two-Server, Sealed-Bid Auction Protocol”, Proceedings of Financial Cryptography 02, to be published, (2002).
H. Kikuchi, “(M+1)st-Price Auction Protocol”, Proceedings of Financial Cryptography 2001, to be published, (2001).
K. Kobayashi, H. Morita, K. Suzuki and M. Hakuta, “Efficient Sealedbid Auction by using One-way Functions”, IEICE Trans. Fundamentals, Vol.E84-A NO.1, (Jan. 2001).
M. Kudo, “Secure Electronic Sealed-Bid Auction Protocol with Public Key Cryptography”, IEICE Trans. Fundamentals, Vol.E81-A NO.1, pp. 20–27, (Jan. 1998).
H. Lipmaa, N. Asokan and V. Niemi, “Secure Vickrey Auctions without Threshold Trust”, Proceedings of Financial Cryptography 02, to be published, (2002).
M. Naor, B. Pinkas and R. Sumner, “Privacy Preserving Auctions and Mechanism Design”, Proceedings of ACM conference on E-commerce, pp. 129–139, (1999).
K. Omote and A. Miyaji, “An Anonymous Auction Protocol witha Single Non-trusted Center Using Binary Trees”, Proceedings of ISW 2000, LNCS 1975, pp. 108–120, (2000).
K. Omote and A. Miyaji, “A Second-price Sealed-Bid Auction with the Discriminant of the p-th Root”, Proceedings of Financial Cryptography 02, to be published, (2002).
K. Sako, “Universally verifiable auction protocol which hides losing bids”, Proceedings of Public Key Cryptography 2000, pp. 35–39, (2000).
K. Suzuki, K. Kobayashi and H. Morita, “Efficient Sealed-Bid Auction using Hash Chainrd, Proceedings of ICISC 2000, LNCS 2015, pp. 183–191, (2000).
K. Sakurai and S. Miyazaki, “A bulletin-board based digital auction scheme with bidding down strategy”, Proceedings of 1999 International Workshop on Cryptographic Techniques and E-Commerce, pp. 180–187, (1999).
S. G. Stubblebine and P. F. Syverson, “Fair On-line Auctions Without Special Trusted Parties”, Proceedings of Financial Cryptography 99, LNCS 1648, (1999).
K. Suzuki and M. Yokoo, “Secure Combinatorial Auctions by Dynamic Programming with Polynomial Secret Sharing”, Proceedings of Financial Cryptography 02, to be published, (2002).
M. Yokoo and K. Suzuki, “Secure Multi-agent Dynamic Programming based on Homomorphic Encryption and its Application to Combinatorial Auctions”, Proceedings of Autonomous Agents and Multi-Agent Systems 2002, ACM Press, (2002).
G. Brassard, D. Chaum and C. Crépeau, “Minimum Disclosure Proofs of Knowledge”, Journal of Computer and System Sciences, Vol.37, No.2, pp. 156–189, (1988).
J. Benalohand D. Tuinstra, “Receipt-Free Secret-Ballot Elections”, Proceedings of STOC 94, pp. 544–553, (1994).
V. Niemi and A. Renvall, “How to Prevent Buying of Votes in Computer Elections”, Proceedings of ASIACRYPT 94, LNCS 917, pp. 164–170, (1994).
M. Hirt and K. Sako, “Efficient Receipt-Free Voting Based on Homomorphic Encryption”, Proceedings of EUROCRYPT 2000, LNCS 1807, pp. 539–556, (2000).
T. Okamoto, “An Electronic Voting Scheme”, Proceedings of IFIP 96, Advanced IT Tools, pp. 21–30, (1996).
T. Okamoto, “Receipt-Free Electronic Voting Schemes for Large Scale Elections”, Proceedings of 5th Security Protocols, LNCS 1361, pp. 25–35, (1997).
K. Sako and J. Kilian, “Receipt-Free Mix-type Voting Scheme”, Proceedings of EUROCRYPT 95, LNCS 921, pp. 393–403, (1995).
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
Abe, M., Suzuki, K. (2002). Receipt-Free Sealed-Bid Auction. In: Chan, A.H., Gligor, V. (eds) Information Security. ISC 2002. Lecture Notes in Computer Science, vol 2433. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45811-5_14
Download citation
DOI: https://doi.org/10.1007/3-540-45811-5_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44270-7
Online ISBN: 978-3-540-45811-1
eBook Packages: Springer Book Archive