Abstract. We present two new schemes that, in the absence of a centralized support, allow a pair of nodes of a mobile ad hoc network to compute a shared key without communicating. Such a service is important to secure routing protocols [1] [2] [3] . The schemes are built using the well-known technique of threshold secret sharing and are secure against a collusion of up to a certain number of nodes. We evaluate and compare the performance of both the schemes in terms of the node admission and pairwise key establishment costs.
Saxena and colleagues [2005; REF proposed secure, efficient and noninteractive admission control protocol and schemes that allow a pair of nodes to compute a shared key without centralized support in ad hoc networks.
Self-configurable Key Pre-distribution in Mobile Ad Hoc Networks
NETWORKING
Computer Science