A robust on-demand path-key establishment framework via random key predistribution for wireless sensor networks

Guanfeng Li, Hui Ling, Taieb Znati, Weili Wu

Research output: Contribution to journalArticlepeer-review

10 Citations (Scopus)

Abstract

Secure communication is a necessity for some wireless sensor network (WSN) applications. However, the resource constraints of a sensor render existing cryptographic systems for traditional network systems impractical for a WSN. Random key predistribution scheme has been proposed to overcome these limits. In this scheme, a ring of keys is randomly drawn from a large key pool and assigned to a sensor. Nodes sharing common keys can communicate securely using a shared key, while a path-key is established for those nodes that do not share any common keys. This scheme requires moderate memory and processing power, thus it is considered suitable for WSN applications. However, since the shared key is not exclusively owned by the two end entities, the established path-key may be revealed to other nodes just by eavesdropping. Based on the random-key predistribution scheme, we present a framework that utilizes multiple proxies to secure the path-key establishment. Our scheme is resilient against node capture, collusive attack, and random dropping, while only incurring a small amount of overhead. Furthermore, the scheme ensures that, with high probability, all path-keys are exclusively known by the two end nodes involved in the communication along the path.

Original languageEnglish
Pages (from-to)1-10
Number of pages10
JournalEurasip Journal on Wireless Communications and Networking
Volume2006
DOIs
Publication statusPublished - 2006
Externally publishedYes

ASJC Scopus subject areas

  • Signal Processing
  • Computer Science Applications
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'A robust on-demand path-key establishment framework via random key predistribution for wireless sensor networks'. Together they form a unique fingerprint.

Cite this