ARMOR: A Secure Combinatorial Auction for Heterogeneous Spectrum

被引:20
作者
Chen, Yanjiao [1 ]
Tian, Xin [1 ]
Wang, Qian [2 ]
Li, Minghui [2 ]
Du, Minxin [2 ]
Li, Qi [3 ]
机构
[1] Wuhan Univ, Sch Comp Sci, Wuhan 430072, Hubei, Peoples R China
[2] Wuhan Univ, Sch Cyber Sci & Engn, Wuhan 430072, Hubei, Peoples R China
[3] Tsinghua Univ, Grad Sch Shenzhen, Shenzhen 100084, Peoples R China
基金
中国国家自然科学基金;
关键词
Spectrum allocation; combinatorial auction; privacy preservation; social welfare; verifiable pricing; STRATEGY-PROOF; MECHANISMS;
D O I
10.1109/TMC.2018.2875910
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Dynamic spectrum allocation via auction is an effective solution to spectrum shortage. Combinatorial spectrum auction enables buyers to express diversified preferences towards different combinations of channels. Despite the effort to ensure truthfulness and maximize social welfare, spectrum auction also faces potential security risks. The leakage of sensitive information such as true valuation and location of bidders may incur severe economic damage. However, there is a lack of works that can provide sufficient protection against such security risks in combinatorial spectrum auction. In this paper, we propose ARMOR, to enable combinatorial auction for heterogeneous spectrum with privacy, which can preserve bidders' privacy while guaranteeing the economic-robustness of the combinatorial auction. We leverage the cryptographic methods, including homomorphic encryption, order-preserving encryption, and garbled circuits, to shield the bid and location information of buyers from the auctioneer. We design a novel location protection algorithm, which allows the auctioneer to exploit spectrum reuse opportunities without knowing the exact locations of buyers. Furthermore, we propose a verifiable payment scheme based on digital signature to prevent the auctioneer from forging the payment. The extensive experiments confirm that ARMOR maintains the good performance of the combinatorial spectrum auction, in terms of buyer satisfactory ratio and social welfare, and achieves privacy preservation with acceptable computation and communication costs.
引用
收藏
页码:2270 / 2284
页数:15
相关论文
共 42 条
[1]  
Agrawal R., 2004, ACM SIGMOD INT C MAN, P563
[2]  
[Anonymous], 1991, INPROC 11 ANN INT CR, DOI [10.1007/3-540-46766-1_9, DOI 10.1007/3-540-46766-1_9, DOI 10.1007/3--540-46766-1_9]
[3]   On the existence of unconditionally privacy-preserving auction protocols [J].
Brandt, Felix ;
Sandholm, Tuomas .
ACM TRANSACTIONS ON INFORMATION AND SYSTEM SECURITY, 2008, 11 (02)
[4]  
Camenisch J. L., 1995, Advances in Cryptology - EUROCRYPT '94. Workshop on the Theory and Application of Cryptographic Techniques. Proceedings, P428, DOI 10.1007/BFb0053458
[5]  
Chen Y., 2017, P ACM INT S MOB AD H
[6]  
Chen YJ, 2018, IEEE INFOCOM SER, P1664, DOI 10.1109/INFOCOM.2018.8486258
[7]   Ensuring Minimum Spectrum Requirement in Matching-Based Spectrum Allocation [J].
Chen, Yanjiao ;
Xiong, Yuxuan ;
Wang, Qian ;
Yin, Xiaoyan ;
Li, Baochun .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2018, 17 (09) :2028-2040
[8]  
Chen ZL, 2014, IEEE INFOCOM SER, P1249, DOI 10.1109/INFOCOM.2014.6848057
[9]  
Dong M, 2012, IEEE INFOCOM SER, P2282, DOI 10.1109/INFCOM.2012.6195615
[10]  
Dowlatshahi M.B., 2017, J AI DATA MIN, V5, P169