Re-examining Probabilistic Versus Deterministic Key Management

It is widely believed that although being more complex, a probabilistic key predistribution scheme is much more resilient against node capture than a deterministic one in lightweight wireless ad hoc networks. Backed up by the surprisingly large successful attack probabilities computed in this paper,...

Full description

Saved in:
Bibliographic Details
Main Authors: Dahai Xu, Jianwei Huang, Dwoskin, J., Mung Chiang, Lee, R.
Format: Conference Proceeding
Language:English
Subjects:
Ad hoc networks
Distributed computing
Energy resources
Engineering management
Measurement
Mobile computing
Portable computers
Relays
Security
Surveillance
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:It is widely believed that although being more complex, a probabilistic key predistribution scheme is much more resilient against node capture than a deterministic one in lightweight wireless ad hoc networks. Backed up by the surprisingly large successful attack probabilities computed in this paper, we show that the probabilistic approaches have only limited performance advantages over deterministic approaches. We first consider a static network scenario as originally considered in the seminal paper by Eschenauer and Gligor [1], where any node capture happens after the establishment of all pairwise links, and show that the deterministic approach can achieve a performance as good as the probabilistic one. Furthermore in a mobile network, the probabilistic key management as described in [1] can lead to a successful attack probability of one order of magnitude larger than the one in a static network.
ISSN:2157-8095
2157-8117
DOI:10.1109/ISIT.2007.4557608