An efficient passive-to-active compiler for honest-majority MPC over rings
From MaRDI portal
Publication:2117048
DOI10.1007/978-3-030-78375-4_6zbMATH Open1490.68077OpenAlexW2990913254MaRDI QIDQ2117048FDOQ2117048
Daniel E. Escudero, Ariel Nof, M. Abspoel, Anders Dalskov
Publication date: 21 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-78375-4_6
Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Theory of compilers and interpreters (68N20) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Title not available (Why is that?)
- Security and composition of multiparty cryptographic protocols
- Foundations of Cryptography
- Scalable and Unconditionally Secure Multiparty Computation
- Circuits resilient to additive attacks with applications to secure computation
- Theory of Cryptography
- Secure multi-party computation without agreement
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
- Fast large-scale honest-majority MPC for malicious adversaries
- Amortized complexity of information-theoretically secure MPC revisited
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- Improved Primitives for Secure Multiparty Integer Computation
- High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority
- Yet another compiler for active security or: efficient MPC over arbitrary rings
- Minimising communication in honest-majority MPC by batchwise multiplication verification
- Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
- Guaranteed output delivery comes free in honest majority MPC
- Zero-knowledge proofs on secret-shared data via fully linear PCPs
- Communication-efficient unconditional MPC with guaranteed output delivery
- Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits
- 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
Cited In (7)
- Attaining GOD beyond honest majority with friends and foes
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
- MPC for \(\mathcal{Q}_2\) access structures over rings and fields
- Yet another compiler for active security or: efficient MPC over arbitrary rings
- Honest majority MPC with abort with minimal online communication
- MPClan: protocol suite for privacy-conscious computations
- A new approach to efficient and secure fixed-point computation
Uses Software
This page was built for publication: An efficient passive-to-active compiler for honest-majority MPC over rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117048)
