More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings
From MaRDI portal
Publication:6653054
DOI10.1007/978-3-031-68400-5_13MaRDI QIDQ6653054
Yizhou Yao, Chaoping Xing, Fuchun Lin
Publication date: 13 December 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Amortized complexity of information-theoretically secure MPC revisited
- LPN decoded
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Stacked garbling for disjunctive zero-knowledge proofs
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
- A secret-sharing based MPC protocol for Boolean circuits with good amortized complexity
- Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
- Aurora: transparent succinct arguments for R1CS
- Efficient pseudorandom correlation generators: silent OT extension and more
- Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge
- Two Halves Make a Whole
- Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing
- Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography
- On the Size of Pairing-Based Non-interactive Arguments
- Sok: vector OLE-based zero-knowledge protocols
- Rinocchio: SNARKs for ring arithmetic
- Proving as fast as computing: succinct arguments with constant prover overhead
- Brakedown: linear-time and field-agnostic SNARKs for R1CS
- More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
- SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model
- Improved single-round secure multiplication using regenerating codes
- Orion: zero knowledge proof with linear prover time
- Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\)
- Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head
- Amortized NISC over \(\mathbb{Z}_{2^k}\) from RMFE
- Degree-\(D\) reverse multiplication-friendly embeddings: constructions and applications
- Threshold linear secret sharing to the rescue of MPC-in-the-head
- ZK-for-Z2K: MPC-in-the-head zero-knowledge proofs for \(\mathbb{Z}_{2^k}\)
- The hardness of LPN over any integer ring and field for PCG applications
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)
