Privacy-Preserving Task Recommendation Services for Crowdsourcing

被引:108
作者
Shu, Jiangang [1 ]
Jia, Xiaohua [1 ]
Yang, Kan [2 ]
Wang, Hua [3 ]
机构
[1] City Univ Hong Kong, Dept Comp Sci, Kowloon Tong, Hong Kong, Peoples R China
[2] Univ Memphis, Dept Comp Sci, Memphis, TN 38152 USA
[3] Victoria Univ, Ctr Appl Informat, Footscray, Vic 3011, Australia
关键词
Crowdsourcing; Encryption; Privacy; Servers; task recommendation; multi-keyword; privacy-preserving; proxy re-encryption; SECURITY; CHALLENGES;
D O I
10.1109/TSC.2018.2791601
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Crowdsourcing is a distributed computing paradigm that utilizes human intelligence or resources from a crowd of workers. Existing solutions of task recommendation in crowdsourcing may leak private and sensitive information about both tasks and workers. To protect privacy, information about tasks and workers should be encrypted before being outsourced to the crowdsourcing platform, which makes the task recommendation a challenging problem. In this paper, we propose a privacy-preserving task recommendation scheme (PPTR) for crowdsourcing, which achieves the task-worker matching while preserving both task privacy and worker privacy. In PPTR, we first exploit the polynomial function to express multiple keywords of task requirements and worker interests. Then, we design a key derivation method based on matrix decomposition, to realize the multi-keyword matching between multiple requesters and multiple workers. Through PPTR, user accountability and user revocation are achieved effectively and efficiently. Extensive privacy analysis and performance evaluation show that PPTR is secure and efficient.
引用
收藏
页码:235 / 247
页数:13
相关论文
共 50 条
[11]   TAMT: Privacy-Preserving Task Assignment With Multi-Threshold Range Search for Spatial Crowdsourcing Applications [J].
Bao, Haiyong ;
Wang, Zhehong ;
Lu, Rongxing ;
Huang, Cheng ;
Li, Beibei .
IEEE TRANSACTIONS ON BIG DATA, 2025, 11 (01) :208-220
[12]   SybMatch: Sybil Detection for Privacy-Preserving Task Matching in Crowdsourcing [J].
Shu, Jiangang ;
Liu, Ximeng ;
Yang, Kan ;
Zhang, Yinghui ;
Jia, Xiaohua ;
Deng, Robert H. .
2018 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2018,
[13]   A Privacy-Preserving and Identity-Based Personalized Recommendation Scheme for Encrypted Tasks in Crowdsourcing [J].
Yin, Hui ;
Xiong, Yinqiao ;
Deng, Tiantian ;
Deng, Hua ;
Zhu, Peidong .
IEEE ACCESS, 2019, 7 :138857-138871
[14]   BPTM: Blockchain-Based Privacy-Preserving Task Matching in Crowdsourcing [J].
Wu, Yiming ;
Tang, Shaohua ;
Zhao, Bowen ;
Peng, Zhiniang .
IEEE ACCESS, 2019, 7 :45605-45617
[15]   Dual-side privacy-preserving task matching for spatial crowdsourcing [J].
Shu, Jiangang ;
Liu, Ximeng ;
Zhang, Yinghui ;
Jia, Xiaohua ;
Deng, Robert H. .
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2018, 123 :101-111
[16]   SybSub: Privacy-Preserving Expressive Task Subscription With Sybil Detection in Crowdsourcing [J].
Shu, Jiangang ;
Liu, Ximeng ;
Yang, Kan ;
Zhang, Yinghui ;
Jia, Xiaohua ;
Deng, Robert H. .
IEEE INTERNET OF THINGS JOURNAL, 2019, 6 (02) :3003-3013
[17]   Privacy-Preserving Competitive Detour Tasking in Spatial Crowdsourcing [J].
Zheng, Yifeng ;
Zhou, Menglun ;
Wang, Songlei ;
Hua, Zhongyun ;
Jiang, Jinghua ;
Gao, Yansong .
IEEE TRANSACTIONS ON SERVICES COMPUTING, 2025, 18 (01) :385-398
[18]   FedCrowd: A Federated and Privacy-Preserving Crowdsourcing Platform on Blockchain [J].
Guo, Yu ;
Xie, Hongcheng ;
Miao, Yinbin ;
Wang, Cong ;
Jia, Xiaohua .
IEEE TRANSACTIONS ON SERVICES COMPUTING, 2022, 15 (04) :2060-2073
[19]   A Survey on Location Privacy-Preserving Mechanisms in Mobile Crowdsourcing [J].
Bashanfar, Arwa ;
Al-Zahrani, Eman ;
Alutebei, Maram ;
Aljagthami, Wejdan ;
Alshehri, Suhari .
INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2019, 10 (07) :626-632
[20]   Location Privacy-Preserving Distance Computation for Spatial Crowdsourcing [J].
Han, Song ;
Lin, Jianhong ;
Zhao, Shuai ;
Xu, Guangquan ;
Ren, Siqi ;
He, Daojing ;
Wang, Licheng ;
Shi, Leyun .
IEEE INTERNET OF THINGS JOURNAL, 2020, 7 (08) :7550-7563