Handbook of Applied Cryptography
Handbook of Applied Cryptography
Secure Aggregation for Wireless Networks
SAINT-W '03 Proceedings of the 2003 Symposium on Applications and the Internet Workshops (SAINT'03 Workshops)
SDAP: a secure hop-by-Hop data aggregation protocol for sensor networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Secure hierarchical in-network aggregation in sensor networks
Proceedings of the 13th ACM conference on Computer and communications security
An efficient integrity-preserving scheme for hierarchical sensor aggregation
WiSec '08 Proceedings of the first ACM conference on Wireless network security
SIA: Secure information aggregation in sensor networks
Journal of Computer Security - Special Issue on Security of Ad-hoc and Sensor Networks
Security model and framework for information aggregation in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Security Amplification for Interactive Cryptographic Primitives
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Hi-index | 0.00 |
In-network aggregation is a technique employed in Wireless Sensor Networks (WSNs) to aggregate information flowing from the sensor nodes towards the base station. It helps in reducing the communication overhead on the nodes in the network and thereby increasing the longevity of the network. We study the problem of maintaing integrity of the aggregate value, when the aggregate function is SUM, in the presence of compromised sensor nodes. We focus on one-round, end-to end, secure aggregation protocols and give a strong, formal security defintion. We show that a worst-case lower bound of Ω(n) applies on the congestion (maximum size of message between any two nodes) in such protocols, where n is the number of nodes in the network. This is the first such result showing that the most basic protocols are the best one-round in-network aggregation protocols with respect to congestion. We also show that against a weaker adversary (which does not compromise nodes), we can achieve secure in-network aggregation protocols with a congestion of O(log2n).