1. Optimizing Authenticated Garbling for Faster Secure Two-Party Computation 2018 Crypto GarbledCircuits MPC
    Jonathan Katz and Samuel Ranellucci and Mike Rosulek and Xiao Wang
    [View PDF on eprint.iacr.org]
    [Show BibTex Citation]

    @misc{cryptoeprint:2018:578,
    author = {Jonathan Katz and Samuel Ranellucci and Mike Rosulek and Xiao Wang},
    title = {Optimizing Authenticated Garbling for Faster Secure Two-Party Computation},
    howpublished = {Cryptology ePrint Archive, Report 2018/578},
    year = {2018},
    note = {\url{https://eprint.iacr.org/2018/578}},
    }

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.6x 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.5x improvement in the communication and a 2x improvement in the computation for that step.

  1.