Chopsticks: Fork-Free Two-Round Multi-Signatures from Non-Interactive Assumptions

ePrint Report: Chopsticks: Fork-Free Two-Round Multi-Signatures from Non-Interactive Assumptions

Jiaxin Pan, Benedikt Wagner

Multi-signatures have been drawing lots of attention in recent years, due to their applications in cryptocurrencies.
Most early constructions require three-round signing, and recent constructions have managed to reduce the round complexity to two. However, their security proofs are mostly based on non-standard, interactive assumptions (e.g. one-more assumptions) and come with a huge security loss, due to multiple uses of rewinding (aka the Forking Lemma).
This renders …

applications attention complexity cryptocurrencies drawing eprint report fork free loss managed non pan report security signatures signing standard wagner