Paper 2014/845 Original: eprint.iacr.org/2014/845 ↗
Adaptively secure two-party computation from indistinguishability obfuscation
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.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2016-02-23: last updated
- 2014-10-21: published
- Short URL
- https://ia.cr/2014/845
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2014/845,
author = {Ran Canetti and Shafi Goldwasser and Oxana Poburinnaya},
title = {Adaptively secure two-party computation from indistinguishability obfuscation},
howpublished = {Cryptology {ePrint} Archive, Paper 2014/845},
year = {2014},
url = {https://eprint.iacr.org/2014/845}
}