Anders Dalskov
Research Subjects
Research Interests
Anders Dalskov has a total of 1 co-authors. Here are the top co-authors by number of shared publications:
- Carsten Baum
Technical University of Denmark
1 shared publication
Latest Publications
- Open Access
- 26 October 2026
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 3 (3)
Robust ECDSA Threshold Signing at Scale
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.
- 26 October 2026
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 3 (3)
Open AccessRobust ECDSA Threshold Signing at Scale
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.