What Storage Access Privacy is Achievable with Small Overhead?
Summary: Shows constant-overhead access requires ε = Ω(log n) differential privacy, implying small-overhead schemes must accept logarithmic leakage. Gives matching DP-ORAM/PIR (ε=Θ(log n), O(1) overhead) and a DP key-value store (ε=Θ(log n), O(log log n) overhead) using oblivious two-choice hashing. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Sarvar Patel (Google)
- 2. Giuseppe Persiano (Google; University of Salerno)
- 3. Kevin Yeo (Google)
BibTeX Citation
@inproceedings{patel_pods19,
address = {New York, NY, USA},
series = {{PODS} '19},
title = {{What Storage Access Privacy is Achievable with Small Overhead?}},
url = {https://dl.acm.org/doi/10.1145/3294052.3319695},
doi = {10.1145/3294052.3319695},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Patel, Sarvar and Persiano, Giuseppe and Yeo, Kevin},
year = {2019}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,434 | Waffle: An Online Oblivious Datastore for Protecting Data Access Patterns | 2023 | SIGMOD | 5.4253644e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,548 | Local Differentially Private Heavy Hitter Detection in Data Streams with Bounded Memory | 2024 | SIGMOD |
| 2 | 10,647 | Private Synthetic Data Generation in Bounded Memory | 2025 | PODS |
| 3 | 6,797 | Efficient Searchable Encryption Through Compression | 2018 | VLDB |
| 4 | 7,723 | Frequency-Hiding Order-Preserving Encryption with Small Client Storage | 2021 | VLDB |
| 5 | 11,137 | History-Independent Dynamic Partitioning: Achieving Operation-Order Privacy in Ordered Data Structures | 2024 | PODS |
| 6 | 123 | Revealing Information while Preserving Privacy | 2003 | PODS |
| 7 | 13,323 | Access Control for Information-Theoretically Secure Data | 2025 | VLDB |
| 8 | 5,128 | A Comparative Evaluation of Order-Revealing Encryption Schemes and Secure Range-Query Protocols | 2019 | VLDB |
| 9 | 11,092 | Towards Practical Oblivious Map | 2025 | VLDB |
| 10 | 5,444 | Oblivious RAM: A Dissection and Experimental Evaluation | 2016 | VLDB |