Cryptology ePrint Archive: Report 2014/845

Adaptively secure two-party computation from indistinguishability obfuscation

Ran Canetti and Shafi Goldwasser and Oxana Poburinnaya

Abstract: We present the first two-round, two-party general function evaluation protocol that is secure against honest-but-curious adaptive corruption of both parties. In addition, the protocol is incoercible for one of the parties, and fully leakage tolerant. It requires a global (non-programmable) reference string and is based on one way functions and general-purpose indistinguishability obfuscation with sub-exponential security, as well as augmented non-committing encryption.

A Byzantine version of the protocol, obtained by applying the Canetti et al. [STOC 02] compiler, achieves UC security with comparable efficiency parameters, but is no longer incoercible.

Category / Keywords: cryptographic protocols /

Original Publication (with major differences): IACR-TCC-2015

Date: received 16 Oct 2014, last revised 22 Feb 2016

Contact author: oxanapob at bu edu

Available format(s): PDF | BibTeX Citation

Version: 20160223:012320 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]