• Publications
  • Influence
Path ORAM
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 known to date withExpand
  • 426
  • 121
Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts
Emerging smart contract systems over decentralized cryptocurrencies allow mutually distrustful parties to transact safely without trusted third parties. In the event of contractual breaches orExpand
  • 1,022
  • 65
Privacy-Preserving Aggregation of Time-Series Data
We consider how an untrusted data aggregator can learn desired statistics over multiple participants’ data, without compromising each individual’s privacy. We propose a construction that allows aExpand
  • 379
  • 57
Oblivious RAM with O((logN)3) Worst-Case Cost
Oblivious RAM is a useful primitive that allows a client to hide its data access patterns from an untrusted server in storage outsourcing applications. Until recently, most prior works on ObliviousExpand
  • 375
  • 48
Path ORAM: an extremely simple oblivious RAM protocol
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 for small clientExpand
  • 244
  • 45
The Honey Badger of BFT Protocols
The surprising success of cryptocurrencies has led to a surge of interest in deploying large scale, highly robust, Byzantine fault tolerant (BFT) protocols for mission-critical applications, such asExpand
  • 301
  • 44
Controlling data in the cloud: outsourcing computation without outsourcing control
Cloud computing is clearly one of today's most enticing technology areas due, at least in part, to its cost-efficiency and flexibility. However, despite the surge in activity and interest, there areExpand
  • 879
  • 42
Towards Practical Oblivious RAM
We take an important step forward in making Oblivious RAM (O-RAM) practical. We propose an O-RAM construction achieving an amortized overhead of 20X-35X (for an O-RAM roughly 1 terabyte in size),Expand
  • 285
  • 42
Practical Dynamic Searchable Encryption with Small Leakage
In this paper we revisit the DSSE problem. We propose the first DSSE scheme that achieves the best of both worlds, i.e., both small leakage and efficiency. In particular, our DSSE scheme leaksExpand
  • 311
  • 41