Succinct arguments for \textsf{BatchQMA} and friends under 8 rounds

DOI10.1007/978-3-032-01878-6_20MaRDI QIDQ6863949zbMATH OpenFDO

Authors Rishab Goyal, Aditya Jain, Shashwatha Mitra G B

Publication date 4 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-01878-6_20

zbMATH Keywords

quantum proverquantum random oracle modelround complexity

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Cites work

• Advances in Cryptology - CRYPTO 2003
• Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
• Batch arguments to NIZKs from one-way functions
• Boosting batch arguments and RAM delegation
• Classical verification of quantum computations
• Classical verification of quantum computations with efficient verifier
• Computationally Sound Proofs
• Constant-round interactive proofs for delegating computation
• Efficient fully homomorphic encryption from (standard) LWE
• From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
• Fully homomorphic encryption using ideal lattices
• Functional encryption: definitions and challenges
• How to delegate computations publicly
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• How to use indistinguishability obfuscation
• scientific article; zbMATH DE number 1842483 (Why is no real title available?)
• Impossibilities in succinct arguments: black-box extraction and more
• Indistinguishability obfuscation from compact functional encryption
• Indistinguishability obfuscation from functional encryption
• Minimum disclosure proofs of knowledge
• Non-deterministic exponential time has two-prover interactive protocols
• Non-interactive batch arguments for NP from standard assumptions
• Non-interactive classical verification of quantum computation
• Non-interactive delegation and batch NP verification from standard computational assumptions
• On extractability obfuscation
• On the size of pairing-based non-interactive arguments
• Post-quantum succinct arguments: breaking the quantum rewinding barrier
• Post-quantum zero knowledge, revisited or: how to do quantum rewinding undetectably
• Probabilistic checking of proofs
• Proof verification and the hardness of approximation problems
• Recursive composition and bootstrapping for SNARKs and proof-carrying data
• Security of the Fiat-Shamir transformation in the quantum random-oracle model
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Short pairing-based non-interactive zero-knowledge arguments
• SNARGs for \(\mathcal{P}\) from LWE
• SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
• SNARGs for monotone policy batch NP
• Succinct classical verification of quantum computation
• Succinct delegation for low-space non-deterministic computation
• Succinct non-interactive arguments via linear interactive proofs
• The hunting of the SNARK
• The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more
• The random oracle methodology, revisited.
• Tracing quantum state distinguishers via backtracking

This page was built for publication: Succinct arguments for \textsf{BatchQMA} and friends under 8 rounds

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