One-more unforgeability of blind ECDSA
From MaRDI portal
Publication:2148761
Recommendations
Cites work
- A modular treatment of blind signatures from identification schemes
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
- Compact zero-knowledge proofs for threshold ECDSA with trustless setup
- Equivocal Blind Signatures and Adaptive UC-Security
- scientific article; zbMATH DE number 1722675 (Why is no real title available?)
- scientific article; zbMATH DE number 3825707 (Why is no real title available?)
- scientific article; zbMATH DE number 1088937 (Why is no real title available?)
- scientific article; zbMATH DE number 1942427 (Why is no real title available?)
- scientific article; zbMATH DE number 2080670 (Why is no real title available?)
- scientific article; zbMATH DE number 1759784 (Why is no real title available?)
- Lattice-based blind signatures
- Linearly homomorphic encryption from \(\mathsf {DDH}\)
- On instantiating the algebraic group model from falsifiable assumptions
- On the (in)security of ROS
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Round optimal blind signatures
- Round-Optimal Composable Blind Signatures in the Common Reference String Model
- The algebraic group model and its applications
- The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures
Cited in
(6)- On the one-per-message unforgeability of (EC)DSA and its variants
- On the (in)security of ROS
- On the (im)possibility of secure ElGamal blind signatures
- Homomorphic encryption for large integers from nested residue number systems
- Schnorr signatures are tightly secure in the ROM under a non-interactive assumption
- Blind \textsf{ECDSA} from the \textsf{ECDSA} assumption
This page was built for publication: One-more unforgeability of blind ECDSA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2148761)