The more the merrier: reducing the cost of large scale MPC
From MaRDI portal
Publication:2056763
DOI10.1007/978-3-030-77886-6_24OpenAlexW3157643836MaRDI QIDQ2056763FDOQ2056763
Authors: S. Dov Gordon, Daniel Starin, Arkady Yerukhimovich 
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-77886-6_24
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Computer system organization (68Mxx)
Cites Work
- Multiparty Computation from Somewhat Homomorphic Encryption
- Scalable and Unconditionally Secure Multiparty Computation
- Circuits resilient to additive attacks with applications to secure computation
- Perfectly-Secure MPC with Linear Communication Complexity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Scalable Secure Multiparty Computation
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- An O (log n ) expected rounds randomized byzantine generals protocol
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
- Fast large-scale honest-majority MPC for malicious adversaries
- Using TopGear in overdrive: a more efficient ZKPoK for SPDZ
- Overdrive: making SPDZ great again
- A Unified Approach to MPC with Preprocessing Using OT
- TinyKeys: a new approach to efficient multi-party computation
- The bottleneck complexity of secure multiparty computation
- Minimising communication in honest-majority MPC by batchwise multiplication verification
- The price of low communication in secure multi-party computation
- Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)
- When it's all just too much: outsourcing MPC-preprocessing
- The hidden graph model: communication locality and optimal resiliency with adaptive faults
- Efficient multi-party computation: from passive to active security via secure SIMD circuits
- Communication Locality in Secure Multi-party Computation
- Advances and Open Problems in Federated Learning
Cited In (8)
- Sharing transformation and dishonest majority MPC with packed secret sharing
- Reducing the Overhead of MPC over a Large Population
- Degree-\(D\) reverse multiplication-friendly embeddings: constructions and applications
- Le Mans: dynamic and fluid MPC for dishonest majority
- Secure multiparty computation with free branching
- Non-interactive zero-knowledge proofs to multiple verifiers
- MPClan: protocol suite for privacy-conscious computations
- Generalized pseudorandom secret sharing and efficient straggler-resilient secure computation
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)
