Paper 2013/601

Two-round secure MPC from Indistinguishability Obfuscation

Sanjam Garg, Craig Gentry, Shai Halevi, and Mariana Raykova


One fundamental complexity measure of an MPC protocol is its {\em round complexity}. Asharov et al. recently constructed the first three-round protocol for general MPC in the CRS model. Here, we show how to achieve this result with only two rounds. We obtain UC security with abort against static malicious adversaries, and fairness if there is an honest majority. Additionally the communication in our protocol is only proportional to the input and output size of the function being evaluated and independent of its circuit size. Our main tool is indistinguishability obfuscation, for which a candidate construction was recently proposed by Garg et al. The technical tools that we develop in this work also imply virtual black box obfuscation of a new primitive that we call a \emph{dynamic point function}. This primitive may be of independent interest.

Available format(s)
Public-key cryptography
Publication info
Multilinear MapsIndistinguishability ObfuscationMultiparty Secure Computation
Contact author(s)
sanjamg @ cs ucla edu
craigbgentry @ gmail com
shaih @ alum mit edu
mariana @ cs columbia edu
2013-09-19: received
Short URL
Creative Commons Attribution


      author = {Sanjam Garg and Craig Gentry and Shai Halevi and Mariana Raykova},
      title = {Two-round secure MPC from Indistinguishability Obfuscation},
      howpublished = {Cryptology ePrint Archive, Paper 2013/601},
      year = {2013},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.