MegaBlocks: Breaking the Logarithmic I/O-Overhead Barrier for Oblivious RAM
Open Access
- 19 November 2025
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 4692-4706
Abstract
No abstract availableFunding Information
- Israel Science Foundation (2439/20)
- Israel Science Foundation (1774/20)
- European Research Commission (101043243)
- ERC (101162665)
This publication has 35 references indexed in Scilit:
- Oblivious RAM with Worst-Case Logarithmic OverheadJournal of Cryptology, 2023
- A Logarithmic Lower Bound for Oblivious RAM (for All Parameters)2021
- Oblivious Tight Compaction In O(n) Time with Smaller Constant2020
- OptORAMa: Optimal Oblivious RAM2020
- Yes, There is an Oblivious RAM Lower Bound!2018
- Oblivious Hashing Revisited, and Applications to Asymptotically Efficient ORAM and OPRAM2017
- Dynamic Proofs of Retrievability Via Oblivious RAMJournal of Cryptology, 2015
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs2015
- Private Database Access with HE-over-ORAM Architecture2015
- Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation2011