An Anonymous Auction Protocol with a Single Non-trusted Center Using Binary Trees
Some works about an electronic auction protocol have been proposed,,,,,,,. An electronic auction protocol should satisfy the following seven properties: (a)Fair of bidders; (b)Security of bids; (c)Anonymity; (d)Validity of winning bids; (e)Non-repudiation; (f)Robustness; and (g)Efficient bidding points. As for anonymity, previous protocols assume some entities like a dealer or plural centers to be trusted. In this paper, anonymity is realized without a trusted center, maintaining both computational and round complexity low. Furthermore, we represent a bid efficiently by using binary trees: for 2k bidding points, the size of the representation of bids is just k. Previous works investigating a sealed-bid auction aim at “efficiency” but not “entertainment” seen in English auction,,,,,. We introduce a new idea of entertainment to the opening phase by decreasing winner candidates little by little. Our protocol has the following three main features in addition to the above seven properties: perfect anonymity(a single non-trusted center), efficient bidding points and entertainment.
keywordsanonymity sealed-bid auction bidding points entertainment one-way function
Unable to display preview. Download preview PDF.
- 1.T. ElGamal. A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Trans. on Information Theory, pages 469–472, 1985.Google Scholar
- 3.M. Harkavy, D. Tyger, and H. Kikuchi. Electronic Auctions with Private Bids. In Proceedings of the Third USENIX Workshop on Electronic Commerce, 1998.Google Scholar
- 4.H. Kikuchi, M. Harkavy, and D. Tyger. Multi-round anonymous auction protocols. In Proceedings of the First IEEE Workshop on Dependable and Real-Time E-Commerce Systems, pages 62–69, 1998.Google Scholar
- 5.K. Kobayashi and M. Morita. Efficient sealed-bid auction with quantitative competition using one-way functions. ISEC99-30, pages 31–37, 1999.Google Scholar
- 7.NIST. Secure Hash Standard (SHS). FIPS Publication 180–1, April 1995.Google Scholar
- 8.C-S. Peng, M. Pulido, J. Lin, and M. Blough. The Design of an Internet-based Real Time Auction Systems. In Proceedings of the First IEEE Workshop on Dependable and Real-Time E-Commerce Systems, pages 70–78, 1998.Google Scholar
- 9.R.L. Rivest. The MD5 message-digest algorithm. Internet Request for Comments, pages 302–312, April 1992.Google Scholar
- 10.R.L. Rivest and A. Shamir. PayWord and MicroMint:Two simple micropayment schemes. To Appear at the RSA’ 96 Conference, May 1996.Google Scholar
- 11.K. Sako. An Auction Protocol Which Hides Bids of Losers. In Proceedings of PKC2000, pages 422–432, 2000.Google Scholar
- 12.K. Sakurai and S. Miyazaki. A Bulletin-board based digital auction scheme with bidding down strategy-towards anonymous electronic bidding without anonymous channels nor trusted centers in Cryptographic Techniques and E-Commerce. In Proceedings of the 1999 International Workshop on Cryptographic Techniques and E-Commerce(CryTEC’ 99), 1999.Google Scholar