Cryptology ePrint Archive: Report 2014/844

Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation

Sanjam Garg and Antigoni Polychroniadou

Abstract: Adaptively secure Multi-Party Computation (MPC) first studied by Canetti, Feige, Goldreich, and Naor in 1996, is a fundamental notion in cryptography. Adaptive security is particularly hard to achieve in settings where arbitrary number of parties can be corrupted and honest parties are not trusted to properly erase their internal state. We did not know how to realize constant round protocols for this task even if we were to restrict ourselves to semi-honest adversaries and to the simpler two-party setting. Specifically the round complexity of known protocols grows with the depth of the circuit the parties are trying to compute.

In this work, using indistinguishability obfuscation, we construct the first UC two-round Multi-Party computation protocol secure against any active, adaptive adversary corrupting an arbitrary number of parties.

Category / Keywords: cryptographic protocols / Adaptive Security, Multiparty Computation, Indistinguishability Obfuscation, Round Complexity

Original Publication (in the same form): IACR-TCC-2015

Date: received 16 Oct 2014, last revised 17 Mar 2015

Contact author: antigoni at cs au dk

Available format(s): PDF | BibTeX Citation

Version: 20150318:052445 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]