Shweta Agrawal

FE and iO for Turing Machines from Minimal Assumptions.

2018 · IACR Cryptology ePrint Archive

We construct Indistinguishability Obfuscation (\(\mathsf {iO}\)) and Functional Encryption (\(\mathsf {FE}\)) schemes in the Turing machine model from the minimal assumption of compact \(\mathsf {FE}\) for circuits (\(\mathsf {CktFE}\)). Our constructions overcome the barrier of …