Faster Secure Two-Party Computation Using Garbled Circuits

Yan Huang, David Evans, Jonathan Katz & Lior Malka
Secure two-party computation enables two parties to evaluate a function cooperatively without revealing to either party anything beyond the function's output. The garbled-circuit technique, a generic approach to secure two-party computation for semi-honest participants, was developed by Yao in the 1980s, but has been viewed as being of limited practical significance due to its inefficiency. We demonstrate several techniques for improving the running time and memory requirements of the garbled-circuit technique, resulting in an implementation...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.