pith. sign in

arxiv: 1107.5093 · v1 · pith:6U5UCBNZnew · submitted 2011-07-25 · 💻 cs.CR

Oblivious RAM Simulation with Efficient Worst-Case Access Overhead

classification 💻 cs.CR
keywords accessobliviousachievinginvolvesimulationstorageworst-caseamortized
0
0 comments X
read the original abstract

Oblivious RAM simulation is a method for achieving confidentiality and privacy in cloud computing environments. It involves obscuring the access patterns to a remote storage so that the manager of that storage cannot infer information about its contents. Existing solutions typically involve small amortized overheads for achieving this goal, but nevertheless involve potentially huge variations in access times, depending on when they occur. In this paper, we show how to de-amortize oblivious RAM simulations, so that each access takes a worst-case bounded amount of time.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.