Name
Abstract | ||
|---|---|---|
In this paper, we describe a new information-theoretic protocol (and a computationally-secure variant) for secure three-party computation with an honest majority. The protocol has very minimal computation and communication; for Boolean circuits, each party sends only a single bit for every AND gate (and nothing is sent for XOR gates). Our protocol is (simulation-based) secure in the presence of semi-honest adversaries, and achieves privacy in the client/server model in the presence of malicious adversaries. On a cluster of three 20-core servers with a 10Gbps connection, the implementation of our protocol carries out over 1.3 million AES computations per second, which involves processing over 7 billion gates per second. In addition, we developed a Kerberos extension that replaces the ticket-granting-ticket encryption on the Key Distribution Center (KDC) in MIT-Kerberos with our protocol, using keys/ passwords that are shared between the servers. This enables the use of Kerberos while protecting passwords. Our implementation is able to support a login storm of over 35,000 logins per second, which suffices even for very large organizations. Our work demonstrates that high-throughput secure computation is possible on standard hardware. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1145/2976749.2978331 | IACR Cryptology ePrint Archive |
DocType | Volume | Citations |
Conference | 2016 | 44 |
PageRank | References | Authors |
1.31 | 14 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Toshinori Araki | 1 | 59 | 3.62 |
| Jun Furukawa | 2 | 357 | 18.35 |
| Yehuda Lindell | 3 | 4194 | 215.46 |
| Ariel Nof | 4 | 93 | 6.24 |
| Kazuma Ohara | 5 | 74 | 5.34 |