Polynomial commitments for Galois rings and applications to SNARKs over Z₂^k
From MaRDI portal
Publication:6866564
Cites work
- \textsf{Jolt}: SNARKs for virtual machines via lookups
- \textsf{Orbweaver}: succinct linear functional commitments from lattices
- Amortized complexity of information-theoretically secure MPC revisited
- Amortized NISC over \(\mathbb{Z}_{2^k}\) from RMFE
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
- Aurora: transparent succinct arguments for R1CS
- Blaze: fast SNARKs from interleaved RAA codes
- Brakedown: linear-time and field-agnostic SNARKs for R1CS
- Concretely efficient lattice-based polynomial commitment from standard assumptions
- Constant-round interactive proofs for delegating computation
- Degree-D reverse multiplication-friendly embeddings: constructions and applications
- Fast Reed-Solomon interactive oracle proofs of proximity
- Fiat-Shamir security of FRI and related SNARKs
- Fully secure MPC and zk-FLIOP over rings: new constructions, improvements and extensions
- Functional commitments for all functions, with transparent setup and from SIS
- Greyhound: fast polynomial commitments from lattices
- scientific article; zbMATH DE number 1936673 (Why is no real title available?)
- scientific article; zbMATH DE number 2002850 (Why is no real title available?)
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Interactive oracle proofs
- IOPs with inverse polynomial soundness error
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Linear-time encodable and decodable error-correcting codes
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
- More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings
- Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\)
- Nearly-linear size holographic proofs
- On Generalized Reed–Solomon Codes Over Commutative and Noncommutative Rings
- On interactive oracle proofs for Boolean R1CS statements
- On the size of pairing-based non-interactive arguments
- Perfectly-secure multiparty computation with linear communication complexity over any modulus
- Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup
- Proximity gaps for Reed-Solomon codes
- Remarks on Divisors of Zero
- Rinocchio: SNARKs for ring arithmetic
- SLAP: succinct lattice-based polynomial commitments from standard assumptions
- Snarks for C: verifying program executions succinctly and in zero knowledge
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- STIR: Reed-Solomon proximity testing with fewer queries
- Succinct arguments over towers of binary fields
- Succinct vector, polynomial, and functional commitments from lattices
- Transparent SNARKs over Galois rings
- Unlocking the lookup singularity with \textsf{Lasso}
- WHIR: Reed-Solomon proximity testing with super-fast verification
- ZK-for-Z2K: MPC-in-the-head zero-knowledge proofs for \(\mathbb{Z}_{2^k}\)
This page was built for publication: Polynomial commitments for Galois rings and applications to SNARKs over \(\mathbb{Z}_{2^k}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6866564)
