USENIX Security2025Top-tier venue
V-ORAM: A Versatile and Adaptive ORAM Framework with Service Transformation for Dynamic Workloads
Bo Zhang, Helei Cui, Xingliang Yuan, Zhiwen Yu, Bin Guo
Abstract
Oblivious RAM (ORAM) has been attracting significant attention for building encrypted data storage systems due to its strong security guarantees and communities' continuing efforts to improve its efficiency. Despite great potential, a specific ORAM scheme is normally designed and optimized for a certain type of client workloads, given the nature of its complicated cryptographic construction. Once deployed, a single ORAM service can hardly serve dynamic workloads in an efficient and cost-effective manner. To bridge the gap, in this paper, we propose a versatile ORAM framework named V-ORAM, which can efficiently and securely switch between different ORAM services to adaptively serve dynamic workloads in the real-world. In particular, V-ORAM is equipped with a service transformation protocol that leverages a base ORAM as an intermedia of transformation and can synchronize the states of tree-based ORAMs without downloading and rebuilding the ORAM by the client. We formalize the security of V-ORAM, and prove that V-ORAM holds the security of ORAMs, including the process of service transformation. V-ORAM also provides a planner to recommend the ORAM service type and ORAM parameters for adapting to the client workloads, server resources and monetary expenses. We implement V-ORAM and evaluate the cost of transformation. We also conduct real-world case studies over three medical datasets and different workloads. Compared with directly rebuilding ORAMs, V-ORAM saves up to 10 4.12 ↓ processing time and communication cost, up to 33.1% of monetary costs in real-world workloads, and generates constant impact to employed ORAM services, i.e., < 5ms in processing and < 50kB in communication.
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 d62be875-a556-4f82-b3d6-9c94d91313adBuilds on30
- A large scale analysis of hundreds of in-memory cache clusters at TwitterJuncheng Yang, Yao Yue, K. V. RashmiOSDI 2020 · 245 citations
- Scaling ORAM for Secure ComputationJack Doerner, Abhi ShelatCCS 2017 · 221 citations
- OBLIVIATE: A Data Oblivious Filesystem for Intel SGXAdil Ahmad, Kyungtae Kim, Muhammad Ihsanulhaq Sarfaraz, Byoungyoung LeeNDSS 2018 · 144 citations
- Revisiting Square-Root ORAM: Efficient Random Access in Multi-party ComputationSamee Zahur, Xiao Wang, Mariana Raykova, Adrià Gascón et al.S&P 2016 · 124 citations
- TaoStore: Overcoming Asynchronicity in Oblivious Data StorageCetin Sahin, Victor Zakhary, Amr El Abbadi, Huijia Lin et al.S&P 2016 · 98 citations
Related papers
- rORAM: Efficient Range ORAM with O(log2 N) LocalityAnrin Chakraborti, Adam J. Aviv, Seung Geol Choi, Travis Mayberry et al.NDSS 2019 · 20 citations
- Towards Practical Oblivious MapXinle Cao, Weiqi Feng, Jian Liu, Jinjin Zhou et al.VLDB 2025 · 4 citations
- Weighted Oblivious RAM, with Applications to Searchable Symmetric EncryptionLéonard Assouline, Brice MinaudEUROCRYPT 2023 · 9 citations
- S3ORAM: A Computation-Efficient and Constant Client Bandwidth Blowup ORAM with Shamir Secret SharingThang Hoang, Ceyhun D. Ozkaptan, Attila A. Yavuz, Jorge Guajardo et al.CCS 2017 · 52 citations
- QuORAM: A Quorum-Replicated Fault Tolerant ORAM DatastoreSujaya Maiyya, Seif Ibrahim, Caitlin Scarberry, Divyakant Agrawal et al.USENIX Security 2022
