Snoopy: Surpassing the Scalability Bottleneck of Oblivious Storage
Emma Dauterman, Vivian Fang, Ioannis Demertzis, Natacha Crooks, Raluca Ada Popa
Abstract
Existing oblivious storage systems provide strong security by hiding access patterns, but do not scale to sustain high throughput as they rely on a central point of coordination. To overcome this scalability bottleneck, we present Snoopy, an object store that is both oblivious and scalable such that adding more machines increases system throughput. Snoopy contributes techniques tailored to the high-throughput regime to securely distribute and efficiently parallelize every system component without prohibitive coordination costs. These techniques enable Snoopy to scale similarly to a plaintext storage system. Snoopy achieves 13.7x higher throughput than Obladi, a state-of-the-art oblivious storage system. Specifically, Obladi reaches a throughput of 6.7K requests/s for two million 160-byte objects and cannot scale beyond a proxy and server machine. For the same data size, Snoopy uses 18 machines to scale to 92K requests/s with average latency under 500ms.
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 4f219810-b5d1-4ff2-b778-10bd22f22c55Cited by top-tier papers17
- Private Web Search with TiptoeAlexandra Henzinger, Emma Dauterman, Henry Corrigan-Gibbs, Nickolai ZeldovichSOSP 2023 · 25 citations
- GraphOS: Towards Oblivious Graph ProcessingJavad Ghareh Chamani, Ioannis Demertzis, Dimitrios Papadopoulos, Charalampos Papamanthou et al.VLDB 2023 · 21 citations
- MUSES: Efficient Multi-User Searchable Encrypted DatabaseTung Le, Rouzbeh Behnia, Jorge Guajardo, Thang HoangUSENIX Security 2024 · 11 citations
- Waks-On/Waks-Off: Fast Oblivious Offline/Online Shuffling and Sorting with Waksman NetworksSajin Sasy, Aaron Johnson, Ian GoldbergCCS 2023 · 6 citations
- Towards Practical Oblivious MapXinle Cao, Weiqi Feng, Jian Liu, Jinjin Zhou et al.VLDB 2025 · 4 citations
Builds on33
- Foreshadow: Extracting the Keys to the Intel SGX Kingdom with Transient Out-of-Order ExecutionJo Van Bulck, Marina Minkin, Ofir Weisse, Daniel Genkin et al.USENIX Security 2018 · 1,175 citations
- Sanctum: Minimal Hardware Extensions for Strong Software IsolationVictor Costan, Ilia A. Lebedev, Srinivas DevadasUSENIX Security 2016 · 649 citations
- Inferring Fine-grained Control Flow Inside SGX Enclaves with Branch ShadowingSangho Lee, Ming-Wei Shih, Prasun Gera, Taesoo Kim et al.USENIX Security 2017 · 536 citations
- ZombieLoad: Cross-Privilege-Boundary Data SamplingMichael Schwarz, Moritz Lipp, Daniel Moghimi, Jo Van Bulck et al.CCS 2019 · 464 citations
- RIDL: Rogue In-Flight Data LoadStephan van Schaik, Alyssa Milburn, Sebastian Österlund, Pietro Frigo et al.S&P 2019 · 408 citations
Related papers
- TaoStore: Overcoming Asynchronicity in Oblivious Data StorageCetin Sahin, Victor Zakhary, Amr El Abbadi, Huijia Lin et al.S&P 2016 · 98 citations
- Treebeard: A Scalable and Fault Tolerant ORAM DatastoreAmin Setayesh, Cheran Mahalingam, Emily Chen, Sujaya MaiyyaUSENIX Security 2025
- SHORTSTACK: Distributed, Fault-tolerant, Oblivious Data AccessMidhul Vuppalapati, Kushal Babel, Anurag Khandelwal, Rachit AgarwalOSDI 2022 · 13 citations
- OasisDB: An Oblivious and Scalable System for Relational DataHaseeb Ahmed, Nachiket Rao, Abdelkarim Kati, Florian Kerschbaum et al.VLDB 2025 · 2 citations
- Distributed & Scalable Oblivious Sorting and ShufflingNicholas Ngai, Ioannis Demertzis, Javad Ghareh Chamani, Dimitrios PapadopoulosS&P 2024 · 11 citations
