Locality-Preserving Oblivious RAM

• Published in: Journal of cryptology Vol. 35; no. 2
• Main Authors: Asharov, Gilad, Chan, T.-H. Hubert, Nayak, Kartik, Pass, Rafael, Ren, Ling, Shi, Elaine
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.04.2022; Springer Nature B.V
• Subjects: Bandwidths; Coding and Information Theory; Combinatorics; Communications Engineering; Computational Mathematics and Numerical Analysis; Computer Science; Networks; Probability Theory and Stochastic Processes; Pseudorandom; Random access memory; Research Article; Oblivious RAM; Locality; Randomized algorithms
• ISSN: 0933-2790; 1432-1378
• DOI: 10.1007/s00145-022-09419-1

Oblivious RAMs, introduced by Goldreich and Ostrovsky [JACM’96], compile any RAM program into one that is “memory oblivious,” i.e., the access pattern to the memory is independent of the input. All previous ORAM schemes, however, completely break the locality of data accesses (for instance, by shuffling the data to pseudorandom positions in memory). In this work, we initiate the study of locality-preserving ORAMs —ORAMs that preserve locality of the accessed memory regions, while leaking only the lengths of contiguous memory regions accessed. Our main results demonstrate the existence of a locality-preserving ORAM with polylogarithmic overhead both in terms of bandwidth and locality. We also study the trade-off between locality, bandwidth and leakage, and show that any scheme that preserves locality and does not leak the lengths of the contiguous memory regions accessed, suffers from prohibitive bandwidth. To further improve the parameters, we also consider a weaker notion of a File ORAM, which supports accesses to predefined non-overlapping regions. Assuming one-way functions, we present a computationally secure File ORAM that has a work overhead and locality of roughly O ( log 2 N ) , while ignoring log log N factors. To the best of our knowledge, before our work, the only works combining locality and obliviousness were for symmetric searchable encryption [e.g., Cash and Tessaro (EUROCRYPT’14), Asharov et al. (STOC’16)]. Symmetric search encryption ensures obliviousness if each keyword is searched only once, whereas ORAM provides obliviousness to any input program. Thus, our work generalizes that line of work to the much more challenging task of preserving locality in ORAMs.