Attribute-based and Predicate Encryption
summary
Claim: a construction gives predicate encryption for all circuits under a standard but subexponential LWE assumption, with short ciphertexts and keys and compact encryption running in polynomial time. Construction encrypts the attribute via a random FHE secret key K (publishing the FHE ciphertext but not K), uses the BG+ABE homomorphic recoding to evaluate P on the encrypted attribute, and reduces decryption to computing an inner‑product style FHE decryption so keys check a small noise interval; result stops short of full functional encryption.
AI-written summary · about
chapters (10)
- 0:00Intro
- 2:25Syntax
- 9:43Parameters
- 11:08Recap
- 12:33Construction
- 15:31Ciphertext
- 18:10Generating secret key
- 24:05Decryption
- 30:41Proof
- 32:28Conclusion
related talks
38mPre-Constrained Encryption
01h 08mFully Secure Attribute-Based Encryption for t-CNF from LWE
36mPublic Key Cryptography
23mBootstrapping Homomorphic Encryption via Functional Encryption
31mHow to Construct Indistinguishability Obfuscation from Compact Functional Encryption
48mAdvanced Symmetric-Key Encryption
01h 18mMixed Functional Encryption: Applications to Traitor Tracing
01h 03mLockable Obfuscation