A Privacy-Preserving Data Aggregation Scheme Based on Chinese Remainder Theorem in Mobile Crowdsensing System
Mobile crowdsensing provides a large-scale reliable data, since sensing nodes support wide distribution, flexible mobility, and opportunistic connectivity. The generated data often contains the sensing node's sensitive information. Existing schemes dedicated to protecting the privacy of percept...
Saved in:
Published in | IEEE systems journal Vol. 17; no. 3; pp. 4257 - 4266 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
New York
IEEE
01.09.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
ISSN | 1932-8184 1937-9234 |
DOI | 10.1109/JSYST.2023.3262321 |
Cover
Summary: | Mobile crowdsensing provides a large-scale reliable data, since sensing nodes support wide distribution, flexible mobility, and opportunistic connectivity. The generated data often contains the sensing node's sensitive information. Existing schemes dedicated to protecting the privacy of perception data, but these schemes cannot balance the computational and communication overheads well. Therefore, we propose a privacy-preserving data aggregation scheme based on the Chinese remainder theorem. Using blinding factor and Paillier homomorphic encryption technology, which not only ensures the privacy of perceived data but also improves the robustness of the system. Specially, the introduction of secure multicast communication technology based on the Chinese remainder theorem protects task privacy and ensures only designated sensing nodes can obtain the task. In addition, we design an efficient signature scheme to ensure data integrity. Detailed security analysis shows that our scheme is existentially unforgeable against adaptively chosen message attack. Extensive experiments and performance analysis show that our scheme is efficient and has a low communication overhead. |
---|---|
Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
ISSN: | 1932-8184 1937-9234 |
DOI: | 10.1109/JSYST.2023.3262321 |