Obfuscation III

on YouTube ↗44m

" summary

Proves a security amplification theorem that turns an S,ε functional‑encryption primitive plus subexponential LWE into a scheme with advantage roughly 1/s^{Θ(1)} + 2^{-λ^{Θ(1)}}, preserving compactness and sublinear ciphertexts. Construction secret‑shares the message into T ≈ λ shares, encrypts each under the weak FE, and uses homomorphic secret sharing (HSS) plus an indistinguishability hard‑core set theorem to switch hybrids and build an efficient simulator. The reduction is explicit, the transformation is implemented, and the result yields negligible security under the stated LWE assumptions.

AI-written summary · about

" chapters (7)

1. 0:00Introduction
2. 5:21Definition
3. 16:20Construction
4. 22:40Scheme Clarity
5. 26:35Hardcore Sets
6. 30:00Hardcore Theorem
7. 35:55Hybrid

" related talks

• 58mObfuscation 2Aayush Jain · Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025
• 01h 07mLattices and Encrypted ComputationVinod Vaikuntanathan · Lattices: Algorithms, Complexity, and Cryptography Boot Camp 2020
• 56miO via Functional Encryption: Techniques and Challenges from LWEBoaz Barak · Simons Institute Workshop: New Developments in Obfuscation
• 45mFully Homomorphic Encryption IShai Halevi · Cryptography Boot Camp 2015
• 31mHow to Construct Indistinguishability Obfuscation from Compact Functional EncryptionAbhishek Jain · Securing Computation (Simons Institute, June 2015)
• 53mLPN Based IO Part 2Rachel Lin · Simons Institute Workshop: New Developments in Obfuscation
• 01h 04mFully Homomorphic Encryption IIShai Halevi · Cryptography Boot Camp 2015
• 01h 01mCircularity Based IO, Part 1Rafael Pass, Romain Gay · Simons Institute Workshop: New Developments in Obfuscation