Lockable Obfuscation
summary
Constructs lockable obfuscation from LWE for compute-and-compare programs: builds an NC^1 obfuscator using GGH15 encodings of permutation branching programs, tensors with random blocks, and relies on GPV/GPV-style trapdoors plus a permutation-LWE step; then bootstraps to arbitrary circuits with an FHE whose decryption is low-depth. Produces working primitives — anonymous public-key encryption, one-sided predicate encryption, and circular-security separations — with concrete reductions; proves correctness and indistinguishability under the stated lattice assumptions.
AI-written summary · about
chapters (12)
- 0:00Introduction to obfuscation
- 4:32Compute and compare programs
- 7:56Security definitions
- 13:58Applications: Anonymity
- 18:22Encryption schemes construction
- 21:51Security proof overview
- 27:27Advanced encryption applications
- 32:22Construction methodology
- 35:41Bootstrapping technique
- 40:51Lattice-based construction
- 50:20Encoding and evaluation
- 56:27Conclusion and future work
related talks
51mObfuscation via GGH15 Encodings, 10 Years Later
58mObfuscation 2
01h 29mLattices, Multilinear Maps and Program Obfuscation
01h 04mTutorial on obfuscation
01h 07mLattices and Encrypted Computation
01h 15mThe Journey Towards Program Obfuscation
01h 26mObfuscation 1
36mDiamond iO: Lattice-Based Obfuscation without Bootstrapping from Functional Encryption, toward...
