Candidate Obfuscation via Oblivious LWE Sampling.
Hoeteck Wee, Daniel Wichs · IACR Cryptology ePrint Archive · 2020
We present a new, simple candidate construction of indistinguishability obfuscation (iO). Our scheme is inspired by lattices and learning-with-errors (LWE) techniques, but we are unable to prove security under a standard assumption. Instead, we formulate a new falsifiable assumption under which the scheme is secure. Furthermore, the scheme plausibly achieves post-quantum security.