Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
From MaRDI portal
Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
Recommendations
- Improved Bounds on Security Reductions for Discrete Log Based Signatures
- Generic construction for tightly-secure signatures from discrete log
- Self-certified Signatures Based on Discrete Logarithms
- scientific article; zbMATH DE number 2134166
- scientific article; zbMATH DE number 1088937
- scientific article; zbMATH DE number 2222194
- Publication:4502515
- scientific article; zbMATH DE number 2222188
- scientific article; zbMATH DE number 1440063
- Remarks on some signature schemes based on factoring and discrete logarithms
Cited in
(59)- A synthetic indifferentiability analysis of some block-cipher-based hash functions
- On the tightness of forward-secure signature reductions
- Signatures from sequential-OR proofs
- Lossy CSI-fish: efficient signature scheme with tight reduction to decisional CSIDH-512
- Impossibility on tamper-resilient cryptography with uniqueness properties
- More efficient digital signatures with tight multi-user security
- A classification of computational assumptions in the algebraic group model
- Black-box use of one-way functions is useless for optimal fair coin-tossing
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
- On instantiating the algebraic group model from falsifiable assumptions
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols
- Another look at extraction and randomization of Groth's zk-SNARK
- The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures
- A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption
- Logarithmic-size ring signatures with tight security from the DDH assumption
- Optimal tightness for chain-based unique signatures
- Identity-based signatures in standard model
- Simple Schnorr multi-signatures with applications to bitcoin
- On tight security proofs for Schnorr signatures
- On tightly-secure (linkable) ring signatures
- Optimal security proofs for signatures from identification schemes
- Another look at tightness
- On the joint security of encryption and signature in EMV
- Towards non-black-box separations of public key encryption and one way function
- On related-secret pseudorandomness
- Improved Bounds on Security Reductions for Discrete Log Based Signatures
- Hash function requirements for Schnorr signatures
- Anonymity from Public Key Encryption to Undeniable Signatures
- Tighter Reductions for Forward-Secure Signature Schemes
- scientific article; zbMATH DE number 1440063 (Why is no real title available?)
- On methods of shortening ElGamal-type signatures
- Separation Results on the “One-More” Computational Problems
- Digital Signatures with Memory-Tight Security in the Multi-challenge Setting
- The One-More Discrete Logarithm Assumption in the Generic Group Model
- Chain Reductions for Multi-signatures and the HBMS Scheme
- On pairing-free blind signature schemes in the algebraic group model
- The price of verifiability: lower bounds for verifiable random functions
- An analysis of the algebraic group model
- Adaptive proofs have straightline extractors (in the random oracle model)
- Toward tight security of the Galindo-Garcia identity-based signature
- A tightly secure ID-based signature scheme under DL assumption in AGM
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for -protocols
- Generic-group lower bounds via reductions between geometric-search problems: with and without preprocessing
- Limits in the provable security of ECDSA signatures
- On proving equivalence class signatures secure from non-interactive assumptions
- Vector commitments with proofs of smallness: short range proofs and more
- New limits of provable security and applications to ElGamal encryption
- \textsc{Zeromorph}: zero-knowledge multilinear-evaluation proofs from homomorphic univariate commitments
- Generic and algebraic computation models: when AGM proofs transfer to the GGM
- Schnorr signatures are tightly secure in the ROM under a non-interactive assumption
- Tightly secure lattice-based synchronized aggregate signature in standard model
- Joint security of encryption and signature in rucms: two keys are better, but one is also fine
- On the limits of non-interactive blind signatures
- New limits for homomorphic encryption
- Tight bounds on uniform-challenge reductions from sigma protocols
- The uber-knowledge assumption: a bridge to the AGM
- Hashing in generic groups: completing the AGM-to-GGM transfer
- Generic construction for tightly-secure signatures from discrete log
- The random oracle model: a twenty-year retrospective
This page was built for publication: Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5451061)
