11th IEEE International Conference on Network Protocols (ICNP'03)
Establishing Pairwise Keys for Secure Communication in Ad Hoc Networks: A Probabilistic Approach
Atlanta, Georgia
November 04-November 07
ISBN: 0-7695-2024-3
A prerequisite for 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.
Citation:
Sencun Zhu, Shouhuai Xu, Sanjeev Setia, Sushil Jajodia, "Establishing Pairwise Keys for Secure Communication in Ad Hoc Networks: A Probabilistic Approach," icnp, pp.326, 11th IEEE International Conference on Network Protocols (ICNP'03), 2003