Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
From MaRDI portal
Publication:2175924
DOI10.1007/978-3-030-36030-6_19zbMath1455.94203MaRDI QIDQ2175924
Ronald Cramer, Chen Yuan, M. Abspoel, Daniel E. Escudero, Ivan B. Damgård
Publication date: 30 April 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-36030-6_19
secure multi-party computation; linear secret sharing; multiplicative span programs; randomizing polynomials
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
94A60: Cryptography
68P25: Data encryption (aspects in computer science)
94A62: Authentication, digital signatures and secret sharing
Related Items
Rinocchio: SNARKs for ring arithmetic, MPClan: protocol suite for privacy-conscious computations, Attaining GOD beyond honest majority with friends and foes, More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings, Improved single-round secure multiplication using regenerating codes, Vector commitments over rings and compressed \(\varSigma \)-protocols, Doubly efficient interactive proofs over infinite and non-commutative rings, An efficient passive-to-active compiler for honest-majority MPC over rings, Sumcheck arguments and their applications, Efficient information-theoretic multi-party computation over non-commutative rings, Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices, Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC, Honest majority MPC with abort with minimal online communication, 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, An efficient threshold access-structure for RLWE-based multiparty homomorphic encryption
Cites Work
- Amortized complexity of information-theoretically secure MPC revisited
- On fast multiplication of polynomials over arbitrary algebras
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
- Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
- Perfectly-Secure MPC with Linear Communication Complexity
- Secure Multiparty Computation and Secret Sharing
- Shift-register synthesis and BCH decoding
- Theory of Cryptography
- Unnamed Item
- Unnamed Item
