An efficient random key pre-distribution scheme

Mahalingam Ramkumar, Nasir Memon

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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 Leighton and 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.

Original languageEnglish (US)
Title of host publicationGLOBECOM'04 - IEEE Global Telecommunications Conference
Pages2218-2223
Number of pages6
Volume4
StatePublished - 2004
EventGLOBECOM'04 - IEEE Global Telecommunications Conference - Dallas, TX, United States
Duration: Nov 29 2004Dec 3 2004

Other

OtherGLOBECOM'04 - IEEE Global Telecommunications Conference
CountryUnited States
CityDallas, TX
Period11/29/0412/3/04

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Ramkumar, M., & Memon, N. (2004). An efficient random key pre-distribution scheme. In GLOBECOM'04 - IEEE Global Telecommunications Conference (Vol. 4, pp. 2218-2223). [SN06-4]

An efficient random key pre-distribution scheme. / Ramkumar, Mahalingam; Memon, Nasir.

GLOBECOM'04 - IEEE Global Telecommunications Conference. Vol. 4 2004. p. 2218-2223 SN06-4.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ramkumar, M & Memon, N 2004, An efficient random key pre-distribution scheme. in GLOBECOM'04 - IEEE Global Telecommunications Conference. vol. 4, SN06-4, pp. 2218-2223, GLOBECOM'04 - IEEE Global Telecommunications Conference, Dallas, TX, United States, 11/29/04.
Ramkumar M, Memon N. An efficient random key pre-distribution scheme. In GLOBECOM'04 - IEEE Global Telecommunications Conference. Vol. 4. 2004. p. 2218-2223. SN06-4
Ramkumar, Mahalingam ; Memon, Nasir. / An efficient random key pre-distribution scheme. GLOBECOM'04 - IEEE Global Telecommunications Conference. Vol. 4 2004. pp. 2218-2223
@inproceedings{09ac0220e68546c3bb015ce5f05151b9,
title = "An efficient random key pre-distribution scheme",
abstract = "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 Leighton and 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.",
author = "Mahalingam Ramkumar and Nasir Memon",
year = "2004",
language = "English (US)",
volume = "4",
pages = "2218--2223",
booktitle = "GLOBECOM'04 - IEEE Global Telecommunications Conference",

}

TY - GEN

T1 - An efficient random key pre-distribution scheme

AU - Ramkumar, Mahalingam

AU - Memon, Nasir

PY - 2004

Y1 - 2004

N2 - 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 Leighton and 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.

AB - 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 Leighton and 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.

UR - http://www.scopus.com/inward/record.url?scp=18144411997&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=18144411997&partnerID=8YFLogxK

M3 - Conference contribution

VL - 4

SP - 2218

EP - 2223

BT - GLOBECOM'04 - IEEE Global Telecommunications Conference

ER -