USENIX Security2022Top-tier venue
QuORAM: A Quorum-Replicated Fault Tolerant ORAM Datastore
Sujaya Maiyya, Seif Ibrahim, Caitlin Scarberry, Divyakant Agrawal, Amr El Abbadi, Huijia Lin, Stefano Tessaro, Victor Zakhary
Abstract
Privacy and security challenges due to the outsourcing of data storage and processing to third-party cloud providers are well known. With regard to data privacy, Oblivious RAM (ORAM) schemes provide strong privacy guarantees by not only hiding the contents of the data (by encryption) but also obfuscating the access patterns of the outsourced data. But most existing ORAM datastores are not fault tolerant in that if the external storage server (which stores encrypted data) or the trusted proxy (which stores the encryption key and other metadata) crashes, an application loses all of its data. To achieve fault-tolerance, we propose QuORAM, the first ORAM datastore to replicate data with a quorum-based replication protocol. QuORAM's contributions are three-fold: (i) it obfuscates access patterns to provide obliviousness guarantees, (ii) it replicates data using a novel lock-free and decentralized replication protocol to achieve fault-tolerance, and (iii) it guarantees linearizable semantics. Experimentally evaluating QuORAM highlights counter-intuitive results: QuORAM incurs negligible cost to achieve obliviousness when compared to an insecure fault-tolerant replicated system; QuORAM's peak throughput is 2.4x of its non-replicated baseline; and QuORAM performs 33.2x better in terms of throughput than an ORAM datastore that relies on CockroachDB, an opensource geo-replicated database, for fault tolerance.
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 cf45b709-4532-49d9-a6bb-ac97993fc04cCited by top-tier papers4
- 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
- OasisDB: An Oblivious and Scalable System for Relational DataHaseeb Ahmed, Nachiket Rao, Abdelkarim Kati, Florian Kerschbaum et al.VLDB 2025 · 2 citations
- MVP-ORAM: a Wait-free Concurrent ORAM for Confidential BFT StorageRobin Vassantlal, Hasan Heydari, Bernardo Ferreira, Alysson BessaniNDSS 2026
- Treebeard: A Scalable and Fault Tolerant ORAM DatastoreAmin Setayesh, Cheran Mahalingam, Emily Chen, Sujaya MaiyyaUSENIX Security 2025
Builds on5
- Generic Attacks on Secure Outsourced DatabasesGeorgios Kellaris, George Kollios, Kobbi Nissim, Adam O'NeillCCS 2016 · 327 citations
- Learning to Reconstruct: Statistical Learning Theory and Encrypted Database AttacksPaul Grubbs, Marie-Sarah Lacharité, Brice Minaud, Kenneth G. PatersonS&P 2019 · 146 citations
- Data Recovery on Encrypted Databases with k-Nearest Neighbor Query LeakageEvgenios M. Kornaropoulos, Charalampos Papamanthou, Roberto TamassiaS&P 2019 · 92 citations
- Hermes: A Fast, Fault-Tolerant and Linearizable Replication ProtocolAntonios Katsarakis, Vasilis Gavrielatos, M. R. Siavash Katebzadeh, Arpit Joshi et al.ASPLOS 2020 · 47 citations
- SEAL: Attack Mitigation for Encrypted Databases via Adjustable LeakageIoannis Demertzis, Dimitrios Papadopoulos, Charalampos Papamanthou, Saurabh ShintreUSENIX Security 2020
Related papers
- Towards Practical Oblivious JoinZhao Chang, Dong Xie, Sheng Wang, Feifei LiSIGMOD 2022 · 20 citations
- Oblivious Single Access Machines - A New Model for Oblivious ComputationAnanya Appan, David Heath, Ling RenCCS 2024 · 1 citation
- ObliviSync: Practical Oblivious File Backup and SynchronizationAdam J. Aviv, Seung Geol Choi, Travis Mayberry, Daniel S. RocheNDSS 2017 · 13 citations
- Bulkor: Enabling Bulk Loading for Path ORAMXiang Li, Yunqian Luo, Mingyu GaoS&P 2024 · 8 citations
- ConcurORAM: High-Throughput Stateless Parallel Multi-Client ORAMAnrin Chakraborti, Radu SionNDSS 2019 · 42 citations
