Privacy Preserving Data Aggregation in Wireless Sensor Networks
Arijit Ukil

TL;DR
This paper proposes a simple privacy-preserving data aggregation scheme for wireless sensor networks using secure key management and data perturbation, addressing resource constraints and enhancing privacy during data sharing.
Contribution
It introduces a novel, resource-efficient privacy preservation method combining secure key management and randomized data perturbation for WSNs.
Findings
The scheme effectively preserves data privacy during aggregation.
Simulation results show improved efficiency over existing methods.
The approach is suitable for resource-limited sensor nodes.
Abstract
Privacy preservation is an important issue in today's context of extreme penetration of internet and mobile technologies. It is more important in the case of Wireless Sensor Networks (WSNs) where collected data often requires in-network processing and collaborative computing. Researches in this area are mostly concentrated in applying data mining techniques to preserve the privacy content of the data. These techniques are mostly computationally expensive and not suitable for resource limited WSN nodes. In this paper, a scheme is developed to provide privacy preservation in a much simpler way with the help of a secure key management scheme and randomized data perturbation technique. We consider a scenario in which two or more parties owning confidential data need to share only for aggregation purpose to a third party, without revealing the content of the data. Through simulation results…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
