An efficient key-policy attribute-based searchable encryption in prime-order groups
From MaRDI portal
Recommendations
- Expressive attribute-based keyword search with constant-size ciphertext
- Linear encryption with keyword search
- Keyword search meets membership testing: adaptive security from SXDH
- An efficient key-policy attribute-based encryption scheme with constant ciphertext length
- Attribute-based encryption with expressive and authorized keyword search
Cited in
(12)- Hierarchical attribute based encryption with continuous leakage-resilience
- Attribute-based keyword search from lattices
- Towards secure data retrieval for multi-tenant architecture using attribute-based key word search
- Keyword search meets membership testing: adaptive security from SXDH
- Forward secure online/offline key policy attribute-based encryption with keyword search
- On the Security of a Searchable Anonymous Attribute Based Encryption
- Linear encryption with keyword search
- Expressive attribute-based keyword search with constant-size ciphertext
- Attribute-based encryption with expressive and authorized keyword search
- Adaptively Secure Unrestricted Attribute-Based Encryption with Subset Difference Revocation in Bilinear Groups of Prime Order
- Multi-authority distributed attribute-based encryption with application to searchable encryption on lattices
- Public key based searchable encryption with fine-grained sender permission control
This page was built for publication: An efficient key-policy attribute-based searchable encryption in prime-order groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1616856)