Big Data concern large-volume, complex, growing data sets with multiple, autonomous
sources. With the fast development of networking, data storage, and the data collection …

We present Path ORAM, an extremely simple Oblivious RAM protocol with a small amount of
client storage. Partly due to its simplicity, Path ORAM is the most practical ORAM scheme …

Search indices are fundamental building blocks of many systems, and there is great interest
in running them on encrypted data. Unfortunately, many known schemes that enable search …

We propose a new tree-based ORAM scheme called Circuit ORAM. Circuit ORAM makes
both theoretical and practical contributions. From a theoretical perspective, Circuit ORAM …

Encrypted search algorithms (ESA) are cryptographic algorithms that support search over
encrypted data. ESAs can be designed with various primitives including …

We design and build ObliviStore, a high performance, distributed ORAM-based cloud data
store secure in the malicious model. To the best of our knowledge, ObliviStore is the fastest …

Oblivious RAM (ORAM) is a cryptographic primitive that hides memory access patterns as
seen by untrusted storage. This paper proposes Ring ORAM, the most bandwidth-efficient …

This paper presents a new, co-designed compiler and architecture called GhostRider for
supporting privacy preserving computation in the cloud. GhostRider ensures all programs …

We introduce PHANTOM [1] a new secure processor that obfuscates its memory access
trace. To an adversary who can observe the processor's output pins, all memory access …

We present Onion ORAM, an Oblivious RAM (ORAM) with constant worst-case bandwidth
blowup that leverages poly-logarithmic server computation to circumvent the logarithmic …