[Resource Topic] 2016/458: CompGC: Efficient Offline/Online Semi-honest Two-party Computation

Welcome to the resource topic for 2016/458

CompGC: Efficient Offline/Online Semi-honest Two-party Computation

Authors: Adam Groce, Alex Ledger, Alex J. Malozemoff, Arkady Yerukhimovich


We introduce a new technique, component-based garbled circuits, for increasing the efficiency of secure two-party computation in the offline/online semi-honest setting. We observe that real-world functions are generally constructed in a modular way, comprising many standard components such as arithmetic operations and other common tasks. Our technique allows circuits for these common tasks to be garbled and shared during an offline phase; once the function to compute is specified, these pre-shared components can be chained together to create a larger garbled circuit. We stress that we do not assume that the function is known during the offline phase — only that it uses some common, predictable components. We give an implementation, CompGC, of this technique and measure the efficiency gains for various examples. We find that our technique results in roughly an order of magnitude performance improvement over standard garbled circuit-based secure two-party computation.

ePrint: https://eprint.iacr.org/2016/458

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .