Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > ORAM:
Reports tagged with ORAM:
TR15-146 | 7th September 2015
Elette Boyle, Moni Naor

Is There an Oblivious RAM Lower Bound?

Revisions: 1

An Oblivious RAM (ORAM), introduced by Goldreich and Ostrovsky (JACM 1996), is a (probabilistic) RAM that hides its access pattern, i.e. for every input the observed locations accessed are similarly distributed. Great progress has been made in recent years in minimizing the overhead of ORAM constructions, with the goal of ... more >>>




ISSN 1433-8092 | Imprint