Efficient No-dictionary Verifiable Searchable Symmetric Encryption
From MaRDI portal
Publication:5854441
DOI10.1007/978-3-319-70972-7_28zbMath1460.94059OpenAlexW2780643700MaRDI QIDQ5854441
Publication date: 17 March 2021
Published in: Financial Cryptography and Data Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-70972-7_28
Related Items (2)
Towards efficient verifiable conjunctive keyword search for large encrypted database ⋮ Efficient Trapdoor Generation from Multiple Hashing in Searchable Symmetric Encryption
Cites Work
- Unnamed Item
- Unnamed Item
- Improvement of UC secure searchable symmetric encryption scheme
- UC-secure dynamic searchable symmetric encryption scheme
- Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
- Privacy Preserving Keyword Searches on Remote Encrypted Data
- Applied Cryptography and Network Security
- Information and Communications Security
- The Locality of Searchable Symmetric Encryption
- Keyword Field-Free Conjunctive Keyword Searches on Encrypted Data and Extension for Dynamic Groups
This page was built for publication: Efficient No-dictionary Verifiable Searchable Symmetric Encryption