On the concrete efficiency of probabilistically-checkable proofs
From MaRDI portal
Publication:5495829
DOI10.1145/2488608.2488681zbMath1293.94054OpenAlexW2077901621MaRDI QIDQ5495829
Alessandro Chiesa, Eran Tromer, Daniel Genkin, Eli Ben-Sasson
Publication date: 7 August 2014
Published in: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2488608.2488681
Linear codes (general theory) (94B05) Cryptography (94A60) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (21)
Local Reductions ⋮ Succinct non-interactive arguments via linear interactive proofs ⋮ Asymptotically quasi-optimal cryptography ⋮ Linear-size constant-query IOPs for delegating computation ⋮ Ligero: lightweight sublinear arguments without a trusted setup ⋮ Scalable zero knowledge via cycles of elliptic curves ⋮ Parallelizable delegation from LWE ⋮ Succinct arguments for RAM programs via projection codes ⋮ Unnamed Item ⋮ A new approach to efficient non-malleable zero-knowledge ⋮ Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II ⋮ The hunting of the SNARK ⋮ Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes ⋮ Fast Reed-Solomon Interactive Oracle Proofs of Proximity ⋮ Shorter arithmetization of nondeterministic computations ⋮ Sublinear Zero-Knowledge Arguments for RAM Programs ⋮ Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs ⋮ SPARKs: succinct parallelizable arguments of knowledge ⋮ Unnamed Item ⋮ Spartan: efficient and general-purpose zkSNARKs without trusted setup ⋮ Computational Integrity with a Public Random String from Quasi-Linear PCPs
This page was built for publication: On the concrete efficiency of probabilistically-checkable proofs
