Skip to main content
SpringerLink
Log in

Efficient Implementation of Relative Bid Privacy in Sealed-Bid Auction

  • Conference paper
Information Security Applications (WISA 2003)

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

Included in the following conference series:

Abstract

The concept of relative bid privacy in auction is proposed, which does not conceal the bids, but conceals the link between them and the corresponding bidders. Relative bid privacy leads to three advantages: high efficiency, the bidding values can be very precise and any auction rule can be applied. A new mix network is designed and applied to implement relative bid privacy efficiently. Two rounds of shuffling are employed in the mix network, so that fairness can be achieved in the auction without any trust and relative bid privacy is achieved even in abnormal situations.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Abe, M.: Mix-networks on permutation net-works. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol. 1716, pp. 258–273. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  2. Abe, M., Hoshino, F.: Remarks on mix-network based on permutation networks. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol. 1992, pp. 317–324. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  3. Abe, M., Suzuki, K.: M+1-st price auction using homomorphic encryption. In: Kim, K.-c. (ed.) ICISC 2001. LNCS, vol. 2288, pp. 115–124. Springer, Heidelberg (2002)

    Google Scholar 

  4. Boneh, D., Golle, P.: Almost entirely correct mixing with applications to voting. In: Proceedings of the 9th ACM conference on Computer and communications security, pp. 68–77 (2002)

    Google Scholar 

  5. Brandt, F.: Cryptographic protocols for secure second-price auctions (2001), Available at http://wwwbrauer.in.tum.de/~brandtf/papers/cia2001.pdf

  6. Chaum, D.: Untraceable electronic mail, return address and digital pseudonym. Communications of the ACM 24(2), 84–88 (1981)

    Article  Google Scholar 

  7. Chida, K., Kobayashi, K., Morita, H.: Efficient sealed-bid auctions for massive numbers of bidders with lump comparison. In: Davida, G.I., Frankel, Y. (eds.) ISC 2001. LNCS, vol. 2200, pp. 408–419. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  8. Franklin, M.K., Reiter, M.K.: The design and implementation of a secure auction service. IEEE Transactions on Software Enginerring 5, 302–312 (1996)

    Article  Google Scholar 

  9. Furukawa, J., Sako, K.: An efficient scheme for proving a shuffle. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 368–387. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  10. Golle, P., Zhong, S., Boneh, D., Jakobsson, M., Juels, A.: Optimistic mixing for exit-polls. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 1592, pp. 451–465. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  11. Groth, J.: A verifiable secret shuffle of homomorphic encryptions. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 145–160. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  12. Jakobsson, M., Juels, A., Rivest, R.L.: Making mix nets robust for electronic voting by randomizsed partial checking. In: Proceedings of the 11th USENIX Security Symposium, San Francisco, CA, USA, August 5-9, pp. 339–353. USENIX (2002)

    Google Scholar 

  13. Juels, A., Jakobsson, M.: An optimally robust hybrid mix network. In: Proc. of the 20th annual ACM Symposium on Principles of Distributed Computation, pp. 284–292. ACM, New York (2001)

    Google Scholar 

  14. Kikuchi, H., Harkavy, M., Tygar, J.D.: Multi-round anonymous auction. In: Proceedings of the First IEEE Workshop on Dependable and Real-Time ECommerce Systems, June 1998, pp. 62–69 (1998)

    Google Scholar 

  15. Kikuchi, H. (m+1)st-price auction. In: Syverson, P.F. (ed.) FC 2001. LNCS, vol. 2339, pp. 291–298. Springer, Heidelberg (2001)

    Google Scholar 

  16. Kikuchi, H., Hotta, S., Abe, K., Nakanishi, S.: Distributed auction servers resolving winner and winning bid without revealing privacy of bids. In: Proc. of International Workshop on Next Generation Internet (NGITA 2000), July 2000, pp. 307–312. IEEE, Los Alamitos (2000)

    Google Scholar 

  17. Lipmaa, H., Asokan, N., Niemi, V.: Secure vickrey auctions without thresh-old trust. In: Blaze, M. (ed.) FC 2002. LNCS, vol. 2357, Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  18. Mu, Y., Varadharajan, V.: An internet anonymous auction scheme. In: Won, D. (ed.) ICISC 2000. LNCS, vol. 2015, pp. 171–182. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  19. Naor, M., Pinkas, B., Sumner, R.: Privacy perserving auctions and mechanism design (1999), Available from http://www.tml.hut.fi/~helger/crypto/link/protocols/auctions.html

  20. Andrew Neff, C.: A verifiable secret shuffle and its application to e-voting. In: ACM Conference on Computer and Communications Security 2001, pp. 116–125 (2001)

    Google Scholar 

  21. Ogata, W., Kurosawa, K., Sako, K., Takatani, K.: Fault tolerant anonymous channel. In: Han, Y., Quing, S. (eds.) ICICS 1997. LNCS, vol. 1334, pp. 440–444. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  22. Ohkubo, M., Abe, M.: A length-invariant hybrid mix. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 178–191. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  23. Omote, K., Miyaji, A.: A second-price sealed-bid auction with the discriminant of the p-th root. In: Blaze, M. (ed.) FC 2002. LNCS, vol. 2357, Springer, Heidelberg (2002)

    Google Scholar 

  24. Park, C., Itoh, K., Kurosawa, K.: Efficient anonymous channel and all/nothing election scheme. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 248–259. Springer, Heidelberg (1994)

    Google Scholar 

  25. Pedersen, T.P.: Distributed provers with applications to undeniable signatures. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 221–242. Springer, Heidelberg (1991)

    Google Scholar 

  26. Sako, K.: An auction scheme which hides the bids of losers. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol. 1880, pp. 422–432. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  27. Sako, K., Kilian, J.: Receipt-free mix-type voting scheme–a practical solution to the implementation of a voting booth. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 393–403. Springer, Heidelberg (1995)

    Google Scholar 

  28. Sakurai, K., Miyazaki, S.: 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, pp. 180–187. City University of Hong Kong Press, Hong Kong (1999)

    Google Scholar 

  29. Suzuki, K., Kobayashi, K., Morita, H.: Efficient sealed-bid auction using hash chain. In: Won, D. (ed.) ICISC 2000. LNCS, vol. 2015, pp. 183–191. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  30. Viswanathan, K., Boyd, C., Dawson, E.: A three phased schema for sealed bid auction system design. In: Clark, A., Boyd, C., Dawson, E.P. (eds.) ACISP 2000. LNCS, vol. 1841, pp. 412–426. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  31. Watanabe, Y., Imai, H.: Reducing the round complexity of a sealed-bid auction protocol with an off-line ttp. In: STOC 2000, pp. 80–86. ACM, New York (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ISRC, IT Faculty, Queensland University of Technology, 2 Goerge Street, Brisbane, QLD4000, Australia

    Kun Peng, Colin Boyd, Ed Dawson & Kapalee Viswanathan

Authors
  1. Kun Peng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Colin Boyd
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ed Dawson
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Kapalee Viswanathan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Science and Engineering, Ewha Womans University, Korea

    Ki-Joon Chae

  2. Computer Science Department, Google Inc. and Columbia University, 1214 Amsterdam Avenue, NY 10027, New York, USA

    Moti Yung

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Peng, K., Boyd, C., Dawson, E., Viswanathan, K. (2004). Efficient Implementation of Relative Bid Privacy in Sealed-Bid Auction. In: Chae, KJ., Yung, M. (eds) Information Security Applications. WISA 2003. Lecture Notes in Computer Science, vol 2908. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24591-9_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24591-9_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20827-3

  • Online ISBN: 978-3-540-24591-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation