Achieving Privacy-Preserving and Lightweight Truth Discovery in Mobile Crowdsensing
- 29 January 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 34 (11), 5140-5153
- https://doi.org/10.1109/tkde.2021.3054409
Abstract
To obtain reliable results from conflicting data in mobile crowdsensing, numerous truth discovery protocols have been proposed in the past decade. However, most of them do not consider the data privacy of entities involved (e.g., workers and servers), and several existing privacy-preserving truth discovery protocols either provide limited privacy protection or have heavy computation and communication overheads due to iterative computation and transmission over large ciphertexts. In this paper, we aim to propose privacy-preserving and lightweight truth discovery protocols to tackle the above problems. Specifically, we carefully design an anonymization protocol named AnonymTD to delink workers from their data, where workers’ data are computed and transmitted without complicated encryption. To further reduce each worker's overheads in the scenarios where workers are willing to share their weights, we resort to the perturbation technology to propose a more lightweight truth discovery protocol named PerturbTD. Based on workers’ perturbed data, two cloud servers in PerturbTD complete most of the workload of truth discovery together, which avoids the frequent involvement of workers. The theoretical analysis and the comparative experiments in this paper demonstrate that our two protocols can achieve our security goals with low computation and communication overheads.Keywords
Funding Information
- National University of Defense Technology (ZK19-38)
- National Natural Science Foundation of China (61672195, 61872372)
- State Key Laboratory of Cryptography (MMKFKT201617)
This publication has 51 references indexed in Scilit:
- Maximum likelihood analysis of conflicting observations in social sensingACM Transactions on Sensor Networks, 2014
- Truth finding on the deep webProceedings of the VLDB Endowment, 2012
- A Bayesian approach to discovering truth from conflicting sources for data integrationProceedings of the VLDB Endowment, 2012
- Differential PrivacyPublished by Springer Science and Business Media LLC ,2011
- Fully Homomorphic Encryption over the IntegersLecture Notes in Computer Science, 2010
- Integrating conflicting dataProceedings of the VLDB Endowment, 2009
- k-ANONYMITY: A MODEL FOR PROTECTING PRIVACYInternational Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2002
- A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key SystemLecture Notes in Computer Science, 2001
- Privacy-preserving data miningACM SIGMOD Record, 2000
- Public-Key Cryptosystems Based on Composite Degree Residuosity ClassesPublished by Springer Science and Business Media LLC ,1999