Paper 2016/458

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

Adam Groce, Alex Ledger, Alex J. Malozemoff, and 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.

Note: Extended experimental results section.

Available format(s)
Cryptographic protocols
Publication info
Preprint. MINOR revision.
efficient secure two-party computationgarbled circuitsimplementation
Contact author(s)
arkady5 @ gmail com
2017-06-15: last of 3 revisions
2016-05-13: received
See all versions
Short URL
Creative Commons Attribution


      author = {Adam Groce and Alex Ledger and Alex J.  Malozemoff and Arkady Yerukhimovich},
      title = {CompGC: Efficient Offline/Online Semi-honest Two-party Computation},
      howpublished = {Cryptology ePrint Archive, Paper 2016/458},
      year = {2016},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.