Fast threshold ECDSA with honest majority
From MaRDI portal
Publication:2106655
DOI10.1007/978-3-030-57990-6_19zbMATH Open1506.94077OpenAlexW3032559458MaRDI QIDQ2106655FDOQ2106655
Authors: Thomas Pelle Jakobsen, Jesper Buus Nielsen, Jakob Illeborg Pagter, Michael Bæksvang Østergaard, Ivan B. Damgård 
Publication date: 16 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-57990-6_19
Recommendations
Cited In (20)
- FROST: Flexible round-optimized Schnorr threshold signatures
- Limits in the provable security of ECDSA signatures
- Promise $$\varSigma $$-Protocol: How to Construct Efficient Threshold ECDSA from Encryptions Based on Class Groups
- Efficient secure two party ECDSA
- Fast secure two-party ECDSA signing
- One round threshold ECDSA without roll call
- Practical Schnorr threshold signatures without the algebraic group model
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
- Decentralized asset custody scheme with security against rational adversary
- Threshold-optimal DSA/ECDSA signatures and an application to bitcoin wallet security
- Fast secure two-party ECDSA signing
- On the security of ECDSA with additive key derivation and presignatures
- Threshold ECDSA with an offline recovery party
- Bandwidth-efficient threshold EC-DSA
- Compact zero-knowledge proofs for threshold ECDSA with trustless setup
- Twinkle: threshold signatures from DDH with full adaptive security
- Bandwidth-efficient threshold EC-DSA revisited: online/offline extensions, identifiable aborts proactive and adaptive security
- Efficient threshold-optimal ECDSA
- Using level-1 homomorphic encryption to improve threshold DSA signatures for Bitcoin wallet security
- Two-round threshold signature from algebraic one-more learning with errors
This page was built for publication: Fast threshold ECDSA with honest majority
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106655)
