Efficient Trapdoor Generation from Multiple Hashing in Searchable Symmetric Encryption
From MaRDI portal
Publication:6163658
Recommendations
- Probabilistic generation of trapdoors: reducing information leakage of searchable symmetric encryption
- Tight tradeoffs in searchable symmetric encryption
- Simple, secure, and efficient searchable symmetric encryption with multiple encrypted indexes
- Tight tradeoffs in searchable symmetric encryption
- Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
Cites work
- Advances in Cryptology - EUROCRYPT 2004
- Boolean searchable symmetric encryption with worst-case sub-linear complexity
- Deterministic and Efficiently Searchable Encryption
- Dynamic searchable symmetric encryption with minimal leakage and efficient updates on commodity hardware
- Dynamic searchable symmetric encryption with physical deletion and small leakage
- Efficient Fuzzy Search on Encrypted Data
- Efficient no-dictionary verifiable searchable symmetric encryption
- Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
- Improvement of UC secure searchable symmetric encryption scheme
- Multi-key searchable encryption, revisited
- Multiuser private queries over encrypted databases
- Privacy Preserving Keyword Searches on Remote Encrypted Data
- Probabilistic generation of trapdoors: reducing information leakage of searchable symmetric encryption
- Ranked Searchable Symmetric Encryption Supporting Conjunctive Queries
- Simple, secure, and efficient searchable symmetric encryption with multiple encrypted indexes
- Structured encryption and controlled disclosure
- The locality of searchable symmetric encryption
- Toward practical searchable symmetric encryption
Cited in
(2)
This page was built for publication: Efficient Trapdoor Generation from Multiple Hashing in Searchable Symmetric Encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6163658)