• Publications
  • Influence
Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation
K-resilient Nash equilibria, joint strategies where no member of a coalition C of size up to k can do better, even if the whole coalition defects, exist for secret sharing and multiparty computation, provided that players prefer to get the information than not to get it.
HotStuff: BFT Consensus with Linearity and Responsiveness
HotStuff is the first partially synchronous BFT replication protocol exhibiting these combined properties, and its simplicity enables it to be further pipelined and simplified into a practical, concise protocol for building large-scale replication services.
Highway dimension, shortest paths, and provably efficient algorithms
The notion of highway dimension is introduced and it is shown how low highway dimension gives a unified explanation for several seemingly different algorithms.
Hierarchical Hub Labelings for Shortest Paths
This work studies hierarchical hub labelings for computing shortest paths to lead to faster preprocessing algorithms, making the labeling approach practical for a wider class of graphs.
A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks
An implementation of the labeling algorithm that is faster than any existing method on continental road networks and has the best time bounds is described.
SBFT: A Scalable and Decentralized Trust Infrastructure
The results show that SBFT simultaneously provides almost 2x better throughput and about 1.5x better latency relative to a highly optimized system that implements the PBFT protocol.
PebblesDB: Building Key-Value Stores using Fragmented Log-Structured Merge Trees
PebblesDB is built, a high-performance key-value store, by modifying HyperLevelDB to use the FLSM data structure, and two widely-used NoSQL stores, MongoDB and HyperDex, are modified to use PebblesDB as their underlying storage engine.
HotStuff: BFT Consensus in the Lens of Blockchain
This work presents HotStuff, a leader-based Byzantine fault-tolerant replication protocol for the partially synchronous model that enables a correct leader to drive the protocol to consensus at the pace of actual network delay with communication complexity that is linear in the number of replicas.
Peaches, lemons, and cookies: designing auction markets with dispersed information
This paper studies the role of information asymmetries in second price, common value auctions. Motivated by information structures that arise commonly in applications such as online advertising, we
LLS: a locality aware location service for mobile ad hoc networks
LLS is presented, the first location service for the Unit Disk Graph model whose lookup and publish algorithms have worst case locality guarantees and average case locality awareness efficiency for any source destination pair.