A toolbox for barriers on interactive oracle proofs

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
On the complexity of interactive proofs with bounded communication
On interactive proofs with a laconic prover
Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
Linear-time arguments with sublinear verification from tensor codes
Barriers for succinct arguments in the random oracle model
A PCP theorem for interactive proofs and applications
Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
Libra: succinct zero-knowledge proofs with optimal prover computation
Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs
Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition
A PCP Characterization of AM
Proof verification and the hardness of approximation problems
Interactive Oracle Proofs
Short PCPs with Polylog Query Complexity
Probabilistic checking of proofs
Random Debaters and the Hardness of Approximating Stochastic Functions
Interactive proofs and the hardness of approximating cliques
Fast Reed-Solomon Interactive Oracle Proofs of Proximity
Efficient probabilistically checkable proofs and applications to approximations
Computational Integrity with a Public Random String from Quasi-Linear PCPs
Constant-round interactive proofs for delegating computation
The complexity of satisfiability problems
On the NP-Hardness of Max-Not-2
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
The PCP theorem by gap amplification
Succinct interactive oracle proofs: applications and limitations

This page was built for publication: A toolbox for barriers on interactive oracle proofs