Cryptology ePrint Archive: Report 2016/768

High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority

Toshinori Araki and Jun Furukawa and Yehuda Lindell and Ariel Nof and Kazuma Ohara

Abstract: In this paper, we describe a new information-theoretic protocol (and a computationally-secure variant) for secure {\em 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 \textit{1.3 million} AES computations per second, which involves processing over \textit{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.

Category / Keywords: cryptographic protocols / secure multiparty computation, honest majority, concrete efficiency, Kerberos

Original Publication (in the same form): ACM CCS 2016
DOI:
10.1145/2976749.2978331

Date: received 9 Aug 2016, last revised 10 Nov 2016

Contact author: lindell at biu ac il

Available format(s): PDF | BibTeX Citation

Version: 20161110:181046 (All versions of this report)

Short URL: ia.cr/2016/768

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]