Abstract

In this talk (Allerton 2014), I discuss garbled circuits and their use in secure computation. First, I review the functionality and the security properties of garbling schemes and survey various constructions. Then, I focus on their use in secure two-party computation protocols (e.g. the cut-and-choose paradigm), and point out important directions for future research.