{'fraction_non_alphanumeric': 0.01312910284463895, 'fraction_numerical': 0.0, 'mean_word_length': 5.140939597315437, '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}}
Randomness in self-healing key distribution schemes

Self-healing key distribution schemes allow group managers to broadcast session keys to dynamic groups of users over unreliable channels. The main property of the scheme is that, if during a certain session some broadcasted packet gets lost, then users are still capable of recovering the session key for that session simply by using the packets they have received during a previous session and the packets they receive at the beginning of a subsequent one, without requesting additional transmission from the group manager. Such schemes are quite suitable in supporting secure communication in wireless networks and mobile wireless ad-hoc networks. In this paper we present a lower bound on the randomness required for implementing self-healing key distribution schemes. We also show that the lower bound in tight by describing a self-healing scheme meeting it