Two-Round Multiparty Secure Computation from Minimal Assumptions

Sanjam Garg; Akshayaram Srinivasan

Paper 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.

Metadata

Available format(s): PDF
Category: Foundations
Publication info: A minor revision of an IACR publication in EUROCRYPT 2018
Contact author(s): akshayaram @ berkeley edu
History: 2020-03-08: last of 2 revisions; 2017-11-29: received; See all versions
Short URL: https://ia.cr/2017/1156
License: CC BY

BibTeX

@misc{cryptoeprint:2017/1156,
      author = {Sanjam Garg and Akshayaram Srinivasan},
      title = {Two-Round Multiparty Secure Computation from Minimal Assumptions},
      howpublished = {Cryptology {ePrint} Archive, Paper 2017/1156},
      year = {2017},
      url = {https://eprint.iacr.org/2017/1156}
}