By Topic

An improved distributed key revocation scheme in wireless sensor networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jun Zhou ; Sch. of Math. & Comput. Eng., Xihua Univ., Chengdu ; Mingxing He

A distributed reliable key revocation scheme is proposed in this paper according to randomness of the deployment of sensor nodes. This scheme derives the concept of appealing members who are responsible for userspsila revocation operations as the topology varies by using secret sharing techniques and modified Blompsilas symmetric key establishment mechanism. Besides, a novel seed member alternation mechanism is also proposed in this paper, which can efficiently resist of node capture attacks. It also leaves the resources much more balanced among the sensor nodes and helps to prolong the lifetime of WSNs. By comparison, the performance of this scheme is considerably refined in terms of network security, key connectivity, complexity of storage as well as communication.

Published in:

Communication Technology, 2008. ICCT 2008. 11th IEEE International Conference on

Date of Conference:

10-12 Nov. 2008