Cryptology ePrint Archive: Report 2018/572

Round-Optimal Secure Multiparty Computation with Honest Majority

Prabhanjan Ananth and Arka Rai Choudhuri and Aarushi Goel and Abhishek Jain

Abstract: We study the exact round complexity of secure multiparty computation (MPC) in the honest majority setting. We construct several round-optimal $n$-party protocols, tolerating any $t<\frac{n}{2}$ corruptions.

- Security with abort: We give the first construction of two round MPC for general functions that achieves security with abort against malicious adversaries in the plain model. The security of our protocol only relies on one-way functions.

- Guaranteed output delivery: We also construct protocols that achieve security with guaranteed output delivery: (i) Against fail-stop adversaries, we construct two round MPC either in the (bare) public-key infrastructure model with no additional assumptions, or in the plain model assuming two-round semi-honest oblivious transfer. In three rounds, however, we can achieve security assuming only one-way functions. (ii) Against malicious adversaries, we construct three round MPC in the plain model, assuming public-key encryption and Zaps. Previously, such protocols were only known based on specific learning assumptions and required the use of common reference strings.

All of our results are obtained via general compilers that may be of independent interest.

Category / Keywords: Secure Computation

Original Publication (in the same form): IACR-CRYPTO-2018

Date: received 3 Jun 2018, last revised 10 Sep 2018

Contact author: prabhanjan at csail mit edu, achoud at cs jhu edu, agoel10 at jhu edu, abhishek at cs jhu edu

Available format(s): PDF | BibTeX Citation

Note: Added citation to concurrent work

Version: 20180910:074731 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]