Time-Optimal Interactive Proofs for Circuit Evaluation
From MaRDI portal
Publication:2849387
DOI10.1007/978-3-642-40084-1_5zbMath1316.94093arXiv1304.3812OpenAlexW2964279767MaRDI QIDQ2849387
Publication date: 17 September 2013
Published in: Advances in Cryptology – CRYPTO 2013 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.3812
Related Items (17)
Sumcheck arguments and their applications ⋮ Arguments of Proximity ⋮ Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs ⋮ Efficient proof composition for verifiable computation ⋮ 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 ⋮ Scalable zero knowledge via cycles of elliptic curves ⋮ Brakedown: linear-time and field-agnostic SNARKs for R1CS ⋮ Nova: recursive zero-knowledge arguments from folding schemes ⋮ Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP ⋮ Multi-server verifiable delegation of computations: unconditional security and practical efficiency ⋮ Flexible and efficient verifiable computation on encrypted data ⋮ Verifiable Stream Computation and Arthur--Merlin Communication ⋮ Spartan: efficient and general-purpose zkSNARKs without trusted setup ⋮ Computational Integrity with a Public Random String from Quasi-Linear PCPs
Uses Software
This page was built for publication: Time-Optimal Interactive Proofs for Circuit Evaluation
