Abstract
This paper proposes the first sealed-bid auction method which uses only hash function. We use a hash chain to commit a bidding price. By using the hash chain, we can drastically reduce the time needed for bidding and opening bids. If we use a practical hash function e.g. SHA-1, our method is 200,000 times faster than former methods that use public key cryptosystems. Accordingly, our method is capable of wide application in terms of the number of bidders and the range of bidding prices.
Acknowledgments
The first author would like to thank Masayuki Abe (NTT Laboratories) for his helpful suggestions.
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
A. Bosselaer, The hash function RIPEMD-160, http://www.esat.kuleuven.ac.be/~bosselae/ripemd160.html.
C. Cachin, Efficient Private Bidding and Auctions with an Oblivious Third Party, Proc. of 6th ACM Conference on Computer and Communications Security, pp. 120–127, 1999.
FIPS Publication 180-1, Secure Hash Standard, Federal Information Processing Standards Publication 180-1, NIST, 1993.
M. Harkavy, J. D. Tygar and H. Kikuchi, Electronic Auctions with Private Bids, Proc. of Third USENIX Workshop on Electronic Commerce, pp. 61–74, 1998.
[KHT98]H. Kikuchi, M. Harkavy and J. D. Tygar, Multi-round Anonymous Auction Protocols, Proc. Of first IEEE Workshop on Dependable and Real-Time E-Commerce Systems, pp. 62–69, 1998.
K. Kobayashi and H. Morita, Efficient Sealed-bid Auction with Quantitative Competition using One-way Functions, Tech. Report of IEICE ISEC99-30 (Japanese), 1999.
K. Kobayashi, H. M orita, K. Suzuki and M. Hakuta, Efficient Sealed-bid Auction by using One-way Functions, to appear in IEICE Trans. Fundamentals, 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.
M. Naor, B. Pinkas and R. Sumner, Privacy Preserving Auctions and Mechanism Design, Proc. of ACM conference on E-commerce, pp. 129–139, 1999.
R.L. Rivest, A. Shamir, PayWord and MicroMint: Two simple micro payment schemes, preprint 1996.
K. Sako, Universally verifiable auction protocol which hides losing bids, Proc. of Public Key Cryptography 2000, pp. 35–39, 2000.
L. Lamport, Password Authentication with insecure Communication, Communications of the ACM, vol. 24, No. 11, pp. 770–772, Nov. 1981.
Shamus Software Ltd., Benchmarks, http://indigo.ie/~mscott/.
K. S akurai and S. Miyazaki, A bulletin-board based digital auction scheme with bidding down strategy, Proc. 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, Proc. of Financial Cryptography 99, 1999.
K. Suzuki, Efficient Sealed-bid Auction by Sequentially Revealable Commitment, Tech. Report of IEICE ISEC99-67 (Japanese), 1999.
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
Suzuki, K., Kobayashi, K., Morita, H. (2001). Efficient Sealed-bid Auction using Hash Chain. In: Won, D. (eds) Information Security and Cryptology — ICISC 2000. ICISC 2000. Lecture Notes in Computer Science, vol 2015. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45247-8_15
Download citation
DOI: https://doi.org/10.1007/3-540-45247-8_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41782-8
Online ISBN: 978-3-540-45247-8
eBook Packages: Springer Book Archive