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 …

Secure multi-party computation (MPC) allows a group of mutually distrustful parties to
compute a joint function on their inputs without revealing any information beyond the result …

We introduce Tiny Garble, a novel automated methodology based on powerful logic
synthesis techniques for generating and optimizing compressed Boolean circuits used in …

Deciding “greater-than” relations among data items just given their encryptions is at the
heart of search algorithms on encrypted data, most notably, non-interactive binary search on …

The arrival of indistinguishability obfuscation (i O i O) has transformed the cryptographic
landscape by enabling several security goals that were previously beyond our reach …

A (single server) private information retrieval (PIR) allows a client to read data from a public
database held on a remote server, without revealing to the server which locations she is …

We provide the first constructions of identity-based encryption and hierarchical identity-
based encryption based on the hardness of the (Computational) Diffie-Hellman Problem …

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 provide new two-round multiparty secure computation (MPC) protocols in the dishonest
majority setting assuming the minimal assumption that two-round oblivious transfer (OT) …

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