An efficient passive-to-active compiler for honest-majority MPC over rings
From MaRDI portal
Publication:2117048
DOI10.1007/978-3-030-78375-4_6zbMath1490.68077OpenAlexW2990913254MaRDI QIDQ2117048
Ariel Nof, M. Abspoel, Anders Dalskov, Daniel E. Escudero
Publication date: 21 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-78375-4_6
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Theory of compilers and interpreters (68N20) Authentication, digital signatures and secret sharing (94A62)
Related Items (4)
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 ⋮ MPClan: protocol suite for privacy-conscious computations ⋮ Attaining GOD beyond honest majority with friends and foes
Uses Software
Cites Work
- Unnamed Item
- Fast large-scale honest-majority MPC for malicious adversaries
- Amortized complexity of information-theoretically secure MPC revisited
- Minimising communication in honest-majority MPC by batchwise multiplication verification
- \(\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
- Security and composition of multiparty cryptographic protocols
- Guaranteed output delivery comes free in honest majority MPC
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
- Field extension in secret-shared form and its applications to efficient secure computation
- Zero-knowledge proofs on secret-shared data via fully linear PCPs
- Communication-efficient unconditional MPC with guaranteed output delivery
- Secure multi-party computation without agreement
- Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
- Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits
- Improved Primitives for Secure Multiparty Integer Computation
- Scalable and Unconditionally Secure Multiparty Computation
- Foundations of Cryptography
- Circuits resilient to additive attacks with applications to secure computation
- High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority
- Theory of Cryptography
This page was built for publication: An efficient passive-to-active compiler for honest-majority MPC over rings
