| |
 Three-Round (Robust) Threshold ECDSA from Threshold CL Encryption Speaker (s):
JIANG Bowen
PhD Student,
School of Computing and Information Systems
Singapore Management University
| Date: Time: Venue: | | 27 June 2025, Friday 10:00am – 10:30am Meeting room 5.1, Level 5.
School of Computing and
Information Systems 1,
Singapore Management University,
80 Stamford Road, Singapore 178902 We look forward to seeing you at this research seminar. Please register by 25 June 2025. 
|
|
About the Talk 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 O(n) 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.|
This is a Pre-Conference talk for 30th Australasian Conference on Information Security and Privacy (ACISP 2025).
About the Speaker JIANG Bowen is a first-year Ph.D. student in Computer Science at Singapore Management University, supervised by Professor XUE Haiyang. Her research focuses on threshold cryptography, particularly the design and analysis of threshold Schnorr and ECDSA signature schemes. |
