Recent Advances on Foundations of Program Obfuscation
summary
Proposes a route to indistinguishability obfuscation from standard ingredients: LWE plus bilinear maps and homomorphic encryption, using a new degree-2.5 noise generator (public seed degree 1, private degree 2) together with a special homomorphic encoding and a compact single-key functional encryption. Shows degree 1 impossible, degree 2 attacks exist, degree 3 suffices and is compressed to 2.5; builds FE that outputs group-exponent values requiring brute-force discrete log so outputs must be polynomially small; security is only partial hiding, giving weak IO under those assumptions.
AI-written summary · about
chapters (10)
- 0:00Introduction
- 0:51Program obfuscation concepts
- 3:21Low-degree noise generators
- 5:38Partial hiding and security
- 8:39Constructing degree 2.5 generators
- 13:07Decomposition of assumptions
- 17:46Functional encryption overview
- 22:04Decryption strategies
- 27:37Special homomorphic encoding
- 31:53Conclusion and Q&A
related talks
58mObfuscation 2
01h 15mThe Journey Towards Program Obfuscation
46mIndistinguishability Obfuscation from Bilinear Maps and LPN Variants
01h 04mTutorial on obfuscation
01h 26mObfuscation 1
01h 08mExpedition to Obfustopia: Indistinguishability Obfuscation from Well-Studied Assumptions to New...
01h 06mObfuscation: Past, Present, and Possible Futures
50mApplications of Obfuscation II
