Threshold ECDSA in Three Rounds

Jack Doerner; Yashvanth Kondi; Eysa Lee; abhi shelat

Paper 2023/765

Threshold ECDSA in Three Rounds

Jack Doerner, Technion – Israel Institute of Technology

Yashvanth Kondi, Aarhus University

Eysa Lee, Northeastern University

abhi shelat, Northeastern University

Abstract

We present a three-round protocol for threshold ECDSA signing with malicious security against a dishonest majority, which information-theoretically UC-realizes a standard threshold signing functionality, assuming ideal commitment and two-party multiplication primitives. Our work improves upon and fully subsumes the DKLs $t$-of-$n$ and 2-of-$n$ protocols. This document focuses on providing a succinct but complete description of the protocol and its security proof, and contains little expository text.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint.
Keywords: threshold cryptography multi-party computation ECDSA concrete efficiency
Contact author(s): j @ ckdoerner net
yash @ ykondi net
lee ey @ northeastern edu
abhi @ neu edu
History: 2023-05-30: approved; 2023-05-26: received; See all versions
Short URL: https://ia.cr/2023/765
License: CC BY

BibTeX

@misc{cryptoeprint:2023/765,
      author = {Jack Doerner and Yashvanth Kondi and Eysa Lee and abhi shelat},
      title = {Threshold ECDSA in Three Rounds},
      howpublished = {Cryptology ePrint Archive, Paper 2023/765},
      year = {2023},
      note = {\url{https://eprint.iacr.org/2023/765}},
      url = {https://eprint.iacr.org/2023/765}
}