Fine-grained searchable encryption in multi-user setting
From MaRDI portal
Publication:1741938
DOI10.1007/S00500-016-2179-XzbMath1384.68018OpenAlexW2407471567WikidataQ122395732 ScholiaQ122395732MaRDI QIDQ1741938
Publication date: 11 April 2018
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-016-2179-x
Related Items (1)
Cites Work
- Unnamed Item
- Secure deduplication storage systems supporting keyword search
- Multiuser private queries over encrypted databases
- Secure threshold multi authority attribute based encryption without a central authority
- How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
- Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
- Privacy Preserving Ranked Multi-Keyword Search for Multiple Data Owners in Cloud Computing
- Multi-User Keyword Search Scheme for Secure Data Sharing with Fine-Grained Access Control
- Attribute-Based Encryption for Circuits
- Privacy-Aware Attribute-Based Encryption with User Accountability
- Attribute-Based Encryption with Partially Hidden Encryptor-Specified Access Structures
- Privacy Preserving Keyword Searches on Remote Encrypted Data
- Verifiable Delegation of Computation over Large Datasets
- Practical Direct Chosen Ciphertext Secure Key-Policy Attribute-Based Encryption with Public Ciphertext Test
- Privacy-Preserving Public Auditing for Secure Cloud Storage
- Fuzzy Identity-Based Encryption
- Attribute-based encryption for circuits
This page was built for publication: Fine-grained searchable encryption in multi-user setting