Applications of Obfuscation II
summary
Shows that indistinguishability obfuscation yields extraction when two circuits differ on a single input by using a binary search extract over obfuscated intermediate programs, relying on one‑way functions and punctured PRFs. Builds implicit exponential key cycles (random‑access via obfuscation) to turn leveled FHE into effectively unbounded FHE by puncturing a random position and hybrid arguments; same puncture/hybrid pattern gives trapdoor permutations and hardness results for succinct graph problems, with security depending on IO and PRF/OWF assumptions.
AI-written summary · about
chapters (18)
- 0:00Start
- 0:33Another Useful Trick: Extraction
- 1:49iO and Differing Inputs Obfuscation (diO)
- 10:58Random Puncture is Undetectable
- 25:17Related Work on Circular Security vs. iO
- 31:29Trapdoor Permutation from iO [BPW15]
- 36:04Other Work on iO vs. Delicate Graphs
- 42:28Delegation using iO
- 43:13Some Applications of iO to MPC
- 44:08Two-Round Adaptively-Secure MPC
- 44:34Explainability Compiler: Construction
- 45:10Communication Complexity of SFE with Long Output [Hubacek,Wichs'15]
- 45:31Papers Considering Randomized Functionalities
- 46:15iO and Randomized Encodings
- 46:35Fully Succinct Garbled RAM [CH15]
- 46:49iO + Differential Privacy: A Positive App
- 48:19More on iO and Complexity Theory
- 49:02Software Watermarking
related talks
31mObfuscation of Probabilistic Circuits and Applications
38mRecent Advances on Foundations of Program Obfuscation
58mObfuscation 2
31mHow to Construct Indistinguishability Obfuscation from Compact Functional Encryption
48mTales of Obfuscation in Bounded Arithmetic, Metacomplexity, and Differential Privacy
52mIndistinguishability Obfuscation via Mathematical Proofs of Equivalence
01h 15mThe Journey Towards Program Obfuscation
01h 03mFrom Program Obfuscation to Unclonable Cryptography