1. Fast Secure Two-Party ECDSA Signing 2017 Crypto Signatures
    Yehuda Lindell
    [View PDF on eprint.iacr.org]
    [Show BibTex Citation]

    author = {Yehuda Lindell},
    title = {Fast Secure Two-Party {ECDSA} Signing},
    booktitle = {Advances in Cryptology - {CRYPTO} 2017 - 37th Annual International
    Cryptology Conference, Santa Barbara, CA, USA, August 20-24, 2017,
    Proceedings, Part {II}},
    pages = {613--644},
    year = {2017},
    url = {https://doi.org/10.1007/978-3-319-63715-0\_21},
    doi = {10.1007/978-3-319-63715-0\_21},
    timestamp = {Tue, 14 May 2019 10:00:48 +0200},
    biburl = {https://dblp.org/rec/bib/conf/crypto/Lindell17},
    bibsource = {dblp computer science bibliography, https://dblp.org}

ECDSA is a standard digital signature schemes that is widely used in TLS, Bitcoin and elsewhere. Unlike other schemes like RSA, Schnorr signatures and more, it is particularly hard to construct efficient threshold signature protocols for ECDSA (and DSA). As a result, the best-known protocols today for secure distributed ECDSA require running heavy zero-knowledge proofs and computing many large-modulus exponentiations for every signing operation. In this paper, we consider the specific case of two parties (and thus no honest majority) and construct a protocol that is approximately two orders of magnitude faster than the previous best. Concretely, our protocol achieves good performance, with a single signing operation for curve P-256 taking approximately 37ms between two standard machine types in Azure (utilizing a single core only). Our protocol is proven secure under standard assumptions using a game-based definition. In addition, we prove security by simulation under a plausible yet non-standard assumption regarding Paillier.