FutORAMa: A Concretely Efficient Hierarchical Oblivious RAM
Gilad Asharov, Ilan Komargodski, Yehuda Michelson
2023Year
7Citations
9Top-tier citations
Abstract
Oblivious RAM (ORAM) is a general-purpose technique for hiding memory access patterns. This is a fundamental task underlying many secure computation applications. While known ORAM schemes provide optimal asymptotic complexity, despite extensive efforts, their concrete costs remain prohibitively expensive for many interesting applications. The current state-of-the-art practical ORAM schemes are suitable only for somewhat small memories (Square-Root ORAM or Path ORAM).
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 44beae52-cb28-45a1-beaf-b2dd7428a448Cited by top-tier papers9
- Hoss: Fast Oblivious Semantic Search with Heterogeneous GPU-CPU-TEE ArchitectureJianzhang Du, Weijie Huang, Chenghong Wang, Nicolas Tsagareli et al.CCS 2026
- SONIC: Concurrent Oblivious RAM & Data Structures for Low-Latency and High-ThroughputNihal Talur, Ioannis DemertzisUSENIX Security 2026
- Differentially Oblivious Multi-way JoinZhiang Wu, Wei Dong, Xiao HuSIGMOD 2026
- MVP-ORAM: a Wait-free Concurrent ORAM for Confidential BFT StorageRobin Vassantlal, Hasan Heydari, Bernardo Ferreira, Alysson BessaniNDSS 2026
- BOLT: Bandwidth-Optimized Lightning-Fast Oblivious Map powered by Secure HBM AcceleratorsYitong Guo, Hongbo Chen, Haobin Hiroki Chen, Yukui Luo et al.CCS 2025
Related papers
- Oblivious Single Access Machines - A New Model for Oblivious ComputationAnanya Appan, David Heath, Ling RenCCS 2024 · 1 citation
- Optimal Oblivious Parallel RAMGilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico et al.SODA 2022 · 19 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
- OptORAMa: Optimal Oblivious RAMGilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak et al.EUROCRYPT 2020 · 92 citations
- MegaBlocks: Breaking the Logarithmic I/O-Overhead Barrier for Oblivious RAMGilad Asharov, Eliran Eiluz, Ilan Komargodski, Wei-Kai LinCCS 2025
