Skip to main content

Secure Vickrey Auctions without Threshold Trust

  • Conference paper
Financial Cryptography (FC 2002)

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

Included in the following conference series:

Abstract

We argue that threshold trust is not an option in most of the real-life electronic auctions. We then propose two new cryptographic Vickrey auction schemes that involve, apart from the bidders and the seller S, an auction authority A so that unless 5 and A collude the outcome of auctions will be correct, and moreover, S will not get any information about the bids, while A will learn bid statistics. Further extensions make it possible to decrease damage that colluding S and A can do, and to construct (m + l)st price auction schemes. The communication complexity between the S and A in medium-size auctions is at least one order of magnitude less than in the Naor-Pinkas-Sumner scheme.

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. Olivier Baudron and Jacques Stern. Non-interactive Private Auctions. In Paul Syverson, editor, Financial Cryptography — Fifth International Conference, Lecture Notes in Computer Science, Grand Cayman, BWI, 19–22 February 2001. Springer-Verlag. To appear.

    Google Scholar 

  2. Christian Cachin. Efficient Private Bidding and Auctions with an Oblivious Third Party. In 6th ACM Conference on Computer and Communications Security, pages 120–127, Singapore, 1–4 November 1999. ACM Press.

    Google Scholar 

  3. Ivan Damgård. Personal communication, November 2001.

    Google Scholar 

  4. Ivan Damgård and Eiichiro Fujisaki. An Integer Commitment Scheme Based on Groups with Hidden Order. Technical Report 064, IACR, 13 August 2001. Available at http://eprint.iacr.org/2001/064/.

  5. Ivan Damgård and Mads Jurik. A Generalisation, a Simplification and Some Applications of Paillier’s Probabilistic Public-Key System. In Kwangjo Kim, editor, Public Key Cryptography’ 2001, volume 1992 of Lecture Notes in Computer Science, pages 119–136, Cheju Island, Korea, 13–15 February 2001. Springer-Verlag.

    Google Scholar 

  6. Ivan B. Damgård, Mads J. Jurik, and Jesper B. Nielsen. A Generalization, a Simplification and Some Applications of Paillier’s Probabilistic Public-key System. International Journal of Information Security. To appear. Manuscript, available from authors.

    Google Scholar 

  7. Hiroaki Kikuchi. (M+l)st-Price Auction Protocol. In Paul Syverson, editor, Financial Cryptography — Fifth International Conference, Lecture Notes in Computer Science, Grand Cayman, BWI, 19–22 February 2001. Springer-Verlag. To appear.

    Google Scholar 

  8. Helger Lipmaa. Statistical zero-knowledge proofs from diophantine equations. Cryptology ePrint Archive, Report 2001/086, 20 November 2001. http://eprint.iacr.org/.

  9. Moni Naor, Benny Pinkas, and Reuben Sumner. Privacy Preserving Auctions and Mechanism Design. In The 1st ACM Conference on Electronic Commerce, Denver, Colorado, November 1999.

    Google Scholar 

  10. Hannu Nurmi and Arto Salomaa. Cryptographic Protocols for Vickrey Auctions. Group Decision and Negotiation, 2:363–373, 1993.

    Article  Google Scholar 

  11. Benny Pinkas. Personal communication, October 2001.

    Google Scholar 

  12. Michael H. Rothkopf and Ronald M. Harstad. Two Models of Bid-Taker Cheating in Vickrey Auctions. Journal of Business, 68(2):257–267, April 1995.

    Article  Google Scholar 

  13. Michael O. Rabin and Jeffrey O. Shallit. Randomized Algorithms in Number Theory. Communications in Pure and Applied Mathematics, 39:239–256, 1986.

    Article  Google Scholar 

  14. Michael H. Rothkopf, Thomas J. Teisberg, and Edward P. Kahn. Why are Vickrey Auctions Rare? The Journal of Political Economy, 98(1):94–109, February 1990.

    Article  Google Scholar 

  15. Kouichi Sakurai and Shingo Miyazaki. An Anonymous Electronic Bidding Protocol Based on a New Convertible Group Signature Scheme. In Ed Dawson, Andrew Clark, and Colin Boyd, editors, Fifth Australasian Conference on Information Security and Privacy, volume 1841 of Lecture Notes in Computer Science, pages 385–399, Brisbane, Australia, 10–12 July 2000. Springer-Verlag. ISBN 3-540-67742-9.

    Google Scholar 

  16. William Vickrey. Counterspeculation, Auctions, and Competitive Sealed Tenders. Journal of Finance, 16(1):8–37, March 1961.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 IFCA/Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lipmaa, H., Asokan, N., Niemi, V. (2003). Secure Vickrey Auctions without Threshold Trust. In: Blaze, M. (eds) Financial Cryptography. FC 2002. Lecture Notes in Computer Science, vol 2357. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36504-4_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-36504-4_7

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-36504-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics