{'fraction_non_alphanumeric': 0.02112676056338028, 'fraction_numerical': 0.0, 'mean_word_length': 5.902912621359223, '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}}
Short Paper: GKE: Efficient Group-based Key Establishment for Large Sensor Networks

We present a group-based key predistribution scheme, GKE, which enables all pairs of neighboring sensors to establish a unique pairwise key, regardless of sensor density or distribution. Since pairwise keys are unique, security in GKE degrades gracefully as the number of compromised nodes increases. In addition, GKE is very efficient since it requires only localized communication to establish pairwise keys, significantly reducing communication overheads. Our security analysis and performance evaluation show that GKE performs very well in terms of resilience, connectivity, communication overhead and memory requirements