We present TWORAM, an asymptotically efficient oblivious RAM (ORAM) protocol providing
oblivious access (read and write) of a memory index y in exactly two rounds: The client …

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

To understand the gap between theory and practice for oblivious cloud storage, we
experimentally evaluate four representative Oblivious RAM (ORAM) designs on Amazon S3 …

We present PanORAMa, the first Oblivious RAM construction that achieves communication
overhead O (log N log log N) for database of N blocks and for any block size B= Ω (log N) …

We consider oblivious storage systems hiding both the contents of the data as well as
access patterns from an untrusted cloud provider. We target a scenario where multiple users …

Searchable Symmetric Encryption (SSE) allows a data owner to securely outsource its
encrypted data to a cloud server while maintaining the ability to search over it and retrieve …

Recently there has been much interest in performing search queries over encrypted data to
enable functionality while protecting sensitive data. One particularly efficient mechanism for …

Oblivious RAM (ORAM) is a cryptographic primitive that allows a client to hide access
pattern to its data encrypted and stored at a remote server. Traditionally, ORAM algorithms …

Oblivious RAM (ORAM) is important for applications that require hiding access patterns.
Many ORAM schemes have been proposed but most of them support only storing blocks of …

We present a new oblivious RAM that supports variable-sized storage blocks (vORAM),
which is the first ORAM to allow varying block sizes without trivial padding. We also present …