SSE and SSD: page-efficient searchable symmetric encryption
From MaRDI portal
Publication:2128993
DOI10.1007/978-3-030-84252-9_6OpenAlexW3174344191MaRDI QIDQ2128993
Michael Reichle, Raphael Bost, Pierre-Alain Fouque, Angèle Bossuat, Brice Minaud
Publication date: 22 April 2022
Full work available at URL: https://hal.inria.fr/hal-03377462/file/lsm-sse.pdf
Related Items
Generalized cuckoo hashing with a stash, revisited, Dynamic local searchable symmetric encryption, Weighted oblivious RAM, with applications to searchable symmetric encryption, Cuckoo hashing in cryptography: optimal parameters, robustness and applications, Limits of breach-resistant and snapshot-oblivious RAMs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Explicit and efficient hash families suffice for cuckoo hashing with a stash
- Fast concurrent access to parallel disks
- Structured encryption and leakage suppression
- Searchable encryption with optimal locality: achieving sublogarithmic read efficiency
- Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution
- On weighted balls-into-bins games
- Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
- Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation
- Beyond the flow decomposition barrier
- A precise analysis of Cuckoo hashing
- Maximal Flow Through a Network
- Cuckoo hashing
- Hashing, Load Balancing and Multiple Choice
- Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
- The Locality of Searchable Symmetric Encryption
- Automata, Languages and Programming
- More Robust Hashing: Cuckoo Hashing with a Stash
- Tight tradeoffs in searchable symmetric encryption