Rogue-instance security for batch knowledge proofs
From MaRDI portal
Recommendations
- Batch proofs of partial knowledge
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for -protocols
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols
- Batch ZK Proof and Verification of OR Logic
- Expected-time cryptography: generic techniques and applications to concrete soundness
Cites work
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 4170086 (Why is no real title available?)
- scientific article; zbMATH DE number 1302863 (Why is no real title available?)
- scientific article; zbMATH DE number 708798 (Why is no real title available?)
- scientific article; zbMATH DE number 1162684 (Why is no real title available?)
- scientific article; zbMATH DE number 2086722 (Why is no real title available?)
- A classification of computational assumptions in the algebraic group model
- A compressed \(\varSigma \)-protocol theory for lattices
- Algebraic (trapdoor) one-way functions: constructions and applications
- Algebraic distinguishers: from discrete logarithms to decisional Uber assumptions
- Batching Schnorr Identification Scheme with Applications to Privacy-Preserving Authorization and Low-Bandwidth Communication Devices
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
- Chain Reductions for Multi-signatures and the HBMS Scheme
- Compact multi-signatures for smaller blockchains
- Computationally Sound Proofs
- Cryptography and Coding
- Efficient secure two-party protocols. Techniques and constructions
- 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
- Generic Hardness of the Multiple Discrete Logarithm Problem
- Handling expected polynomial-time strategies in simulation-based security proofs
- Interactive oracle proofs
- MuSig2: simple two-round Schnorr multi-signatures
- On instantiating the algebraic group model from falsifiable assumptions
- Optimal security proofs for signatures from identification schemes
- Security arguments for digital signatures and blind signatures
- Simple Schnorr multi-signatures with applications to bitcoin
- The algebraic group model and its applications
- 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
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols
Cited in
(2)
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)
