Privacy-Preserving Task Matching With Threshold Similarity Search via Vehicular Crowdsourcing
Fuyuan Song, Zheng Qin, Dongxiao Liu, Jixin Zhang, Xiaodong Sheldon Lin, Xuemin Shen
Hunan University University of Waterloo Hubei University of Technology University of Guelph
阅读操作
确认中在文库中上传 PDF 后可生成中文音频讲解。
摘要与影响
In vehicular crowdsourcing, task requesters rely on a server to distribute spatial crowdsourcing tasks to on-road vehicular workers based on interests and locations. To protect the privacy of the interests and locations, both requesters and workers prefer to encrypt the information before uploading them to the server. However, such an encryption-before-outsourcing paradigm makes it a challenging issue to conduct the task matching. In this paper, we propose a Privacy-Preserving Task Matching (PPTM) with threshold similarity search via vehicular crowdsourcing. We first propose an interest-based PPTM by transforming vehicular workers' interests into binary vectors. By using Symmetric-key Threshold Predicate Encryption (STPE) and proxy re-encryption, PPTM achieves privacy-preserving multi-keyword task matching with Jaccard similarity search in multi-worker multi-requester setting. Furthermore, by comparing the Euclidean distances between workers and requesters against a pre-defined threshold, PPTM preserves the location privacy of workers and requesters that only reveals the comparison results to the crowdsourcing server. The security analysis and extensive experiments demonstrate that PPTM protects the confidentiality of locations and interests of requesters and workers while achieving the efficient task matching.
逐年被引趋势
关键指标
同类平均 = 1
同领域 · 同年份 · 同类型
Google Scholar 与 OpenAlex 的被引统计范围不同,数值存在差异属正常。
AI 辅助阅读
依据:摘要
可就本文提问;依据不足时会说明。
学术脉络
学科主题
计算机 / AIPrivacy-Preserving Technologies in Data
Cryptography and Data Security · Mobile Crowdsensing and Crowdsourcing
参考文献 36
此处列出前 3 条
引用本文 50
按被引量排序,此处列出前 3 条