Skip to main content

Efficient Public Auction with One-Time Registration and Public Verifiability

  • Conference paper
  • First Online:
Progress in Cryptology — INDOCRYPT 2001 (INDOCRYPT 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2247))

Included in the following conference series:

Abstract

In public auction, all bid values are published, but each bidder participates in auction protocol in anonymous way. Recently, Omote and Miyaji [OM01] proposed a new model of public auction in which any bidder can participate in plural rounds of auction with one-time registration. They have introduced two managers, registration manager (RM) and auction manager (AM), and have used efficient tools such as bulletin board and signature of knowledge [CS97].In this scheme, even if a bidder is identified as a winner in a round, he can participate in next rounds of auction maintaining anonymity for RM, AM, and any bidder. But a problem of this protocol is that the identity of winner cannot be published. In the winner announcement stage, RM informs the vendor of winner’s identity secretly. Therefore RM’s final role cannot be verified, and AM and any participating bidder can not be sure of the validity of auction.

In this paper, we propose a new public auction scheme which can solve this problem. In the proposed scheme, both RM and AM execute randomization operation in round setup process which makes the publication of winner’s identity be possible while keeping anonymity of winner in next rounds of auction. Moreover, AM provides ticket identifier based on Diffie-Hellman key agreement which is recognized only by the bidder. Our scheme provides real anonymity in plural rounds of auction with one-time registration in a verifiable way.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Camenisch and M. Stadler, “Efficient group signature schemes for large groups”, In Crypto’97, pages 410–424, 1997.

    Google Scholar 

  2. M. Franklin and M. Reiter, “The design and implementation of a secure auction service”, In IEEE Transactions on Software Engineering, pages 302–312, 1996.

    Google Scholar 

  3. K. Nguyen and J. Traore, “An online public auction protocol protecting bidder privacy”, In ACISP’2000, pages 427–442, 2000.

    Google Scholar 

  4. K. Omote and A. Miyaji, “An anonymous auction protocol with a single nontrusted center using binary trees”, In ISW’2000, pages 108–120, 2000.

    Google Scholar 

  5. K. Omote and A. Miyaji, “A practical English auction with one-time registration”, In ACISP’2001, pages 221–234, 2001.

    Google Scholar 

  6. K. Sako, “An auction protocol which hides bids of losers”, In PKC’2000, pages 422–432, 2000.

    Google Scholar 

  7. K. Suzuki, K. Kobayashi, and H. Morita, “Efficient sealed-bid auction using hash chain”, In ICISC’2000, pages 189–197, 2000.

    Google Scholar 

  8. K. Sakurai and S. Miyazaki, “An anonymous electronic bidding protocol based on a new convertible group signature scheme”, In ACISP’2000, pages 385–399, 2000.

    Google Scholar 

  9. S. G. Stubblebine and P. F. Syverson, “Fair online auctions without special trusted parties”, In Financial Cryptography’1999, pages 230–240, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, B., Kim, K., Ma, J. (2001). Efficient Public Auction with One-Time Registration and Public Verifiability. In: Rangan, C.P., Ding, C. (eds) Progress in Cryptology — INDOCRYPT 2001. INDOCRYPT 2001. Lecture Notes in Computer Science, vol 2247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45311-3_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-45311-3_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43010-0

  • Online ISBN: 978-3-540-45311-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics