A probabilistic key agreement scheme for sensor networks without key predistribution

TL;DR

This paper introduces a probabilistic protocol for secure key establishment in sensor networks that does not rely on pre-distributed keys, enabling dynamic and secure communication between previously unencountered nodes.

Contribution

It proposes and analyzes a novel probabilistic protocol for key agreement in sensor networks without prior key predistribution, using only a small seed value.

Findings

Protocols enable secure key exchange without pre-distribution

Theoretical analysis confirms protocol effectiveness

Supports dynamic, ad-hoc network communication

Abstract

The dynamic establishment of shared information (e.g. secret key) between two entities is particularly important in networks with no pre-determined structure such as wireless sensor networks (and in general wireless mobile ad-hoc networks). In such networks, nodes establish and terminate communication sessions dynamically with other nodes which may have never been encountered before, in order to somehow exchange information which will enable them to subsequently communicate in a secure manner. In this paper we give and theoretically analyze a series of protocols that enables two entities that have never encountered each other before to establish a shared piece of information for use as a key in setting up a secure communication session with the aid of a shared key encryption algorithm. These protocols do not require previous pre-distribution of candidate keys or some other piece of information of specialized form except a small seed value, from which the two entities can produce arbitrarily long strings with many similarities.