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. © 2014 International Association for Cryptologic Research.
CITATION STYLE
Choi, S. G., Katz, J., Malozemoff, A. J., & Zikas, V. (2014). Efficient three-party computation from cut-and-choose. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8617 LNCS, pp. 513–530). Springer Verlag. https://doi.org/10.1007/978-3-662-44381-1_29
Mendeley helps you to discover research relevant for your work.