Paper Info
Title
Practical oblivious storage
Abstract
We study oblivious storage (OS), a natural way to model privacy-preserving data outsourcing where a client, Alice, stores sensitive data at an honest-but-curious server, Bob. We show that Alice can hide both the content of her data and the pattern in which she accesses her data, with high probability, using a method that achieves O(1) amortized rounds of communication between her and Bob for each data access. We assume that Alice and Bob exchange small messages, of size O(N1/c), for some constant c=2, in a single round, where N is the size of the data set that Alice is storing with Bob. We also assume that Alice has a private memory of size 2N1/c. These assumptions model real-world cloud storage scenarios, where trade-offs occur between latency, bandwidth, and the size of the client's private memory.
Year
DOI
Venue
2012
10.1145/2133601.2133604
CODASPY
Keywords
Field
DocType
practical oblivious storage,stores sensitive data,assumptions model real-world cloud,size o,bob exchange,private memory,oblivious storage,privacy-preserving data,amortized round,storage scenario,data access,systems,security,cloud computing,private information retrieval
Oblivious ram,Internet privacy,Alice and Bob,Latency (engineering),Computer science,Computer security,Bandwidth (signal processing),Data access,Private information retrieval,Cloud storage,Cloud computing
Conference
Citations 
PageRank 
References 
22
0.87
17
Authors
4
Name
Order
Citations
PageRank
Michael T. Goodrich14351331.47
Michael Mitzenmacher27386730.89
Olga Ohrimenko349427.48
R Tamassia44686550.39