Database Paper Browser

Back to papers

Efficient Searchable Encryption Through Compression

Summary: Compression-based searchable encryption compresses plaintext indexes before encryption, usable with any SE scheme and lossless compressor. Up to 188x and 62x search-time reductions; with compress-first-ORAM-next, large queries drop from ~21 hours to ~20 minutes. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
11656
Venue
VLDB
Year
2018
Pagerank
4.5018004e-05
Overall Rank
8,457 | 41.23%
DOI
10.14778/3236187.3236218

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
5,511 GraphOS: Towards Oblivious Graph Processing 2023 VLDB 5.4701773e-05
9,235 OBIR-tree: An Efficient Oblivious Index for Spatial Keyword Queries on Secure Enclaves 2025 SIGMOD 4.3648789e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers