TY - JOUR
T1 - Preserving privacy against external and internal threats in WSN data aggregation
AU - Zhang, Lei
AU - Zhang, Honggang
AU - Conti, Mauro
AU - Di Pietro, Roberto
AU - Jajodia, Sushil
AU - Mancini, Luigi Vincenzo
N1 - Generated from Scopus record by KAUST IRTS on 2023-09-20
PY - 2013/4/1
Y1 - 2013/4/1
N2 - In this paper, we propose two efficient and privacy-preserving data aggregation protocols for WSNs: PASKOS (Privacy preserving based on Anonymously Shared Keys and Omniscient Sink) and PASKIS (Privacy preserving based on Anonymously Shared Keys and Ignorant Sink) - requiring low overhead. Both protocols guarantee privacy preservation and a high data-loss resilience. In particular, PASKOS effectively protects the privacy of any node against other nodes, by requiring O(log N) communication cost in the worst case and O(1) on average, and O(1) as for memory and computation. PASKIS can even protect a node's privacy against a compromised sink, requiring only O(1) overhead as for computation, communication, and memory; however, these gains in efficiency are traded-off with a (slightly) decrease in the assured level of privacy. A thorough analysis and extensive simulations demonstrate the superior performance of our protocols against existing solutions in terms of privacy-preserving effectiveness, efficiency, and accuracy of computed aggregation. © 2011 The Author(s).
AB - In this paper, we propose two efficient and privacy-preserving data aggregation protocols for WSNs: PASKOS (Privacy preserving based on Anonymously Shared Keys and Omniscient Sink) and PASKIS (Privacy preserving based on Anonymously Shared Keys and Ignorant Sink) - requiring low overhead. Both protocols guarantee privacy preservation and a high data-loss resilience. In particular, PASKOS effectively protects the privacy of any node against other nodes, by requiring O(log N) communication cost in the worst case and O(1) on average, and O(1) as for memory and computation. PASKIS can even protect a node's privacy against a compromised sink, requiring only O(1) overhead as for computation, communication, and memory; however, these gains in efficiency are traded-off with a (slightly) decrease in the assured level of privacy. A thorough analysis and extensive simulations demonstrate the superior performance of our protocols against existing solutions in terms of privacy-preserving effectiveness, efficiency, and accuracy of computed aggregation. © 2011 The Author(s).
UR - http://link.springer.com/10.1007/s11235-011-9539-8
UR - http://www.scopus.com/inward/record.url?scp=84879906461&partnerID=8YFLogxK
U2 - 10.1007/s11235-011-9539-8
DO - 10.1007/s11235-011-9539-8
M3 - Article
SN - 1018-4864
VL - 52
SP - 2163
EP - 2176
JO - Telecommunication Systems
JF - Telecommunication Systems
IS - 4
ER -