Welcome to the resource topic for 2017/1003
Title:
Secure Multi-Party Computation in Large Networks
Authors: Varsha Dani, Valerie King, Mahnush Movahedi, Jared Saia, Mahdi Zamani
Abstract:We describe scalable protocols for solving the secure multi-party computation (MPC) problem among a significant 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 1/3 fraction of the parties. In the asynchronous environment, we allow the adversary to corrupt less than a 1/8 fraction of parties. For any deterministic function that can be computed by an arithmetic circuit with m gates, both of our protocols require each party to send a number of messages and perform an amount of computation that is \tilde{O}(m/n + \sqrt n). We also show that our protocols provide statistical and universally-composable security. To achieve our asynchronous MPC result, we define the 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 O(\log{n}), and can also be used for designing other load-balanced applications in the asynchronous communication model.
ePrint: https://eprint.iacr.org/2017/1003
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .