论文信息 - Efficient Sealed-Bid Auction Using Hash Chain

Efficient Sealed-Bid Auction Using Hash Chain

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.

[1] J. Doug Tygar,et al. Electronic Auctions with Private Bids , 1998, USENIX Workshop on Electronic Commerce.

[2] Leslie Lamport,et al. Password authentication with insecure communication , 1981, CACM.

[3] Paul F. Syverson,et al. Fair On-Line Auctions without Special Trusted Parties , 1999, Financial Cryptography.

[4] Hiroaki Kikuchi,et al. Multi-round Anonymous Auction Protocols , 1999 .

[5] Koutarou Suzuki,et al. Efficient Sealed-Bid Auction by Using One-Way Functions , 2001 .

[6] Kazue Sako,et al. An Auction Protocol Which Hides Bids of Losers , 2000, Public Key Cryptography.

[7] Christian Cachin,et al. Efficient private bidding and auctions with an oblivious third party , 1999, CCS '99.

[8] Koutarou Suzuki. Efficient Sealed-bid Auction by Sequentially Revealable Commitment , 1999 .

[9] Adi Shamir,et al. PayWord and MicroMint: Two Simple Micropayment Schemes , 1996, Security Protocols Workshop.

[10] Moni Naor,et al. Privacy preserving auctions and mechanism design , 1999, EC '99.