Indistinguishability Obfuscation from Well-Founded Assumptions

Abstract

In this work, we show how to construct indistinguishability obfuscation from subexponential hardness of four well-founded assumptions. We prove: Theorem (Informal). Let τ ∈ (0, ∞), δ ∈ (0, 1), ǫ ∈ (0, 1) be arbitrary constants. Assume sub-exponential security of the following assumptions, where λ is a security parameter, and the parameters ℓ, k, n below are large enough polynomials in λ: