A Collusion-Resistant and Privacy-Preserving Data Aggregation Protocol in Crowdsensing SystemReport as inadecuate

A Collusion-Resistant and Privacy-Preserving Data Aggregation Protocol in Crowdsensing System - Download this document for free, or read online. Document in PDF available to download.

Mobile Information Systems - Volume 2017 2017, Article ID 3715253, 11 pages - https:-doi.org-10.1155-2017-3715253

Research ArticleBeijing Engineering Research Center of Massive Language Information Processing and Cloud Computing Application, School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, China

Correspondence should be addressed to Liehuang Zhu

Received 8 December 2016; Accepted 15 March 2017; Published 30 March 2017

Academic Editor: Rossana M. C. Andrade

Copyright © 2017 Chang Xu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


With the pervasiveness and increasing capability of smart devices, mobile crowdsensing has been applied in more and more practical scenarios and provides a more convenient solution with low costs for existing problems. In this paper, we consider an untrusted aggregator collecting a group of users’ data, in which personal private information may be contained. Most previous work either focuses on computing particular functions based on the sensing data or ignores the collusion attack between users and the aggregator. We design a new protocol to help the aggregator collect all the users’ raw data while resisting collusion attacks. Specifically, the bitwise XOR homomorphic functions and aggregate signature are explored, and a novel key system is designed to achieve collusion resistance. In our system, only the aggregator can decrypt the ciphertext. Theoretical analysis shows that our protocol can capture k-source anonymity. In addition, extensive experiments are conducted to demonstrate the feasibility and efficiency of our algorithms.

Author: Chang Xu, Xiaodong Shen, Liehuang Zhu, and Yan Zhang

Source: https://www.hindawi.com/


Related documents