Stronger Lower Bounds for Online ORAM

03/08/2019
by   Pavel Hubáček, et al.
0

Oblivious RAM (ORAM), introduced in the context of software protection by Goldreich and Ostrovsky [JACM'96], aims at obfuscating the memory access pattern induced by a RAM computation. Ideally, the memory access pattern of an ORAM should be oblivious of the data being processed. Since the work of Goldreich and Ostrovsky, it was believed that there is an inherent Ω( n) bandwidth overhead in any ORAM working with memory of size n . Larsen and Nielsen [CRYPTO'18] were the first to give a general Ω( n) lower bound for any online ORAM, i.e., an ORAM that must process its inputs in an online manner. In this work, we revisit the lower bound of Nielsen and Larsen, which was proved under an assumption about the format of the memory access pattern of the ORAM. We give an Ω( n) lower bound for the bandwidth overhead of any online ORAM without any such restriction. Our results thus match the model of Boyle and Naor [ITCS'16] who proved that any super-constant lower bound for offline ORAM, i.e., an ORAM that can process its inputs simultaneously, implies super-linear lower bounds on size of sorting circuits -- which would constitute a major breakthrough in computational complexity. As our main technical contribution and to handle the lack of structure, we study the properties of access graph induced naturally by the memory access pattern of an ORAM computation. We identify a particular graph property that can be efficiently tested and that all access graphs of ORAM computation must satisfy with high probability. This property is reminiscent of the Larsen-Nielsen property but it is substantially less structured; that is, it is more generic.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/15/2020

Observations on Symmetric Circuits

We study symmetric arithmetic circuits and improve on lower bounds given...
research
04/18/2023

Super-Logarithmic Lower Bounds for Dynamic Graph Problems

In this work, we prove a Ω̃(^3/2 n ) unconditional lower bound on the ma...
research
08/08/2023

Determinants vs. Algebraic Branching Programs

We show that for every homogeneous polynomial of degree d, if it has det...
research
11/04/2018

Lower Bounds for External Memory Integer Sorting via Network Coding

Sorting extremely large datasets is a frequently occuring task in practi...
research
08/30/2022

Lower bound for constant-size local certification

Given a network property or a data structure, a local certification is a...
research
12/07/2020

Stronger Calibration Lower Bounds via Sidestepping

We consider an online binary prediction setting where a forecaster obser...
research
12/31/2020

I/O Lower Bounds for Auto-tuning of Convolutions in CNNs

Convolution is the most time-consuming part in the computation of convol...

Please sign up or login with your details

Forgot password? Click here to reset