Cryptology ePrint Archive: Report 2013/601

Two-round secure MPC from Indistinguishability Obfuscation

Sanjam Garg and Craig Gentry and Shai Halevi and Mariana Raykova

Abstract: 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.

Category / Keywords: public-key cryptography / Multilinear Maps, Indistinguishability Obfuscation, Multiparty Secure Computation

Date: received 17 Sep 2013

Contact author: sanjamg at cs ucla edu, craigbgentry@gmail com,shaih@alum mit edu,mariana@cs columbia edu