Cryptology ePrint Archive: Report 2014/872

Recent Results in Scalable Multi-Party Computation

Jared Saia and Mahdi Zamani

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.

Category / Keywords: cryptographic protocols / Multi-Party Computation; Byzantine Fault Tolerance

Original Publication (in the same form): 41st International Conference on Current Trends in Theory and Practice of Computer Science

Date: received 22 Oct 2014

Contact author: zamani at cs unm edu

Available format(s): PDF | BibTeX Citation

Version: 20141022:205940 (All versions of this report)

Short URL: ia.cr/2014/872

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]