Obfuscation from Noisy Linear FE

on YouTube ↗01h 05m

" summary

Proposes that noisy linear FE — a symmetric-key FE that outputs X·Y plus bounded, PRG-derived noise — compiles (with a special FHE bootstrap) to indistinguishability obfuscation, avoiding multilinear maps. Builds a lattice-based construction from ring-LWE by sampling errors in hidden principal ideals so cross-terms cancel, generating per-key noise on the fly so ciphertext size stays sublinear in Q. Initial candidate has two practical attacks that are fixable; security rests on new lattice hardness assumptions.

AI-written summary · about

" chapters (5)

1. 0:00Start
2. 6:14Recap: Bilinear Maps
3. 17:51iO from Functional Encryption
4. 29:54Permits New Direct Constructions
5. 35:56Linear Functional Encryption ALS16

" related talks

• 58mObfuscation 2Aayush Jain · Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025
• 46mIndistinguishability Obfuscation from Bilinear Maps and LPN VariantsNeekon Vafa · Obfuscation
• 56miO via Functional Encryption: Techniques and Challenges from LWEBoaz Barak · Simons Institute Workshop: New Developments in Obfuscation
• 01h 26mObfuscation 1Amit Sahai · Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025
• 01h 29mLattices, Multilinear Maps and Program ObfuscationYilei Chen · Lattices: Algorithms, Complexity, and Cryptography Boot Camp 2020
• 01h 07mLattices and Encrypted ComputationVinod Vaikuntanathan · Lattices: Algorithms, Complexity, and Cryptography Boot Camp 2020
• 36mDiamond iO: Lattice-Based Obfuscation without Bootstrapping from Functional Encryption, toward...Sora Suegami · Obfuscation
• 01h 15mThe Journey Towards Program ObfuscationYael Tauman Kalai · Simons Institute Workshop: New Developments in Obfuscation