Threshold and Multi-Signature Schemes from Linear Hash Functions

ePrint Report: Threshold and Multi-Signature Schemes from Linear Hash Functions

Stefano Tessaro, Chenzhi Zhu

This paper gives new constructions of two-round multi-signatures and threshold signatures for which security relies solely on either the hardness of the (plain) discrete logarithm problem or the hardness of RSA, in addition to assuming random oracles. Their signing protocol is partially non-interactive, i.e., the first round of the signing protocol is independent of the message being signed.


We obtain our constructions by generalizing the most …

addition eprint report functions hash hash functions message non problem protocol random report rsa security signature signatures signing