Journal
IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2019)
Volume -, Issue -, Pages 2053-2061Publisher
IEEE
DOI: 10.1109/infocom.2019.8737594
Keywords
-
Categories
Funding
- National Natural Science of China [61872274, 61702562, 61772472, 61822207]
- Equipment Pre -Research Joint Fund of Ministry of Education of China (Youth Talent) [6141A02033327]
- National Key Research and Development Program of China [2018Y11131.003702]
- Hunan Provincial Natural Science Foundation of China for Distinguished Young Scholars [2018E1025]
- Natural Science Foundation of Hubei Province [2017CFB503, 2017CFA047, 2017CFA007]
- Science and Technology planning project of ShenZhen [JCYJ120170818112550194]
- Natural Science Foundation of Zhejiang Province [LY17F020020]
- Fundamental Research Funds for the Central Universities [2042018gf0043]
- State Key Lab. for Novel Software Technology, Nanjing University [KFKT2018B09]
Ask authors/readers for more resources
Reverse auction-based incentive mechanisms have been commonly proposed to stimulate mobile users to participate in crowdsensing, where users submit bids to the platform to compete for tasks. Recent works pointed out that bid is a private information which can reveal sensitive information of users (e.g., location privacy), and proposed bid-preserving mechanisms with differential privacy against inference attack. However, all these mechanisms rely on a trusted platform, and would fail in bid protection completely when the platform is untrusted (e.g., honest-hut-curious). In this paper, we focus on the bid protection problem in mobile crowdsensing with an untrusted platform, and propose a novel privacy-preserving incentive mechanism to protect users' true bids against the honest-but-curious platform while minimizing the social cost of winner selection. To this end, instead of uploading the true hid to the platform, a differentially private hid obfuscation function is designed with the exponential mechanism, which helps each user to obfuscate bids locally and submit obfuscated task-bid pairs to the platform. The winner selection problem with the obfuscated task-bid pairs is lOrmulated as an integer linear programming problem and proved to be NP-hard. We consider the optimization problem at two different scenarios, and propose a solution based on Hungarian method for single measurement and a greedy solution for multiple measurements, respectively. The proposed incentive mechanism is proved to satisfy epsilon-differential privacy, individual rationality and gamma-truthfulness. The extensive experiments on a real-world data set demonstrate the effectiveness of the proposed mechanism against the untrusted platform.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available