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 × 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 × improvement in the communication and a 2 × improvement in the computation for that step.
CITATION STYLE
Katz, J., Ranellucci, S., Rosulek, M., & Wang, X. (2018). Optimizing authenticated garbling for faster secure two-party computation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10993 LNCS, pp. 365–391). Springer Verlag. https://doi.org/10.1007/978-3-319-96878-0_13
Mendeley helps you to discover research relevant for your work.