4.7 Article

Optimizing rewards allocation for privacy-preserving spatial crowdsourcing

期刊

COMPUTER COMMUNICATIONS
卷 146, 期 -, 页码 85-94

出版社

ELSEVIER
DOI: 10.1016/j.comcom.2019.07.020

关键词

Spatial crowdsourcing; Privacy preservation; Homomorphic encryption

资金

  1. Ministry of Education, Humanities, and Social Science Project of China [19A10520035]
  2. Fundamental Research Funds for the Central Universities, Zhongnan University of Economics and law [201911414]

向作者/读者索取更多资源

Rewards allocation in one of the key issues for ensuring a high task acceptance rate in spatial crowdsourcing applications. Generally, workers who participate in a crowdsourcing project are required to disclose their locations, which may lead to serious privacy threats. Unfortunately, providing a rigid privacy guarantee is incompatible with ensuring a high task acceptance rate in most existing crowdsourcing solutions. Hence, this paper proposes a crowdsourcing framework based on optimized reward allocation strategies. The key idea is to tune the reward for performing each task to the workers' preferences to attain a high acceptance rate. The first step in the framework is to interrogate the workers' preferences using a cryptographic protocol that fully preserves the location privacy of the workers. Based on those preferences, two different approaches to reward assignments have been proposed to ensure the rewards are distributed optimally. A theoretical analysis of the privacy protection inherent in the framework demonstrates that the proposed framework guarantee the worker's location privacy from adversaries including the requester and crowdsourcing server. Further, experiments based on real-world datasets show that the proposed strategies outperform existing solutions in terms of task acceptance rates.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据