• Publications
  • Influence
Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
TLDR
We introduce a new primitive called an algebraic manipulation detection (AMD) code, which encodes a source s into a value x stored on Σ(G) so that any tampering by an adversary will be detected. Expand
  • 241
  • 41
  • PDF
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
We study the design of cryptographic primitives resilient to key-leakage attacks, where an attacker can repeatedly and adaptively learn information about the secret key, subject only to theExpand
  • 277
  • 26
  • PDF
Fully Homomorphic Message Authenticators
TLDR
We define and construct a new primitive called a fully homomorphic message authenticator, which allows anybody to perform arbitrary computations over authenticated data and produce a short tag that authenticates the result of the computation. Expand
  • 116
  • 24
  • PDF
Public-Key Encryption in the Bounded-Retrieval Model
TLDR
We construct the first public-key encryption scheme in the Bounded-Retrieval Model (BRM), providing security against various forms of adversarial “key leakage” attacks. Expand
  • 185
  • 22
  • PDF
Optimizing ORAM and Using It Efficiently for Secure Computation
TLDR
Oblivious RAM (ORAM) allows a client to access her data on a remote server while hiding the access pattern (which locations she is accessing) from the server. Expand
  • 172
  • 22
  • PDF
Dynamic Proofs of Retrievability Via Oblivious RAM
TLDR
We give the first proofs of retrievability for dynamic storage, where the client can perform arbitrary reads/writes on any location within her data by running an efficient protocol with the server. Expand
  • 169
  • 22
  • PDF
Efficient Public-Key Cryptography in the Presence of Key Leakage
TLDR
We study the design of cryptographic primitives resistant to a large class of side-channel attacks, called “memory attacks”, where an attacker can repeatedly and adaptively learn information about the secret key, subject only to the constraint that the overall amount of such information is bounded by some parameter. Expand
  • 172
  • 21
  • PDF
Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM
TLDR
We present Onion ORAM, an Oblivious RAM (ORAM) with constant worst-case bandwidth blowup that leverages poly-logarithmic server computation to circumvent the logarithsmic lower bound on ORAM bandwidth blow up. Expand
  • 118
  • 20
  • PDF
Two Round Multiparty Computation via Multi-key FHE
TLDR
We construct a general multiparty computation MPC protocol with only two rounds of interaction in the common random string model, which is known to be optimal. Expand
  • 157
  • 19
  • PDF
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
TLDR
Fully homomorphic encryption (FHE) enables secure computation over the encrypted data of a single party. Expand
  • 264
  • 18
  • PDF