Wireless Networks

, Volume 25, Issue 4, pp 1763–1776 | Cite as

PATH: privacy-preserving auction for heterogeneous spectrum allocations

  • Zhili ChenEmail author
  • Ruihong Che
  • Hong Zhong
  • Miaomiao Tian
  • Jie Cui


Recently, truthful spectrum auctions have been extensively studied to improve spectrum utilization. Furthermore, privacy preservation in truthful spectrum auctions has also been taken into account. However, existing work mainly focuses on privacy-preserving homogenous spectrum auctions, while the case of heterogeneous spectrum auctions is ignored. In this paper, we propose PATH, a privacy-preserving auction for single-sided heterogeneous spectrum allocations. Through organically combining three security techniques: homomorphic encryption, secret sharing and garbled circuit, PATH reveals nothing about buyers’ bids and identities beyond the auction outcome to any participant party. Specifically, PATH not only maintains the properties of truthfulness and spectrum reuse of the underlining auction mechanism TAMES, but also implements the first provably secure solution for single-sided heterogeneous spectrum auctions. Finally, experimental results demonstrate that PATH incurs only limited computation and communication overhead, and it is feasible for large-scale applications.


Privacy preservation Heterogeneous spectrum auction Homomorphic encryption Secret sharing Garbled circuit 



The work by Zhili Chen and Ruihong Che is supported by the National Natural Science Foundation of China (NSFC) under Grant No. 61572031; the work by Hong Zhong is supported by the NSFC under Grant No. 61572001; the work by Miaomiao Tian is supported by the NSFC under Grant No. 61502443; and the work by Jie Cui is supported by the NSFC under Grant No. 61502008.


  1. 1.
    Brandt, F., & Sandholm, T. (2008). On the existence of unconditionally privacy-preserving auction protocols. ACM Transactions on Information and System Security (TISSEC), 11(2), 6.CrossRefGoogle Scholar
  2. 2.
    Cao, B., Feng, G., Li, Y., & Daneshmand, M. (2014). Auction-based relay assignment in cooperative communications. In Global Communications Conference, pp 4496–4501.Google Scholar
  3. 3.
    Cao, B., Lang, W., Li, Y., & Chen, Z. (2014) Power allocation in wireless network virtualization with buyer/seller and auction game. In IEEE Global Communications Conference, pp. 1–6.Google Scholar
  4. 4.
    Chen, Y., Zhang, J., Wu, K., & Zhang, Q. (2013). TAMES: A truthful auction mechanism for heterogeneous spectrum allocation. In Proceedings of INFOCOM (pp 180–184). IEEE.Google Scholar
  5. 5.
    Chen, Y., Zhang, J., Wu, K., & Zhang, Q. (2014). TAMES: A truthful double auction for multi-demand heterogeneous spectrums. IEEE Transactions on Parallel and Distributed Systems, 25(11), 3012–3024.CrossRefGoogle Scholar
  6. 6.
    Chen, Z., Huang, L., Li, L., & Yang, W. (2014). PS-TRUST: Provably secure solution for truthful double spectrum auctions. In Proceedings of IEEE INFOCOM, pp. 1249–1257.Google Scholar
  7. 7.
    Feng, X., Chen, Y., Zhang, J., Zhang, Q., & Li, B. (2012). TAHES: Truthful double auction for heterogeneous spectrums. In 2012 Proceedings IEEE INFOCOM (pp. 3076–3080). IEEE.Google Scholar
  8. 8.
    Goldreich, O. (2009). Foundations of cryptography: Volume 2, basic applications. Cambridge: Cambridge University Press.zbMATHGoogle Scholar
  9. 9.
    Hazay, C., & Lindell, Y. (2010). Efficient secure two-party protocols: Techniques and constructions. Berlin: Springer Science & Business Media.CrossRefzbMATHGoogle Scholar
  10. 10.
    Huang, H., Li, X., Sun, Y., Xu, H., & Huang, L. (2015). PPS: Privacy-preserving strategyproof social-efficient spectrum auction mechanisms. IEEE Transactions on Parallel and Distributed Systems, 26(5), 1393–1404.CrossRefGoogle Scholar
  11. 11.
    Huang, Q., Tao, Y., & Wu, F. (2013). SPRING: A strategy-proof and privacy preserving spectrum auction mechanism. In Proceedings of INFOCOM (pp. 827–835). IEEE.Google Scholar
  12. 12.
    Huang, Y., Evans, D., Katz, J., & Malka, L. (2011). Faster secure two-party computation using garbled circuits. In Usenix Conference on Security, p. 35.Google Scholar
  13. 13.
    Li, Y., Liao, C., Wang, Y., & Wang, C. (2015). Energy-efficient optimal relay selection in cooperative cellular networks based on double auction. IEEE Transactions on Wireless Communications, 14(8), 4093–4104.CrossRefGoogle Scholar
  14. 14.
    Lindell, Y., & Pinkas, B. (2009). A proof of security of Yao’s protocol for two-party computation. Journal of Cryptology, 22(2), 161–188.MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Lipmaa, H., Asokan, N., & Niemi, V. (2002). Secure Vickrey auctions without threshold trust. In International Conference on Financial Cryptography (pp. 87–101). Springer.Google Scholar
  16. 16.
    Naor, M., Pinkas, B., & Sumner, R. (1999). Privacy preserving auctions and mechanism design. In Proceedings of the 1st ACM Conference on Electronic Commerce (pp. 129–139). ACM.Google Scholar
  17. 17.
    Paillier, P. (1999). Public-key cryptosystems based on composite degree residuosity classes. In International Conference on the Theory and Applications of Cryptographic Techniques (pp. 223–238). Springer.Google Scholar
  18. 18.
    Pan, M., Sun, J., & Fang, Y. (2011). Purging the back-room dealing: Secure spectrum auction leveraging paillier cryptosystem. IEEE Journal on Selected Areas in Communications, 29(4), 866–876.CrossRefGoogle Scholar
  19. 19.
    Rabin, M. O. (2005). How to exchange secrets with oblivious transfer. IACR Cryptology ePrint Archive, 2005, 187.Google Scholar
  20. 20.
    Sun, Y., Huang, H., Li, X., Du, Y., Tian, M., Xu, H., et al. (2016). Privacy-preserving strategyproof auction mechanisms for resource allocation in wireless communications. In International Conference on Big Data Computing and Communications (pp. 13–26). Springer.Google Scholar
  21. 21.
    Sun, Y., Huang, H., Tian, M., Sun, Z., Yang, W., Guo, H., et al. (2015). STRUCTURE: A strategyproof double auction for heterogeneous secondary spectrum markets. In International Conference on Algorithms and Architectures for Parallel Processing (pp. 427–441). Springer.Google Scholar
  22. 22.
    Sun, Y., Wu, Q., Wang, J., Xu, Y., & Anpalagan, A. (2016). VERACITY: Overlapping coalition formation-based double auction for heterogeneous demand and spectrum reusability. IEEE Journal on Selected Areas in Communications, 34(10), 2690–2705.CrossRefGoogle Scholar
  23. 23.
    Wang, X., Ji, Y., Zhou, H., Liu, Z., Gu, Y., & Li, J. (2015). A privacy preserving truthful spectrum auction scheme using homomorphic encryption. In 2015 IEEE Global Communications Conference (GLOBECOM) (pp. 1–6). IEEE.Google Scholar
  24. 24.
    Wu, F., Huang, Q., Tao, Y., & Chen, G. (2015). Towards privacy preservation in strategy-proof spectrum auction mechanisms for noncooperative wireless networks. IEEE/ACM Transactions on Networking (TON), 23(4), 1271–1285.CrossRefGoogle Scholar
  25. 25.
    Xie, H., Wang, B., Gao, F., & Jin, S. (2016). A full-space spectrum-sharing strategy for massive mimo cognitive radio systems. IEEE Journal on Selected Areas in Communications, 34(10), 2537–2549.CrossRefGoogle Scholar
  26. 26.
    Yao, A. C. (1982). Protocols for secure computations. In 23rd Annual Symposium on Foundations of Computer Science, 1982. SFCS’08 (pp. 160–164). IEEE.Google Scholar
  27. 27.
    Zhang, R., Gao, F., & Liang, Y. (2010). Cognitive beamforming made practical: Effective interference channel and learning-throughput tradeoff. IEEE Transactions on Communications, 58(2), 706–718.CrossRefGoogle Scholar
  28. 28.
    Zhao, N., Yu, F. R., Sun, H., & Li, M. (2016). Adaptive power allocation schemes for spectrum sharing in interference-alignment-based cognitive radio networks. IEEE Transactions on Vehicular Technology, 65(5), 3700–3714.CrossRefGoogle Scholar
  29. 29.
    Zhou, X., Gandhi, S., Suri, S., & Zheng, H. (2008). eBay in the sky: Strategy-proof wireless spectrum auctions. In Proceedings of MobiCom.Google Scholar
  30. 30.
    Zhou, X., & Zheng, H. (2009). TRUST: A general framework for truthful double spectrum auctions. In Proceedings of INFOCOM (pp. 999–1007). IEEE.Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2017

Authors and Affiliations

  1. 1.School of Computer Science and TechnologyAnhui UniversityHefeiChina

Personalised recommendations