An efficient passive-to-active compiler for honest-majority MPC over rings
From MaRDI portal
Publication:2117048
Recommendations
- Yet another compiler for active security or: efficient MPC over arbitrary rings
- The price of active security in cryptographic protocols
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
- scientific article; zbMATH DE number 2009982
- Multiparty computation for dishonest majority: from passive to active security at low cost
Cites work
- scientific article; zbMATH DE number 7759457 (Why is no real title available?)
- Amortized complexity of information-theoretically secure MPC revisited
- Circuits resilient to additive attacks with applications to secure computation
- Communication-efficient unconditional MPC with guaranteed output delivery
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
- Efficient multi-party computation: from passive to active security via secure SIMD circuits
- Fast large-scale honest-majority MPC for malicious adversaries
- Field extension in secret-shared form and its applications to efficient secure computation
- Foundations of Cryptography
- Guaranteed output delivery comes free in honest majority MPC
- High-throughput secure three-party computation for malicious adversaries and an honest majority
- Improved primitives for secure multiparty integer computation
- Minimising communication in honest-majority MPC by batchwise multiplication verification
- Near-linear unconditionally-secure multiparty computation with a dishonest minority
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
- Scalable and Unconditionally Secure Multiparty Computation
- Secure multi-party computation without agreement
- Security and composition of multiparty cryptographic protocols
- Theory of Cryptography
- Yet another compiler for active security or: efficient MPC over arbitrary rings
- Zero-knowledge proofs on secret-shared data via fully linear PCPs
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
Cited in
(11)- 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
- scientific article; zbMATH DE number 2009982 (Why is no real title available?)
- Honest majority MPC with abort with minimal online communication
- The price of active security in cryptographic protocols
- The price of active security in cryptographic protocols
- MPClan: protocol suite for privacy-conscious computations
- Improved multiplication triple generation over rings via RLWE-based AHE
- A new approach to efficient and secure fixed-point computation
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)
