80 likes | 249 Views
(More) Efficient Secure Computation from Garbled Circuits. Yan Huang David Evans Jonathan Katz Lior Malka. www.MightBeEvil.com. Overview. A new system for secure 2-party computation that is much more scalable and significantly faster than best prior work
E N D
(More) Efficient Secure Computation from Garbled Circuits Yan Huang David Evans Jonathan Katz LiorMalka www.MightBeEvil.com
Overview • A new system for secure 2-party computation that is much more scalableand significantly fasterthan best prior work • Garbled-circuit protocols can be competitive with “custom” protocols: • Hamming distance • Private set intersection (PSI)
Our Results Performance Scalability
Timing Results [Jha+, 2008] [SCiFI, 2010] 29x faster 4176x faster Hamming Distance (900 bits) Edit Distance (200 chars, 8-bits each)
Timing Results 16.5x faster Oblivious AES Evaluation
Using the Framework 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
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