Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
From MaRDI portal
Publication:5451061
DOI10.1007/11593447_1zbMath1146.94305OpenAlexW1508759756MaRDI QIDQ5451061
Damien Vergnaud, Pascal Paillier
Publication date: 18 March 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11593447_1
Related Items
Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols ⋮ Generic construction for tightly-secure signatures from discrete log ⋮ Another Look at Tightness ⋮ On the Joint Security of Encryption and Signature in EMV ⋮ Another look at extraction and randomization of Groth's zk-SNARK ⋮ Towards Non-Black-Box Separations of Public Key Encryption and One Way Function ⋮ 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 ⋮ On methods of shortening ElGamal-type signatures ⋮ Logarithmic-size ring signatures with tight security from the DDH assumption ⋮ Optimal tightness for chain-based unique signatures ⋮ The random oracle model: a twenty-year retrospective ⋮ On tightly-secure (linkable) ring signatures ⋮ 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 tight security proofs for Schnorr signatures ⋮ 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 ⋮ On the tightness of forward-secure signature reductions ⋮ Tighter Reductions for Forward-Secure Signature Schemes ⋮ Improved Bounds on Security Reductions for Discrete Log Based Signatures ⋮ Separation Results on the “One-More” Computational Problems ⋮ A synthetic indifferentiability analysis of some block-cipher-based hash functions ⋮ Hash function requirements for Schnorr signatures ⋮ Signatures from sequential-OR proofs ⋮ Lossy CSI-fish: efficient signature scheme with tight reduction to decisional CSIDH-512 ⋮ Anonymity from Public Key Encryption to Undeniable Signatures ⋮ Impossibility on tamper-resilient cryptography with uniqueness properties ⋮ More efficient digital signatures with tight multi-user security ⋮ Optimal Security Proofs for Signatures from Identification Schemes ⋮ Identity-based signatures in standard model ⋮ On Related-Secret Pseudorandomness ⋮ Simple Schnorr multi-signatures with applications to bitcoin ⋮ 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
