MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture
From MaRDI portal
Recommendations
- Maliciously secure massively parallel computation for all-but-one corruptions
- Secure massively parallel computation for dishonest majority
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
- Secure Multiparty Computation
- MPC for tech giants (GMPC): enabling Gulliver and the Lilliputians to cooperate amicably
Cited in
(12)- Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)
- Yet another compiler for active security or: efficient MPC over arbitrary rings
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
- Secure massively parallel computation for dishonest majority
- High throughput secure MPC over small population in hybrid networks (extended abstract)
- Insured MPC: efficient secure computation with financial penalties
- MPC with synchronous security and asynchronous responsiveness
- Secure MPC: laziness leads to GOD
- MPC vs. SFE: Perfect Security in a Unified Corruption Model
- MPClan: protocol suite for privacy-conscious computations
- Maliciously secure massively parallel computation for all-but-one corruptions
- MPC for tech giants (GMPC): enabling Gulliver and the Lilliputians to cooperate amicably
This page was built for publication: MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875782)
