eprint.iacr.orgpaperRobust ECDSA Threshold Signing at Scale
Presents a robust threshold ECDSA signing protocol for t ≤ (n-1)/3 corrupted signers. It batch-computes pre-processing material for fast online signing and scales to many signers, for uses such as bridging consensus between blockchains. It combines batched verifiable secret sharing (Fitzi & Hirt), randomness extraction (Beerliova-Trubiniova & Hirt), efficient share opening (Damgård & Nielsen) and Attema–Cramer zero-knowledge proofs. The authors implement it and show it is practical for large n.
TL;DR Scalable, robust threshold ECDSA signing tolerating up to a third malicious signers, with an implementation, aimed at blockchain bridges.
Organisations named here
- Anders Dalskov
- Carsten Baum
Technologies named here
- ECDSA
Techniques named here
- Batching techniques for sharing
- Randomness extraction
- Share opening
- Efficient Zero-Knowledge proofs
- Secret sharing
Related in other
eprint.iacr.orgpaperRerandomizable Garbling for Arithmetic Circuits
aseemshrey.inarticle