{'fraction_non_alphanumeric': 0.02275189599133261, 'fraction_numerical': 0.0, 'mean_word_length': 5.328767123287672, '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 Secure Threshold Signature Scheme from Lattices

Lattices are the most fascinating mathematical tool used in modern cryptography. Cryptographic schemes based on lattices have got rapid development in almost all areas, like public key encryption, group and ring signature, identity-based encryption, attribute-based encryption, and even fully homomorphic encryption, except that there barely are not threshold schemes. In this work, we give a direct construction of a threshold signature scheme from lattices, which is proved to be non-adaptive existential unforgeable in the random oracles. Our scheme do not need any interactions between the players. The dealer holds the system public key. Each player holds its own public-secret pair. Each player gets verified signature share separately and combines all individual signature shares into a final signature. Furthermore, the dealer can not imitate the signature shares.