A Logarithmic Lower Bound for Oblivious RAM (For All Parameters)
An Oblivious RAM (ORAM), introduced by Goldreich and Ostrovsky (J. ACM 1996), is a (probabilistic) RAM that hides its access pattern, i.e., for every input the observed locations accessed are similarly distributed. In recent years there has been great progress both in terms of upper bounds as well as in terms of lower bounds, essentially pinning down the smallest overhead possible in various settings of parameters.
Authors
- Ilan Komargodski (ORCID: https://orcid.org/0000-0002-1647-2112)
- Wei-Kai Lin (ORCID: https://orcid.org/0000-0001-6012-7124)
Institutions
- University of Virginia (US)
Publication Details
- Journal
- SIAM Journal on Computing
- Published
- 2025-04-25
- DOI
- https://doi.org/10.1137/21m1428431
- Primary Topic
- Cryptography and Data Security
- Type
- article
- Field-Weighted Citation Impact
- 0.00