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

DOI10.1007/S00145-024-09506-5zbMATH Open1543.94791MaRDI QIDQ6570528FDOQ6570528

Gil Segev, Lior Rotem

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)

Cites Work

• Security arguments for digital signatures and blind signatures
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Efficient signature generation by smart cards
• Foundations of Cryptography
• Title not available (Why is that?)
• On the Exact Security of Schnorr-Type Signatures in the Random Oracle Model
• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
• Optimal Security Proofs for Signatures from Identification Schemes
• Compact multi-signatures for smaller blockchains
• The algebraic group model and its applications
• Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
• The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures
• On Tight Security Proofs for Schnorr Signatures
• Improved Bounds on Security Reductions for Discrete Log Based Signatures
• Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
• Expected-time cryptography: generic techniques and applications to concrete soundness
• 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)