{'fraction_non_alphanumeric': 0.022222222222222223, 'fraction_numerical': 0.0, 'mean_word_length': 5.247524752475248, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
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.