Secure multi-party computation in large networks
From MaRDI portal
Abstract: We describe scalable protocols for solving the secure multi-party computation (MPC) problem among a large number of parties. We consider both the synchronous and the asynchronous communication models. In the synchronous setting, our protocol is secure against a static malicious adversary corrupting less than a fraction of the parties. In the asynchronous setting, we allow the adversary to corrupt less than a fraction of parties. For any deterministic function that can be computed by an arithmetic circuit with gates, both of our protocols require each party to send a number of field elements and perform an amount of computation that is . We also show that our protocols provide perfect and universally-composable security. To achieve our asynchronous MPC result, we define the emph{threshold counting problem} and present a distributed protocol to solve it in the asynchronous setting. This protocol is load balanced, with computation, communication and latency complexity of , and can also be used for designing other load-balanced applications in the asynchronous communication model.
Recommendations
- Simple and Efficient Perfectly-Secure Asynchronous MPC
- Asynchronous Multiparty Computation: Theory and Implementation
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
- scientific article; zbMATH DE number 1583939
- Asynchronous secure multiparty computation in constant time
Cites work
- scientific article; zbMATH DE number 1583939 (Why is no real title available?)
- scientific article; zbMATH DE number 4101088 (Why is no real title available?)
- scientific article; zbMATH DE number 46532 (Why is no real title available?)
- scientific article; zbMATH DE number 176564 (Why is no real title available?)
- scientific article; zbMATH DE number 1256784 (Why is no real title available?)
- scientific article; zbMATH DE number 1179121 (Why is no real title available?)
- scientific article; zbMATH DE number 1955785 (Why is no real title available?)
- scientific article; zbMATH DE number 3273551 (Why is no real title available?)
- (Leveled) fully homomorphic encryption without bootstrapping
- A full proof of the BGW protocol for perfectly secure multiparty computation
- Asynchronous Multiparty Computation: Theory and Implementation
- Asynchronous secure computation
- Brief announcement: Breaking the \(O(nm)\) bit barrier, secure multiparty computation with a static adversary
- Communication Locality in Secure Multi-party Computation
- Fast Byzantine agreement
- Fast perfect-information leader-election protocols with linear immunity
- Fault Tolerance in Networks of Bounded Degree
- Foundations of Cryptography
- Foundations of Cryptography
- Fully homomorphic encryption using ideal lattices
- How to run Turing machines on encrypted data
- How to share a secret
- Information-theoretically secure protocols and security under composition
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
- Polynomial Codes Over Certain Finite Fields
- Practically efficient multi-party sorting protocols from comparison sort algorithms
- Probability and Computing
- Resilient-optimal interactive consistency in constant time
- Scalable Multiparty Computation with Nearly Optimal Work and Resilience
- Scalable Secure Multiparty Computation
- Scalable and Unconditionally Secure Multiparty Computation
- Scalable leader election
- Secure Multi-party Shuffling
- Secure multiparty computation goes live
- Security and composition of multiparty cryptographic protocols
- Simple and Efficient Perfectly-Secure Asynchronous MPC
- Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
- Software protection and simulation on oblivious RAMs
Cited in
(25)- Network agnostic MPC with statistical security
- Asynchronous Multiparty Computation: Theory and Implementation
- Simple and Efficient Perfectly-Secure Asynchronous MPC
- MPC with delayed parties over star-like networks
- scientific article; zbMATH DE number 1303136 (Why is no real title available?)
- Secure Protocols with Asymmetric Trust
- On Secure Multi-party Computation in Black-Box Groups
- Batch secret sharing for secure multi-party computation in asynchronous network
- Size-Hiding Computation for Multiple Parties
- Scalable Multiparty Computation with Nearly Optimal Work and Resilience
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
- Secure \(k\)-skyband computation framework in distributed multi-party databases
- Recent results in scalable multi-party computation
- Asymmetric multi-party computation
- Phoenix: secure computation in an unstable network with dropouts and comebacks
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
- Fast large-scale honest-majority MPC for malicious adversaries
- MPC for tech giants (GMPC): enabling Gulliver and the Lilliputians to cooperate amicably
- Must the communication graph of MPC protocols be an expander?
- Scalable agreement protocols with optimal optimistic efficiency
- Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation?
- Asynchronous secure multiparty computation in constant time
- Constant-round asynchronous multi-party computation based on one-way functions
- Brief announcement: Breaking the \(O(nm)\) bit barrier, secure multiparty computation with a static adversary
- Scalable Secure Multiparty Computation
This page was built for publication: Secure multi-party computation in large networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2401120)
