Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
From MaRDI portal
Recommendations
Cited in
(41)- Strong ETH breaks with Merlin and Arthur: short non-interactive proofs of batch evaluation
- Oblivious transfer with constant computational overhead
- Polynomial IOPs for memory consistency checks in zero-knowledge virtual machines
- Brakedown: linear-time and field-agnostic SNARKs for R1CS
- Succinct arguments for RAM programs via projection codes
- Practical zero-knowledge proofs for circuit evaluation
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
- Linear-time arguments with sublinear verification from tensor codes
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- scientific article; zbMATH DE number 7706037 (Why is no real title available?)
- On the amortized complexity of zero knowledge protocols for multiplicative relations
- Succinct non-interactive arguments via linear interactive proofs
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
- 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
- BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
- More efficient amortization of exact zero-knowledge proofs for LWE
- Practical sublinear proofs for R1CS from lattices
- Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\)
- Orion: zero knowledge proof with linear prover time
- Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II
- Faster sounder succinct arguments and \textsf{IOP}s
- Malleable commitments from group actions and zero-knowledge proofs for circuits based on isogenies
- Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier
- Asymptotically quasi-optimal cryptography
- Gemini: elastic SNARKs for diverse environments
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
- Linear-size constant-query IOPs for delegating computation
- Updateable Inner Product Argument with Logarithmic Verifier and Applications
- A PCP theorem for interactive proofs and applications
- More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Field-agnostic SNARKs from expand-accumulate codes
- How to prove statements obliviously?
- Acyclicity programming for sigma-protocols
- Arya: nearly linear-time zero-knowledge proofs for correct program execution
- Linear Algebra with Sub-linear Zero-Knowledge Arguments
- A toolbox for barriers on interactive oracle proofs
- scientific article; zbMATH DE number 1559559 (Why is no real title available?)
This page was built for publication: Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1701451)
