Abstract
The sealed bid model of auctions is ideally suited for electronic auction systems, as they avoid the requirement for real-time communications between various entities. A sealed bid auction scheme designed by Kikuchi, Harkavy and Tygar is analysed. Several shortcomings are identified in this scheme including the lack of public verifiability and the possibility of collusion between bidders and/or auctioneers. A new scheme is designed to overcome these shortcomings.
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
Masayuki Abe and Koutarou Suzuki. M+1-st price auction using homomorphic encryption. In PKC 2002, pages 115–124, 2002.
Feng Bao. An efficient verifiable encryption scheme for encryption of discrete logarithms. In CARDIS’98, 1820 of Lecture Notes in Computer Science, pages 213–220. Springer Verlag, 1998.
J C Benaloh. Secret sharing homomorphisms: Keeping shares of a secret secret. In Advances in Cryptology (Proceedings of CRYPTO’ 86. Santa Barbara, CA. August 1986. ed. by A. M. Odlyzko.), pages 251–260. Springer Verlag, 1986.
Koji Chida, Kunio Kobayashi, and Hikaru Morita. Efficient sealed-bid auctions for massive numbers of bidders with lump comparison. In LNCS 2200, page 48, 2001.
Matthew K Franklin and Michael K Reiter. The design and implementation of a secure auction service. IEEE Transactions on Software Enginerring, 22(5):302–312, May 1996.
Michael Harkavy, J D Tygar, and Hiroaki Kikuchi. Electronic auctions with private bids. In 3rd Usenix Workshop on Electronic Commerce, pages 61–83, 1998.
Hiroaki Kikuchi, Shinji Hotta, Kensuke Abe, and Shohachiro Nakanishi. Distributed auction servers resolving winner and winning bid without revealing privacy of bids. In proc. Of International Workshop on Next Generation Internet (NGITA2000), IEEE, pages 307–312, July 2000.
Hiroaki Kikuchi. (m+1)st-price auction. In Proc. of The Fifth International Conference on Financial Cryptography’ 01, IFCA, pages 291–298, February 2001.
H Kikuchi, Michael Harkavy, and J D Tygar. Multi-round anonymous auction. In Proceedings of the First IEEE Workshop on Dependable and Real-Time E-Commerce Systems, pages 62–69, June 1998.
E Magkos, M Burmester, and V Chrissikopoulos. Sam: A flexible and secure auction architecture using trusted hardware. 2000. Available at http://thalis.cs.unipi.gr/~emagos/EC_WEB2000Springer.ps.
T Okamoto and S Uchiyama. A new public-key encyptosystem as secure as factoring. In volume 1403 Of Lecture Notes in Computer Science, pages 308–318. Advances in Cryptology-CRYPTO’98, Springer Verlag, 1998.
P Paillier. Public key cryptosystem based on composite degree residuosity classes. In LNCS 1592, pages 223–238. Eurocrypt’99, Springer Verlag, 1999.
Torben P. Pedersen. Distributed provers with applications to undeniable signatures. Pages 221–242. EUROCRYPT 91, Springer Verlag, 1991.
Torben P. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In volume 547 of Lecture Notes in Computer Science, pages 129–140. Advances in Cryptology-EUROCRYPT 91, Springer Verlag, 1991.
K Sako. An auction scheme which hides the bids of losers. In Public Key Cryptology, PKC’2000, Springer, pages 422–432, 2000.
Kouichi 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 Proc. International Workshop on Cryptographic Techniques and E-Commerce, pages 180–187. City University of Hong Kong Press, 1999.
Adi Shamir. How to share a secret. Communication of the ACM, 22(11):612–613, Nov 1979.
Dawn Xiaodong Song and Jonathan K Millen. Secure auctions in a publish/subscribe system. Available at http://www2.csl.sri.com/~millen/papers/dcca8.ps.
Koutarou Suzuki, Kunio Kobayashi, and Hikaru Morita. Efficient sealed-bid auction using hash chain. In ICISC 2000, LNCS 2015, pages 183–191, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Peng, K., Boyd, C., Dawson, E., Viswanathan, K. (2002). Robust, Privacy Protecting and Publicly Verifiable Sealed-Bid Auction. In: Deng, R., Bao, F., Zhou, J., Qing, S. (eds) Information and Communications Security. ICICS 2002. Lecture Notes in Computer Science, vol 2513. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36159-6_13
Download citation
DOI: https://doi.org/10.1007/3-540-36159-6_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00164-5
Online ISBN: 978-3-540-36159-6
eBook Packages: Springer Book Archive