Interactive oracle proofs with constant rate and query complexity
From MaRDI portal
Complexity of proofs (03F20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20)
Recommendations
Cited in
(29)- SPARKs: succinct parallelizable arguments of knowledge
- Sumcheck arguments and their applications
- A PCP theorem for interactive proofs and applications
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
- Computing Riemann-Roch spaces via Puiseux expansions
- Linear-size constant-query IOPs for delegating computation
- Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes
- Interactive oracle proofs
- Constant-round interactive proofs for delegating computation
- Fast Reed-Solomon interactive oracle proofs of proximity
- Polynomial IOPs for linear algebra relations
- On interactive oracle proofs for Boolean R1CS statements
- Ligero: lightweight sublinear arguments without a trusted setup
- Parallelizable delegation from LWE
- Succinct interactive oracle proofs: applications and limitations
- A toolbox for barriers on interactive oracle proofs
- Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II
- Efficient computation of Riemann-Roch spaces for plane curves with ordinary singularities
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance
- \textsc{Zeromorph}: zero-knowledge multilinear-evaluation proofs from homomorphic univariate commitments
- Zero-knowledge IOPs approaching witness length
- STIR: Reed-Solomon proximity testing with fewer queries
- \textsc{Arc}: accumulation for Reed-Solomon codes
- Hamming weight proofs of proximity with one-sided error
- Proving as fast as computing: succinct arguments with constant prover overhead
- Local proofs approaching the witness length
- Quantum rewinding for IOP-based succinct arguments
- Foundations of data availability sampling
- Simple attacks against (extended) Fiat-Shamir
This page was built for publication: Interactive oracle proofs with constant rate and query complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111371)
