More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
From MaRDI portal
Publication:6155261
DOI10.1007/978-3-031-15802-5_14zbMath1516.94030OpenAlexW4312846686MaRDI QIDQ6155261
Chen Yuan, Daniel E. Escudero, Xing, Chaoping
Publication date: 12 June 2023
Published in: Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-15802-5_14
Cites Work
- Unnamed Item
- Amortized complexity of information-theoretically secure MPC revisited
- Using TopGear in overdrive: a more efficient ZKPoK for SPDZ
- Overdrive2k: efficient secure MPC over \(\mathbb{Z}_{2^k}\) from somewhat homomorphic encryption
- Overdrive: making SPDZ great again
- Secure computation with constant communication overhead using multiplication embeddings
- Committed MPC -- maliciously secure multiparty computation from homomorphic commitments
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \)
- 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
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
- Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \)
- Dishonest Majority Multi-Party Computation for Binary Circuits
- Multiparty Computation from Somewhat Homomorphic Encryption
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
- Torsion Limits and Riemann-Roch Systems for Function Fields and Applications
- Semi-homomorphic Encryption and Multiparty Computation
- Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field
- Improved Multiplication Triple Generation over Rings via RLWE-Based AHE
- Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing
- Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
- Improved single-round secure multiplication using regenerating codes
This page was built for publication: More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
