Authenticated Garbling and Efficient Maliciously Secure Two-Party Computation
Xiao Shaun Wang, Samuel Ranellucci, Jonathan I. Katz · 2017
We propose a simple and efficient framework for obtaining efficient constant-round protocols for maliciously secure two-party computation. Our framework uses a function-independent preprocessing phase to generate authenticated information for the two parties; this information is then used to construct a single "authenticated" garbled circuit which is transmitted and evaluated. We also show how to efficiently instantiate the preprocessing phase with a new, highly optimized version of the TinyOT protocol by Nielsen et al.