Two-Round Threshold Lattice Signatures from Threshold Homomorphic Encryption

ePrint Report: Two-Round Threshold Lattice Signatures from Threshold Homomorphic Encryption

Kamil Doruk Gur, Jonathan Katz, Tjerand Silde

Much recent work has developed efficient protocols for threshold signatures, where $n$ parties share a signing key and some threshold $t$ of those parties must interact to produce a signature. Yet efficient threshold signatures with post-quantum security have been elusive, with the state-of-the-art being a two-round scheme by Damgård et al. based on lattices that support only the full threshold case (i.e., $t=n$). …

encryption eprint report homomorphic encryption key protocols report share signature signatures signing signing key work