Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols

DOI10.1007/978-3-030-84242-0_9zbMath1485.94118OpenAlexW3190952314MaRDI QIDQ2120075

Gil Segev, Lior Rotem

Publication date: 31 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-84242-0_9

zbMATH Keywords

discrete logarithm problemforking lemma\(t\)-time attacks

Mathematics Subject Classification ID

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

Related Items (7)

Optimal tightness for chain-based unique signatures ⋮ Chain Reductions for Multi-signatures and the HBMS Scheme ⋮ Hardening signature schemes via derive-then-derandomize: stronger security proofs for EdDSA ⋮ Classical and quantum security of elliptic curve VRF, via relative indifferentiability ⋮ Half-aggregation of Schnorr signatures with tight reductions ⋮ DualDory: logarithmic-verifier linkable ring signatures through preprocessing ⋮ Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs

Cites Work

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

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