{'fraction_non_alphanumeric': 0.021561338289962824, 'fraction_numerical': 0.0, 'mean_word_length': 5.231481481481482, '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}}
Verifiable Secret Sharing Scheme Using Merkle Tree

In Shamir’s (k,n) secret sharing scheme, the distributor splits a secret into n shares(shadows), and sends the shares to n participants. Each participant has a different share. In the phase of secret reconstruction, only K or more participants with their shares can reconstruct the secret together, less than K participants can’t reconstruct the secret, and know nothing about the secret. Shamir’s scheme is unconditionally secure in theory. However, this scheme can’t prevent adversaries from cheating. In asynchronous communication, a dishonest participant or a foreign adversary sends a fake share to the honest participants after he gets the shares from other participants and will reconstruct the secret alone while the other honest participants cannot reconstruct the secret. This scheme does not verify the share and identify the participants. In this paper, an efficient share verification method based on Merkel tree will be discussed, in which the root and authentication paths of a Merkel tree are used to verify shares between the participants, so that they can reconstruct secrets correctly after verifying and eliminating the fake shares. This method does not need complex algorithms and estimating the number of cheaters in advance, and will not increase the size of each share.