Cryptology ePrint Archive: Report 2018/180

Two-Round Multiparty Secure Computation Minimizing Public Key Operations

Sanjam Garg and Peihan Miao and Akshayaram Srinivasan

Abstract: We show new constructions of semi-honest and malicious two-round multiparty secure computation protocols using only (a fixed) $\mathsf{poly}(n,\lambda)$ invocations of a two-round oblivious transfer protocol (which use expensive public-key operations) and $\mathsf{poly}(\lambda, |C|)$ cheaper one-way function calls, where $\lambda$ is the security parameter, $n$ is the number of parties, and $C$ is the circuit being computed. All previously known two-round multiparty secure computation protocols required $\mathsf{poly}(\lambda,|C|)$ expensive public-key operations.

Category / Keywords: cryptographic protocols /

Date: received 13 Feb 2018, last revised 16 Feb 2018

Contact author: akshayaram at berkeley edu

Available format(s): PDF | BibTeX Citation

Version: 20180216:164053 (All versions of this report)

Short URL: ia.cr/2018/180

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]