Obfuscation 1

on YouTube ↗01h 26m

" summary

Claims a provable construction of indistinguishability obfuscation from three assumptions: LPN (moderate sparse errors) + local PRGs + DLIN over pairings. It uses randomized encodings/garbled circuits to reduce outputs to constant-degree polynomials, tensors secrets to evaluate monomials, and then compresses sparse errors via rank-1 matrix decompositions and block partitioning. Construction works under subexponential hardness and uses bilinear maps (so not yet post-quantum); removing pairings or lowering hardness is left open.

AI-written summary · about

" chapters (9)

1. 0:00Introduction to obfuscation
2. 1:51Defining obfuscation
3. 6:20Indistinguishability obfuscation
4. 11:38Applications and history of IO
5. 17:56Hardness assumptions in cryptography
6. 23:24The quest for IO constructions
7. 33:19Building IO from assumptions
8. 48:29Implementation techniques
9. 59:07Challenges and open questions

" related talks

• 46mIndistinguishability Obfuscation from Bilinear Maps and LPN VariantsNeekon Vafa · Obfuscation
• 01h 08mExpedition to Obfustopia: Indistinguishability Obfuscation from Well-Studied Assumptions to New...Rachel Lin · Obfuscation
• 01h 04mTutorial on obfuscationRachel Lin · Minimal Complexity Assumptions for Cryptography 2023
• 01h 06mObfuscation: Past, Present, and Possible FuturesAmit Sahai · Securing Computation (Simons Institute, June 2015)
• 57mIndistinguishability Obfuscation from Well-Founded AssumptionsAayush Jain · Simons Institute Workshop: New Developments in Obfuscation
• 01h 06mOn the Assumptions Used for ObfuscationBenny Applebaum · Simons Institute Workshop: New Developments in Obfuscation
• 38mRecent Advances on Foundations of Program ObfuscationRachel Lin · Lattices: New Cryptographic Capabilities 2020
• 58mObfuscation IAmit Sahai · Cryptography Boot Camp 2015