Paper 2009/289

Analysis of the End-by-Hop Protocol for Secure Aggregation in Sensor Networks

Erik Zenner

Abstract

In order to save bandwidth and thus battery power, sensor network measurements are sometimes aggregated en-route while being reported back to the querying server. Authentication of the measurements then becomes a challenge if message integrity is important for the application. At ESAS 2007, the End-by-Hop protocol for securing in-network aggregation for sensor nodes was presented. The solution was claimed to be secure and efficient and to provide the possibility of trading off bandwidth against computation time on the server. In this paper, we disprove these claims. We describe several attacks against the proposed solution and point out shortcomings in the original complexity analysis. In particular, we show that the proposed solution is inferior to a naive solution without in-network aggregation both in security and in efficiency.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. DTU MAT report no. 2009-01
Keywords
cryptanalysissensor networksprotocols
Contact author(s)
e zenner @ mat dtu dk
History
2009-06-17: received
Short URL
https://ia.cr/2009/289
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2009/289,
      author = {Erik Zenner},
      title = {Analysis of the End-by-Hop Protocol for Secure Aggregation in Sensor Networks},
      howpublished = {Cryptology ePrint Archive, Paper 2009/289},
      year = {2009},
      note = {\url{https://eprint.iacr.org/2009/289}},
      url = {https://eprint.iacr.org/2009/289}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.