Attribute-based Encryption for Circuits

on YouTube ↗54m

" summary

Constructs an attribute‑based encryption scheme from lattices that handles arbitrary Boolean circuits under a sub‑exponential LWE assumption, gives selective security (convertible to adaptive via complexity‑leveraging), and produces short ciphertexts and secret keys whose length is essentially one bit per gate. It uses a public key homomorphism dance with a gadget matrix G so ciphertexts evolve with attributes, then a trapdoor lets a final short inversion recover the message.

AI-written summary · about

" chapters (11)

1. 0:00Attribute-based Encryption for Circuits
2. 7:57Public vs. Private Attributes
3. 12:35(IND) Security
4. 15:36(IND) Selective Security
5. 19:30Main Result
6. 21:25Key Idea: Key-Homomorphism
7. 24:53ABE Keys
8. 33:31ABE Encryption
9. 39:36ABE Decryption
10. 42:13Summing Up: ABE
11. 45:48Key Tool in Security Proof Two Ways to Generate Trapdoors for [A || Ap]

" related talks

• 01h 08mFully Secure Attribute-Based Encryption for t-CNF from LWERotem Tsabar · Lattices: New Cryptographic Capabilities 2020
• 41mLattice based cryptographyLéo Ducas · Post-Quantum Cryptography Conference Amsterdam 2023
• 01h 03mLockable ObfuscationVenkata Koppula · Lattices: New Cryptographic Capabilities 2020
• 46mRunning Circuits of Unbounded Depth over Encrypted Data, Securely, Using Lattices...Ji Luo · Obfuscation
• 57mTutorial: Encrypted Computation from LatticesHoeteck Wee · Lattices: New Cryptographic Capabilities 2020
• 31mIdentity-Based EncryptionParhat Abla, Huiwen Jia · RSA Conference 2024
• 57mLattice Assumptions with Hints: Succinct LWE and its ApplicationsDavid Wu · Obfuscation
• 01h 07mLattices and Encrypted ComputationVinod Vaikuntanathan · Lattices: Algorithms, Complexity, and Cryptography Boot Camp 2020