The more the merrier: reducing the cost of large scale MPC

DOI10.1007/978-3-030-77886-6_24OpenAlexW3157643836MaRDI QIDQ2056763

Daniel Starin, S. Dov Gordon, Arkady Yerukhimovich

Publication date: 8 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-77886-6_24

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer system organization (68Mxx)

Related Items (6)

Secure multiparty computation with free branching ⋮ Le Mans: dynamic and fluid MPC for dishonest majority ⋮ MPClan: protocol suite for privacy-conscious computations ⋮ Sharing transformation and dishonest majority MPC with packed secret sharing ⋮ Non-interactive zero-knowledge proofs to multiple verifiers ⋮ Generalized pseudorandom secret sharing and efficient straggler-resilient secure computation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast large-scale honest-majority MPC for malicious adversaries
• Using TopGear in overdrive: a more efficient ZKPoK for SPDZ
• Overdrive: making SPDZ great again
• 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
• A Unified Approach to MPC with Preprocessing Using OT
• Multiparty Computation from Somewhat Homomorphic Encryption
• Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
• The Hidden Graph Model
• Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits
• Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
• Scalable and Unconditionally Secure Multiparty Computation
• An O (log n ) expected rounds randomized byzantine generals protocol
• Communication Locality in Secure Multi-party Computation
• Advances and Open Problems in Federated Learning
• Circuits resilient to additive attacks with applications to secure computation
• Perfectly-Secure MPC with Linear Communication Complexity
• Scalable Secure Multiparty Computation
• TinyKeys: a new approach to efficient multi-party computation

This page was built for publication: The more the merrier: reducing the cost of large scale MPC