Efficient Searchable Encryption Through Compression
Summary: Introduces a generic compress-before-encryption layer for searchable indexes, treating SE and lossless compression as black boxes while preserving security. It cuts cryptographic search costs by up to 188× (keyword search), 62× (database search), and makes ORAM-scale queries practical. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Ioannis Demertzis (University of Maryland)
- 2. Rajdeep Talapatra (University of Maryland)
- 3. Charalampos Papamanthou (University of Maryland)
BibTeX Citation
@article{demertzis_vldb18,
title = {{Efficient Searchable Encryption Through Compression}},
author = {Demertzis, Ioannis and Talapatra, Rajdeep and Papamanthou, Charalampos},
journal = {PVLDB},
series = {{VLDB} '18},
volume = {11},
number = {11},
pages = {1729--1741},
doi = {10.14778/3236187.3236218},
url = {https://doi.org/10.14778/3236187.3236218},
year = {2018}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,428 | GraphOS: Towards Oblivious Graph Processing | 2023 | VLDB | 6.1329964e-05 |
| 7,488 | OBIR-tree: An Efficient Oblivious Index for Spatial Keyword Queries on Secure Enclaves | 2025 | SIGMOD | 5.5102404e-05 |
| 10,488 | Loom: Weaving PCS-Preserving and Searchable Cloud Backups for Secure Messaging | 2026 | SIGMOD | 4.9769913e-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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 420 | Processing Analytical Queries over Encrypted Data | 2013 | VLDB | 0.00018531799 |
| 538 | TrustedDB: A Trusted Hardware based Database with Privacy and Data Confidentiality | 2011 | SIGMOD | 0.00016756835 |
| 899 | Orthogonal Security With Cipherbase | 2013 | CIDR | 0.00013183669 |
| 2,011 | An Experimental Study of Bitmap Compression vs. Inverted List Compression | 2017 | SIGMOD | 9.1924806e-05 |
| 4,723 | Practical Private Range Search Revisited | 2016 | SIGMOD | 6.4507676e-05 |
| 5,580 | Oblivious RAM: A Dissection and Experimental Evaluation | 2016 | VLDB | 6.0750335e-05 |
| 12,299 | Fast Searchable Encryption With Tunable Locality | 2017 | SIGMOD | 4.9769913e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,888 | Frequency-Hiding Order-Preserving Encryption with Small Client Storage | 2021 | VLDB |
| 2 | 6,667 | Range Search over Encrypted Multi-Attribute Data | 2023 | VLDB |
| 3 | 5,388 | Order-Preserving Key Compression for In-Memory Search Trees | 2020 | SIGMOD |
| 4 | 11,066 | A Workload-Aware Encrypted Index for Efficient Privacy-Preserving Range Queries | 2026 | VLDB |
| 5 | 6,918 | Adaptive Indexing over Encrypted Numeric Data | 2016 | SIGMOD |
| 6 | 4,723 | Practical Private Range Search Revisited | 2016 | SIGMOD |
| 7 | 5,248 | A Comparative Evaluation of Order-Revealing Encryption Schemes and Secure Range-Query Protocols | 2019 | VLDB |
| 8 | 9,792 | Memory-Efficient Search Trees for Database Management Systems | 2021 | SIGMOD |
| 9 | 8,913 | Practical and Secure Substring Search | 2018 | SIGMOD |
| 10 | 12,299 | Fast Searchable Encryption With Tunable Locality | 2017 | SIGMOD |