Threshold ECDSA in Two Rounds
Open Access
- 19 November 2025
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 2937-2950
Abstract
No abstract availableFunding Information
- Natural Science Foundation of China (6247225)
- National Key Research and Development Program of China (2022YFB2701700)
This publication has 48 references indexed in Scilit:
- FROST: Flexible Round-Optimized Schnorr Threshold Signatures2021
- The Rise of Paillier: Homomorphic Secret Sharing and Public-Key Silent OT2021
- Securing DNSSEC Keys via Threshold ECDSA from Generic MPC2020
- Fast Threshold ECDSA with Honest Majority2020
- Bandwidth-Efficient Threshold EC-DSA2020
- Two-Party ECDSA from Hash Proof Systems and Efficient Instantiations2019
- Practical Fully Secure Unrestricted Inner Product Functional Encryption Modulo p2018
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors2005
- Threshold cryptosystems2001
- Lower Bounds for Discrete Logarithms and Related Problems1997