Paper 2014/872 Original: eprint.iacr.org/2014/872 ↗
Recent Results in Scalable Multi-Party Computation
Abstract
Secure multi-party computation (MPC) allows multiple parties to compute a known function over inputs held by each party, without any party having to reveal its private input. Unfortunately, traditional MPC algorithms do not scale well to large numbers of parties. In this paper, we describe several recent MPC algorithms that are designed to handle large networks. All of these algorithms rely on recent techniques from the Byzantine agreement literature on forming and using quorums. Informally, a quorum is a small set of parties, most of which are trustworthy. We describe the advantages and disadvantages of these scalable algorithms, and we propose new ideas for improving practicality of current techniques. Finally, we conduct simulations to measure bandwidth cost for several current MPC algorithms.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2014-10-22: last updated
- 2014-10-22: published
- Short URL
- https://ia.cr/2014/872
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2014/872,
author = {Jared Saia and Mahdi Zamani},
title = {Recent Results in Scalable Multi-Party Computation},
howpublished = {Cryptology {ePrint} Archive, Paper 2014/872},
year = {2014},
url = {https://eprint.iacr.org/2014/872}
}