Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation

Oblivious RAM (ORAM) is a provable technique to protect a user's access pattern to outsourced data. Recently, many ORAM constructions have been proposed, but most of them are impractical due to high communication and user-side storage costs. Motivated by Partition ORAM (P-ORAM) [16], a stateof-the-art communication-efficient ORAM construction, this paper proposes GPORAM (Generalized Partition ORAM) as a new framework to assemble multiple ORAM partitions together while overcoming the limitations of the P-ORAM construction. GP-ORAM allows smaller and adjustable number of partitions, fully utilizes the available user-side storage to reduce communication cost, and can efficiently export the index table to the server. As a result, GP-ORAM incurs low bandwidth cost (i.e., O(logN) data blocks per query in practice) and has significantly less user-side storage cost than P-ORAM.We demonstrate the security and practicality of GP-ORAM through extensive performance analysis. , a stateof-the-art communication-efficient ORAM construction, this paper proposes GP-ORAM (Generalized Partition ORAM) as a new framework to assemble multiple ORAM partitions together while overcoming the limitations of the P-ORAM construction. GP-ORAM allows smaller and adjustable number of partitions, fully utilizes the available user-side storage to reduce communication cost, and can efficiently export the index table to the server. As a result, GP-ORAM incurs low bandwidth cost (i.e., O(log N ) data blocks per query in practice) and has significantly less user-side storage cost than P-ORAM. We demonstrate the security and practicality of GP-ORAM through extensive performance analysis.

show abstract

“…[3][4][5][6][7][8][9][10]12,14]. These ORAMs only have little state information, such as secret keys and query counters, stored in local storage.…”

Section: Related Workmentioning

confidence: 99%

GP-ORAM: A Generalized Partition ORAM

Zhang

Qiao

2015

Network and System Security

View full text Add to dashboard Cite

show abstract

“…Oblivious RAM (ORAM) was first proposed by Goldreich and Ostrovsky [21], and later improved in a series of works [13,14,17,20,[22][23][24]26,[28][29][30][31][33][34][35][36][37]. Recently, ORAM has been used in outsourcing storage [22,35,37], and in secure two-party computation to achieve sublinear amortized cost [17,25].…”

Section: Related Workmentioning

confidence: 99%

“…Recently, ORAM has been used in outsourcing storage [22,35,37], and in secure two-party computation to achieve sublinear amortized cost [17,25].…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Verifiable Oblivious Storage

Apon

Katz

Shi

et al. 2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We formalize the notion of Verifiable Oblivious Storage (VOS), where a client outsources the storage of data to a server while ensuring data confidentiality, access pattern privacy, and integrity and freshness of data accesses. VOS generalizes the notion of Oblivious RAM (ORAM) in that it allows the server to perform computation, and also explicitly considers data integrity and freshness.We show that allowing server-side computation enables us to construct asymptotically more efficient VOS schemes whose bandwidth overhead cannot be matched by any ORAM scheme, due to a known lower bound by Goldreich and Ostrovsky. Specifically, for large block sizes we can construct a VOS scheme with constant bandwidth per query; further, answering queries requires only poly-logarithmic server computation. We describe applications of VOS to Dynamic Proofs of Retrievability, and RAM-model secure multi-party computation.

show abstract

“…In particular, it is common in cryptographic applications to aim for negligible failure probabilities. For example, cuckoo structures with negligible failure probabilities have recently found applications in oblivious RAM simulations [16]. Moreover, a significant motivation for de-amortized cuckoo hashing is to prevent timing attacks and clocked adversaries from compromising a system [3].…”

Section: Introductionmentioning

confidence: 99%

Cache-Oblivious Dictionaries and Multimaps with Negligible Failure Probability

Goodrich

Hirschberg

Mitzenmacher

et al. 2012

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. A dictionary (or map) is a key-value store that requires all keys be unique, and a multimap is a key-value store that allows for multiple values to be associated with the same key. We design hashing-based indexing schemes for dictionaries and multimaps that achieve worst-case optimal performance for lookups and updates, with minimal space overhead and sub-polynomial probability that the data structure will require a rehash operation. Our dictionary structure is designed for the Random Access Machine (RAM) model, while our multimap implementation is designed for the cache-oblivious external memory (I/O) model. The failure probabilities for our structures are sub-polynomial, which can be useful in cryptographic or data-intensive applications.

show abstract

Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation

Cited by 161 publications

References 40 publications

GP-ORAM: A Generalized Partition ORAM

GP-ORAM: A Generalized Partition ORAM

Verifiable Oblivious Storage

Cache-Oblivious Dictionaries and Multimaps with Negligible Failure Probability

Contact Info

Product

Resources

About