1. (More) Efficient Secure Computation from Garbled Circuits
Yan Huang
David Evans
Jonathan Katz
Lior Malka

2. Overview
A new system for secure 2-party computation that is much more scalable and significantly faster than best prior work
Garbled-circuit protocols can be competitive with “custom” protocols:
Hamming distance
Private set intersection (PSI)

3. Our Results Performance Scalability
People have done this before. What’s new here is achieving performance & scalability needed for realistic problems.
Performance
Scalability

4. Timing Results [Jha+, 2008] [SCiFI, 2010] 29x faster 4176x faster
Hamming Distance
(900 bits)
Edit Distance
(200 chars, 8-bits each)

5. Oblivious AES Evaluation
Timing Results
16.5x
faster
Oblivious AES Evaluation

6. Private Set Intersection

7. Using the Framework Java code javac Traditional Java Application
Rest of the Java Program
Circuit Generator
javac
Critical Component
LibraryCircuit
Circuit Evaluator
Java code
Critical Component
Custom Circuit
Critical Component
LibraryCircuit

8. Thanks!
“Faster Secure Two-Party Computation Using Garbled Circuits,” USENIX Security 2011
“Private Set Intersection: Are Garbled Circuits Better than Custom Protocols?,” In submission
Download framework and Android demo application from MightBeEvil.com