Multi-key searchable encryption, revisited

DOI10.1007/978-3-319-76578-5_4MaRDI QIDQ1749275zbMATH OpenOpenAlexFDO

Authors Ariel Hamlin, Abhi Shelat, Mor Weiss, Daniel Wichs

Publication date 16 May 2018

Full work available at URL https://doi.org/10.1007/978-3-319-76578-5_4

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Fine-grained searchable encryption in multi-user setting
• Searchable Encryption
• Simple, secure, and efficient searchable symmetric encryption with multiple encrypted indexes
• Toward practical searchable symmetric encryption
• Secure and practical searchable encryption: a position paper
• Efficient multi-keyword searchable encryption based on multi-input inner-product functional encryption
• Public Key Encryption with Conjunctive Keyword Search and Its Extension to a Multi-user System
• Efficient encrypted keyword search for multi-user data sharing

Cited in

(6)

• Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model
• Secure generalized deduplication via multi-key revealing encryption
• Fast two-server multi-user searchable encryption with strict access pattern leakage
• scientific article; zbMATH DE number 6874616 (Why is no real title available?)
• Efficient Trapdoor Generation from Multiple Hashing in Searchable Symmetric Encryption
• ProxCode: efficient proximity searchable encryption from error correcting codes

This page was built for publication: Multi-key searchable encryption, revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1749275)