Pages that link to "Item:Q1701451"
From MaRDI portal
The following pages link to Linear-time zero-knowledge proofs for arithmetic circuit satisfiability (Q1701451):
Displaying 26 items.
- Arya: nearly linear-time zero-knowledge proofs for correct program execution (Q1633476) (← links)
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits (Q1784111) (← links)
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures (Q2117059) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- BooLigero: improved sublinear zero knowledge proofs for Boolean circuits (Q2145410) (← links)
- More efficient amortization of exact zero-knowledge proofs for LWE (Q2148770) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- A PCP theorem for interactive proofs and applications (Q2170038) (← links)
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier (Q2170049) (← links)
- Gemini: elastic SNARKs for diverse environments (Q2170056) (← links)
- Linear-size constant-query IOPs for delegating computation (Q2175951) (← links)
- Acyclicity programming for sigma-protocols (Q2695643) (← links)
- Updateable Inner Product Argument with Logarithmic Verifier and Applications (Q5041169) (← links)
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting (Q5739207) (← links)
- Ligero: lightweight sublinear arguments without a trusted setup (Q6063128) (← links)
- Practical sublinear proofs for R1CS from lattices (Q6104331) (← links)
- Line-point zero knowledge and its applications (Q6107254) (← links)
- Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier (Q6132419) (← links)
- Orion: zero knowledge proof with linear prover time (Q6166953) (← links)
- Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\) (Q6166955) (← links)
- Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II (Q6169368) (← links)
- Polynomial IOPs for memory consistency checks in zero-knowledge virtual machines (Q6562561) (← links)
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs (Q6581781) (← links)
- More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings (Q6653054) (← links)
- Field-agnostic SNARKs from expand-accumulate codes (Q6660301) (← links)
- How to prove statements obliviously? (Q6660309) (← links)
