Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
From MaRDI portal
Publication:2129015
DOI10.1007/978-3-030-84252-9_22zbMath1487.94152OpenAlexW3187633241MaRDI QIDQ2129015
Matthieu Rambaud, Ronald Cramer, Xing, Chaoping
Publication date: 22 April 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84252-9_22
Related Items (5)
Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\) ⋮ Field instruction multiple data ⋮ Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings ⋮ Sharing transformation and dishonest majority MPC with packed secret sharing ⋮ More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Amortized complexity of information-theoretically secure MPC revisited
- Computing Riemann-Roch spaces in algebraic function fields and related topics.
- Secure computation with constant communication overhead using multiplication embeddings
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- Yet another compiler for active security or: efficient MPC over arbitrary rings
- Algebraic geometric codes over rings
- Modular and \(p\)-adic cyclic codes
- Constant-overhead unconditionally secure multiparty computation over binary fields
- Guaranteed output delivery comes free in honest majority MPC
- An efficient passive-to-active compiler for honest-majority MPC over rings
- 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
- Communication lower bounds for statistically secure MPC, with or without preprocessing
- Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \)
- Circuit amortization friendly encodingsand their application to statistically secure multiparty computation
- Multiparty Computation from Somewhat Homomorphic Encryption
- Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
- Torsion Limits and Riemann-Roch Systems for Function Fields and Applications
- Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field
- Secret Sharing Schemes with Algebraic Properties and Applications
- Algebraic Function Fields and Codes
- Linear algebra algorithms for divisors on an algebraic curve
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound
- List decoding of algebraic-geometric codes
- A fast randomized geometric algorithm for computing Riemann-Roch spaces
- Subquadratic Time Encodable Codes Beating the Gilbert–Varshamov Bound
- Perfectly-Secure MPC with Linear Communication Complexity
- Secure Multiparty Computation and Secret Sharing
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
- Theory of Cryptography
This page was built for publication: Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
