Robust ECDSA Threshold Signing at Scale
Open Access
- 26 October 2026
- journal article
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 3 (3)
Abstract
This work presents an efficient, scalable, and robust threshold ECDSA signing protocol for the honest super-majority scenario, making it suitable for e.g., bridging consensus from one Blockchain to another. Our construction allows to batch-compute pre-processing material for efficient online signing. While our protocol is based on established ideas for (Verifiable) Secret Sharing, we optimize it to scale efficiently both in terms of computation and communication with a large number of signers. We therefore combine efficient batching techniques for sharing (Fitzi & Hirt, PODC 2006), randomness extraction (Beerliova-Trubiniova & Hirt, TCC 2008) and share opening (Damgård & Nielsen, CRYPTO 2007) with recent advances in efficient Zero-Knowledge proofs (Attema & Cramer, CRYPTO 2020). We implement and evaluate the protocol experimentally and show that it is practical for large number of parties.Keywords
This publication has 46 references indexed in Scilit:
- Securing DNSSEC Keys via Threshold ECDSA from Generic MPC2020
- Fast Threshold ECDSA with Honest Majority2020
- Compressed $\varSigma $-Protocol Theory and Practical Application to Plug & Play Secure Algorithmics2020
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors2005
- Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing2001
- Robust Threshold DSS SignaturesInformation and Computation, 2001
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems2000
- Robust Threshold DSS Signatures1996
- Society and Group Oriented Cryptography: a New Concept1988
- A Digital Signature Based on a Conventional Encryption Function1988