Simple and Concretely Efficient Hierarchical Doubly ORAM
Shun Takagi, Marin Matsumoto, Satoshi Hasegawa
2026Year
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 97f644c5-16d1-4a04-943d-c0e4c2442916Related papers
- Zero-Knowledge RAM: Doubly Efficient and Black-BoxYuval Ishai, Rafail Ostrovsky, Akash ShahEUROCRYPT 2025 · 2 citations
- Alibi: A Flaw in Cuckoo-Hashing Based Hierarchical ORAM Schemes and a SolutionBrett Hemenway Falk, Daniel Noble, Rafail OstrovskyEUROCRYPT 2021 · 10 citations
- GigaDORAM: Breaking the Billion Address BarrierBrett Hemenway Falk, Rafail Ostrovsky, Matan Shtepel, Jacob ZhangUSENIX Security 2023
- Scaling ORAM for Secure ComputationJack Doerner, Abhi ShelatCCS 2017 · 221 citations
- Hourglass: Enabling Efficient Split Federated Learning with Data ParallelismQiang He, Kaibin Wang, Zeqian Dong, Liang Yuan et al.EuroSys 2025 · 3 citations
