Paper 2010/029 Original: eprint.iacr.org/2010/029 ↗
On Achieving the "Best of Both Worlds" in Secure Multiparty Computation
Abstract
Two settings are traditionally considered for secure multiparty computation, depending on whether or not a majority of the parties are assumed to be honest. Protocols designed under this assumption provide ``full security'' (and, in particular, guarantee output delivery and fairness) when this assumption holds; unfortunately, these protocols are completely insecure if this assumption is violated. On the other hand, protocols tolerating an arbitrary number of corruptions do not guarantee fairness or output delivery even if only a \emph{single} party is dishonest. It is natural to wonder whether it is possible to achieve the ``best of both worlds'': namely, a single protocol that simultaneously achieves the best possible security in both the above settings. Here, we rule out this possibility (at least for general functionalities) but show some positive results regarding what \emph{can} be achieved.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2010-01-22: last updated
- 2010-01-22: published
- Short URL
- https://ia.cr/2010/029
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2010/029,
author = {Yuval Ishai and Jonathan Katz and Eyal Kushilevitz and Yehuda Lindell and Erez Petrank},
title = {On Achieving the "Best of Both Worlds" in Secure Multiparty Computation},
howpublished = {Cryptology {ePrint} Archive, Paper 2010/029},
year = {2010},
url = {https://eprint.iacr.org/2010/029}
}