Abstract
This paper proposes a new Internet bidding system that offers anonymity of bidders and fairness to both bidders and the auction server. Our scheme satisfies all the basic security requirements for a sealed-bid auction system, without requiring multiple servers.
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
N. Asokan, V. Shoup and M. Waidner. “Asynchronous protocols for optimistic fair exchange”, In Proceedings of IEEE Symp. on Research in Security and Privacy Available on-line at http://www.cs.wisc.edu/~shoup.
N. Asokan, V. Shoup and M. Waidner. “Optimistic fair exchange of Digital Signatures”, Advances in Cryptography-Eurocrypt’98 (Lecture Notes in Compute Science 1403), Springer-Verlag, 1998. Pages 591–606.
F. Bao, R. H. Deng and W. Mao, “Efficient and practical fair exchange protocols with off-line TTP”, in Proceedings of the 1998 IEEE Symposium on Security and Privacy, IEEE Computer Press, Oakland, CA, 1998.
F. Bao, “An efficient verifiable encryption scheme for the encryption of discrete logarithms”, in Proceedings of CARDIS’98, LNCS, Springer-Verlag, 1998.
S. Brands. “Untraceable off-line cash in wallets with observers”. In Advances in Cryptology-Crypto’93, Springer-Verlag 1994. Pages 302–318.
D. Chaum. “Security without identification: Transaction systems to make big both obsolete”, Communications of the ACM, 28:1030–1044, 1985.
D. Chaum. “Online cash checks”, Advances in Cryptology-EUROCRYPT’ 89. Springer-Verlag, 1990. Pages 288–293.
K. Q. Nguyen, Y. Mu, and Vijay Varadharajan, “A new digital cash scheme based on blind Nyberg-Rueppel digital signature”, in Proceedings of the Information Security Workshop, 1997, Japan, Lecture Notes in Computer Science, Springer Verlag.
T. ElGamal, “A public key cryptosystem and a signature scheme based on discrete logarithms”, IEEE Transactions on Information Theory, IT-31(4):469–472, 1985.
FCC takes licenses, denies more time to 13 bidders. AP-Dow Jones News, August 10,1994.
M. Franklin and M. Reiter. “The design and implementation of a secure auction service”, Proceedings of 16th IEEE Symposium on Security and Privacy, Oakland, California, May 1995. Pages 2–14.
C. P. Schnorr, “Efficient signature generation for smart cards”, Proceedings Crypto’89, LNCS, Springer-Verlag, pp.225–232, 1990.
D. Chaum, J.-H. Evertse, and J. V. de Graaf, “An improved protocol for demonstrating possession of discrete logarithms and some generalizations, ” pp. 128–141, Springer-Verlag, 1988.
Dawn Song and Jonathan Millen, “Secure Auctions in a Publish/Subscribe System”, available from http://www.csl.sri.com/~millen
J. Camenisch and J. Piveteau, M. Stadler, “Blind Signatures Based on the Discrete Logarithm Problem”, Advances of Cryptology-Eurocrypt’94 Proceedings, Springer-Verlag, 1994, pp.428–432.
Jan Camenisch, “Efficient and Generalized Group Signatures”, Adances in cryptology-EUROCRYPT’97, Lecture Notes in Computer Secience 1233, Springer-Verlag, Berlin, 1997, pp465–479.
J. Camenisch and M. Stadler, “Efficient group signature schemes for large groups,”; pp.410–424, Springer-Verlag, Berlin, 1997.
K. Viswanathan, C. Boyd, E. Dawson: “A Three Phased Scheme for Sealed Bid Auction System Design” in 5th Australasian Conference on Information Security and Privacy (ACISP 2000), LNCS 1841, Springer-Verlag, pp.412–427
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
Mu, Y., Varadharajan, V. (2001). An Internet Anonymous Auction Scheme. 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_14
Download citation
DOI: https://doi.org/10.1007/3-540-45247-8_14
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