Hermes: I/O-efficient forward-secure searchable symmetric encryption

DOI10.1007/978-981-99-8736-8_9zbMATH Open1545.68037MaRDI QIDQ6605326FDOQ6605326

Authors: Brice Minaud, Michael Reichle 

Publication date: 13 September 2024

Recommendations

• FSSE: forward secure searchable encryption with keyed-block chains
• Dynamic searchable symmetric encryption with forward and stronger backward privacy
• Verifiable and forward secure dynamic searchable symmetric encryption with storage efficiency
• Towards efficient verifiable forward secure searchable symmetric encryption
• scientific article; zbMATH DE number 7234319

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Data structures (68P05)

Cites Work

• Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
• Balanced allocations (extended abstract)
• Searchable encryption with optimal locality: achieving sublogarithmic read efficiency
• Yes, there is an oblivious RAM lower bound!
• Tight tradeoffs in searchable symmetric encryption
• Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
• The locality of searchable symmetric encryption
• SSE and SSD: page-efficient searchable symmetric encryption
• Dynamic local searchable symmetric encryption

This page was built for publication: Hermes: I/O-efficient forward-secure searchable symmetric encryption

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