International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: On Achieving the "Best of Both Worlds" in Secure Multiparty Computation

Authors:
Yuval Ishai
Jonathan Katz
Eyal Kushilevitz
Yehuda Lindell
Erez Petrank
Download:
URL: http://eprint.iacr.org/2010/029
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2010-22930,
  title={On Achieving the "Best of Both Worlds" in Secure Multiparty Computation},
  booktitle={IACR Eprint archive},
  keywords={foundations / secure computation, guaranteed output delivery, privacy},
  url={http://eprint.iacr.org/2010/029},
  note={This is a full version of the combination of two papers by the authors. The first paper by Ishai, Kushilevitz, Lindell and Petrank appeared at CRYPTO 2006 and the second paper by Katz appeared at STOC 2007. lindell@cs.biu.ac.il 14629 received 20 Jan 2010},
  author={Yuval Ishai and Jonathan Katz and Eyal Kushilevitz and Yehuda Lindell and Erez Petrank},
  year=2010
}