{'fraction_non_alphanumeric': 0.01759014951627089, 'fraction_numerical': 0.0, 'mean_word_length': 4.927083333333333, '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}}
Reducing Multi-Secret Sharing Problem to Sharing a Single Secret Based on Cellular Automata

The aim of a secret sharing scheme is to share a secret among a group of participants in such a way that while authorized subsets of participants are able to recover the secret, non-authorized subsets of them obtain no information about it. Multi-secret sharing is the natural generalization of secret sharing for situations in which the simultaneous protection of more than one secret is required. However, there exist some secret sharing schemes for which there are no secure or efficient multi-secret sharing counterparts. In this paper, using cellular automata, an efficient general method is proposed to reduce the problem of sharing secrets (all assigned with the same access structure and needed to be reconstructed at once) under a certain secret sharing scheme ( ), to the problem of sharing one secret under such that none of the properties of are violated. Using the proposed approach, any secret sharing scheme can be converted to a multisecret sharing scheme. We provide examples to show the applicability of the proposed approach.