Ciphertext policy attribute-based encryption for circuits from LWE assumption
From MaRDI portal
Recommendations
Cites work
- Advances in Cryptology - EUROCRYPT 2004
- Attribute-based encryption for circuits
- Attribute-based encryption for circuits from multilinear maps
- Attribute-based functional encryption on lattices
- Bonsai trees, or how to delegate a lattice basis
- Bounded Ciphertext Policy Attribute Based Encryption
- Ciphertext-policy attribute-based encryption: an expressive, efficient, and provably secure realization
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- Efficient ciphertext policy attribute-based encryption with constant-size ciphertext and constant computation-cost
- Efficient lattice (H)IBE in the standard model
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption
- Functional encryption for inner product predicates from learning with errors
- Functional encryption for threshold functions (or fuzzy IBE) from lattices
- Fuzzy Identity-Based Encryption
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Multi-authority Attribute Based Encryption
- New proof methods for attribute-based encryption: achieving full security through selective techniques
- On lattices, learning with errors, random linear codes, and cryptography
- Practical implementation of Ring-SIS/LWE based signature and IBE
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Witness encryption and its applications
Cited in
(1)
This page was built for publication: Ciphertext policy attribute-based encryption for circuits from LWE assumption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536220)