Secure function evaluation (SFE) is a cryptographic protocol that facilitates participants to
compute a function on their private inputs in such a way that privacy of their inputs is …

Secure function evaluation, or how two parties can jointly compute a function while keeping
their inputs private, is an active field in cryptography. In 1986 Andrew Yao presented a …

Garbled circuits, a classical idea rooted in the work of Yao, have long been understood as a
cryptographic technique, not a cryptographic goal. Here we cull out a primitive …

The well-known classical constructions of garbled circuits use four ciphertexts per gate,
although various methods have been proposed to reduce this cost. The best previously …

In this paper, we examine a form of garbled (or encrypted) circuit introduced by Beaver,
Micali, and Rogaway as part of their design of a constant-round secure function evaluation …

A garbling scheme enables one to garble a circuit C and an input x in a way that C (x) can
be evaluated, but nothing else is revealed. Since the first construction by Yao, tremendous …

Secure two-party computation enables applications in which participants compute the output
of a function that depends on their private inputs, without revealing those inputs or relying on …

Protocols for secure computation enable mutually distrustful parties to jointly compute on
their private inputs without revealing anything but the result. Over recent years, secure …

Secure two-party computation allows two parties to evaluate a function of their private inputs
without revealing their own inputs to the other party. The garbled circuit technique …

Efficient garbled circuit construction can lead to more practical secure computation
protocols. Garbled circuit construction has been considered as a separate goal for …