Improved Bounds on Security Reductions for Discrete Log Based Signatures

DOI10.1007/978-3-540-85174-5_6zbMath1183.94051OpenAlexW1704483751MaRDI QIDQ3600215

Satyanarayana V. Lokam, Sanjam Garg, Raghav Bhaskar

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)

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 ⋮ Towards Non-Black-Box Separations of Public Key Encryption and One Way Function ⋮ Optimal tightness for chain-based unique signatures ⋮ 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 ⋮ On tight security proofs for Schnorr signatures ⋮ On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model ⋮ On the tightness of forward-secure signature reductions ⋮ Tighter Reductions for Forward-Secure Signature Schemes ⋮ Lossy CSI-fish: efficient signature scheme with tight reduction to decisional CSIDH-512 ⋮ More efficient digital signatures with tight multi-user security ⋮ Optimal Security Proofs for Signatures from Identification Schemes ⋮ Identity-based signatures in standard model ⋮ Simple Schnorr multi-signatures with applications to bitcoin ⋮ Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model

Cites Work

• Unnamed Item
• Unnamed Item
• Descending subsequences of random permutations
• Security arguments for digital signatures and blind signatures
• Security Proofs for Signature Schemes
• Breaking RSA may not be equivalent to factoring
• Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log