Promise \varSigma -Protocol: How to Construct Efficient Threshold ECDSA from Encryptions Based on Class Groups
From MaRDI portal
Publication:6041298
DOI10.1007/978-3-030-92068-5_19zbMATH Open1514.94150OpenAlexW3215175885MaRDI QIDQ6041298FDOQ6041298
Shunli Ma, Author name not available (Why is that?), Yi Deng, Xiang Xie, Hailong Wang, Xuyang Song
Publication date: 26 May 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-92068-5_19
Recommendations
Cites Work
- Security Proofs for Signature Schemes
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- On the fly authentication and signature schemes based on groups of unknown order
- Robust Threshold DSS Signatures
- Linearly Homomorphic Encryption from $$\mathsf {DDH}$$
- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
- Bandwidth-efficient threshold EC-DSA
- Compact zero-knowledge proofs for threshold ECDSA with trustless setup
- Using level-1 homomorphic encryption to improve threshold DSA signatures for Bitcoin wallet security
- Two-party ECDSA from hash proof systems and efficient instantiations
- Threshold-Optimal DSA/ECDSA Signatures and an Application to Bitcoin Wallet Security
- Fast secure two-party ECDSA signing
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)
