A Pairwise Key Pre-Distribution Scheme for Wireless Sensor Networks-英文文献.pdf

A Pairwise Key Pre-Distribution Scheme for Wireless Sensor Networks WENLIANG DU and JING DENG Syracuse University YUNGHSIANG S. HAN National Chi Nan University, Taiwan PRAMOD K. VARSHNEY Syracuse University and JONATHAN KATZ and ARAM KHALILI University of Maryland, College Park To achieve security in wireless sensor networks, it is important to be able to encrypt and authenticate messages sent between sensor nodes. Before doing so, keys for performing encryption and authentication must be agreed upon by the communicating parties. Due to resource constraints, however, achieving key agreement in wireless sensor networks is non-trivial. Many key agreement schemes used in general networks, such as Diffie-Hellman and other public-key based schemes, are not suitable for wireless sensor networks due to the limited computational abilities of the sensor nodes. Pre-distribution of secret keys for all pairs of nodes is not viable due to the large amount of memory this requires when the network size is large. To solve the key pre-distribution problem, two elegant key pre-distribution approaches have been proposed recently. In this paper, we provide a framework in which to study the security of key pre-distribution schemes, propose a new key pre-distribution scheme which substantially improves the resilience of the network compared to previous schemes, and give an in-depth analysis of our scheme in terms of network resilience and associated overhead. Our scheme exhibits a nice threshold property: when the number of compromised nodes is less than the threshold, the probability that communications between any additional nodes are compromised 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 large fraction of the network before it can achieve any significant gain. Categories and Subject Descriptors: C.2.0 [Computer-Communication N