Paper 2015/987
Blazing Fast 2PC in the Offline/Online Setting with Security for Malicious Adversaries
Yehuda Lindell and Ben Riva
Abstract
Recently, several new techniques were presented to dramatically improve key parts of secure two-party computation (2PC) protocols that use the cut-and-choose paradigm on garbled circuits for 2PC with security against malicious adversaries. These include techniques for reducing the number of garbled circuits (Lindell 13, Huang et al.~13, Lindell and Riva 14, Huang et al.~14) and techniques for reducing the overheads besides garbled circuits (Mohassel and Riva 13, Shen and Shelat~13).
We design a highly optimized protocol in the offline/online setting that makes use of all state-of-the-art techniques, along with several new techniques that we introduce. A crucial part of our protocol is a new technique for enforcing consistency of the inputs used by the party who garbles the circuits. This technique has both theoretical and practical advantages over \mbox{previous methods.}
We present a prototype implementation of our new protocol, which is also the first implementation of the amortized cut-and-choose technique of Lindell and Riva (Crypto 2014).
Our prototype achieves a speed of just \emph{
Note: In previous versions, the bounds in Lemmas 2.3 and 2.4 were erroneously copied from [24]. This has been fixed in this version.
Metadata
- Available format(s)
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Major revision. ACM CCS 2015
- Keywords
- Yaoofflineonlineconsistency checkimplementation
- Contact author(s)
- lindell @ biu ac il
- History
- 2016-06-21: revised
- 2015-10-13: received
- See all versions
- Short URL
- https://ia.cr/2015/987
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2015/987, author = {Yehuda Lindell and Ben Riva}, title = {Blazing Fast {2PC} in the Offline/Online Setting with Security for Malicious Adversaries}, howpublished = {Cryptology {ePrint} Archive, Paper 2015/987}, year = {2015}, url = {https://eprint.iacr.org/2015/987} }