Promise \varSigma -Protocol: How to Construct Efficient Threshold ECDSA from Encryptions Based on Class Groups
From MaRDI portal
Publication:6041298
Recommendations
Cites work
- Bandwidth-efficient threshold EC-DSA
- Compact zero-knowledge proofs for threshold ECDSA with trustless setup
- Fast secure two-party ECDSA signing
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Linearly homomorphic encryption from \(\mathsf {DDH}\)
- On the fly authentication and signature schemes based on groups of unknown order
- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
- Robust threshold DSS signatures
- Security proofs for signature schemes
- Threshold-optimal DSA/ECDSA signatures and an application to bitcoin wallet security
- Two-party ECDSA from hash proof systems and efficient instantiations
- Using level-1 homomorphic encryption to improve threshold DSA signatures for Bitcoin wallet security
Cited in
(4)- Threshold structure-preserving signatures: strong and adaptive security under standard assumptions
- Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\)
- I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups
- Efficient succinct zero-knowledge arguments in the CL framework
This page was built for publication: Promise $$\varSigma $$-Protocol: How to Construct Efficient Threshold ECDSA from Encryptions Based on Class Groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041298)
