Cryptology ePrint Archive: Report 2021/1386

Efficient Threshold-Optimal ECDSA

Michaella Pettit

Abstract: This paper proposes a threshold-optimal ECDSA scheme based on the first threshold signature scheme by Gennaro et al. with efficient non-interactive signing for any $t+1$ signers in the group, provided the total group size is more than twice the threshold $t$. The scheme does not require any homomorphic encryption or zero-knowledge proofs and is proven to be robust and unforgeable with identifiable aborts tolerating at most $t$ corrupted participants. The security of the scheme is proven in a simulation-based definition, assuming DDH and that ECDSA is existentially unforgeable under chosen message attack. To evaluate the performance of the protocol, it has been implemented in C++ and the results demonstrate the non-interactive signing phase takes 0.12ms on average meaning over 8000 signatures can be created per second. With pre-signing phase, it takes 3.35ms in total, which is over 144 times faster than the current state of the art.

Category / Keywords: public-key cryptography / ECDSA, Multiparty computation, Threshold signatures

Original Publication (with minor differences): CANS2021

Date: received 13 Oct 2021

Contact author: m pettit at nchain com

Available format(s): PDF | BibTeX Citation

Version: 20211015:082438 (All versions of this report)

Short URL: ia.cr/2021/1386


[ Cryptology ePrint archive ]