Task Allocation under Geo-Indistinguishability via Group-based Noise Addition

Locations are usually necessary for task allocation in spatial crowdsourcing, which may put individual privacy in jeopardy without proper protection. Although existing studies have well explored the problem of location privacy protection in task allocation under geo-indistinguishability, they potent...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on big data 2023-06, Vol.9 (3), p.1-16
Main Authors: Zhang, Pengfei, Cheng, Xiang, Su, Sen, Wang, Ning
Format: Article
Language:English
Subjects:
Convergence
Crowdsourcing
Geo-indistinguishability
Noise measurement
Privacy
Privacy Protection
Resource management
Servers
Spatial Crowdsourcing
Task Allocation
Task analysis
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Locations are usually necessary for task allocation in spatial crowdsourcing, which may put individual privacy in jeopardy without proper protection. Although existing studies have well explored the problem of location privacy protection in task allocation under geo-indistinguishability, they potentially assume the workers could perform any tasks, which might not be practical in reality. Moreover, they usually adopt planar laplacian mechanism to achieve geo-indistinguishability, which will introduce excessive noise due to its randomness and boundlessness. To this end, we propose a task allo CA tio N approach via gr O up-based nois E addition under Geo-I, referred to as CANOE . Its main idea is that each worker uploads the noisy distances between his true location and the obfuscated locations of his preferred tasks instead of uploading his obfuscated location. In particular, to alleviate the total noise when conducting grouping, we put forward an optimized global grouping with adaptive local adjustment method OGAL with convergence guarantee. To collect the noisy distances which are required for subsequent task allocation, we develop a utility-aware obfuscated distance collection method UODC with solid privacy and utility guarantees. We further theoretically analyze the privacy, utility and complexity guarantees of CANOE . Extensive analyses and experiments over two real-world datasets confirm the effectiveness of CANOE .
ISSN:2332-7790
2372-2096
DOI:10.1109/TBDATA.2022.3215467