Abstract
Some works about an electronic auction protocol have been proposed[2],[3],[4],[5],[6],[8],[11],[12]. 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[2],[4],[5],[6],[11],[12]. 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.
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.
References
T. ElGamal. A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Trans. on Information Theory, pages 469–472, 1985.
M. Franklin and M. Reiter. The design and implementation of a secure auction service. IEEE Transactions on Software Engineering, 5:302–312, 1996.
M. Harkavy, D. Tyger, and H. Kikuchi. Electronic Auctions with Private Bids. In Proceedings of the Third USENIX Workshop on Electronic Commerce, 1998.
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.
K. Kobayashi and M. Morita. Efficient sealed-bid auction with quantitative competition using one-way functions. ISEC99-30, pages 31–37, 1999.
M. Kudo. Secure electronic sealed-bid auction protocol with public key cryptography. IEICE Trans. Fundamentals, E81-A(1):20–27, 1998.
NIST. Secure Hash Standard (SHS). FIPS Publication 180–1, April 1995.
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.
R.L. Rivest. The MD5 message-digest algorithm. Internet Request for Comments, pages 302–312, April 1992.
R.L. Rivest and A. Shamir. PayWord and MicroMint:Two simple micropayment schemes. To Appear at the RSA’ 96 Conference, May 1996.
K. Sako. An Auction Protocol Which Hides Bids of Losers. In Proceedings of PKC2000, pages 422–432, 2000.
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.
A. Shamir. How to share a secret. Communications of the ACM, 22:612–613, 1979.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Omote, K., Miyaji, A. (2000). An Anonymous Auction Protocol with a Single Non-trusted Center Using Binary Trees. In: Goos, G., Hartmanis, J., van Leeuwen, J., Pieprzyk, J., Seberry, J., Okamoto, E. (eds) Information Security. ISW 2000. Lecture Notes in Computer Science, vol 1975. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44456-4_9
Download citation
DOI: https://doi.org/10.1007/3-540-44456-4_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41416-2
Online ISBN: 978-3-540-44456-5
eBook Packages: Springer Book Archive