This paper describes the framework and illustrates our approach with
several applications:

Abstract.
Secure two-party computation enables two parties to evaluate a function
cooperatively without revealing to either party anything beyond the
function's output. The garbled-circuit technique, a generic approach to
secure two-party computation for semi-honest participants, was developed
by Yao in the 1980s, but has been viewed as being of limited practical
significance due to its inefficiency. We demonstrate several techniques
for improving the running time and memory requirements of the
garbled-circuit technique, resulting in an implementation of generic
secure two-party computation that is significantly faster than any
previously reported while also scaling to arbitrarily large circuits. We
validate our approach by demonstrating secure computation of circuits
with over 109 gates at a rate of roughly 10 microseconds per garbled
gate, and showing order-of-magnitude improvements over the best previous
privacy-preserving protocols for computing Hamming distance, Levenshtein
distance, Smith-Waterman genome alignment, and AES.

This paper describes a way to use the framework to provide security
assurances much stronger than the semi-honest model: