CryptoDB
Simple Three-Round Multiparty Schnorr Signing with Full Simulatability
| Authors: |
|
|---|---|
| Download: | |
| Abstract: | In a multiparty signing protocol, also known as a threshold signature scheme, the private signing key is shared amongst a set of parties and only a quorum of those parties can generate a signature. Research on multiparty signing has been growing in popularity recently due to its application to cryptocurrencies. Most work has focused on reducing the number of rounds to two, and as a result: (a) are not fully simulatable in the sense of MPC real/ideal security definitions, and/or (b) are not secure under concurrent composition, and/or (c) utilize non-standard assumptions of different types in their proofs of security. In this paper, we describe a simple three-round multiparty protocol for Schnorr signatures that is secure for any number of corrupted parties; i.e., in the setting of a dishonest majority. The protocol is fully simulatable, secure under concurrent composition, and proven secure in the standard model or random-oracle model (depending on the instantiations of the commitment and zero-knowledge primitives). The protocol realizes an ideal Schnorr signing functionality with perfect security in the ideal commitment and zero-knowledge hybrid model (and thus the only assumptions needed are for realizing these functionalities). In our presentation, we do not assume that all parties begin with the message to be signed, the identities of the participating parties and a unique common session identifier, since this is often not the case in practice. Rather, the parties achieve consensus on these parameters as the protocol progresses. |
BibTeX
@article{cic-2024-34103,
title={Simple Three-Round Multiparty Schnorr Signing with Full Simulatability},
journal={cic},
publisher={International Association for Cryptologic Research},
volume={1, Issue 1},
url={https://cic.iacr.org//p/1/1/25},
doi={10.62056/a36c0l5vt},
author={Yehuda Lindell},
year=2024
}