{'fraction_non_alphanumeric': 0.02483660130718954, 'fraction_numerical': 0.0, 'mean_word_length': 5.278688524590164, '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}}
Provably secure verifiable multi-stage secret sharing scheme based on monotone span program

In multi-secret sharing (MSS) scheme, a dealer distributes multiple secrets among a set of participants, each of them according to an access structure. In this study, the authors propose a novel linear MSS with computational verifiability that provide many functions for practical applications in comparison with the previous works focusing on MSS schemes in the general scenario. This scheme has the same advantages as previous schemes; moreover, it is verifiable and multi-use secret sharing. Furthermore, in this scheme the secret reconstruction is according to the dealer's preassigned order. Also, they prove the security of the authors’ scheme in the standard model.