Obfuscation I

on YouTube ↗58m

" summary

Proposes a concrete candidate for indistinguishability obfuscation that encodes matrix branching programs with Kilian randomization and multilinear-map “jigsaw” encodings, rotates extra primed levels to foil the specific input-mixing attack, and multiplies each matrix by a random scalar. Claims the construction preserves functionality (NC1 via Barrington), yields no known algebraic attacks and gives IO (not VBB) under multilinear assumptions; notes the curious fact that IO would trivially exist if P = NP.

AI-written summary · about

" chapters (15)

1. 0:00Intro
2. 4:00Secure Multiparty Computation
3. 7:40Fundamental Break
4. 8:15Hiding Secrets
5. 10:20Selfeating Programs
6. 14:30Positive Results
7. 20:35Philosophical Question
8. 23:20Interesting Fact
9. 27:10Why Im here
10. 28:15What will I talk about
11. 33:40The formal setting
12. 39:43The construction
13. 44:27Killian randomization
14. 48:33Multilinear maps
15. 56:42Obfuscation

" related talks

• 01h 06mObfuscation: Past, Present, and Possible FuturesAmit Sahai · Securing Computation (Simons Institute, June 2015)
• 01h 04mHow to Encrypt a FunctionalityAmit Sahai · Quantum Games and Protocols
• 01h 04mTutorial on obfuscationRachel Lin · Minimal Complexity Assumptions for Cryptography 2023
• 01h 26mObfuscation 1Amit Sahai · Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025
• 01h 04mCryptanalysis of Candidate Program ObfuscatorsYilei Chen · Lattices: New Cryptographic Capabilities 2020
• 51mObfuscation via GGH15 Encodings, 10 Years LaterHoeteck Wee · Obfuscation
• 31mObfuscation of Probabilistic Circuits and ApplicationsHuijia Lin · Securing Computation (Simons Institute, June 2015)
• 57mIndistinguishability Obfuscation from Well-Founded AssumptionsAayush Jain · Simons Institute Workshop: New Developments in Obfuscation