By Topic

An efficient random key pre-distribution scheme

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)
M. Ramkumar ; Dept. of Comput. Sci. & Eng., Mississippi State Univ., MS, USA ; N. Memon

Any key pre-distribution (KPD) scheme is inherently a trade-off between complexity and security. By sacrificing some security (KPD schemes need some assurance of the ability to limit sizes of attacker coalitions), KPD schemes gain many advantages. We argue that random KPD schemes, in general, perform an "advantageous" trade-off which renders them more suitable for practical large scale deployments of resource constrained nodes. We introduce a novel random KPD scheme, hashed random preloaded subsets (HARPS), which turns out to be a generalization of two other random KPD schemes, random preloaded subsets (RPS) and a scheme proposed by T. Leighton and S. Micali (LM). All three schemes have probabilistic measures for the "merit" of the system. We analyze and compare the performance of the three schemes. We show that HARPS has significant advantages over other KPD schemes, and in particular, over RPS and LM.

Published in:

Global Telecommunications Conference, 2004. GLOBECOM '04. IEEE  (Volume:4 )

Date of Conference:

29 Nov.-3 Dec. 2004