Fully Secure Attribute-Based Encryption for t-CNF from LWE
summary
Presents a concrete construction that achieves fully secure ABE for t‑CNF from LWE by combining a lattice-based selective-IBE backbone (BGG+-style LWE encodings) with a tagging/punctured-key method implemented via a constrained PRF with gatewise eval equivalence. The scheme makes ciphertexts succinct by supplying a constrained PRF key per policy, turns per-row random tags into punctures for secret keys, and proves adaptive security under LWE; limitation: the constrained PRF requirement restricts expressiveness to t‑CNF.
AI-written summary · about
chapters (14)
- 0:00Intro
- 4:30AttributeBased Encryption
- 8:34During Encryption
- 15:54Previous work
- 20:27Starting Point
- 20:50XPrime
- 21:42Tagging
- 21:54AttributeSpace
- 31:46Simulations
- 41:22Requirements
- 44:14Constraint PRF
- 47:28Constraint Graph
- 50:57Public Key Encryption
- 53:10Additional Algorithms
related talks
54mAttribute-based Encryption for Circuits
21mLattice-Inspired Broadcast Encryption and Succinct Ciphertext-Policy ABE
46mOptimal Broadcast Encryption and More from Evasive LWE
57mLattice Assumptions with Hints: Succinct LWE and its Applications
38mPre-Constrained Encryption
31mIdentity-Based Encryption
37mAttribute-based and Predicate Encryption
01h 16mHow to Use Lattice Trapdoors: IBE, ABE and More