Short Paper: GKE: Efficient Group-based Key Establishment for Large Sensor Networks

Li  Zhou; Jinfeng  Ni; C.V.   Ravishankar

1st International ICST Conference on Security and Privacy for Emerging Areas in Communication Networks

Research Article

Short Paper: GKE: Efficient Group-based Key Establishment for Large Sensor Networks

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1109/SECURECOMM.2005.41,
    author={ Li  Zhou and Jinfeng  Ni and C.V.   Ravishankar},
    title={Short Paper: GKE: Efficient Group-based Key Establishment for Large Sensor Networks},
    proceedings={1st International ICST Conference on Security and Privacy for Emerging Areas in Communication Networks},
    publisher={IEEE},
    proceedings_a={SECURECOMM},
    year={2006},
    month={3},
    keywords={},
    doi={10.1109/SECURECOMM.2005.41}
}

Li Zhou
Jinfeng Ni
C.V. Ravishankar
Year: 2006
Short Paper: GKE: Efficient Group-based Key Establishment for Large Sensor Networks
SECURECOMM
IEEE
DOI: 10.1109/SECURECOMM.2005.41

Li Zhou¹, Jinfeng Ni¹, C.V. Ravishankar¹

1: University of California, Riverside

Abstract

We present a group-based key predistribution scheme, GKE, which enables all pairs of neighboring sensors to establish a unique pairwise key, regardless of sensor density or distribution. Since pairwise keys are unique, security in GKE degrades gracefully as the number of compromised nodes increases. In addition, GKE is very efficient since it requires only localized communication to establish pairwise keys, significantly reducing communication overheads. Our security analysis and performance evaluation show that GKE performs very well in terms of resilience, connectivity, communication overhead and memory requirements

Published: 2006-03-20
Publisher: IEEE

: http://dx.doi.org/10.1109/SECURECOMM.2005.41