Efficient three-party computation from cut-and-choose

Seung Geol Choi, Jonathan Katz, Alex J. Malozemoff, Vassilis Zikas

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

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.

Original languageEnglish
Title of host publicationAdvances in Cryptology - CRYPTO 2014
Subtitle of host publication34th Annual Cryptology Conference, Proceedings
EditorsJuan A. Garay, Rosario Gennaro
Place of PublicationBerlin, Heidelberg
Number of pages18
EditionPART 2
ISBN (Electronic)978-3-662-44381-1
ISBN (Print)978-3-662-44380-4
Publication statusPublished - 21 Aug 2014
Event34rd Annual International Cryptology Conference - Santa Barbara, United States
Duration: 17 Aug 201421 Aug 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer, Berlin, Heidelberg
NumberPart II
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference34rd Annual International Cryptology Conference
Abbreviated titleCRYPTO 2014
Country/TerritoryUnited States
CitySanta Barbara
Internet address


Dive into the research topics of 'Efficient three-party computation from cut-and-choose'. Together they form a unique fingerprint.

Cite this