Obfuscation 2
Talkat Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025 · 2025-05-19..05-23·
summary
Proves indistinguishability obfuscation from three assumptions: NC0 PRGs, LPN over large fields with error 1/l^delta, and bilinear maps (e.g. DLIN); subexponential hardness yields subexp security. Replaces LWE-based FHE with partially hiding functional encryption over bilinear groups plus NC0 garbling, builds a time-succinct structured SPRG by amortizing k seeds via a new preprocessing polynomial encoding (PPE), compressing sparse LPN error matrices, and producing sublinearly compact FE that composes to IO — correct but far from practical.
AI-written summary · about
chapters (9)
- 0:00Introduction
- 1:03Motivation for obfuscation
- 4:19Why LWE in obfuscation
- 7:09Functional encryption stepping stone
- 13:54Challenges: matrix compression & LWE
- 26:31Amortization & polynomial encoding
- 37:44Sublinear processing for PPE
- 49:23Functional encryption without LWE
- 51:56Future directions in IO
related talks
46mIndistinguishability Obfuscation from Bilinear Maps and LPN Variants
53mLPN Based IO Part 2
01h 05mObfuscation from Noisy Linear FE
38mRecent Advances on Foundations of Program Obfuscation
01h 08mExpedition to Obfustopia: Indistinguishability Obfuscation from Well-Studied Assumptions to New...
57mIndistinguishability Obfuscation from Well-Founded Assumptions
01h 04mTutorial on obfuscation
01h 06mOn the Assumptions Used for Obfuscation