Secure Bootstrapping of Distributed Hash Tables in Dynamic Wireless Networks

Existing research work on Distributed Hash Tables (DHTs) assume that, prior to actually establishing a DHT, large number potential member nodes would come together at one point and at one place, and would all agree on the characteristics of the DHT to-be-established. This paper presents DHT bootstrapping, which is a novel approach to enable secure, efficient and scalable deployment of DHTs in wireless networks, in particular in wireless networks with time-varying topology. Our solution is not restricted to a particular type of DHT implementation.