Fast threshold ECDSA with honest majority
From MaRDI portal
Publication:2106655
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
- Decentralized asset custody scheme with security against rational adversary
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
- Threshold-optimal DSA/ECDSA signatures and an application to bitcoin wallet security
- 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
- Fast secure two-party ECDSA signing
- Bandwidth-efficient threshold EC-DSA revisited: online/offline extensions, identifiable aborts proactive and adaptive security
- Efficient threshold-optimal ECDSA
- Twinkle: threshold signatures from DDH with full adaptive security
- 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)