Linear-time arguments with sublinear verification from tensor codes
From MaRDI portal
Publication:2119036
DOI10.1007/978-3-030-64378-2_2zbMath1493.68156OpenAlexW3116303059MaRDI QIDQ2119036
Alessandro Chiesa, Jens Groth, Jonathan Bootle
Publication date: 23 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-64378-2_2
Related Items (14)
Sumcheck arguments and their applications ⋮ A PCP theorem for interactive proofs and applications ⋮ Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier ⋮ Gemini: elastic SNARKs for diverse environments ⋮ HyperPlonk: Plonk with linear-time prover and high-degree custom gates ⋮ Ligero: lightweight sublinear arguments without a trusted setup ⋮ Brakedown: linear-time and field-agnostic SNARKs for R1CS ⋮ Lattice-based succinct arguments for NP with polylogarithmic-time verification ⋮ Faster sounder succinct arguments and \textsf{IOP}s ⋮ Orion: zero knowledge proof with linear prover time ⋮ A toolbox for barriers on interactive oracle proofs ⋮ Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II ⋮ Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head ⋮ Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes
This page was built for publication: Linear-time arguments with sublinear verification from tensor codes
