The more the merrier: reducing the cost of large scale MPC
From MaRDI portal
Publication:2056763
Cites work
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 176564 (Why is no real title available?)
- A Unified Approach to MPC with Preprocessing Using OT
- Advances and Open Problems in Federated Learning
- An O (log n ) expected rounds randomized byzantine generals protocol
- Circuits resilient to additive attacks with applications to secure computation
- Communication Locality in Secure Multi-party Computation
- Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)
- Efficient multi-party computation: from passive to active security via secure SIMD circuits
- Fast large-scale honest-majority MPC for malicious adversaries
- Minimising communication in honest-majority MPC by batchwise multiplication verification
- Multiparty Computation from Somewhat Homomorphic Encryption
- Overdrive: making SPDZ great again
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Perfectly-Secure MPC with Linear Communication Complexity
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
- Scalable Secure Multiparty Computation
- Scalable and Unconditionally Secure Multiparty Computation
- The bottleneck complexity of secure multiparty computation
- The hidden graph model: communication locality and optimal resiliency with adaptive faults
- The price of low communication in secure multi-party computation
- TinyKeys: a new approach to efficient multi-party computation
- Using TopGear in overdrive: a more efficient ZKPoK for SPDZ
- When it's all just too much: outsourcing MPC-preprocessing
Cited in
(8)- MPClan: protocol suite for privacy-conscious computations
- Non-interactive zero-knowledge proofs to multiple verifiers
- Degree-\(D\) reverse multiplication-friendly embeddings: constructions and applications
- Generalized pseudorandom secret sharing and efficient straggler-resilient secure computation
- Reducing the Overhead of MPC over a Large Population
- Le Mans: dynamic and fluid MPC for dishonest majority
- Sharing transformation and dishonest majority MPC with packed secret sharing
- Secure multiparty computation with free branching
This page was built for publication: The more the merrier: reducing the cost of large scale MPC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2056763)
