Prior to our work, only special cases of this result were known, or stronger assumptions were required. More specifically, previous work (implicitly) achieved selectively secure FE for Turing machines with a-priori bounded input based on indistinguishability obfuscation (STOC 2015), or achieved FE for general Turing machines only based on knowledge-type assumptions such as public-coin differing-inputs obfuscation (TCC 2015).
A consequence of our result is the first constructions of succinct adaptively secure garbling schemes (even for circuits) in the standard model. Prior succinct garbling schemes (even for circuits) were only known to be adaptively secure in the random oracle model.Category / Keywords: Original Publication (with minor differences): IACR-TCC-2016 Date: received 3 Aug 2015, last revised 28 Oct 2015 Contact author: prabhanjan va at gmail com Available format(s): PDF | BibTeX Citation Note: Corrected typos, added subsequent work. Version: 20151028:200001 (All versions of this report) Short URL: ia.cr/2015/776 Discussion forum: Show discussion | Start new discussion