More efficient dishonest majority secure computation over Z₂^k via Galois rings
From MaRDI portal
Publication:6155261
DOI10.1007/978-3-031-15802-5_14zbMATH Open1516.94030OpenAlexW4312846686MaRDI QIDQ6155261FDOQ6155261
Authors: Daniel E. Escudero, Chaoping Xing, Chen Yuan 
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
Recommendations
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
- Efficient multiparty computation for arithmetic circuits against a covert majority
- Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \)
- Round-optimal secure multiparty computation with honest majority
- scientific article; zbMATH DE number 2009982
- Dishonest majority multi-party computation for binary circuits
- Efficient bit-decomposition and modulus-conversion protocols with an honest majority
- Near-linear unconditionally-secure multiparty computation with a dishonest minority
- Efficient fully secure computation via distributed zero-knowledge proofs
- Verifiable computation in multiparty protocols with honest majority
Cites Work
- Title not available (Why is that?)
- Multiparty Computation from Somewhat Homomorphic Encryption
- Constant-overhead secure computation of Boolean circuits using preprocessing
- Semi-homomorphic encryption and multiparty computation
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
- Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
- 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
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- Overdrive: making SPDZ great again
- Dishonest majority multi-party computation for binary circuits
- Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves
- Secure computation with constant communication overhead using multiplication embeddings
- Committed MPC -- maliciously secure multiparty computation from homomorphic commitments
- 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
- 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} \)
- 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
- Improved multiplication triple generation over rings via RLWE-based AHE
- Improved single-round secure multiplication using regenerating codes
Cited In (12)
- Lightweight asynchronous verifiable secret sharing with optimal resilience
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP
- Amortized NISC over \(\mathbb{Z}_{2^k}\) from RMFE
- Degree-\(D\) reverse multiplication-friendly embeddings: constructions and applications
- ZK-for-Z2K: MPC-in-the-head zero-knowledge proofs for \(\mathbb{Z}_{2^k}\)
- Circuit amortization friendly encodingsand their application to statistically secure multiparty computation
- Title not available (Why is that?)
- Fully secure MPC and zk-FLIOP over rings: new constructions, improvements and extensions
- More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings
- Scalable multiparty computation from non-linear secret sharing
This page was built for publication: More efficient dishonest majority secure computation 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 Q6155261)
