Skip to main content

A Bidder-Oriented Privacy-Preserving VCG Auction Scheme

  • Conference paper
  • First Online:
Wireless Algorithms, Systems, and Applications (WASA 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9204))

Abstract

Vickrey-Clarke-Groves (VCG) is a type of sealed-bid auction of multiple items which has good economic properties. However, VCG has security vulnerabilities, e.g. it is vulnerable to auctioneer fraud. To make VCG more practical, bid prices must be well protected. To tackle this challenge, we propose a bidder-oriented, privacy-preserving auction scheme using homomorphic encryption, where the bidders can calculate the results by themselves, and the auctioneer is able to verify the results. Compared to previous research, our scheme is more trustworthy with stronger privacy.

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 EPUB and 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

References

  1. Chen, Z., Huang, L., Li, L., Yang, W., Miao, H., Tian, M., Wang, F.: Ps-trust: provably secure solution for truthful double spectrum auctions. In: 2014 IEEE Proceedings on INFOCOM, pp. 1249–1257. IEEE (2014)

    Google Scholar 

  2. El Gamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 10–18. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

  3. Hu, C., Liao, X., Cheng, X.: Verifiable multi-secret sharing based on LFSR sequences. Theor. Comput. Sci. 445, 52–62 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  4. Hu, C., Liao, X., Xiao, D.: Secret image sharing based on chaotic map and Chinese remainder theorem. Int. J. Wavelets Multiresolut. Inf. Process. 10(03), 1250023(1–18) (2012)

    Article  MathSciNet  Google Scholar 

  5. Hu, C., Zhang, F., Cheng, X., Liao, X., Chen, D.: Securing communications between external users and wireless body area networks. In: Proceedings of the 2nd ACM workshop on Hot topics on wireless network security and privacy, pp. 31–36. ACM (2013)

    Google Scholar 

  6. Hu, C., Zhang, F., Xiang, T., Li, H., Xiao, X., Huang, G.: A practically optimized implementation of attribute based cryptosystems. In: 2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom), pp. 197–204. IEEE (2014)

    Google Scholar 

  7. Hu, C., Zhang, N., Li, H., Cheng, X., Liao, X.: Body area network security: a fuzzy attribute-based signcryption scheme. IEEE J. Sel. Areas Commun. 31(9), 37–46 (2013)

    Article  Google Scholar 

  8. Huang, Q., Tao, Y., Wu, F.: Spring: a strategy-proof and privacy preserving spectrum auction mechanism. In: 2013 IEEE Proceedings on INFOCOM, pp. 827–835. IEEE (2013)

    Google Scholar 

  9. Jing, T., Zhao, C., Xing, X., Huo, Y., Li, W., Cheng, X.: A multi-unit truthful double auction framework for secondary market. In: IEEE ICC (2013)

    Google Scholar 

  10. Kobayashi, K., Morita, H., Suzuki, K., Hakuta, M.: Efficient sealed-bid auction by using one-way functions. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 84(1), 289–294 (2001)

    Google Scholar 

  11. Krishna, V.: Auction theory. Academic press, San Diego (2009)

    Google Scholar 

  12. Larson, M., Hu, C., Li, R., Li, W., Cheng, X.: Secure auctions without an auctioneer via verifiable secret sharing. In: Workshop on Privacy-Aware Mobile Computing (PAMCO) 2015 In conjunction with ACM MobiHoc 2015. ACM, pp. 1–6 (2015)

    Google Scholar 

  13. Larson, M., Li, W., Hu, C., Li, R., Cheng, X.: A secure multi-unit sealed first-price auction mechanism. In: The 10th International Conference on Wireless Algorithms, Systems, and Applications (WASA 2015), vol. 9204, pp. 295–304. Springer, Heidelberg (2015)

    Google Scholar 

  14. Li, W., Cheng, X., Bie, R., Zhao, F.: An extensible and flexible truthful auction framework for heterogeneous spectrum markets. In: ACM MobiHoc, pp. 175–184. Philadelphia, USA, August 2014

    Google Scholar 

  15. Li, W., Wang, S., Cheng, X., Bie, R.: Truthful multi-attribute auction with discriminatory pricing in cognitive radio networks. ACM SIGMOBILE Mob. Comput. Commun. Rev. 18(1), 3–13 (2014)

    Article  Google Scholar 

  16. Nojoumian, M., Stinson, D.R.: Efficient sealed-bid auction protocols using verifiable secret sharing. In: Huang, X., Zhou, J. (eds.) ISPEC 2014. LNCS, vol. 8434, pp. 302–317. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  17. Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  18. Pan, M., Sun, J., Fang, Y.: Purging the back-room dealing: secure spectrum auction leveraging paillier cryptosystem. IEEE J. Sel. Areas Commun. 29(4), 866–876 (2011)

    Article  Google Scholar 

  19. Pan, M., Zhu, X., Fang, Y.: Using homomorphic encryption to secure the combinatorial spectrum auction without the trustworthy auctioneer. Wirel. Netw. 18(2), 113–128 (2012)

    Article  Google Scholar 

  20. Peng, K.: Efficient proof of bid validity with untrusted verifier in homomorphic e-auction. IET Inf. Secur. 7(1), 11–21 (2013)

    Article  Google Scholar 

  21. Peng, K., Boyd, C., Dawson, E.: A multiplicative homomorphic sealed-bid auction based on goldwasser-micali encryption. In: Zhou, J., López, J., Deng, R.H., Bao, F. (eds.) ISC 2005. LNCS, vol. 3650, pp. 374–388. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  22. Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  23. 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 (2001)

    Chapter  Google Scholar 

  24. Suzuki, K., Yokoo, M.: Secure combinatorial auctions by dynamic programming with polynomial secret sharing. In: Blaze, M. (ed.) FC 2002. LNCS, vol. 2357, pp. 44–56. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  25. Suzuki, K., Yokoo, M.: Secure generalized vickrey auction using homomorphic encryption. In: Wright, R.N. (ed.) FC 2003. LNCS, vol. 2742, pp. 239–249. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

Download references

Acknowledgment

The authors would like to thank all the reviewers for their helpful comments. This project was supported by the US National Science Foundation (ECCS-1407986, AST-1443858, CNS-1265311, and CNS-1162057), and the National Natural Science Foundation of China (61171014).

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Ruinian Li or Rongfang Bie .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Larson, M., Li, R., Hu, C., Li, W., Cheng, X., Bie, R. (2015). A Bidder-Oriented Privacy-Preserving VCG Auction Scheme. In: Xu, K., Zhu, H. (eds) Wireless Algorithms, Systems, and Applications. WASA 2015. Lecture Notes in Computer Science(), vol 9204. Springer, Cham. https://doi.org/10.1007/978-3-319-21837-3_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-21837-3_28

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-21836-6

  • Online ISBN: 978-3-319-21837-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics