Anzeige
Erschienen in:
2014 | OriginalPaper | Buchkapitel
Efficient Three-Party Computation from Cut-and-Choose
verfasst von : Seung Geol Choi, Jonathan Katz, Alex J. Malozemoff, Vassilis Zikas
Erschienen in: Advances in Cryptology – CRYPTO 2014
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
With relatively few exceptions, the literature on efficient (practical) secure computation has focused on secure two-party computation (2PC). It is, in general, unclear whether the techniques used to construct practical 2PC protocols—in particular, the
cut-and-choose
approach—can be adapted to the multi-party setting.
In this work we explore the possibility of using cut-and-choose for practical secure
three-party
computation. The three-party case has been studied in prior work in the semi-honest setting, and is motivated by the observation that real-world deployments of multi-party computation are likely to involve few parties. We propose a constant-round protocol for three-party computation tolerating any number of malicious parties, whose computational cost is only a small constant worse than that of state-of-the-art two-party protocols.