Indistinguishability Obfuscation from Well-Founded Assumptions (Invited Talk)
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 the subexponential hardness of three well-founded assumptions. We prove the following.
Theorem (Informal) Assume sub-exponential hardness for the following:
- the Learning Parity with Noise (LPN) assumption over general prime fields 𝔽_p with polynomially many LPN samples and error rate 1/k^δ, where k is the dimension of the LPN secret, and δ > 0 is any constant;
- the existence of a Boolean Pseudo-Random Generator (PRG) in NC⁰ with stretch n^(1+τ), where n is the length of the PRG seed, and τ > 0 is any constant;
- the Decision Linear (DLIN) assumption on symmetric bilinear groups of prime order.
Then, (subexponentially secure) indistinguishability obfuscation for all polynomial-size circuits exist.
As a corollary, all cryptographic goals that can be achieved using indistinguishability obfuscation can now be achieved assuming the above three assumptions. This includes fully homomorphic encryption, functional encryption, multiparty non-interactive key-exchange, succinct garbled random access machine, and many others.
This is joint work with Aayush Jain (UCLA and NTT Research) and Amit Sahai (UCLA).
Cryptography
indistinguishability obfuscation
Theory of computation~Cryptographic primitives
4:1-4:1
Invited Talk
Huijia (Rachel)
Lin
Huijia (Rachel) Lin
Paul G. Allen School of Computer Science & Engineering, University of Washington, Seattle, WA, USA
https://homes.cs.washington.edu/~rachel/
10.4230/LIPIcs.FSTTCS.2021.4
Huijia (Rachel) Lin
Creative Commons Attribution 4.0 International license
https://creativecommons.org/licenses/by/4.0/legalcode