Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
From MaRDI portal
Publication:1701451
DOI10.1007/978-3-319-70700-6_12zbMath1417.94046OpenAlexW2754619027MaRDI QIDQ1701451
Essam Ghadafi, Andrea Cerulli, Mohammad Hajiabadi, Jens Groth, Jonathan Bootle, Sune Kristian Jakobsen
Publication date: 23 February 2018
Full work available at URL: https://discovery.ucl.ac.uk/id/eprint/10039786/
Related Items (21)
Updateable Inner Product Argument with Logarithmic Verifier and Applications ⋮ Succinct non-interactive arguments via linear interactive proofs ⋮ More efficient amortization of exact zero-knowledge proofs for LWE ⋮ Asymptotically quasi-optimal cryptography ⋮ 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 ⋮ Linear-size constant-query IOPs for delegating computation ⋮ Actively secure arithmetic computation and VOLE with constant computational overhead ⋮ HyperPlonk: Plonk with linear-time prover and high-degree custom gates ⋮ Ligero: lightweight sublinear arguments without a trusted setup ⋮ Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier ⋮ Oblivious transfer with constant computational overhead ⋮ Succinct arguments for RAM programs via projection codes ⋮ Brakedown: linear-time and field-agnostic SNARKs for R1CS ⋮ 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 ⋮ Acyclicity programming for sigma-protocols ⋮ TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
This page was built for publication: Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
