• Publications
  • Influence
The smallest grammar problem
This paper shows that every efficient algorithm for the smallest grammar problem has approximation ratio at least 8569/8568 unless P=NP, and bound approximation ratios for several of the best known grammar-based compression algorithms, including LZ78, B ISECTION, SEQUENTIAL, LONGEST MATCH, GREEDY, and RE-PAIR. Expand
Analysis of the Blockchain Protocol in Asynchronous Networks
Nakamoto’s famous blockchain protocol enables achieving consensus in a so-called permissionless setting—anyone can join (or leave) the protocol execution, and the protocol instructions do not dependExpand
Simulatable Adaptive Oblivious Transfer
An adaptivevariant of oblivious transfer in which a sender has N messages, of which a receiver can adaptively choose to receive kone-after-the-other, is studied, which prohibits a subtle selective-failure attack not addressed by the security notions achieved by previous practical schemes. Expand
Efficient Protocols for Set Membership and Range Proofs
Two new approaches to buildingset-membership proofs based on bilinear group assumptions are presented, and a discrete logarithm based setting, which is an order ofmagnitude more efficient than previously known ones. Expand
Billion-Gate Secure Computation with Malicious Adversaries
It is shown that by incorporating the best known techniques and parallelizing almost all steps of the resulting protocol, evaluating billion-gate circuits is feasible in the malicious model. Expand
SCORAM: Oblivious RAM for Secure Computation
This work presents SCORAM, a heuristic compact ORAM design optimized for secure computation protocols, which is almost 10x smaller in circuit size and also faster than all other designs tested for realistic settings. Expand
Computing on Authenticated Data
The definition is carefully formulated to provide one unified framework for a variety of distinct concepts in this area, including arithmetic, homomorphic, quotable, redactable, transitive signatures, and more, and is unable to distinguish a derived signature from a fresh one even when given the original signature. Expand
Scaling ORAM for Secure Computation
This work designs and implements a Distributed Oblivious Random Access Memory (DORAM) data structure that is optimized for use in two-party secure computation protocols, and finds that it still outperforms the fastest previously known constructions, Circuit ORAM and Square-root ORAM, for datasets that are 32 KiB or larger. Expand
Remembrance of Data Passed: A Study of Disk Sanitization Practices
Many discarded hard drives contain information that is both confidential and recoverable, as the authors' own experiment shows. The availability of this information is little publicized, butExpand
Doubly-Efficient zkSNARKs Without Trusted Setup
The Fiat-Shamir heuristic is applied to produce a zero-knowledge succinct non-interactive argument of knowledge (zkSNARK) in the random oracle model, based on the discrete log assumption, which is called Hyrax. Expand