Paper 2014/128
Efficient Three-Party Computation from Cut-and-Choose
Seung Geol Choi, Jonathan Katz, Alex J. Malozemoff, and Vassilis Zikas
Abstract
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 essentially only a small constant worse than that of state-of-the-art two-party protocols.
Note: - Corrected computation/communication costs. - Cleaned up some writing. - Updated motivation for 3PC.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- A major revision of an IACR publication in CRYPTO 2014
- Keywords
- secure computation
- Contact author(s)
- amaloz @ cs umd edu
- History
- 2014-06-27: revised
- 2014-02-24: received
- See all versions
- Short URL
- https://ia.cr/2014/128
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2014/128,
author = {Seung Geol Choi and Jonathan Katz and Alex J. Malozemoff and Vassilis Zikas},
title = {Efficient Three-Party Computation from Cut-and-Choose},
howpublished = {Cryptology {ePrint} Archive, Paper 2014/128},
year = {2014},
url = {https://eprint.iacr.org/2014/128}
}
