Interactive PCP
From MaRDI portal
Publication:3519531
DOI10.1007/978-3-540-70583-3_44zbMath1155.68504OpenAlexW2914525031MaRDI QIDQ3519531
Publication date: 19 August 2008
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70583-3_44
Related Items
Toward the KRW composition conjecture: cubic formula lower bounds via communication complexity ⋮ Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration ⋮ Succinct non-interactive arguments via linear interactive proofs ⋮ A Hierarchy Theorem for Interactive Proofs of Proximity ⋮ BooLigero: improved sublinear zero knowledge proofs for Boolean circuits ⋮ Interactive Oracle Proofs ⋮ More efficient amortization of exact zero-knowledge proofs for LWE ⋮ Spatial Isolation Implies Zero Knowledge Even in a Quantum World ⋮ On succinct non-interactive arguments in relativized worlds ⋮ Succinct arguments in the quantum random oracle model ⋮ Linear-size constant-query IOPs for delegating computation ⋮ Constant-Round Interactive Proof Systems for AC0[2 and NC1] ⋮ Proof-carrying data from arithmetized random oracles ⋮ Ligero: lightweight sublinear arguments without a trusted setup ⋮ Infeasibility of instance compression and succinct PCPs for NP ⋮ Succinct interactive oracle proofs: applications and limitations ⋮ Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs ⋮ Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes ⋮ Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds ⋮ Zero-Knowledge Proofs of Proximity ⋮ Fast Reed-Solomon Interactive Oracle Proofs of Proximity ⋮ Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs ⋮ SPARKs: succinct parallelizable arguments of knowledge
Uses Software
