Snoopy: Surpassing the Scalability Bottleneck of Oblivious Storage
Emma Dauterman, Vivian Fang, Ioannis Demertzis, Natacha Crooks, Raluca Ada Popa
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper17
- Private Web Search with TiptoeAlexandra Henzinger, Emma Dauterman, Henry Corrigan-Gibbs, Nickolai ZeldovichSOSP 2023 · 被引用 25 次
- GraphOS: Towards Oblivious Graph ProcessingJavad Ghareh Chamani, Ioannis Demertzis, Dimitrios Papadopoulos, Charalampos Papamanthou 等VLDB 2023 · 被引用 21 次
- MUSES: Efficient Multi-User Searchable Encrypted DatabaseTung Le, Rouzbeh Behnia, Jorge Guajardo, Thang HoangUSENIX Security 2024 · 被引用 11 次
- Waks-On/Waks-Off: Fast Oblivious Offline/Online Shuffling and Sorting with Waksman NetworksSajin Sasy, Aaron Johnson, Ian GoldbergCCS 2023 · 被引用 6 次
- Towards Practical Oblivious MapXinle Cao, Weiqi Feng, Jian Liu, Jinjin Zhou 等VLDB 2025 · 被引用 4 次
它引用的顶会 Paper33
- Foreshadow: Extracting the Keys to the Intel SGX Kingdom with Transient Out-of-Order ExecutionJo Van Bulck, Marina Minkin, Ofir Weisse, Daniel Genkin 等USENIX Security 2018 · 被引用 1,175 次
- Sanctum: Minimal Hardware Extensions for Strong Software IsolationVictor Costan, Ilia A. Lebedev, Srinivas DevadasUSENIX Security 2016 · 被引用 649 次
- Inferring Fine-grained Control Flow Inside SGX Enclaves with Branch ShadowingSangho Lee, Ming-Wei Shih, Prasun Gera, Taesoo Kim 等USENIX Security 2017 · 被引用 536 次
- ZombieLoad: Cross-Privilege-Boundary Data SamplingMichael Schwarz, Moritz Lipp, Daniel Moghimi, Jo Van Bulck 等CCS 2019 · 被引用 464 次
- RIDL: Rogue In-Flight Data LoadStephan van Schaik, Alyssa Milburn, Sebastian Österlund, Pietro Frigo 等S&P 2019 · 被引用 408 次
相关 Paper
- TaoStore: Overcoming Asynchronicity in Oblivious Data StorageCetin Sahin, Victor Zakhary, Amr El Abbadi, Huijia Lin 等S&P 2016 · 被引用 98 次
- 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 次
- OasisDB: An Oblivious and Scalable System for Relational DataHaseeb Ahmed, Nachiket Rao, Abdelkarim Kati, Florian Kerschbaum 等VLDB 2025 · 被引用 2 次
- Distributed & Scalable Oblivious Sorting and ShufflingNicholas Ngai, Ioannis Demertzis, Javad Ghareh Chamani, Dimitrios PapadopoulosS&P 2024 · 被引用 11 次
