Paper 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.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published by the IACR in TCC 2015
- Keywords
- Adaptive SecurityMultiparty ComputationIndistinguishability ObfuscationRound Complexity
- Contact author(s)
- antigoni @ cs au dk
- History
- 2015-03-18: revised
- 2014-10-21: received
- See all versions
- Short URL
- https://ia.cr/2014/844
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2014/844,
author = {Sanjam Garg and Antigoni Polychroniadou},
title = {Two-Round Adaptively Secure {MPC} from Indistinguishability Obfuscation},
howpublished = {Cryptology {ePrint} Archive, Paper 2014/844},
year = {2014},
url = {https://eprint.iacr.org/2014/844}
}
