TY - GEN
T1 - Secure code distribution in dynamically programmable wireless sensor networks
AU - Deng, Jing
AU - Han, Richard
AU - Mishra, Shivakant
PY - 2006
Y1 - 2006
N2 - Remote reprogramming of in situ wireless sensor networks (WSNs) via the wireless link is an important capability. Securing the process of reprogramming allows each sensor node to authenticate each received code image. Due to the resource constraints of WSNs, public key schemes must be used sparingly. This paper introduces a mechanism for secure and efficient code distribution that employs public key cryptography only to sign the root of a combined structure consisting of both hash chains and hash trees. The chain based scheme works best when packets are received in the order they are sent with very few losses. Our hash tree based scheme allows nodes to authenticate packets and verify their integrity quickly, even when the packets may arrive out of order, but can result in too many public key operations. Integrating hash chains and hash trees produces a mechanism that is both resilient to losses and lightweight in terms of reducing memory consumption and the number of public key operations that a node has to perform. Simulation shows that the proposed secure reprogramming schemes add only a modest amount of overhead to a conventional non-secure reprogramming scheme, namely Deluge, and are therefore feasible and practical in a wireless sensor network.
AB - Remote reprogramming of in situ wireless sensor networks (WSNs) via the wireless link is an important capability. Securing the process of reprogramming allows each sensor node to authenticate each received code image. Due to the resource constraints of WSNs, public key schemes must be used sparingly. This paper introduces a mechanism for secure and efficient code distribution that employs public key cryptography only to sign the root of a combined structure consisting of both hash chains and hash trees. The chain based scheme works best when packets are received in the order they are sent with very few losses. Our hash tree based scheme allows nodes to authenticate packets and verify their integrity quickly, even when the packets may arrive out of order, but can result in too many public key operations. Integrating hash chains and hash trees produces a mechanism that is both resilient to losses and lightweight in terms of reducing memory consumption and the number of public key operations that a node has to perform. Simulation shows that the proposed secure reprogramming schemes add only a modest amount of overhead to a conventional non-secure reprogramming scheme, namely Deluge, and are therefore feasible and practical in a wireless sensor network.
KW - Secure reprogramming
KW - Security
KW - Sensor networks
UR - http://www.scopus.com/inward/record.url?scp=34247397108&partnerID=8YFLogxK
U2 - 10.1145/1127777.1127822
DO - 10.1145/1127777.1127822
M3 - Conference proceeding contribution
SN - 1595933344
SN - 9781595933348
T3 - Proceedings of the Fifth International Conference on Information Processing in Sensor Networks, IPSN '06
SP - 292
EP - 300
BT - Proceedings of the Fifth International Conference on Information Processing in Sensor Networks, IPSN '06
PB - Association for Computing Machinery, Inc
CY - New York, NY
T2 - Fifth International Conference on Information Processing in Sensor Networks, IPSN '06
Y2 - 19 April 2006 through 21 April 2006
ER -