Date Added: Nov 2011
In this paper, the authors consider key agreement in a distributed wireless network in which adversarial nodes may exist in the network. Two practical scenarios are studied, i.e., path-key establishment and key pool bootstrapping. For both scenarios, previous work mainly focuses on preventing adversarial eavesdropping attacks. When the adversarial nodes can both eavesdrop and change the packets in the network, they show that an optimal scheme (in terms of error correction capability) can be obtained by using techniques from the literature of network error correction codes. In particular, for the path-key establishment problem, which has a particular topological structure, they propose a lightweight scheme with lower error probability and computational complexity than existing network error correction codes.