FutORAMa: A Concretely Efficient Hierarchical Oblivious RAM
Gilad Asharov, Ilan Komargodski, Yehuda Michelson
2023年份
7被引次数
9顶会引用
摘要
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).
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper,每个回答都会注明依据哪几篇。
引用它的顶会 Paper9
- Hoss: Fast Oblivious Semantic Search with Heterogeneous GPU-CPU-TEE ArchitectureJianzhang Du, Weijie Huang, Chenghong Wang, Nicolas Tsagareli 等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 等CCS 2025
相关 Paper
- Oblivious Single Access Machines - A New Model for Oblivious ComputationAnanya Appan, David Heath, Ling RenCCS 2024 · 被引用 1 次
- Optimal Oblivious Parallel RAMGilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico 等SODA 2022 · 被引用 19 次
- Revisiting Square-Root ORAM: Efficient Random Access in Multi-party ComputationSamee Zahur, Xiao Wang, Mariana Raykova, Adrià Gascón 等S&P 2016 · 被引用 124 次
- OptORAMa: Optimal Oblivious RAMGilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak 等EUROCRYPT 2020 · 被引用 92 次
- MegaBlocks: Breaking the Logarithmic I/O-Overhead Barrier for Oblivious RAMGilad Asharov, Eliran Eiluz, Ilan Komargodski, Wei-Kai LinCCS 2025
