Rogue-instance security for batch knowledge proofs

DOI10.1007/978-3-031-48615-9_5zbMATH Open1544.94271MaRDI QIDQ6581786

Gil Segev, Eylon Yogev, Amit Sharabi

Publication date: 1 August 2024

zbMATH Keywords

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

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algebraic (trapdoor) one-way functions: constructions and applications
• Efficient secure two-party protocols. Techniques and constructions
• Handling expected polynomial-time strategies in simulation-based security proofs
• Efficient signature generation by smart cards
• Security arguments for digital signatures and blind signatures
• Compact multi-signatures for smaller blockchains
• The algebraic group model and its applications
• A classification of computational assumptions in the algebraic group model
• Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
• On instantiating the algebraic group model from falsifiable assumptions
• Algebraic distinguishers: from discrete logarithms to decisional Uber assumptions
• Expected-time cryptography: generic techniques and applications to concrete soundness
• MuSig2: simple two-round Schnorr multi-signatures
• Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols
• A compressed \(\varSigma \)-protocol theory for lattices
• The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures
• Tight reductions for Diffie-Hellman variants in the algebraic group model
• Simple Schnorr multi-signatures with applications to bitcoin
• Optimal Security Proofs for Signatures from Identification Schemes
• Generic Hardness of the Multiple Discrete Logarithm Problem
• Interactive Oracle Proofs
• Computationally Sound Proofs
• Batching Schnorr Identification Scheme with Applications to Privacy-Preserving Authorization and Low-Bandwidth Communication Devices
• Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
• Cryptography and Coding
• Chain Reductions for Multi-signatures and the HBMS Scheme

Related Items (1)

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

This page was built for publication: Rogue-instance security for batch knowledge proofs

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