Indistinguishability Obfuscation from Functional Encryption

摘要: Indistinguishability obfuscation (IO) is a tremendous notion, powerful enough to give rise almost any known cryptographic object. So far, candidate IO constructions were based on specific assumptions algebraic objects called multi-linear graded encodings. We present generic construction of indistinguishability from public-key functional encryption with succinct cipher texts and sub-exponential security. This shows the equivalence encryption, primitive that has so far seemed be much weaker, lacking power staggering range applications obfuscation. As an application, we obtain new scheme Garg, Gentry, Halevi, Zhan dry [Eprint 14] under their also show that, Learning Errors assumptions, our techniques imply obfuscator can converted one where obfuscated circuits are linear size in original circuit plus polynomial overhead its depth. Our reduction highlights importance text succinctness schemes, which hope will serve as pathway solid foundations.