We construct an indistinguishability obfuscation IO scheme for all polynomial-size circuits from constant-degree graded encoding schemes, assuming the existence of a subexponentially secure pseudo-random generator computable by constant-degree arithmetic circuits, and the subexponential hardness of the Learning With Errors LWE problems. Previously, all candidate general purpose IO schemes rely on polynomial-degree graded encoding schemes.
['Huijia Lin']
Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes