Paper 2020/1003

Indistinguishability Obfuscation from Well-Founded Assumptions

Aayush Jain, Huijia Lin, and Amit Sahai

Abstract

Indistinguishability obfuscation, introduced by [Barak et. al. Crypto’2001], aims to compile programs into unintelligible ones while preserving functionality. It is a fascinating and powerful object that has been shown to enable a host of new cryptographic goals and beyond. However, constructions of indistinguishability obfuscation have remained elusive, with all other proposals relying on heuristics or newly conjectured hardness assumptions. In this work, we show how to construct indistinguishability obfuscation from subexponential hardness of four well-founded assumptions. We prove: Theorem: Let $$ be arbitrary constants. Assume sub-exponential security of the following assumptions, where $$ is a security parameter, $$ is a $$-bit prime, and the parameters $$ are large enough polynomials in $$: - the Learning With Errors ($$) assumption over $$ with subexponential modulus-to-noise ratio $$, where $$ is the dimension of the $$ secret, - the Learning Parity with Noise ($$) assumption over $$ with polynomially many $$ samples and error rate $$, where $$ is the dimension of the $$ secret, - the existence of a Boolean Pseudo-Random Generator ($$) in $$ with stretch $$, where $$ is the length of the $$ seed, - the Symmetric eXternal Diffie-Hellman ($$) assumption on asymmetric bilinear groups of order $$. Then, (subexponentially secure) indistinguishability obfuscation for all polynomial-size circuits exists. Further, assuming only polynomial security of the aforementioned assumptions, there exists collusion resistant public-key functional encryption for all polynomial-size circuits.