Tighter security for Schnorr identification and signatures: a high-moment forking lemma for -protocols

DOI10.1007/S00145-024-09506-5MaRDI QIDQ6570528zbMATH OpenFDO

Authors Lior Rotem, Gil Segev

Publication date 10 July 2024

Published in Journal of Cryptology (Search for Journal in Brave)

zbMATH Keywords

forking lemmasignaturesidentification schemessigma protocols

Mathematics Subject Classification ID

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

Recommendations

• Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols
• On the exact security of Schnorr-type signatures in the random oracle model
• On tight security proofs for Schnorr signatures
• On tight security proofs for Schnorr signatures
• Improved Bounds on Security Reductions for Discrete Log Based Signatures

Cites work

• scientific article; zbMATH DE number 4191111 (Why is no real title available?)
• scientific article; zbMATH DE number 708798 (Why is no real title available?)
• scientific article; zbMATH DE number 2086722 (Why is no real title available?)
• Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
• Compact multi-signatures for smaller blockchains
• Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
• Efficient signature generation by smart cards
• Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
• Expected-time cryptography: generic techniques and applications to concrete soundness
• Foundations of Cryptography
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Improved Bounds on Security Reductions for Discrete Log Based Signatures
• On the exact security of Schnorr-type signatures in the random oracle model
• On tight security proofs for Schnorr signatures
• Optimal security proofs for signatures from identification schemes
• Rogue-instance security for batch knowledge proofs
• Security arguments for digital signatures and blind signatures
• The algebraic group model and its applications
• The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures

Cited in

(1)

• Rogue-instance security for batch knowledge proofs

This page was built for publication: Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \(\Sigma\)-protocols

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