Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
Name
2014-845.pdf
Description
Accepted version
Size
391.81 KB
Format
Adobe PDF
Checksum (MD5)
9fd672c9cc60d783b672eb8539c92790
Author(s)
Canetti, Ran
Goldwasser, Shafi
Poburinnaya, Oxana
Date Issued
2015
Publisher
Springer Nature America, Inc
Version
Author's final manuscript
Abstract
© International Association for Cryptologic Research 2015. 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 (nonprogrammable) 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.1.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-662-46497-7_22
