TY - JOUR
T1 - Privacy-Preserving Task Assignment in Spatial Crowdsourcing
AU - Liu, An
AU - Li, Zhi-Xu
AU - Liu, Guan-Feng
AU - Zheng, Kai
AU - Zhang, Min
AU - Li, Qing
AU - Zhang, Xiangliang
N1 - KAUST Repository Item: Exported on 2020-10-01
Acknowledgements: This work was partially supported by King Abdullah University of Science and Technology (KAUST) and the National Natural Science Foundation of China under Grant Nos. 61572336, 61632016, 61402313, 61572335, and 61472337.
PY - 2017/9/20
Y1 - 2017/9/20
N2 - With the progress of mobile devices and wireless networks, spatial crowdsourcing (SC) is emerging as a promising approach for problem solving. In SC, spatial tasks are assigned to and performed by a set of human workers. To enable effective task assignment, however, both workers and task requesters are required to disclose their locations to
untrusted SC systems. In this paper, we study the problem of assigning workers to tasks in a way that location privacy for both workers and task requesters is preserved. We first combine the Paillier cryptosystem with Yao’s garbled circuits to construct a secure protocol that assigns the nearest worker to a task. Considering that this protocol cannot scale to a large number of workers, we then make use of Geohash, a hierarchical spatial index to design a more efficient protocol that can securely find approximate nearest workers. We theoretically show that these two protocols are secure against semi-honest adversaries. Through extensive experiments on two real-world datasets, we demonstrate the efficiency and effectiveness of our protocols.
AB - With the progress of mobile devices and wireless networks, spatial crowdsourcing (SC) is emerging as a promising approach for problem solving. In SC, spatial tasks are assigned to and performed by a set of human workers. To enable effective task assignment, however, both workers and task requesters are required to disclose their locations to
untrusted SC systems. In this paper, we study the problem of assigning workers to tasks in a way that location privacy for both workers and task requesters is preserved. We first combine the Paillier cryptosystem with Yao’s garbled circuits to construct a secure protocol that assigns the nearest worker to a task. Considering that this protocol cannot scale to a large number of workers, we then make use of Geohash, a hierarchical spatial index to design a more efficient protocol that can securely find approximate nearest workers. We theoretically show that these two protocols are secure against semi-honest adversaries. Through extensive experiments on two real-world datasets, we demonstrate the efficiency and effectiveness of our protocols.
UR - http://hdl.handle.net/10754/626013
UR - http://link.springer.com/article/10.1007/s11390-017-1772-5
UR - http://www.scopus.com/inward/record.url?scp=85029798918&partnerID=8YFLogxK
U2 - 10.1007/s11390-017-1772-5
DO - 10.1007/s11390-017-1772-5
M3 - Article
SN - 1000-9000
VL - 32
SP - 905
EP - 918
JO - Journal of Computer Science and Technology
JF - Journal of Computer Science and Technology
IS - 5
ER -