TY - GEN
T1 - Establishing pairwise keys for secure communication in ad hoc networks
T2 - 11th IEEE International Conference on Network Protocols, ICNP 2003
AU - Zhu, Sencun
AU - Xu, Shouhuai
AU - Setia, Sanjeev
AU - Jajodia, Sushil
N1 - Publisher Copyright:
© 2003 IEEE.
PY - 2003
Y1 - 2003
N2 - A prerequisite for a secure communication between two nodes in an ad hoc network is that the nodes share a key to bootstrap their trust relationship. In this paper, we present a scalable and distributed protocol that enables two nodes to establish a pairwise shared key on the fly, without requiring the use of any on-line key distribution center. The design of our protocol is based on a novel combination of two techniques - probabilistic key sharing and threshold secret sharing. Our protocol is scalable since every node only needs to possess a small number of keys, independent of the network size, and it is computationally efficient because it only relies on symmetric key cryptography based operations. We show that a pairwise key established between two nodes using our protocol is secure against a collusion attack by up to a certain number of compromised nodes. We also show through a set of simulations that our protocol can be parameterized to meet the desired levels of performance, security and storage for the application under consideration.
AB - A prerequisite for a secure communication between two nodes in an ad hoc network is that the nodes share a key to bootstrap their trust relationship. In this paper, we present a scalable and distributed protocol that enables two nodes to establish a pairwise shared key on the fly, without requiring the use of any on-line key distribution center. The design of our protocol is based on a novel combination of two techniques - probabilistic key sharing and threshold secret sharing. Our protocol is scalable since every node only needs to possess a small number of keys, independent of the network size, and it is computationally efficient because it only relies on symmetric key cryptography based operations. We show that a pairwise key established between two nodes using our protocol is secure against a collusion attack by up to a certain number of compromised nodes. We also show through a set of simulations that our protocol can be parameterized to meet the desired levels of performance, security and storage for the application under consideration.
UR - http://www.scopus.com/inward/record.url?scp=84943553152&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84943553152&partnerID=8YFLogxK
U2 - 10.1109/ICNP.2003.1249782
DO - 10.1109/ICNP.2003.1249782
M3 - Conference contribution
AN - SCOPUS:84943553152
T3 - Proceedings - International Conference on Network Protocols, ICNP
SP - 326
EP - 335
BT - Proceedings - 11th IEEE International Conference on Network Protocols, ICNP 2003
PB - IEEE Computer Society
Y2 - 4 November 2003 through 7 November 2003
ER -