Spatiotemporal-Aware Privacy-Preserving Task Matching in Mobile Crowdsensing

被引:12
|
作者
Peng, Tao [1 ]
Zhong, Wentao [1 ]
Wang, Guojun [1 ]
Zhang, Shaobo [2 ]
Luo, Entao [3 ]
Wang, Tian [4 ,5 ]
机构
[1] Guangzhou Univ, Sch Comp Sci & Cyber Engn, Guangzhou 510006, Peoples R China
[2] Hunan Univ Sci & Technol, Sch Comp Sci & Engn, Xiangtan 411201, Peoples R China
[3] Hunan Univ Sci & Engn, Sch Informat Engn, Yongzhou 425199, Peoples R China
[4] Beijing Normal Univ BNU Zhuhai, BNU UIC Inst Artificial Intelligence & Future Netw, BNU HKBU United Int Coll Zhuhai, Zhuhai 519087, Peoples R China
[5] Beijing Normal Univ BNU Zhuhai, BNU HKBU United Int Coll, Guangdong Key Lab AI & Multimodal Data Proc, Zhuhai 519087, Peoples R China
关键词
Mobile crowdsensing (MCS); privacy preserving; secure computing; task matching; ALLOCATION;
D O I
10.1109/JIOT.2023.3292284
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Task matching is widely used for participant selection in mobile crowdsensing (MCS). However, accurate task matching relies on collecting a large amount of user information, which has the risk of privacy leakage. Existing privacy-preserving task matching methods have the disadvantages of low matching efficiency and coarse matching granularity, and are difficult to apply to MCS because of higher real-time requirements. In this article, we propose a spatiotemporal-aware privacy-preserving task matching scheme, achieving efficient and fine-grained matching while protecting privacy between users and task publishers. Specifically, the time matching score (TMS) and location matching score (LMS) between users and tasks are defined for the spatiotemporal requirement of MCS. In addition, a lightweight protocol called SCP (secure computing protocol) is constructed based on Shamir secret sharing and Carmichael theorem for securely calculating TMS and LMS and matching attribute values by size and range. The correctness and security of our scheme are proved by detailed theoretical analysis, and the experimental result shows that the computational overhead of our proposed scheme is only 10% of that in the scheme we compared with, while the difference in communication overhead is less than 200 KB.
引用
收藏
页码:2394 / 2406
页数:13
相关论文
共 50 条
  • [41] Privacy-preserving Worker Selection in Mobile Crowdsensing over Spatial-temporal Constraints
    Zhang, Xichen
    Lu, Rongxing
    Zhang, Songnian
    Ray, Suprio
    Ghorbani, Ali A.
    IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC 2022), 2022, : 4384 - 4389
  • [42] Dual-side privacy-preserving task matching for spatial crowdsourcing
    Shu, Jiangang
    Liu, Ximeng
    Zhang, Yinghui
    Jia, Xiaohua
    Deng, Robert H.
    JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2018, 123 : 101 - 111
  • [43] EPDL: An efficient and privacy-preserving deep learning for crowdsensing
    Xu, Chang
    Jin, Guoxie
    Zhu, Liehuang
    Zhang, Chuan
    Jia, Yu
    PEER-TO-PEER NETWORKING AND APPLICATIONS, 2022, 15 (06) : 2529 - 2541
  • [44] EPDL: An efficient and privacy-preserving deep learning for crowdsensing
    Chang Xu
    Guoxie Jin
    Liehuang Zhu
    Chuan Zhang
    Yu Jia
    Peer-to-Peer Networking and Applications, 2022, 15 : 2529 - 2541
  • [45] Privacy-preserving Task Allocation and Decentralized Dispute Protocol in Mobile Crowdsourcing
    Meng, Zhenyu
    Yu, Chong
    Qian, Yi
    ICC 2023-IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, 2023, : 1579 - 1584
  • [46] Privacy-preserving mobile crowd sensing task assignment with Stackelberg game
    Fu, Yanming
    Huang, Bocheng
    Liu, Xiao
    Chen, Jiayuan
    Lu, Shenglin
    COMPUTER NETWORKS, 2023, 234
  • [47] Privacy-Preserving Auction for Heterogeneous Task Assignment in Mobile Device Clouds
    Jiang, Xufeng
    Pei, Xuhao
    Tian, Dawei
    Li, Lu
    WIRELESS ALGORITHMS, SYSTEMS, AND APPLICATIONS, WASA 2021, PT III, 2021, 12939 : 345 - 358
  • [48] A Privacy-Preserving Data Aggregation Scheme Based on Chinese Remainder Theorem in Mobile Crowdsensing System
    Zhu, Boyao
    Li, Yumei
    Hu, Guoxiong
    Zhang, Mingwu
    IEEE SYSTEMS JOURNAL, 2023, 17 (03): : 4257 - 4266
  • [49] Attribute-Aware Task Allocation and Privacy-Preserving Coordination Mechanism for MCS
    Yang P.
    Wu Q.
    Huanan Ligong Daxue Xuebao/Journal of South China University of Technology (Natural Science), 2020, 48 (08): : 38 - 48
  • [50] Proxy-Free Privacy-Preserving Task Matching with Efficient Revocation in Crowdsourcing
    Shu, Jiangang
    Yang, Kan
    Jia, Xiaohua
    Liu, Ximeng
    Wang, Cong
    Deng, Robert H.
    IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2021, 18 (01) : 117 - 130