PROST : Privacy-Preserving and Truthful Online Double Auction for Spectrum Allocation
Spectrum auction is an effective way to redistribute scarce spectrum resources. However, most spectrum auction designs only target at economic robustness, while neglecting the inherent privacy leakage problem. Existing secure spectrum auction mechanisms fail to provide adequate security, and they al...
Saved in:
Published in | IEEE transactions on information forensics and security Vol. 14; no. 2; pp. 374 - 386 |
---|---|
Main Authors | , , , , , |
Format | Journal Article |
Language | English |
Published |
IEEE
01.02.2019
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Spectrum auction is an effective way to redistribute scarce spectrum resources. However, most spectrum auction designs only target at economic robustness, while neglecting the inherent privacy leakage problem. Existing secure spectrum auction mechanisms fail to provide adequate security, and they all neglect the online fashion of spectrum request arrival. In this paper, for the first time, we propose a Privacy-pReserving and truthful Online double auction mechanism for Spectrum allocaTion in wireless networks, PROST. Compared with the state-of-the-art solutions, PROST provides a comprehensive and strong protection for users' sensitive information, especially for location privacy and time dynamics. PROST is constructed based on our carefully designed security building blocks, which support various arithmetics over encrypted real numbers, and they are also well applicable in other spectrum auctions. Besides, we improve on the existing online spectrum auction mechanisms by designing a novel privacy-preserving buyer grouping protocol for spectrum reuse. We not only theoretically prove that PROST can realize an all-round security against semi-honest adversaries but also extensively evaluate its performance. Experimental results validate that PROST achieves nice spectrum allocation efficiency with light computation and communication costs. |
---|---|
ISSN: | 1556-6013 1556-6021 |
DOI: | 10.1109/TIFS.2018.2850330 |