Name
Abstract | ||
|---|---|---|
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, Comp GC, 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. |
Year | Venue | Field |
|---|---|---|
2016 | IACR Cryptology ePrint Archive | Computer science,Cryptography,XOR gate,Coding (social sciences),Theoretical computer science,Preprocessor,Modular design,Electronic circuit,Computation,Performance improvement |
DocType | Volume | Citations |
Journal | 2016 | 2 |
PageRank | References | Authors |
0.37 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Adam Groce | 1 | 134 | 7.90 |
| Alex Ledger | 2 | 2 | 1.04 |
| Alex J. Malozemoff | 3 | 158 | 8.98 |
| Arkady Yerukhimovich | 4 | 80 | 8.86 |