Generic Attacks on Secure Outsourced Databases
Georgios Kellaris, George Kollios, Kobbi Nissim, Adam O'Neill
Abstract
Recently, various protocols have been proposed for securely outsourcing database storage to a third party server, ranging from systems with "full-fledged" security based on strong cryptographic primitives such as fully homomorphic encryption or oblivious RAM, to more practical implementations based on searchable symmetric encryption or even on deterministic and order-preserving encryption. On the flip side, various attacks have emerged that show that for some of these protocols confidentiality of the data can be compromised, usually given certain auxiliary information.
We take a step back and identify a need for a formal understanding of the inherent efficiency/privacy trade-off in outsourced database systems, independent of the details of the system. We propose abstract models that capture secure outsourced storage systems in sufficient generality, and identify two basic sources of leakage, namely access pattern and communication volume. We use our models to distinguish certain classes of outsourced database systems that have been proposed, and deduce that all of them exhibit at least one of these leakage sources.
We then develop generic reconstruction attacks on any system supporting range queries where either access pattern or communication volume is leaked. These attacks are in a rather weak passive adversarial model, where the untrusted server knows only the underlying query distribution. In particular, to perform our attack the server need not have any prior knowledge about the data, and need not know any of the issued queries nor their results. Yet, the server can reconstruct the secret attribute of every record in the database after about N 4 queries, where N is the domain size. We provide a matching lower bound showing that our attacks are
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 1b5902a3-5f7a-42bb-a10c-6be198f6a633Cited by top-tier papers79
- Oblix: An Efficient Oblivious Search IndexPratyush Mishra, Rishabh Poddar, Jerry Chen, Alessandro Chiesa et al.S&P 2018 · 200 citations
- Improved Reconstruction Attacks on Encrypted Data Using Range Query LeakageMarie-Sarah Lacharité, Brice Minaud, Kenneth G. PatersonS&P 2018 · 183 citations
- Pump up the Volume: Practical Database Reconstruction from Volume Leakage on Range QueriesPaul Grubbs, Marie-Sarah Lacharité, Brice Minaud, Kenneth G. PatersonCCS 2018 · 172 citations
- Hiding the Access Pattern is Not Enough: Exploiting Search Pattern Leakage in Searchable EncryptionSimon Oya, Florian KerschbaumUSENIX Security 2021 · 152 citations
- Learning to Reconstruct: Statistical Learning Theory and Encrypted Database AttacksPaul Grubbs, Marie-Sarah Lacharité, Brice Minaud, Kenneth G. PatersonS&P 2019 · 146 citations
Related papers
- εpsolute: Efficiently Querying Databases While Providing Differential PrivacyDmytro Bogatov, Georgios Kellaris, George Kollios, Kobbi Nissim et al.CCS 2021 · 16 citations
- Differentially Private Access in Encrypted Search: Achieving Privacy at a Small Cost?Daniel Pöllmann, Tianxin TangCCS 2025
- Reconstructing with Less: Leakage Abuse Attacks in Two DimensionsEvangelia Anna Markatou, Francesca Falzon, Roberto Tamassia, William SchorCCS 2021 · 22 citations
- Full Database Reconstruction in Two DimensionsFrancesca Falzon, Evangelia Anna Markatou, Akshima, David Cash et al.CCS 2020 · 27 citations
- SEAL: Attack Mitigation for Encrypted Databases via Adjustable LeakageIoannis Demertzis, Dimitrios Papadopoulos, Charalampos Papamanthou, Saurabh ShintreUSENIX Security 2020
