Welcome to the resource topic for 2023/198
Chopsticks: Fork-Free Two-Round Multi-Signatures from Non-Interactive Assumptions
Authors: Jiaxin Pan, Benedikt WagnerAbstract:
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 the quantitative guarantees given by the security proof useless.
In this work, we improve the state of the art by proposing two efficient two-round multi-signature schemes from the (standard, non-interactive) Decisional Diffie-Hellman (DDH) assumption.
Both schemes are proven secure in the random oracle model without rewinding.
We do not require any pairing either.
Our first scheme supports key aggregation but has a security loss linear in the number of signing queries, and our second scheme is the first tightly secure construction.
A key ingredient in our constructions is a new homomorphic dual-mode commitment scheme for group elements, that allows to equivocate for messages of a certain structure.
The definition and efficient construction of this commitment scheme is of independent interest.
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .