Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits

URL: https://eprint.iacr.org/2013/451 Authors: Sanjam Garg, Craig Gentry, Shai Halevi, Mariana Raykova, Amit Sahai, Brent Waters

Abstract

In this work, we study indistinguishability obfuscation and functional encryption for general circuits. We give candidate constructions for both primitives. We prove that if these candidates are secure, then a number of open problems in cryptography are resolved, including the problem of constructing functional encryption schemes for arbitrary circuits, public-key encryption with chosen-ciphertext security from only one-way functions, and the construction of deniable encryption. The candidate constructions are based on multilinear maps.