Rethinking Searchable Symmetric Encryption
Zichen Gui, Kenneth G. Paterson, Sikhar Patranabis
Abstract
Symmetric Searchable Encryption (SSE) schemes enable keyword searches over encrypted documents. To obtain efficiency, SSE schemes incur a certain amount of leakage. The vast majority of the literature on SSE considers only leakage from one component of the overall SSE system, the encrypted search index. This component is used to identify which documents to return in response to a keyword query. The actual fetching of the documents is left to another component, usually left unspecified in the literature, but generally envisioned as a simple storage system matching document identifiers to encrypted documents.This raises the question: do SSE schemes actually protect the security of data and queries when considered from a system-wide viewpoint? We answer this question in the negative. We do this by introducing a new inference attack that achieves practically efficient, highly scalable, accurate query reconstruction against end-to-end SSE systems. In particular, our attack works even when the SSE schemes are built in the natural way using the state-of-the-art techniques (namely, volume-hiding encrypted multi-maps) designed to suppress leakage and protect against previous generations of attack.A second question is whether the state-of-the-art leakage suppression techniques can instead be applied on a system-wide basis, to protect both the encrypted search index and the encrypted document store, to produce efficient SSE systems. We also answer this question in the negative. To do so, we implement SSE systems using those state-of-the-art leakage suppression methods, and evaluate their performance. We show that storage overheads range from 100× to 800× while bandwidth overheads range from 20× to100×, as compared to a naïve baseline system.Our results motivate the design of new SSE systems that are designed with system-wide security in mind from the outset. In this regard, we show that one such SSE system due to Chen et al. (IEEE INFOCOM 2018), with provable security guarantees based on differential privacy, is also vulnerable to our new attack.In totality, our results force a re-evaluation of how to build end-to-end SSE systems that offer both security and efficiency.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 060c9158-a17c-4300-a14e-5cc96c5bbbf7Cited by top-tier papers9
- LEAP: Leakage-Abuse Attack on Efficiently Deployable, Efficiently Searchable Encryption with Partially Known DatasetJianting Ning, Xinyi Huang, Geong Sen Poh, Jiaming Yuan et al.CCS 2021 · 32 citations
- Leakage-Abuse Attacks Against Forward and Backward Private Searchable Symmetric EncryptionLei Xu, Leqian Zheng, Chengzhi Xu, Xingliang Yuan et al.CCS 2023 · 28 citations
- Hermes: Efficient and Secure Multi-Writer Encrypted DatabaseTung Le, Thang HoangS&P 2025
- DDR-SSE: Duplicated Retrieval of Documents for System-wide Secure Searchable Symmetric EncryptionZichen Gui, Simon-Philipp Merz, Kenneth G. Paterson, Sikhar PatranabisUSENIX Security 2026
- Security Analysis of MongoDB Queryable EncryptionZichen Gui, Kenneth G. Paterson, Tianxin TangUSENIX Security 2023
Builds on14
- Forward and Backward Private Searchable Encryption from Constrained Cryptographic PrimitivesRaphaël Bost, Brice Minaud, Olga OhrimenkoCCS 2017 · 423 citations
- ∑oφoς: Forward Secure Searchable EncryptionRaphael BostCCS 2016 · 382 citations
- PIR with Compressed Queries and Amortized Query ProcessingSebastian Angel, Hao Chen, Kim Laine, Srinath T. V. SettyS&P 2018 · 353 citations
- New Constructions for Forward and Backward Private Symmetric Searchable EncryptionJavad Ghareh Chamani, Dimitrios Papadopoulos, Charalampos Papamanthou, Rasool JaliliCCS 2018 · 242 citations
- Hiding the Access Pattern is Not Enough: Exploiting Search Pattern Leakage in Searchable EncryptionSimon Oya, Florian KerschbaumUSENIX Security 2021 · 152 citations
Related papers
- Obfuscated Access and Search Patterns in Searchable EncryptionZhiwei Shang, Simon Oya, Andreas Peter, Florian KerschbaumNDSS 2021
- A Highly Accurate Query-Recovery Attack against Searchable Encryption using Non-Indexed DocumentsMarc Damie, Florian Hahn, Andreas PeterUSENIX Security 2021 · 46 citations
- All Your Queries Are Belong to Us: The Power of File-Injection Attacks on Searchable EncryptionYupeng Zhang, Jonathan Katz, Charalampos PapamanthouUSENIX Security 2016 · 512 citations
- Efficient Single-Round Obfuscation of Search and Result Patterns in Searchable EncryptionTung Le, Thang HoangCCS 2026
- Leakage Inversion: Towards Quantifying Privacy in Searchable EncryptionEvgenios M. Kornaropoulos, Nathaniel Moyer, Charalampos Papamanthou, Alexandros PsomasCCS 2022 · 26 citations
