Paper 2017/062
Efficient Maliciously Secure Two Party Computation for Mixed Programs
Arash Afshar, 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.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- secure computation
- Contact author(s)
- aafshar @ ucalgary ca
- History
- 2017-01-31: received
- Short URL
- https://ia.cr/2017/062
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2017/062,
author = {Arash Afshar and Payman Mohassel and Mike Rosulek},
title = {Efficient Maliciously Secure Two Party Computation for Mixed Programs},
howpublished = {Cryptology {ePrint} Archive, Paper 2017/062},
year = {2017},
url = {https://eprint.iacr.org/2017/062}
}
