ConcurORAM: High-Throughput Stateless Parallel Multi-Client ORAM
Anrin Chakraborti, Radu Sion
Abstract
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.
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 aa7b2163-cebe-4592-b175-0a947163fa3eCited by top-tier papers24
- ObliDB: Oblivious Query Processing for Secure DatabasesSaba Eskandarian, Matei ZahariaVLDB 2020 · 127 citations
- Snoopy: Surpassing the Scalability Bottleneck of Oblivious StorageEmma Dauterman, Vivian Fang, Ioannis Demertzis, Natacha Crooks et al.SOSP 2021 · 26 citations
- GraphOS: Towards Oblivious Graph ProcessingJavad Ghareh Chamani, Ioannis Demertzis, Dimitrios Papadopoulos, Charalampos Papamanthou et al.VLDB 2023 · 21 citations
- SHORTSTACK: Distributed, Fault-tolerant, Oblivious Data AccessMidhul Vuppalapati, Kushal Babel, Anurag Khandelwal, Rachit AgarwalOSDI 2022 · 13 citations
- Waffle: An Online Oblivious Datastore for Protecting Data Access PatternsSujaya Maiyya, Sharath Chandra Vemula, Divyakant Agrawal, Amr El Abbadi et al.SIGMOD 2024 · 11 citations
Builds on1
Related papers
- 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 citation
- QuORAM: A Quorum-Replicated Fault Tolerant ORAM DatastoreSujaya Maiyya, Seif Ibrahim, Caitlin Scarberry, Divyakant Agrawal et al.USENIX Security 2022
- DuetORAM: Two-Server Distributed ORAM with Constant Rounds and O(log N) CommunicationFeng Li, Xiangfu Song, Yingying Li, Lisha Yao et al.USENIX Security 2026
- Optimal Oblivious Parallel RAMGilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico et al.SODA 2022 · 19 citations
