Oblivious RAM simulation with efficient worst-case access overhead

Authors:
Michael T. Goodrich;Michael Mitzenmacher;Olga Ohrimenko;Roberto Tamassia
Affiliations:
Univ. California, Irvine, Irvine, CA, USA;Harvard University, Cambridge, MA, USA;Brown University, Providence, RI, USA;Brown University, Providence, RI, USA
Venue:
Proceedings of the 3rd ACM workshop on Cloud computing security workshop
Year:
2011

Citing 9
Cited 13

How to play ANY mental game

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Software protection and simulation on oblivious RAMs

Journal of the ACM (JACM)
Real-Time Simulation of Multihead Tape Units

Journal of the ACM (JACM)
De-amortization of Algorithms

COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Cuckoo hashing

Journal of Algorithms
Building castles out of mud: practical access pattern privacy and correctness on untrusted storage

Proceedings of the 15th ACM conference on Computer and communications security
More Robust Hashing: Cuckoo Hashing with a Stash

SIAM Journal on Computing
Perfectly secure oblivious RAM without random oracles

TCC'11 Proceedings of the 8th conference on Theory of cryptography
Privacy-preserving access of outsourced data via oblivious RAM simulation

ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II

Privacy-preserving group data access via stateless oblivious RAM simulation

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Practical oblivious storage

Proceedings of the second ACM conference on Data and Application Security and Privacy
Oblivious RAM with o((logn)3) worst-case cost

ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Single round access privacy on outsourced storage

Proceedings of the 2012 ACM conference on Computer and communications security
PrivateFS: a parallel oblivious file system

Proceedings of the 2012 ACM conference on Computer and communications security
Graph drawing in the cloud: privately visualizing relational data using small working storage

GD'12 Proceedings of the 20th international conference on Graph Drawing
Distributed oblivious RAM for secure two-party computation

TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Memory access pattern protection for resource-constrained devices

CARDIS'12 Proceedings of the 11th international conference on Smart Card Research and Advanced Applications
Path ORAM: an extremely simple oblivious RAM protocol

Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Multi-cloud oblivious storage

Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Outsourced private information retrieval

Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society
Access privacy and correctness on untrusted storage

ACM Transactions on Information and System Security (TISSEC)
Shroud: ensuring private access to large-scale data in the data center

FAST'13 Proceedings of the 11th USENIX conference on File and Storage Technologies

Quantified Score

Hi-index	0.00

Visualization

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 others, including even the manager of that storage, cannot infer information about its contents. Existing solutions typically yield small amortized overheads for achieving this goal, but also yield huge variations in access times, depending on when they occur. In this paper, we show how to deamortize oblivious RAM simulations, so that each access takes a worst-case bounded amount of time.