## CryptoDB

### Paper: Optimizing Authenticated Garbling for Faster Secure Two-Party Computation

Authors: Jonathan Katz Samuel Ranellucci Mike Rosulek Xiao Wang DOI: 10.1007/978-3-319-96878-0_13 (login may be required) Search ePrint Search Google CRYPTO 2018 Wang et al. (CCS 2017) recently proposed a protocol for malicious secure two-party computation that represents the state-of-the-art with regard to concrete efficiency in both the single-execution and amortized settings, with or without preprocessing. We show here several optimizations of their protocol that result in a significant improvement in the overall communication and running time. Specifically:We show how to make the “authenticated garbling” at the heart of their protocol compatible with the half-gate optimization of Zahur et al. (Eurocrypt 2015). We also show how to avoid sending an information-theoretic MAC for each garbled row. These two optimizations give up to a 2.6$\times$× improvement in communication, and make the communication of the online phase essentially equivalent to that of state-of-the-art semi-honest secure computation.We show various optimizations to their protocol for generating AND triples that, overall, result in a 1.5$\times$× improvement in the communication and a 2$\times$× improvement in the computation for that step.
##### BibTeX
@inproceedings{crypto-2018-28792,
title={Optimizing Authenticated Garbling for Faster Secure Two-Party Computation},
booktitle={Advances in Cryptology – CRYPTO 2018},
series={Lecture Notes in Computer Science},
publisher={Springer},
volume={10993},
pages={365-391},
doi={10.1007/978-3-319-96878-0_13},
author={Jonathan Katz and Samuel Ranellucci and Mike Rosulek and Xiao Wang},
year=2018
}