Cryptology ePrint Archive: Report 2016/458
CompGC: Efficient Offline/Online Semi-honest Two-party Computation
Adam Groce and Alex Ledger and Alex J. Malozemoff and Arkady Yerukhimovich
Abstract: 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.
Category / Keywords: cryptographic protocols / efficient secure two-party computation, garbled circuits, implementation
Date: received 11 May 2016, last revised 29 May 2016
Contact author: arkady5 at gmail com
Available format(s): PDF | BibTeX Citation
Note: Removed a few editing comments that were accidentally left in in prior version.
Version: 20160530:005825 (All versions of this report)
Short URL: ia.cr/2016/458
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]