Secure multi-party computation (MPC) has evolved from a theoretical curiosity in the 1980s
to a tool for building real systems today. Over the past decade, MPC has been one of the …

We design and develop ObliVM, a programming framework for secure computation. ObliVM
offers a domain specific language designed for compilation of programs into efficient …

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 …

We design and implement a Distributed Oblivious Random Access Memory (DORAM) data
structure that is optimized for use in two-party secure computation protocols. We improve …

Many techniques for secure or private execution depend on executing programs in a data-
oblivious way, where the same instructions execute independent of the private inputs which …

Oblivious RAM (ORAM), first introduced in the ground-breaking work of Goldreich and
Ostrovsky (STOC'87 and J. ACM'96) is a technique for provably obfuscating programs' …

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

Outsourcing data to the cloud has become prevalent, so Searchable Symmetric Encryption
(SSE), one of the methods for protecting outsourced data, has arisen widespread interest …

Oblivious RAM (ORAM) is a tool proposed to hide access pattern leakage, and there has
been a lot of progress in the efficiency of ORAM schemes; however, less attention has been …