Improved Bounds on Security Reductions for Discrete Log Based Signatures

DOI10.1007/978-3-540-85174-5_6MaRDI QIDQ3600215zbMATH OpenOpenAlexFDO

Authors Sanjam Garg, Raghav Bhaskar, Satyanarayana V. Lokam

Publication date 10 February 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85174-5_6

zbMATH Keywords

provable securityrandom oracle modelSchnorr signature scheme

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• On the exact security of Schnorr-type signatures in the random oracle model
• Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
• On tight security proofs for Schnorr signatures
• On tight security proofs for Schnorr signatures
• The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures

Cites work

• Breaking RSA may not be equivalent to factoring
• Descending subsequences of random permutations
• Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
• scientific article; zbMATH DE number 4191111 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• Security arguments for digital signatures and blind signatures
• Security proofs for signature schemes

Cited in

(31)

• On the security loss of unique signatures
• On the tightness of forward-secure signature reductions
• Lossy CSI-fish: efficient signature scheme with tight reduction to decisional CSIDH-512
• More efficient digital signatures with tight multi-user security
• Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
• Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols
• The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures
• 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
• On the exact security of Schnorr-type signatures in the random oracle model
• On tight security proofs for Schnorr signatures
• Towards non-black-box separations of public key encryption and one way function
• scientific article; zbMATH DE number 2080670 (Why is no real title available?)
• Tighter Reductions for Forward-Secure Signature Schemes
• Limitations of the meta-reduction technique: the case of Schnorr signatures
• Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
• Digital Signatures with Memory-Tight Security in the Multi-challenge Setting
• The One-More Discrete Logarithm Assumption in the Generic Group Model
• On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model
• 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
• On proving equivalence class signatures secure from non-interactive assumptions
• New limits of provable security and applications to ElGamal encryption
• Schnorr signatures are tightly secure in the ROM under a non-interactive assumption
• New limits for homomorphic encryption
• Tight bounds on uniform-challenge reductions from sigma protocols
• Generic construction for tightly-secure signatures from discrete log

This page was built for publication: Improved Bounds on Security Reductions for Discrete Log Based Signatures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600215)