Optimal Offline ORAM with Perfect Security via Simple Oblivious Priority Queues

TL;DR

This paper introduces the first optimal offline ORAM with perfect security, utilizing oblivious priority queues, achieving asymptotically optimal runtime and I/O complexities in both cache-aware and cache-oblivious models.

Contribution

It presents a simple, secure oblivious priority queue construction and applies it to create an optimal offline ORAM with perfect security, improving efficiency in external-memory settings.

Findings

Achieves $ heta(rac{1}{B} ext{log} rac{N}{M})$ I/O complexity per operation in cache-aware model.

Provides a near-optimal $ ext{O}(rac{1}{B} ext{log} rac{N}{M} ext{log} ext{log}_M N)$ I/O complexity in cache-oblivious model.

Constructs an asymptotically optimal $ heta( ext{log} N)$ amortized runtime oblivious priority queue.

Abstract

Oblivious RAM (ORAM) is a well-researched primitive to hide the memory access pattern of a RAM computation; it has a variety of applications in trusted computing, outsourced storage, and multiparty computation. In this paper, we study the so-called offline ORAM in which the sequence of memory access locations to be hidden is known in advance. Apart from their theoretical significance, offline ORAMs can be used to construct efficient oblivious algorithms. We obtain the first optimal offline ORAM with perfect security from oblivious priority queues via time-forward processing. For this, we present a simple construction of an oblivious priority queue with perfect security. Our construction achieves an asymptotically optimal (amortized) runtime of $\Theta(\log N)$ per operation for a capacity of $N$ elements and is of independent interest. Building on our construction, we additionally present efficient external-memory instantiations of our oblivious, perfectly-secure construction: For the cache-aware setting, we match the optimal I/O complexity of $\Theta(\frac{1}{B} \log \frac{N}{M})$ per operation (amortized), and for the cache-oblivious setting we achieve a near-optimal I/O complexity of $O(\frac{1}{B} \log \frac{N}{M} \log\log_M N)$ per operation (amortized).