Lattices and Encrypted Computation

on YouTube ↗01h 07m

" summary

Shows a concrete path from LWE to practical fully homomorphic encryption: tensor ciphertexts to multiply, use bit-decomposition to do scalar products, and apply key-switching chain to reduce tensor-grown keys back to manageable size. Noise grows (additions OK, scalar mult adds about log Q factor), ACPS small-secret LWE keeps errors poly-sized, and a leveled FHE construction works; full FHE needs either bootstrapping via homomorphic decryption or an unresolved circular‑security step.

AI-written summary · about

" chapters (15)

1. 0:00Introduction
2. 0:58Lattices and Encryption
3. 3:53Fully Homomorphic Encryption
4. 10:42History
5. 12:10First Breakthrough
6. 19:22Second Breakthrough
7. 27:35Summary
8. 28:50Vika
9. 29:21Encryption
10. 39:13Key Switching
11. 47:14Modular Computation
12. 51:48Short Ciphertex
13. 57:08Circular Encryption
14. 58:06MultiKey Encryption
15. 58:30Questions

" related talks

• 57mTutorial: Encrypted Computation from LatticesHoeteck Wee · Lattices: New Cryptographic Capabilities 2020
• 45mFully Homomorphic Encryption IShai Halevi · Cryptography Boot Camp 2015
• 01h 04mFully Homomorphic Encryption IIShai Halevi · Cryptography Boot Camp 2015
• 39mLattice Based Cryptography PrimerBob Relyea · DevConf.CZ 2021
• 46mRunning Circuits of Unbounded Depth over Encrypted Data, Securely, Using Lattices...Ji Luo · Obfuscation
• 01h 03mLockable ObfuscationVenkata Koppula · Lattices: New Cryptographic Capabilities 2020
• 54mGraph-Induced Multilinear Maps from LatticesShai Halevi · The Mathematics of Modern Cryptography
• 01h 05mObfuscation from Noisy Linear FEShweta Agrawal · Lattices: New Cryptographic Capabilities 2020