Paper 2025/828 Original: eprint.iacr.org/2025/828 ↗

Bandwidth-Efficient Robust Threshold ECDSA in Three Rounds

Yingjie Lyu
Zengpeng Li
Hong-Sheng Zhou
Haiyang Xue
Mei Wang
Shuchao Wang
Mengling Liu
Abstract

Threshold ECDSA schemes distribute the capability of issuing signatures to multiple parties. They have been used in practical MPC wallets holding cryptocurrencies. However, most prior protocols are not robust, wherein even one misbehaving or non-responsive party would mandate an abort. Robust schemes have been proposed (Wong et al., NDSS ’23, ’24), but they do not match state-of-the-art number of rounds which is only three (Doerner et al., S&P ’24). In this work, we propose robust threshold ECDSA schemes RompSig-Q and RompSig-L that each take three rounds (two of which are broadcasts). Building on the works of Wong et al. and further optimized towards saving bandwidth, they respectively take each signer (1.0𝑡 + 1.6) KiB and 3.0 KiB outbound broadcast communication, and thus exhibit bandwidth efficiency that is competitive in practical scenarios where broadcasts are natively handled. RompSig-Q preprocesses multiplications and features fast online signing; RompSig-L leverages threshold CL encryption for scalability and dynamic participation.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
History
2025-05-09: last updated
2025-05-09: published
Short URL
https://ia.cr/2025/828
License
https://creativecommons.org/publicdomain/zero/1.0/

BibTeX

@misc{cryptoeprint:2025/828,
      author = {Yingjie Lyu and Zengpeng Li and Hong-Sheng Zhou and Haiyang Xue and Mei Wang and Shuchao Wang and Mengling Liu},
      title = {Bandwidth-Efficient Robust Threshold ECDSA in Three Rounds},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/828},
      year = {2025},
      url = {https://eprint.iacr.org/2025/828}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.