Cryptology ePrint Archive: Report 2016/632

Faster Malicious 2-party Secure Computation with Online/Ofine Dual Execution

Peter Rindal and Mike Rosulek

Abstract: We describe a highly optimized protocol for general-purpose secure two-party computation (2PC) in the presence of malicious adversaries. Our starting point is a protocol of Kolesnikov \etal (TCC 2015). We adapt that protocol to the online/offline setting, where two parties repeatedly evaluate the same function (on possibly different inputs each time) and perform as much of the computation as possible in an offline preprocessing phase before their inputs are known. Along the way we develop several significant simplifications and optimizations to the protocol.

We have implemented a prototype of our protocol and report on its performance. When two parties on Amazon servers in the same region use our implementation to securely evaluate the AES circuit 1024 times, the amortized cost per evaluation is \emph{5.1ms offline + 1.3ms online}. The total offline+online cost of our protocol is in fact less than the \emph{online} cost of any reported protocol with malicious security. For comparison, our protocol's closest competitor (Lindell \& Riva, CCS 2015) uses 74ms offline + 7ms online in an identical setup.

Our protocol can be further tuned to trade performance for leakage. As an example, the performance in the above scenario improves to \emph{2.4ms offline + 1.0ms online} if we allow an adversary to learn a single bit about the honest party's input with probability $2^{-20}$ (but not violate any other security property, e.g. correctness).

Category / Keywords: cryptographic protocols / secure computation, garbled circuits, dual execution

Original Publication (with major differences): USENIX 2016

Date: received 17 Jun 2016

Contact author: rindalp at oregonstate edu

Available format(s): PDF | BibTeX Citation

Version: 20160621:153730 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]