By Topic

Exact Formulae for Resilience in Random Key Predistribution Schemes

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
$33 $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)
Dae Hyun Yum ; Department of Electrical Engineering, POSTECH, Namgu, Pohang, Gyungbuk, 790-784, Republic of Korea ; Pil Joong Lee

As wireless sensor networks are often deployed in adverse or hostile environments, key management schemes are required for sensor nodes. The random key predistribution (RKP) scheme is a probabilistic key management scheme where each node is preloaded with a subset of keys that are randomly selected from a pool of keys. If a pair of neighbor nodes have a common key, it can be used to establish a secure link between the nodes. The q-composite RKP scheme requires that a pair of neighbor nodes have at least q common keys for a secure link. In this article, we show that the previous security analysis (i.e., resilience against node capture) of the q-composite RKP scheme is inaccurate and present new formulae for resilience in the RKP scheme and the q-composite RKP scheme.

Published in:

IEEE Transactions on Wireless Communications  (Volume:11 ,  Issue: 5 )