Name
Title | ||
|---|---|---|
High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority. |
Abstract | ||
|---|---|---|
In this paper, we describe a new protocol for secure three-party computation of any functionality, with an honest majority and a malicious adversary. Our protocol has both an information-theoretic and computational variant, and is distinguished by extremely low communication complexity and very simple computation. We start from the recent semi-honest protocol of Araki et al. (ACM CCS 2016) in which the parties communicate only a single bit per AND gate, and modify it to be secure in the presence of malicious adversaries. Our protocol follows the paradigm of first constructing Beaver multiplication triples and then using them to verify that circuit gates are correctly computed. As in previous work (e.g., the so-called TinyOT and SPDZ protocols), we rely on the cut-and-choose paradigm to verify that triples are correctly constructed. We are able to utilize the fact that at most one of three parties is corrupted in order to construct an extremely simple and efficient method of constructing such triples. We also present an improved combinatorial analysis for this cut-and-choose which can be used to achieve improvements in other protocols using this approach. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-56614-6_8 | ADVANCES IN CRYPTOLOGY - EUROCRYPT 2017, PT II |
DocType | Volume | ISSN |
Conference | 10211 | 0302-9743 |
Citations | PageRank | References |
21 | 0.61 | 12 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jun Furukawa | 1 | 37 | 3.02 |
| Yehuda Lindell | 2 | 4194 | 215.46 |
| Ariel Nof | 3 | 93 | 6.24 |
| Or Weinstein | 4 | 21 | 0.61 |