ACM Transactions on Sensor Networks · 2009 · 330 citations · 30 references
ComputingComputer EngineeringComputer ScienceAuthenticationComputer SecurityCryptographyMutual AuthenticationPrivacy-preserving ProtocolsSensor NetworksWireless EncryptionWireless Sensor Network SecurityWireless Sensor NetworksComputational IndistinguishabilityPrivacy In Wireless Sensor NetworksPrivacy-preserving Data AggregationPseudorandom FunctionsResource-constrained DevicesSecure AggregationSecure Data AggregationSecure Data Transmission
Wireless sensor networks consist of tiny, energy‑constrained devices where data transmission is costly, making efficient aggregation along the sensor‑to‑sink path essential, especially when end‑to‑end privacy or integrity is required. The study aims to extend WSN lifetime by minimizing transmitted bits through a provably secure encryption scheme that supports efficient additive aggregation while preserving privacy. The proposed method encrypts sensor readings with a PRF‑based scheme, enabling ciphertext aggregation via a single modular addition and providing end‑to‑end aggregate authentication against outsider attacks. The scheme requires only one modular addition for aggregation and supports efficient computation of mean, variance, and standard deviation, yielding significant bandwidth savings.
Wireless sensor networks (WSNs) are composed of tiny devices with limited computation and battery capacities. For such resource-constrained devices, data transmission is a very energy-consuming operation. To maximize WSN lifetime, it is essential to minimize the number of bits sent and received by each device. One natural approach is to aggregate sensor data along the path from sensors to the sink. Aggregation is especially challenging if end-to-end privacy between sensors and the sink (or aggregate integrity) is required. In this article, we propose a simple and provably secure encryption scheme that allows efficient additive aggregation of encrypted data. Only one modular addition is necessary for ciphertext aggregation. The security of the scheme is based on the indistinguishability property of a pseudorandom function (PRF), a standard cryptographic primitive. We show that aggregation based on this scheme can be used to efficiently compute statistical values, such as mean, variance, and standard deviation of sensed data, while achieving significant bandwidth savings. To protect the integrity of the aggregated data, we construct an end-to-end aggregate authentication scheme that is secure against outsider-only attacks, also based on the indistinguishability property of PRFs.
30
A key-management scheme for distributed sensor networks
Laurent Eschenauer, Virgil D. Gligor · 2002 · 3.6K citations