scientific article; zbMATH DE number 7204492
From MaRDI portal
Publication:5111371
DOI10.4230/LIPIcs.ICALP.2017.40zbMath1441.68084MaRDI QIDQ5111371
Michael Riabzev, Alessandro Chiesa, Eli Ben-Sasson, Nicholas Spooner, Ariel Gabizon
Publication date: 27 May 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) 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) Randomized algorithms (68W20) Complexity of proofs (03F20)
Related Items (12)
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 ⋮ Ligero: lightweight sublinear arguments without a trusted setup ⋮ Parallelizable delegation from LWE ⋮ A toolbox for barriers on interactive oracle proofs ⋮ Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II ⋮ Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes ⋮ SPARKs: succinct parallelizable arguments of knowledge ⋮ Constant-Round Interactive Proofs for Delegating Computation
This page was built for publication:
