2010/07/07 by Michael T. Goodrich, Michael Mitzenmacher, Goodrich, Michael T. +1 · 1 citation
Computer Science · #Complexity and Algorithms in Graphs #Cryptography and Data Security #Cryptography and Security (cs.CR) #Data Structures and Algorithms (cs.DS) #Distributed #FOS: Computer and information sciences #Parallel #Privacy-Preserving Technologies in Data #and Cluster Computing (cs.DC) #cs.CR #cs.DC #cs.DS
paper · pdf · doi:10.48550/arxiv.1007.1259
A more complete version of a paper appearing in the 38th International Colloquium on Automata, Languages and Programming (ICALP) 2011
openalex publication_date 2010/07/07 · arxiv created 2011/05/02 · arxiv updated 2011/05/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Suppose a client, Alice, has outsourced her data to an external storage provider, Bob, because he has capacity for her massive data set, of size n, whereas her private storage is much smaller--say, of size O(n1/r), for some constant r > 1. Alice trusts Bob to maintain her data, but she would like to keep its contents private. She can encrypt her data, of course, but she also wishes to keep her access patterns hidden from Bob as well. We describe schemes for the oblivious RAM simulation problem with a small logarithmic or polylogarithmic amortized increase in access times, with a very high probability of success, while keeping the external storage to be of size O(n). To achieve this, our algorithmic contributions include a parallel MapReduce cuckoo-hashing algorithm and an external-memory dataoblivious sorting algorithm.