A pairwise key pre-distribution scheme for wireless sensor networks

  • Authors:

  • Wenliang Du;Jing Deng;Yunghsiang S. Han;Pramod K. Varshney

  • Affiliations:

  • Syracuse University, Syracuse, NY;Syracuse University, Syracuse, NY;National Chi Nan University, Taiwan, R.O.C;Syracuse University, Syracuse, NY

  • Venue:
  • Proceedings of the 10th ACM conference on Computer and communications security
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

To achieve security in wireless sensor networks, it is important to be able to encrypt and authenticate messages sent among sensor nodes. Keys for encryption and authentication purposes must be agreed upon by communicating nodes. Due to resource constraints, achieving such key agreement in wireless sensor networks is non-trivial. Many key agreement schemes used in general networks, such as Diffie-Hellman and public-key based schemes, are not suitable for wireless sensor networks. Pre-distribution of secret keys for all pairs of nodes is not viable due to the large amount of memory used when the network size is large. To solve the key pre-distribution problem, two elegant key pre-distribution approaches have been proposed recently [11, 7].In this paper, we propose a new key pre-distribution scheme, which substantially improves the resilience of the network compared to the existing schemes. Our scheme exhibits a nice threshold property: when the number of compromised nodes is less than the threshold, the probability that any nodes other than these compromised nodes is affected is close to zero. This desirable property lowers the initial payoff of smaller scale network breaches to an adversary, and makes it necessary for the adversary to attack a significant proportion of the network. We also present an in depth analysis of our scheme in terms of network resilience and associated overhead.