Cryptology ePrint Archive: Report 2017/062

Efficient Maliciously Secure Two Party Computation for Mixed Programs

Arash Afshar and Payman Mohassel and Mike Rosulek

Abstract: We propose a new approach for practical secure two-party computation (2PC) achieving security in the presence of malicious adversaries. Given a program to compute, the idea is to identify subcomputations that depend on only one or neither of the parties’ private inputs. Such computations can be secured at significantly lower cost, using different protocol paradigms for each case. We then show how to securely connect these subprotocols together, and with standard 2PC yielding our new approach for 2PC for mixed programs. Our empirical evaluations confirm that the mixed-2PC approach outperforms state-of-the-art monolithic 2PC protocols for most computations.

Category / Keywords: cryptographic protocols / secure computation

Date: received 27 Jan 2017

Contact author: aafshar at ucalgary ca

Available format(s): PDF | BibTeX Citation

Version: 20170131:151935 (All versions of this report)

Short URL: ia.cr/2017/062

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]