DocumentCode
1938599
Title
A Distributed Lightweight Group Rekeying Scheme with Speedy Node Revocation for Wireless Sensor Networks
Author
Wei-ni, Zeng ; Ya-ping, Lin ; Yong-he, Liu
Author_Institution
Coll. of Comput. & Commun., Hunan Univ., Changsha
fYear
2008
fDate
10-12 Dec. 2008
Firstpage
137
Lastpage
144
Abstract
In unattended or hostile environment like battlefield, sensor nodes may be compromised. If one node is compromised, group key which is shared by all the group members should be rekeyed in real-time and the compromised nodes should be revoked as soon as possible. As there is no such node that can always be trusted in sensor network, a distributed group rekeying scheme with speedy compromised node revocation is proposed in this paper. Based on a novelly constructed authentication polynomial, group rekeying is initiated by local network collaboratively in our scheme. Compared with the existing schemes, the proposed scheme can not only rekey in real-time, but reduce more communication overheads and provide a high level of security at the same time.
Keywords
polynomials; telecommunication security; wireless sensor networks; authentication polynomial; distributed lightweight group rekeying; security; speedy node revocation; wireless sensor networks; Authentication; Base stations; Broadcasting; Collaboration; Costs; Cryptography; Educational institutions; Military computing; Mobile communication; Wireless sensor networks; authentication number chain; group rekeying; local collaboration; sensor network;
fLanguage
English
Publisher
ieee
Conference_Titel
Mobile Ad-hoc and Sensor Networks, 2008. MSN 2008. The 4th International Conference on
Conference_Location
Wuhan
Print_ISBN
978-0-7695-3457-2
Type
conf
DOI
10.1109/MSN.2008.39
Filename
4721263
Link To Document