• Publications
  • Influence
Path ORAM
TLDR
It is formally proved that Path ORAM has a O(log N) bandwidth cost for blocks of size B = Ω (log2 N) bits, and is asymptotically better than the best-known ORAM schemes with small client storage. Expand
Path ORAM: an extremely simple oblivious RAM protocol
TLDR
It is formally proved that Path ORAM requires log^2 N / log X bandwidth overhead for block size B = X log N, and is asymptotically better than the best known ORAM scheme with small client storage. Expand
Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts
TLDR
Hawk is a decentralized smart contract system that does not store financial transactions in the clear on the blockchain, thus retaining transactional privacy from the public's view, and is the first to formalize the blockchain model of cryptography. Expand
Privacy-Preserving Aggregation of Time-Series Data
TLDR
A construction that allows a group of participants to periodically upload encrypted values to a data aggregator, such that the aggregator is able to compute the sum of all participants’ values in every time period, but is unable to learn anything else. Expand
The Honey Badger of BFT Protocols
TLDR
HoneyBadgerBFT is presented, the first practical asynchronous BFT protocol, which guarantees liveness without making any timing assumptions, and is based on a novel atomic broadcast protocol that achieves optimal asymptotic efficiency. Expand
Practical Dynamic Searchable Encryption with Small Leakage
TLDR
This paper proposes the first DSSE scheme that achieves the best of both worlds, i.e., both small leakage and efficiency, and provides an implementation of the scheme, showing its practical efficiency. Expand
The Sybil attack in sensor networks: analysis & defenses
TLDR
It is demonstrated that the Sybil attack can be exceedingly detrimental to many important functions of the sensor network such as routing, resource allocation, misbehavior detection, etc. Expand
Oblivious RAM with O((logN)3) Worst-Case Cost
TLDR
This paper proposes novel Oblivious RAM constructions that achieves poly-logarithmic worst-case cost, while consuming constant client-side storage, in a novel technique in which the O-RAM storage is organized into a binary tree over data buckets, while moving data blocks obliviously along tree edges. Expand
Bitter to Better - How to Make Bitcoin a Better Currency
TLDR
An in-depth investigation is performed to understand what made Bitcoin so successful, while decades of research on cryptographic e-cash has not lead to a large-scale deployment. Expand
...
1
2
3
4
5
...