On Tight Security Proofs for Schnorr Signatures

DOI10.1007/978-3-662-45611-8_27zbMath1306.94052OpenAlexW258602522MaRDI QIDQ2938862

Dominique Schröder, Nils Fleischhacker, Tibor Jager

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)

Related Items (13)

Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols ⋮ Generic construction for tightly-secure signatures from discrete log ⋮ Optimal tightness for chain-based unique signatures ⋮ On the multi-user security of short Schnorr signatures with preprocessing ⋮ 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 ⋮ 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 ⋮ Signed (group) Diffie-Hellman key exchange with tight security

This page was built for publication: On Tight Security Proofs for Schnorr Signatures