TY - GEN
T1 - Secure data aggregation without persistent cryptographic operations in wireless sensor networks
AU - Wu, Kui
AU - Dreef, Dennis
AU - Sun, Bo
AU - Yang, Xiao
N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].
PY - 2006
Y1 - 2006
N2 - In-network data aggregation is an essential operation to reduce energy consumption in large-scale wireless sensor networks. With data aggregation, however, raw data items are invisible to the base station and thus the authenticity of the aggregated data is hard to guarantee. A compromised sensor node may forge an aggregation value and mislead the base station into trusting a false reading. Due to the stringent constraints of energy supply and computing capability on sensor nodes, it is challenging to detect a compromised sensor node and keep if from cheating. This paper proposes a Secure Aggregation Tree (SAT) to detect and prevent cheating. Our method is essentially different from other existing solutions in that it does not require any cryptographic operations when all sensosr nodes work honestly. The detection of cheating is based on the topological constraints in the aggregation tree. ©2006 IEEE.
AB - In-network data aggregation is an essential operation to reduce energy consumption in large-scale wireless sensor networks. With data aggregation, however, raw data items are invisible to the base station and thus the authenticity of the aggregated data is hard to guarantee. A compromised sensor node may forge an aggregation value and mislead the base station into trusting a false reading. Due to the stringent constraints of energy supply and computing capability on sensor nodes, it is challenging to detect a compromised sensor node and keep if from cheating. This paper proposes a Secure Aggregation Tree (SAT) to detect and prevent cheating. Our method is essentially different from other existing solutions in that it does not require any cryptographic operations when all sensosr nodes work honestly. The detection of cheating is based on the topological constraints in the aggregation tree. ©2006 IEEE.
UR - https://www.scopus.com/pages/publications/33751030312
UR - https://www.scopus.com/pages/publications/33751030312#tab=impact
U2 - 10.1109/.2006.1629463
DO - 10.1109/.2006.1629463
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 1424401976
SN - 9781424401970
VL - 2006
T3 - Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference
SP - 635
EP - 640
BT - 25th IEEE International Performance, Computing, and Communications Conference, 2006, IPCCC 2006
T2 - 25th IEEE International Performance, Computing, and Communications Conference, 2006, IPCCC 2006
Y2 - 10 April 2006 through 12 April 2006
ER -