Abstract
In a wireless sensor network, data privacy with a minimum network bandwidth usage is addressed using homomorphic‐based data aggregation schemes. Most of the schemes which ensure the end‐to‐end privacy provide collective integrity verification of aggregated data at the receiver end. The presence of corrupted values affects the integrity of the aggregated data and results in the rejection of the whole data by the base station (BS) thereby leading to the wastage of bandwidth and other resources of energy constraint wireless sensor network. In this paper, we propose a secured data aggregation scheme by slicing the data generated by each sensor node deployed in layered topology and enabling en route aggregation. Novel encoding of data and hash slices based on child order is proposed to enable concatenation‐based additive aggregation and smooth extraction of slices from the aggregate by the BS. Elliptic curve‐based homomorphic encryption is adopted to ensure end‐to‐end confidentiality. To the best of our knowledge, the proposed scheme is the first which facilitates the BS to perform node‐wise integrity verification, filter out only the corrupted portion, and implement dynamic query over the received data. Communication‐ and computation‐based performance analysis shows the efficiency of the proposed scheme for varied network sizes. The scheme can resist eavesdropping attack, node compromising attack, replay attack, malleability attack, selective dropping attack, and collusion attack.
Highlights
Wireless sensor network(WSN) has started its origin with the SOSUS (SOund SUrveillance System) developed by the U.S Navy for detecting the Soviet submarines during the end of World War II by employing acoustic sensor on the SOFAR channel [1]
Wireless sensor networks have been extensively used in many applications and play a vital role in monitoring remote places which are remarkably inaccessible by humans and require continuous scanning
The security proof is presented by analysing the possible ways of Encoded sliced message (ESM) distribution and the probability of the intruder finding the corresponding siblings of the same node
Summary
Wireless sensor network(WSN) has started its origin with the SOSUS (SOund SUrveillance System) developed by the U.S Navy for detecting the Soviet submarines during the end of World War II by employing acoustic sensor on the SOFAR channel [1]. In [23], proposed a secure additive homomorphic-based aggregation scheme referred to as SASPKE using symmetric state full key which is shared between the BS and sensor nodes. For secure sharing of this state full key, it employs an asymmetric key using elliptic curve cryptosystem (ECC) This scheme ensures end-to-end concealment, collective data integrity, and authentication by using homomorphic encryption. Since the PH schemes allow the operations over the encrypted data without decryption, the malicious node can perform any malfunction as if it is a valid node This malleability attack is addressed in MRCDA [24] by verifying the integrity at every intermediate aggregator node with the help of the MAC generated using pairwise shared symmetric key, secret key, and random function.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
