The Journey Towards Program Obfuscation
summary
Survey traces concrete reductions: IO reduces to functional encryption, then to semi‑succinct FE for NC0, then to a compressed notion XIO/functional encoding; early heuristics use noisy multilinear maps and suffer repeated linearization breaks, while the recent construction replaces exotic maps with lattice assumptions (LWE/LPN) and a new degree‑2.5 PRG to build a short encoding. The claim: obfuscation becomes plausible from standard assumptions; the build succeeds under specified sub‑exponential security regimes.
AI-written summary · about
chapters (9)
- 0:00Start
- 1:59Introduction
- 14:18Weaker Definitions
- 22:25Multilinear Maps
- 38:07What a Functional Encryption Is
- 39:05Succinctless Requirement
- 59:16Functional Encryption
- 1:06:31How Do You Know that You'Re Not Wasting Your Time
- 1:10:54Why Do You Keep Working on Something That Seems like Waste of Time
related talks
01h 04mTutorial on obfuscation
38mRecent Advances on Foundations of Program Obfuscation
01h 12mApplications of Obfuscation I
58mObfuscation 2
01h 08mExpedition to Obfustopia: Indistinguishability Obfuscation from Well-Studied Assumptions to New...
51mObfuscation via GGH15 Encodings, 10 Years Later
01h 06mObfuscation: Past, Present, and Possible Futures
01h 03mLockable Obfuscation
