Two Halves Make a Whole

Surprisingly, it is possible to reduce the data needed for a garbled gate to only two ciphertexts per gate, while preserving free xors. The scheme for doing that is described in our paper, Two Halves Make a Whole: Reducing Data Transfer in Garbled Circuits using Half Gates by Samee Zahur...

iDash Competition Winne...

Congratulations to Samee Zahur for winning the iDash Secure Genomics competition (Hamming Distance challenge task), sponsored by Human Longevity, Inc. A video of the event is available at http://www.humangenomeprivacy.org/. Samee’s solution was built using Obliv-C, a language for...

Congratulations Profess...

Yan Huang, who completed his PhD in 2012 and was the original lead PhD student for this project, and then was a post-doc at the University of Maryland, is now an Assistant Professor at Indiana University. See his IU faculty page and personal blog. IU is the also the home of Steven...

Symmetric Cut-and-Choos...

Our paper on symmetric cut-and-choose will be presented at CRYPTO 2013 in August.

Circuit Structures

Circuit Structures paper and software is now available. Samee Zahur will present the paper at Oakland 2013.

Quid Pro Quo-tocols

Our paper on strengthening semi-honest protocols with dual execution is now available, and will be presented at Oakland 2012.

Private Set Intersectio...

Our NDSS 2012 paper on using generic garbled circuits to perform private set intersection is now available.

ICISS Paper

Efficient Secure Computation with Garbled Circuits summarizes our recent work on secure computation.