More efficient zero-knowledge protocols over Z₂^k via Galois rings
From MaRDI portal
Publication:6653054
Recommendations
- Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\)
- ZK-for-Z2K: MPC-in-the-head zero-knowledge proofs for \(\mathbb{Z}_{2^k}\)
- scientific article; zbMATH DE number 1302863
- More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
- Zero-knowledge proofs from secure multiparty computation
Cites work
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
- A secret-sharing based MPC protocol for Boolean circuits with good amortized complexity
- 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
- Brakedown: linear-time and field-agnostic SNARKs for R1CS
- Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
- Constant-overhead secure computation of Boolean circuits using preprocessing
- Degree-D reverse multiplication-friendly embeddings: constructions and applications
- Efficient pseudorandom correlation generators: silent OT extension and more
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 2002850 (Why is no real title available?)
- scientific article; zbMATH DE number 7706037 (Why is no real title available?)
- Improved single-round secure multiplication using regenerating codes
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
- LPN decoded
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP
- More efficient dishonest majority secure computation 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}\)
- On the size of pairing-based non-interactive arguments
- Orion: zero knowledge proof with linear prover time
- Privacy-free garbled circuits with applications to efficient zero-knowledge
- Proving as fast as computing: succinct arguments with constant prover overhead
- Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head
- Rinocchio: SNARKs for ring arithmetic
- SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model
- Sok: vector OLE-based zero-knowledge protocols
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Stacked garbling for disjunctive zero-knowledge proofs
- The hardness of LPN over any integer ring and field for PCG applications
- Threshold linear secret sharing to the rescue of MPC-in-the-head
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
- Two halves make a whole: reducing data transfer in garbled circuits using half gates
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
- ZK-for-Z2K: MPC-in-the-head zero-knowledge proofs for \(\mathbb{Z}_{2^k}\)
Cited in
(10)- Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head
- ZK-for-Z2K: MPC-in-the-head zero-knowledge proofs for \(\mathbb{Z}_{2^k}\)
- \textsf{Zinc}: succinct arguments with small arithmetization overheads from IOPs of proximity to the integers
- Efficient pseudorandom correlation generators over \(\mathbb{Z}/p^k\mathbb{Z} \)
- Polynomial commitments for Galois rings and applications to SNARKs over \(\mathbb{Z}_{2^k}\)
- Low-bandwidth mixed arithmetic in VOLE-based ZK from low-degree PRGs
- \textsf{LogRobin++}: optimizing proofs of disjunctive statements in VOLE-based ZK
- Interactive line-point zero-knowledge with sublinear communication and linear computation
- \textsf{Justvengers}: batched VOLE ZK disjunctions in \(\mathcal{O}(R+B+C)\) communication
- Tunable zero-knowledge proof of inference in machine learning via protocols over \(\mathbb{Z}_{2^k} \)
This page was built for publication: More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653054)
