{'fraction_non_alphanumeric': 0.014272121788772598, 'fraction_numerical': 0.0, 'mean_word_length': 5.261904761904762, '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}}
A verifiable secret sharing scheme based on AMBTC

In this paper, we combine absolute moment block truncation coding (AMBTC) and Shamir's secret sharing scheme to propose a verifiable secret sharing scheme. Shares construction is based on the compression codes generated by AMBTC; therefore, the shadow size is about one third of the original secret image. During the shares construction phase, the compression codes generated by AMBTC are first shuffled according to a watermark that is used to verify the authenticity of the reconstructed secret image during the revealing and verifying phase. Then the shuffled compression codes are used to generate the shadows by applying Shamir's scheme. To operate as a cheating prevention function without the need to transmit extra data, the hidden watermark can be a logo or a binary version of the secret image. Comparisons confirm that our proposed scheme offers relatively low computational complexity and smaller shadows than can be achieved with existing schemes offering a cheating prevention function.