{'fraction_non_alphanumeric': 0.02654867256637168, 'fraction_numerical': 0.0011061946902654867, 'mean_word_length': 4.915032679738562, '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}}
Self-healing key distribution for large-scale wireless sensor networks

Recently, T. Yuan et al. proposed a self-healing key distribution with revocation and collusion resistance for wireless sensor networks based on the revocation and participation polynomials. However, we show that T. Yuan's scheme is insecure against the proposed attack. In this paper, we modify the T. Yuan's scheme and further propose a secure and efficient self-healing key distribution scheme to overcome the flaw of T. Yuan's scheme. Our proposed scheme reduces the user's storage overhead to a constant value 2logq bits, and makes the communication overhead be also optimal. Moreover, we analyze our scheme in an appropriate security model and prove that it is unconditionally secure and not only achieves forward and backward secrecy, but also resists to the collusion attack among the revoked users and the new joined users.