ConcurORAM: High-Throughput Stateless Parallel Multi-Client ORAM
Anrin Chakraborti, Radu Sion
摘要
ConcurORAM is a parallel, multi-client oblivious RAM (ORAM) that eliminates waiting for concurrent stateless clients and allows overall throughput to scale gracefully, without requiring trusted third party components (proxies) or direct inter-client coordination. A key insight behind ConcurORAM is the fact that, during multi-client data access, only a subset of the concurrently-accessed server-hosted data structures require access privacy guarantees. Everything else can be safely implemented as oblivious data structures that are later synced securely and efficiently during an ORAM "eviction". Further, since a major contributor to latency is the eviction -in which client-resident data is reshuffled and reinserted back encrypted into the main server database -ConcurORAM also enables multiple concurrent clients to evict asynchronously, in parallel (without compromising consistency), and in the background without having to block ongoing queries. As a result, throughput scales well with increasing number of concurrent clients and is not significantly impacted by evictions. For example, about 65 queries per second can be executed in parallel by 30 concurrent clients, a 2x speedup over the state-ofthe-art [12] . The query access time for individual clients increases by only 2x when compared to a single-client deployment.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper24
- ObliDB: Oblivious Query Processing for Secure DatabasesSaba Eskandarian, Matei ZahariaVLDB 2020 · 被引用 127 次
- Snoopy: Surpassing the Scalability Bottleneck of Oblivious StorageEmma Dauterman, Vivian Fang, Ioannis Demertzis, Natacha Crooks 等SOSP 2021 · 被引用 26 次
- GraphOS: Towards Oblivious Graph ProcessingJavad Ghareh Chamani, Ioannis Demertzis, Dimitrios Papadopoulos, Charalampos Papamanthou 等VLDB 2023 · 被引用 21 次
- SHORTSTACK: Distributed, Fault-tolerant, Oblivious Data AccessMidhul Vuppalapati, Kushal Babel, Anurag Khandelwal, Rachit AgarwalOSDI 2022 · 被引用 13 次
- Waffle: An Online Oblivious Datastore for Protecting Data Access PatternsSujaya Maiyya, Sharath Chandra Vemula, Divyakant Agrawal, Amr El Abbadi 等SIGMOD 2024 · 被引用 11 次
它引用的顶会 Paper1
相关 Paper
- MVP-ORAM: a Wait-free Concurrent ORAM for Confidential BFT StorageRobin Vassantlal, Hasan Heydari, Bernardo Ferreira, Alysson BessaniNDSS 2026
- Oblivious Single Access Machines - A New Model for Oblivious ComputationAnanya Appan, David Heath, Ling RenCCS 2024 · 被引用 1 次
- QuORAM: A Quorum-Replicated Fault Tolerant ORAM DatastoreSujaya Maiyya, Seif Ibrahim, Caitlin Scarberry, Divyakant Agrawal 等USENIX Security 2022
- DuetORAM: Two-Server Distributed ORAM with Constant Rounds and O(log N) CommunicationFeng Li, Xiangfu Song, Yingying Li, Lisha Yao 等USENIX Security 2026
- Optimal Oblivious Parallel RAMGilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico 等SODA 2022 · 被引用 19 次
