TY - GEN
T1 - Re-examining probabilistic versus deterministic key management
AU - Xun, Dahai
AU - Huang, Jianwei
AU - Dwoskin, Jeffrey
AU - Chiang, Mung
AU - Lee, Kuby
PY - 2007
Y1 - 2007
N2 - It is widely believed thai although being more complex, a probabilistic key predislribulion 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.
AB - It is widely believed thai although being more complex, a probabilistic key predislribulion 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.
UR - http://www.scopus.com/inward/record.url?scp=51649084530&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=51649084530&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2007.4557608
DO - 10.1109/ISIT.2007.4557608
M3 - Conference contribution
AN - SCOPUS:51649084530
SN - 1424414296
SN - 9781424414291
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 2586
EP - 2590
BT - Proceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007
T2 - 2007 IEEE International Symposium on Information Theory, ISIT 2007
Y2 - 24 June 2007 through 29 June 2007
ER -