Practical Volume-Based Attacks on Encrypted Databases
Rishabh Poddar, Stephanie Wang, Jianan Lu, Raluca Ada Popa

TL;DR
This paper introduces practical volume-based attacks on encrypted databases that can recover query content with minimal assumptions, exploiting real-world application behaviors like file injection and query replay.
Contribution
The authors develop new attacks that require only a single query and no distribution assumptions, leveraging application behaviors to compromise encrypted database privacy.
Findings
Attacks can recover query keywords from a single volume leak.
Real-world application behaviors enable practical attacks.
Gmail attack completes within minutes.
Abstract
Recent years have seen an increased interest towards strong security primitives for encrypted databases (such as oblivious protocols), that hide the access patterns of query execution, and reveal only the volume of results. However, recent work has shown that even volume leakage can enable the reconstruction of entire columns in the database. Yet, existing attacks rely on a set of assumptions that are unrealistic in practice: for example, they (i) require a large number of queries to be issued by the user, or (ii) assume certain distributions on the queries or underlying data (e.g., that the queries are distributed uniformly at random, or that the database does not contain missing values). In this work, we present new attacks for recovering the content of individual user queries, assuming no leakage from the system except the number of results and avoiding the limiting assumptions…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Security and Verification in Computing · Internet Traffic Analysis and Secure E-voting
