Privacy-Preserving Competitive Detour Tasking in Spatial Crowdsourcing

被引:1
作者
Zheng, Yifeng [1 ]
Zhou, Menglun [1 ]
Wang, Songlei [1 ]
Hua, Zhongyun [1 ]
Jiang, Jinghua [2 ]
Gao, Yansong [3 ]
机构
[1] Harbin Inst Technol, Sch Comp Sci & Technol, Shenzhen 518055, Peoples R China
[2] Shenzhen Polytech Univ, Sch Elect & Commun Engn, Shenzhen 518055, Peoples R China
[3] CSIRO, Data61, Sydney, NSW 2015, Australia
基金
中国国家自然科学基金;
关键词
Costs; Cryptography; Protection; Privacy; Crowdsourcing; Protocols; Homomorphic encryption; Information leakage; Public key; Optimization; Competitive task assignment; privacy; reverse auction; spatial crowdsourcing; FRAMEWORK; SECURITY;
D O I
10.1109/TSC.2024.3511992
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Spatial crowdsourcing (SC) has recently emerged as a new crowdsourcing service paradigm, where workers move physically to designated locations to perform tasks. Most SC systems perform task assignment based on the spatial proximity between task locations and worker locations. Under such a strategy, workers can only perform tasks near them, which may result in low social welfare (i.e., the total profit of the platform and workers). In contrast, the newly emerging strategy of competitive task assignment (CTA) stimulates workers to compete for their preferred tasks, allowing optimization of the overall profit of SC systems. Among others, one novel CTA setting is competitive detour tasking, which allows workers to compete for tasks that need them to make detours from their original travel paths. However, it requires collecting each worker's bidding profile which may expose private information. In light of this, in this article, we design, implement, and evaluate PrivCO, a new system framework enabling privacy-preserving competitive detour tasking services in SC. PrivCO delicately bridges state-of-the-art competitive detour tasking algorithms with lightweight cryptography, providing strong protections for workers' bidding profiles. Extensive experiments over real-world datasets demonstrate that while offering strong security guarantees, PrivCO achieves social welfare comparable to the plaintext domain.
引用
收藏
页码:385 / 398
页数:14
相关论文
共 44 条
[1]   QUOTIENT: Two-Party Secure Neural Network Training and Prediction [J].
Agrawal, Nitin ;
Shamsabadi, Ali Shahin ;
Kusner, Matt J. ;
Gascon, Adria .
PROCEEDINGS OF THE 2019 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (CCS'19), 2019, :1231-1247
[2]   High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority [J].
Araki, Toshinori ;
Furukawa, Jun ;
Lindell, Yehuda ;
Nof, Ariel ;
Ohara, Kazuma .
CCS'16: PROCEEDINGS OF THE 2016 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2016, :805-817
[3]  
Artikis A., 2014, P JOINT EUR C MACH L, P520
[4]   Function Secret Sharing for Mixed-Mode and Fixed-Point Secure Computation [J].
Boyle, Elette ;
Chandran, Nishanth ;
Gilboa, Niv ;
Gupta, Divya ;
Ishai, Yuval ;
Kumar, Nishant ;
Rathee, Mayank .
ADVANCES IN CRYPTOLOGY - EUROCRYPT 2021, PT II, 2021, 12697 :871-900
[5]  
Bracciale L., CRAWDAD dataset roma/taxi (v. 2014-07-03),, V2014, DOI DOI 10.15783/C7QC7M
[6]   Security and composition of multiparty cryptographic protocols [J].
Canetti, R .
JOURNAL OF CRYPTOLOGY, 2000, 13 (01) :143-202
[7]   Metal: A Metadata-Hiding File-Sharing System [J].
Chen, Weikeng ;
Popa, Raluca Ada .
27TH ANNUAL NETWORK AND DISTRIBUTED SYSTEM SECURITY SYMPOSIUM (NDSS 2020), 2020,
[8]   ARMOR: A Secure Combinatorial Auction for Heterogeneous Spectrum [J].
Chen, Yanjiao ;
Tian, Xin ;
Wang, Qian ;
Li, Minghui ;
Du, Minxin ;
Li, Qi .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2019, 18 (10) :2270-2284
[9]   Utility-Aware Ridesharing on Road Networks [J].
Cheng, Peng ;
Xin, Hao ;
Chen, Lei .
SIGMOD'17: PROCEEDINGS OF THE 2017 ACM INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2017, :1197-1210
[10]  
Chun H., 2014, P 9 ACM S INFORM COM, P401, DOI DOI 10.1145/2590296.2590343