On tight security proofs for Schnorr signatures

DOI10.1007/978-3-662-45611-8_27MaRDI QIDQ2938862zbMATH OpenOpenAlexFDO

Authors Nils Fleischhacker, Tibor Jager, Dominique Schröder

Publication date 16 January 2015

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

Full work available at URL https://doi.org/10.1007/978-3-662-45611-8_27

zbMATH Keywords

tightnessSchnorr signaturesblack-box reductionsalgebraic reductionsgeneric reductions

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• On tight security proofs for Schnorr signatures
• On the exact security of Schnorr-type signatures in the random oracle model
• Limitations of the meta-reduction technique: the case of Schnorr signatures
• Improved Bounds on Security Reductions for Discrete Log Based Signatures
• Tight proofs for signature schemes without random oracles

Cited in

(31)

• Optimal security proofs for signatures from identification schemes
• The One-More Discrete Logarithm Assumption in the Generic Group Model
• Proving Tight Security for Rabin-Williams Signatures
• Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols
• Generic construction for tightly-secure signatures from discrete log
• Lossy CSI-fish: efficient signature scheme with tight reduction to decisional CSIDH-512
• Recovering the tight security proof of SPHINCS\textsuperscript{+}
• On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model
• The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures
• Impossibility of the provable security of the Schnorr signature from the one-more DL assumption in the non-programmable random oracle model
• Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \(\Sigma\)-protocols
• Limitations of the meta-reduction technique: the case of Schnorr signatures
• Hash function requirements for Schnorr signatures
• On the Security of the Schnorr Signature Scheme and DSA Against Related-Key Attacks
• Signed (group) Diffie-Hellman key exchange with tight security
• Improved Bounds on Security Reductions for Discrete Log Based Signatures
• Half-aggregation of Schnorr signatures with tight reductions
• On the security of the verifiably-encrypted signature scheme of Boneh, Gentry, Lynn and Shacham
• New limits of provable security and applications to ElGamal encryption
• Identity-based signatures in standard model
• New Signature Schemes with Coupons and Tight Reduction
• On tight security proofs for Schnorr signatures
• Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem
• Tighter Reductions for Forward-Secure Signature Schemes
• On the Security of the Schnorr Scheme using Preprocessing
• On the exact security of Schnorr-type signatures in the random oracle model
• On proving equivalence class signatures secure from non-interactive assumptions
• More efficient digital signatures with tight multi-user security
• Digital Signatures with Memory-Tight Security in the Multi-challenge Setting
• On the multi-user security of short Schnorr signatures with preprocessing
• Optimal tightness for chain-based unique signatures

This page was built for publication: On tight security proofs for Schnorr signatures

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