An efficient key-update scheme for wireless sensor networks

Authors:
Chien-Lung Wang;Gwoboa Horng;Yu-Sheng Chen;Tzung-Pei Hong
Affiliations:
Department of Computer Science, National Chung-Hsing University, Taichung, Taiwan, R.O.C.;Department of Computer Science, National Chung-Hsing University, Taichung, Taiwan, R.O.C.;Department of Computer Science, National Chung-Hsing University, Taichung, Taiwan, R.O.C.;Department of Electrical Engineering, National University of Kaohsiung, Kaohsiung, Taiwan, R.O.C.
Venue:
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
Year:
2006

Citing 2
Cited 0

SPINS: security protocols for sensor networks

Proceedings of the 7th annual international conference on Mobile computing and networking
The Resurrecting Duckling: Security Issues for Ad-hoc Wireless Networks

Proceedings of the 7th International Workshop on Security Protocols

Quantified Score

Hi-index	0.00

Visualization

Abstract

A novel key-update scheme is proposed for wireless sensor networks. The center server in a wireless sensor network first broadcasts a series of randomly generated code slices to sensor nodes. Upon receiving all the code slices, the sensor nodes find their neighboring coordinators to generate a permutation of slice numbers and send this permutation back to the center server. The center server and the sensor nodes can thus assemble a common program based on the permutation to derive their common key. Subsequent key-updates can then be done by this program based on the previous keys. The proposed scheme is simple, efficient, and is secure if the sensor nodes cannot be compromised within a short bound of time.