The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures

DOI10.1007/978-3-030-65277-7_24zbMath1492.94064OpenAlexW3111463348MaRDI QIDQ2152049

Wei Dai, Mihir Bellare

Publication date: 6 July 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-65277-7_24

zbMATH Keywords

Schnorr and Okamoto identification

Mathematics Subject Classification ID

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

Related Items (9)

Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols ⋮ Generic construction for tightly-secure signatures from discrete log ⋮ One-more unforgeability of blind ECDSA ⋮ The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures ⋮ On the multi-user security of short Schnorr signatures with preprocessing ⋮ Chain Reductions for Multi-signatures and the HBMS Scheme ⋮ Multi-user CDH problems and the concrete security of \(\mathsf{NAXOS}\) and \(\mathsf{X3DH}\) ⋮ Hardening signature schemes via derive-then-derandomize: stronger security proofs for EdDSA ⋮ Signed (group) Diffie-Hellman key exchange with tight security

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• FROST: Flexible round-optimized Schnorr threshold signatures
• Recent progress on the elliptic curve discrete logarithm problem
• Zero-knowledge proofs of identity
• Efficient signature generation by smart cards
• The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
• Security arguments for digital signatures and blind signatures
• The algebraic group model and its applications
• The Xedni calculus and the elliptic curve discrete logarithm problem
• Analysis of the Xedni calculus attack
• 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
• The distinction between fixed and random generators in group-based assumptions
• Simple Schnorr multi-signatures with applications to bitcoin
• Optimal Security Proofs for Signatures from Identification Schemes
• Generic Hardness of the Multiple Discrete Logarithm Problem
• From Identification to Signatures, Tightly: A Framework and Generic Transforms
• Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model
• Number-theoretic constructions of efficient pseudo-random functions
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• A public key cryptosystem and a signature scheme based on discrete logarithms
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• New directions in cryptography
• 1-out-of-n Signatures from a Variety of Keys
• Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
• Identity-Based Encryption from the Weil Pairing
• Limitations of the Meta-reduction Technique: The Case of Schnorr Signatures
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology – CRYPTO 2004
• Progress in Cryptology - INDOCRYPT 2003
• Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log

This page was built for publication: The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures