TY - JOUR
T1 - Intrusion-resilient integrity in data-centric unattended WSNs
AU - Di Pietro, Roberto
AU - Soriente, Claudio
AU - Spognardi, Angelo
AU - Tsudik, Gene
N1 - Generated from Scopus record by KAUST IRTS on 2023-09-20
PY - 2011/1/1
Y1 - 2011/1/1
N2 - Unattended Wireless Sensor Networks (UWSNs) operate in autonomous or disconnected mode: sensed data is collected periodically by an itinerant sink. Between successive sink visits, sensor-collected data is subject to some unique vulnerabilities. In particular, while the network is unattended, a mobile adversary (capable of subverting up to a fraction of sensors at a time) can migrate between compromised sets of sensors and inject fraudulent data. In this paper, we provide two collaborative authentication techniques that allow an UWSN to maintain integrity and authenticity of sensor datain the presence of a mobile adversaryuntil the next sink visit. Proposed schemes use simple, standard, and inexpensive symmetric cryptographic primitives, coupled with key evolution and few message exchanges. We study their security and effectiveness, both analytically and via simulations. We also assess their robustness and show how to achieve the desired trade-off between performance and security. © 2011 Elsevier B.V. All rights reserved.
AB - Unattended Wireless Sensor Networks (UWSNs) operate in autonomous or disconnected mode: sensed data is collected periodically by an itinerant sink. Between successive sink visits, sensor-collected data is subject to some unique vulnerabilities. In particular, while the network is unattended, a mobile adversary (capable of subverting up to a fraction of sensors at a time) can migrate between compromised sets of sensors and inject fraudulent data. In this paper, we provide two collaborative authentication techniques that allow an UWSN to maintain integrity and authenticity of sensor datain the presence of a mobile adversaryuntil the next sink visit. Proposed schemes use simple, standard, and inexpensive symmetric cryptographic primitives, coupled with key evolution and few message exchanges. We study their security and effectiveness, both analytically and via simulations. We also assess their robustness and show how to achieve the desired trade-off between performance and security. © 2011 Elsevier B.V. All rights reserved.
UR - https://linkinghub.elsevier.com/retrieve/pii/S1574119210001318
UR - http://www.scopus.com/inward/record.url?scp=79960896827&partnerID=8YFLogxK
U2 - 10.1016/j.pmcj.2010.12.003
DO - 10.1016/j.pmcj.2010.12.003
M3 - Article
SN - 1574-1192
VL - 7
SP - 495
EP - 508
JO - Pervasive and Mobile Computing
JF - Pervasive and Mobile Computing
IS - 4
ER -