Interactive PCP
From MaRDI portal
Recommendations
Cited in
(40)- Short non-interactive cryptographic proofs
- Toward the KRW composition conjecture: cubic formula lower bounds via communication complexity
- SPARKs: succinct parallelizable arguments of knowledge
- Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration
- Succinct non-interactive arguments via linear interactive proofs
- BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
- More efficient amortization of exact zero-knowledge proofs for LWE
- A PCP theorem for interactive proofs and applications
- On succinct non-interactive arguments in relativized worlds
- Succinct arguments in the quantum random oracle model
- Linear-size constant-query IOPs for delegating computation
- Short PCPPs verifiable in polylogarithmic time with \(O(1)\) queries
- Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes
- scientific article; zbMATH DE number 1670844 (Why is no real title available?)
- Quasi-linear size zero knowledge from linear-algebraic PCPs
- Interactive oracle proofs
- Probabilistically Checkable Arguments
- A hierarchy theorem for interactive proofs of proximity
- Zero-knowledge proofs of proximity
- Fast and deterministic constant factor approximation algorithms for LCS imply new circuit lower bounds
- Fast Reed-Solomon interactive oracle proofs of proximity
- Spatial Isolation Implies Zero Knowledge Even in a Quantum World
- Constant-Round Interactive Proof Systems for AC0[2] and NC1
- scientific article; zbMATH DE number 7250162 (Why is no real title available?)
- Computational integrity with a public random string from quasi-linear PCPs
- Probabilistically checkable proofs of proximity with zero-knowledge
- scientific article; zbMATH DE number 7650350 (Why is no real title available?)
- Proof-carrying data from arithmetized random oracles
- Ligero: lightweight sublinear arguments without a trusted setup
- Succinct interactive oracle proofs: applications and limitations
- Infeasibility of instance compression and succinct PCPs for NP
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
- Probabilistically checkable arguments for all NP
- Zero-knowledge IOPs approaching witness length
- STIR: Reed-Solomon proximity testing with fewer queries
- Zero-knowledge in streaming interactive proofs
- Rate-1 zero-knowledge proofs from one-way functions
- Uni/multi variate polynomial embeddings for zkSNARKs
- Local proofs approaching the witness length
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
This page was built for publication: Interactive PCP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3519531)
