Skip to main content

(M + 1)st-Price Auction Protocol

  • Conference paper
  • First Online:
Financial Cryptography (FC 2001)

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

Included in the following conference series:

Abstract

This paper presents a new protocol for M + 1st-price auction, a style of auction in which the highest M bidders win and pay a uniform price, determined by the (M + 1)st price. A set of distributed servers collaborates to resolve the (M + 1)st price without revealing any information in terms of bids including the winners’ bids. A new trick to jointly and securely compute the highest value as a degree of distributed polynomials is introduced. The building block requires just one round for bidders to cast bids and one round for auctioneers to determine the winners.

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. eBay, http://www.ebay.com

  2. Imamura, Matsumoto, and Imai, Anonymous auction protocol, The 1994 Symposium on Cryptography and Information Security, 1994, pp. 11B

    Google Scholar 

  3. Nakanishi, Watanabe, and Fujiwara, Anonymous auction protocol using undeniable signature, The 1995 Symposium on Cryptography and Information Security, 1995, pp. B14

    Google Scholar 

  4. M. Ben-Or, S. Goldwasser, and A. Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation, STOC88, 1988, pp. 1–10

    Google Scholar 

  5. M.K. Franklin, and M.K. Reiter, The design and implementation of a secure auction service, IEEE Trans. on Software Engineering, 22(5), 1996, pp. 302–312.

    Article  Google Scholar 

  6. T.P. Pederson, Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing, in Proc. of CRYPTO’91, pp. 129–140, 1992.

    Google Scholar 

  7. P. Milgrom, Auctions and bidding: a primer, Journal of Economic Perspectives, 3(3), 1989, pp. 3–22

    Google Scholar 

  8. H. Kikuchi, M. Harkavy, and J.D. Tygar, Multi-round anonymous auction, IEICE Trans. Inf.& Syst., E82-D(4), 1999, pp. 769–777

    Google Scholar 

  9. M. Harkavy, J.D. Tygar, and H. Kikuchi, Electronic auction with private bids, In Third USENIX Workshop on Electronic Commerce Proceedings, August 1998, pp. 61–74

    Google Scholar 

  10. C.-S. Peng, J.M. Pulido, K.J. Lin, and D.M. Blough, The design of an Internet-based real time auction system, In Proc. of the First IEEE Workshop on Dependable and Real-Time E-Commerce Systems, 1998, pp. 70–78.

    Google Scholar 

  11. K. Sako, Universal verifiable auction protocol which hides losing bids, In Proc. of SCIS’99, 1999, pp. 35–39

    Google Scholar 

  12. K. Sako, An auction protocol which hides bids of losers, In Proc. of PKC 2000, pp. 422–432, 2000.

    Google Scholar 

  13. Secure electronic sealed-bid auction protocol with public key cryptography, IEICE Trans. Fundamentals, E81-A(1), pp. 20–26, 1998.

    Google Scholar 

  14. S. Miyazaki and K. Sakurai, A bulletin board-based auction system with protecting the bidder’s strategy, in Trans. of IPSJ, 40(8), 1999, pp. 3229–3336.

    Google Scholar 

  15. Y. Watanabe and H. Imai, Optimistic Sealed-Bid Auction Protocol, in Proc. of SCIS 2000, B09, pp. 1–8, 2000.

    Google Scholar 

  16. K. Kobayashi and H. Morita, Efficient sealed-bid auction with quantitative competition using one-way functions, In Technical Report of IEICE, ISEC99-30, 1999, pp. 31–37

    Google Scholar 

  17. M. Naor, B. Pinkas, and R. Sumner, Privacy preserving auctions and mechanism design, ACM Workshop on E-Commerce, 1999

    Google Scholar 

  18. F. Stajano and R. Anderson, The cocaine auction protocol: on the power of anonymous broadcast, Proc. of Information Hiding Workshop 1999 (LNCS), 1999

    Google Scholar 

  19. C. Cachin, Efficient private bidding and auctions with an oblivious third party, ACM Conference on Computer and Communications Security, 1999, pp. 120–127

    Google Scholar 

  20. P.R. Wurman, W.E. Walsh, and M.P. Wellman, Flexible Double Auctions for Electronic Commerce: Theory and Implementation, Decision Support Systems, 24, pp. 17–27, 1998.

    Article  Google Scholar 

  21. S.G. Stubblebine and P.F. Syverson, Fair On-Line Auctions without Special Trusted Parties, in Proc. of Financial Cryptography 1999, LNCS 1648, pp. 230–240, 1999.

    Chapter  Google Scholar 

  22. Y. Sakurai, M. Yokoo, and S. Matsubara, A limitation of the generalized Vickrey auction in electronic commerce: robustness against false-name bids, in Proc. of AAAI annual conference, 1999.

    Google Scholar 

  23. M. Miyamoto, H. Kikuchi, and K. Ogino, Dispersive auction server to calculate only the second win-price keeping the bids secret, in Proc. of DICOMO 2000 Symposium, IPSJ Symposium Series 2000 (7), 2000, pp. 547–552, (in Japanese).

    Google Scholar 

  24. H. Kikuchi, Power auction protocol without revealing bidding prices, in Proc. of SCIS 2000, 2000, pp. B10, (in Japanese).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kikuchi, H. (2002). (M + 1)st-Price Auction Protocol. In: Syverson, P. (eds) Financial Cryptography. FC 2001. Lecture Notes in Computer Science, vol 2339. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46088-8_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-46088-8_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44079-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics