PPS: Privacy-Preserving Strategyproof Social-Efficient Spectrum Auction Mechanisms

Many spectrum auction mechanisms have been proposed for spectrum allocation problem, and unfortunately, few of them protect the bid privacy of bidders and achieve good social efficiency. In this paper, we propose PPS, a Privacy Preserving Strategyproof spectrum auction framework. We design two schemes based on PPS separately for 1) the single-unit auction model (SUA), where only single channel will be sold in the spectrum market; and 2) the multi-unit auction model (MUA), where the primary user subleases multi-unit channels to the secondary users and each of the secondary users wants to access multi-unit channels either. Since the social efficiency maximization problem is NP-hard in both auction models, we present allocation mechanisms with approximation factors of (1 + ε) and 32 separately for SUA and MUA, and further judiciously design strategyproof auction mechanisms with privacy preserving based on them. Our extensive evaluations show that our mechanisms achieve good social efficiency and with low computation and communication overhead.

[1]  E. Maasland,et al.  Auction Theory , 2021, Springer Texts in Business and Economics.

[2]  Zongpeng Li,et al.  Strategyproof Wireless Spectrum Auctions with Interference , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[3]  Baochun Li,et al.  District: Embracing local markets in truthful spectrum double auctions , 2011, 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[4]  Zongpeng Li,et al.  Strategyproof auctions for balancing social welfare and fairness in secondary spectrum markets , 2011, 2011 Proceedings IEEE INFOCOM.

[5]  Baochun Li,et al.  A Secondary Market for Spectrum , 2010, 2010 Proceedings IEEE INFOCOM.

[6]  Xiang-Yang Li,et al.  Near-optimal truthful spectrum auction mechanisms with spatial and temporal reuse in wireless networks , 2013, MobiHoc.

[7]  Mahmoud Al-Ayyoub,et al.  Truthful spectrum auctions with approximate revenue , 2011, 2011 Proceedings IEEE INFOCOM.

[8]  Craig Boutilier,et al.  Efficiency and Privacy Tradeoffs in Mechanism Design , 2011, AAAI.

[9]  Xiang-Yang Li,et al.  SALSA: Strategyproof Online Spectrum Admissions for Wireless Networks , 2010, IEEE Transactions on Computers.

[10]  Mingyan Liu,et al.  Revenue generation for truthful spectrum auction in dynamic spectrum access , 2009, MobiHoc '09.

[11]  Andrew Chi-Chih Yao,et al.  Protocols for secure computations , 1982, FOCS 1982.

[12]  XiaoHua Xu,et al.  TODA: Truthful Online Double Auction for Spectrum Allocation in Wireless Networks , 2010, 2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN).

[13]  Taeho Jung,et al.  Search me if you can: Privacy-preserving location query service , 2012, 2013 Proceedings IEEE INFOCOM.

[14]  Katherine Lai The Knapsack Problem and Fully Polynomial Time Approximation Schemes (FPTAS) , 2006 .

[15]  Tim Roughgarden,et al.  Algorithmic Game Theory , 2007 .

[16]  Qinghua Li,et al.  Providing Efficient Privacy-Aware Incentives for Mobile Sensing , 2014, 2014 IEEE 34th International Conference on Distributed Computing Systems.

[17]  Shaojie Tang,et al.  Efficient and Strategyproof Spectrum Allocations in Multichannel Wireless Networks , 2011, IEEE Transactions on Computers.

[18]  Zongpeng Li,et al.  Core-selecting combinatorial auction design for secondary spectrum markets , 2013, 2013 Proceedings IEEE INFOCOM.

[19]  Xiang-Yang Li,et al.  Privacy preserving cloud data access with multi-authorities , 2012, 2013 Proceedings IEEE INFOCOM.

[20]  Fan Wu,et al.  SMALL: A Strategy-proof Mechanism for radio spectrum allocation , 2011, 2011 Proceedings IEEE INFOCOM.

[21]  Xiang-Yang Li,et al.  Collusion-Tolerable Privacy-Preserving Sum and Product Calculation without Secure Channel , 2015, IEEE Transactions on Dependable and Secure Computing.

[22]  Fan Wu,et al.  SPRING: A Strategy-proof and Privacy preserving spectrum auction mechanism , 2013, 2013 Proceedings IEEE INFOCOM.

[23]  Felix Brandt,et al.  On the Existence of Unconditionally Privacy-Preserving Auction Protocols , 2008, TSEC.

[24]  Ivan Damgård,et al.  Homomorphic encryption and secure comparison , 2008, Int. J. Appl. Cryptogr..

[25]  Christian Cachin,et al.  Efficient private bidding and auctions with an oblivious third party , 1999, CCS '99.

[26]  Ivan Damgård,et al.  Efficient and Secure Comparison for On-Line Auctions , 2007, ACISP.

[27]  Benny Pinkas,et al.  Secure Computation of the k th-Ranked Element , 2004, EUROCRYPT.

[28]  Moni Naor,et al.  Privacy preserving auctions and mechanism design , 1999, EC '99.

[29]  Miao Pan,et al.  Purging the Back-Room Dealing: Secure Spectrum Auction Leveraging Paillier Cryptosystem , 2011, IEEE Journal on Selected Areas in Communications.

[30]  Mo Dong,et al.  Combinatorial auction with time-frequency flexibility in cognitive radio networks , 2012, 2012 Proceedings IEEE INFOCOM.

[31]  Qinghua Li,et al.  Providing privacy-aware incentives for mobile sensing , 2013, 2013 IEEE International Conference on Pervasive Computing and Communications (PerCom).

[32]  Kevin C. Almeroth,et al.  To preempt or not: Tackling bid and time-based cheating in online spectrum auctions , 2011, 2011 Proceedings IEEE INFOCOM.

[33]  Xia Zhou,et al.  eBay in the Sky: strategy-proof wireless spectrum auctions , 2008, MobiCom '08.

[34]  Guihai Chen,et al.  SMASHER: a strategy-proof combinatorial auction mechanism for heterogeneous channel redistribution , 2013, MobiHoc '13.

[35]  Mingyan Liu,et al.  Mining Spectrum Usage Data: A Large-Scale Spectrum Measurement Study , 2009, IEEE Transactions on Mobile Computing.

[36]  Yu Wang,et al.  Simple approximation algorithms and PTASs for various problems in wireless ad hoc networks , 2006, J. Parallel Distributed Comput..

[37]  Shaojie Tang,et al.  Truthful online spectrum allocation and auction in multi-channel wireless networks , 2011, 2011 Proceedings IEEE INFOCOM.

[38]  Benny Pinkas,et al.  Secure computation of the kth-ranked element , 2004 .

[39]  Xia Zhou,et al.  TRUST: A General Framework for Truthful Double Spectrum Auctions , 2009, IEEE INFOCOM 2009.

[40]  Harry B. Hunt,et al.  NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs , 1998, J. Algorithms.

[41]  Shaojie Tang,et al.  Privacy-preserving data aggregation without secure channel: Multivariate polynomial evaluation , 2013, 2013 Proceedings IEEE INFOCOM.

[42]  Zongpeng Li,et al.  Truthful spectrum auction design for secondary networks , 2012, 2012 Proceedings IEEE INFOCOM.

[43]  Wenliang Du,et al.  Secure multi-party computation problems and their applications: a review and open problems , 2001, NSPW '01.