TY - JOUR
T1 - Location Privacy-Preserving Task Recommendation with Geometric Range Query in Mobile Crowdsensing
AU - Zhang, Chuan
AU - Zhu, Liehuang
AU - Xu, Chang
AU - Ni, Jianbing
AU - Huang, Cheng
AU - Shen, Xuemin
N1 - Publisher Copyright:
© 2002-2012 IEEE.
PY - 2022/12/1
Y1 - 2022/12/1
N2 - In mobile crowdsensing, location-based task recommendation requires each data requester to submit a task-related geometric range to crowdsensing service providers such that they can match suitable workers within this range. Generally, a trusted server (i.e., database owner) should be deployed to protect location privacy during the process, which is not desirable in practice. In this paper, we propose the location privacy-preserving task recommendation (PPTR) schemes with geometric range query in mobile crowdsensing without the trusted database owner. Specifically, we first propose a PPTR scheme with linear search complexity, named PPTR-L, based on a two-server model. By leveraging techniques of polynomial fitting and randomizable matrix multiplication, PPTR-L enables the service provider to find the workers located in the data requester's arbitrary geometric query range without disclosing the sensitive location privacy. To further improve query efficiency, we design a novel data structure for task recommendation and propose PPTR-F to achieve faster-than-linear search complexity. Through security analysis, it is shown that our schemes can protect the confidentiality of workers' locations and data requesters' queries. Extensive experiments are performed to demonstrate that our schemes can achieve high computational efficiency in terms of geometric range query.
AB - In mobile crowdsensing, location-based task recommendation requires each data requester to submit a task-related geometric range to crowdsensing service providers such that they can match suitable workers within this range. Generally, a trusted server (i.e., database owner) should be deployed to protect location privacy during the process, which is not desirable in practice. In this paper, we propose the location privacy-preserving task recommendation (PPTR) schemes with geometric range query in mobile crowdsensing without the trusted database owner. Specifically, we first propose a PPTR scheme with linear search complexity, named PPTR-L, based on a two-server model. By leveraging techniques of polynomial fitting and randomizable matrix multiplication, PPTR-L enables the service provider to find the workers located in the data requester's arbitrary geometric query range without disclosing the sensitive location privacy. To further improve query efficiency, we design a novel data structure for task recommendation and propose PPTR-F to achieve faster-than-linear search complexity. Through security analysis, it is shown that our schemes can protect the confidentiality of workers' locations and data requesters' queries. Extensive experiments are performed to demonstrate that our schemes can achieve high computational efficiency in terms of geometric range query.
KW - Task recommendation
KW - geometric range query
KW - location
KW - mobile crowdsensing
KW - privacy
UR - http://www.scopus.com/inward/record.url?scp=85107222368&partnerID=8YFLogxK
U2 - 10.1109/TMC.2021.3080714
DO - 10.1109/TMC.2021.3080714
M3 - Article
AN - SCOPUS:85107222368
SN - 1536-1233
VL - 21
SP - 4410
EP - 4425
JO - IEEE Transactions on Mobile Computing
JF - IEEE Transactions on Mobile Computing
IS - 12
ER -