Cryptology ePrint Archive: Report 2017/1156

Two-Round Multiparty Secure Computation from Minimal Assumptions

Sanjam Garg and Akshayaram Srinivasan

Abstract: We provide new two-round multiparty secure computation (MPC) protocols assuming the minimal assumption that two-round oblivious transfer (OT) exists. If the assumed two-round OT protocol is secure against semi-honest adversaries (in the plain model) then so is our two-round MPC protocol. Similarly, if the assumed two-round OT protocol is secure against malicious adversaries (in the common random/reference string model) then so is our two-round MPC protocol. Previously, two-round MPC protocols were only known under relatively stronger computational assumptions. Finally, we provide several extensions.

Category / Keywords: foundations /

Date: received 28 Nov 2017

Contact author: akshayaram at berkeley edu

Available format(s): PDF | BibTeX Citation

Version: 20171129:155241 (All versions of this report)

Short URL: ia.cr/2017/1156

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]