Three-round (robust) threshold ECDSA from threshold CL encryption

Publication Type

Conference Proceeding Article

Publication Date

7-2025

Abstract

Threshold ECDSA has become a crucial security component in blockchain and decentralized systems, as it mitigates the risk of a single point of failure. Following the multiplicative-to-additive approach, the state-of-the-art threshold ECDSA (Doerner et al. in S&P24) requires only three rounds but has outgoing communication complexity. Based on threshold CL encryption, Wong et al. (in NDSS24) proposed the first scheme with constant outgoing communication; however, their scheme requires at least four rounds.We bridge this gap by introducing a three-round threshold ECDSA scheme with constant outgoing communication based on threshold CL encryption. Additionally, we enhance our basic scheme with robustness while maintaining the number of communication rounds, albeit at the cost of non-constant outgoing communication. Our implementation demonstrates that the basic scheme achieves optimal runtime and communication costs, while the robust variant reduces the communication rounds required by Wong et al.’s scheme, incurring only a small additional cost in small-scale settings.

Discipline

Information Security

Research Areas

Information Systems and Management

Publication

Information Security and Privacy: 30th Australasian Conference, ACISP 2025, Wollongong, NSW, Australia, July 14-16

First Page

224

Last Page

244

ISBN

9789819690954

Identifier

10.1007/978-981-96-9095-4_12

Publisher

Springer

City or Country

Cham

Additional URL

https://doi.org/10.1007/978-981-96-9095-4_12

This document is currently not available here.

Share

COinS