Cryptology ePrint Archive: Report 2018/499

Secure Two-party Threshold ECDSA from ECDSA Assumptions

Jack Doerner and Yashvanth Kondi and Eysa Lee and abhi shelat

Abstract: The Elliptic Curve Digital Signature Algorithm (ECDSA) is one of the most widely used schemes in deployed cryptography. Through its applications in code and binary authentication, web security, and cryptocurrency, it is likely one of the few cryptographic algorithms encountered on a daily basis by the average person. However, its design is such that executing multi-party or threshold signatures in a secure manner is challenging: unlike other, less widespread signature schemes, secure multi-party ECDSA requires custom protocols, which has heretofore implied reliance upon additional cryptographic assumptions and primitives such as the Paillier cryptosystem.

We propose new protocols for multi-party ECDSA key-generation and signing with a threshold of two, which we prove secure against malicious adversaries in the random oracle model using only the Computational Diffie-Hellman Assumption and the assumptions already relied upon by ECDSA itself. Our scheme requires only two messages, and via implementation we find that it outperforms the best prior results in practice by a factor of 56 for key generation and 11 for signing, coming to within a factor of 18 of local signatures. Concretely, two parties can jointly sign a message in just over three milliseconds.

Category / Keywords: cryptographic protocols / threshold cryptography, elliptic curve cryptography, multi-party computation, ECDSA, concrete efficiency

Original Publication (with major differences): IEEE Security and Privacy 2018

Date: received 22 May 2018, last revised 15 Jun 2018

Contact author: j at ckdoerner net

Available format(s): PDF | BibTeX Citation

Version: 20180615:184936 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]