A hierarchical key pre-distribution scheme

Mahalingam Ramkumar, Nasir Memon, Rahul Simha

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

Abstract

We present an efficient, scalable, and renewable hierarchical random key predistribution (KPD) scheme as an enabler for a low complexity security infrastructure. As the proposed KPD scheme employs only symmetric cryptographic primitives it permits resource constrained nodes to take part in the deployment. Further, two nodes need to exchange only their IDs before they can establish a shared secret. The proposed KPD scheme provides scalable security for different levels of the hierarchy depending on available resources. In addition higher levels of the hierarchy are protected from security breaches in lower levels.

Original languageEnglish (US)
Title of host publication2005 IEEE International Conference on Electro Information Technology
StatePublished - 2005
Event2005 IEEE International Conference on Electro Information Technology - Lincoln, NE, United States
Duration: May 22 2005May 25 2005

Publication series

Name2005 IEEE International Conference on Electro Information Technology
Volume2005

Other

Other2005 IEEE International Conference on Electro Information Technology
CountryUnited States
CityLincoln, NE
Period5/22/055/25/05

ASJC Scopus subject areas

  • Engineering(all)

Cite this