• Publications
  • Influence
The smallest grammar problem
This paper addresses the smallest grammar problem: What is the smallest context-free grammar that generates exactly one given string /spl sigma/? This is a natural question about a fundamental objectExpand
  • 344
  • 55
  • PDF
Analysis of the Blockchain Protocol in Asynchronous Networks
TLDR
Nakamoto’s famous blockchain protocol enables achieving consensus in a permissionless setting—anyone can join (or leave) the protocol execution, and the protocol instructions do not depend on the identities of the players. Expand
  • 416
  • 48
  • PDF
Simulatable Adaptive Oblivious Transfer
TLDR
We study an adaptivevariant of oblivious transfer in which a sender has Nmessages, of which a receiver can adaptively choose to receive kone-after-the-other, in such a way that (a) the sender learns nothing about the receiver's selections, and (b) the receiver only learns about the krequested messages. Expand
  • 216
  • 29
  • PDF
Billion-Gate Secure Computation with Malicious Adversaries
TLDR
The goal of this paper is to assess the feasibility of two-party secure computation in the presence of a malicious adversary. Expand
  • 208
  • 24
  • PDF
Efficient Protocols for Set Membership and Range Proofs
TLDR
We consider the following problem: Given a commitment to a valueσ , prove in zero-knowledge that σ belongs to some discrete set φ . Expand
  • 226
  • 23
  • PDF
Computing on Authenticated Data
TLDR
In tandem with recent progress on computing on encrypted data via fully homomorphic encryption, we present a framework for computing on authenticated data via the notion of slightly homomorphic signatures, or $$P$$P-homomorphic signatures. Expand
  • 108
  • 17
  • PDF
SCORAM: Oblivious RAM for Secure Computation
TLDR
We present SCORAM, a heuristic compact ORAM design optimized for secure computation protocols with practical data sizes. Expand
  • 135
  • 16
  • PDF
Remembrance of Data Passed: A Study of Disk Sanitization Practices
TLDR
Many discarded hard drives contain information that is both confidential and recoverable, as the authors' own experiment shows. Expand
  • 230
  • 13
  • PDF
Scaling ORAM for Secure Computation
TLDR
We design and implement a Distributed Oblivious Random Access Memory (DORAM) data structure that is optimized for use in two-party secure computation protocols. Expand
  • 63
  • 12
  • PDF
Securely Obfuscating Re-Encryption
TLDR
We present a positive obfuscation result for a traditional cryptographic functionality for a re-encryption program. Expand
  • 149
  • 11
  • PDF