Computer Science – Cryptography and Security
Scientific paper
2011-10-09
Computer Science
Cryptography and Security
Scientific paper
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(N^{1/c})$, for some constant $c\ge2$, 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 $2N^{1/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.
Goodrich Michael T.
Mitzenmacher Michael
Ohrimenko Olga
Tamassia Roberto
No associations
LandOfFree
Oblivious Storage with Low I/O Overhead does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Oblivious Storage with Low I/O Overhead, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Oblivious Storage with Low I/O Overhead will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-88341