• Publications
  • Influence
ObliVM: A Programming Framework for Secure Computation
This work develops various showcase applications such as data mining, streaming algorithms, graph algorithms, genomic data analysis, and data structures, and demonstrates the scalability of ObliVM to bigger data sizes.
Stubborn Mining: Generalizing Selfish Mining and Combining with an Eclipse Attack
This paper expands the mining strategy space to include novel "stubborn" strategies that, for a large range of parameters, earn the miner more revenue, and shows how a miner can further amplify its gain by non-trivially composing mining attacks with network-level eclipse attacks.
Oblivious Data Structures
This work designs novel, asymptotically more efficient data structures and algorithms for programs whose data access patterns exhibit some degree of predictability and applies these techniques to a broad range of commonly used data structures, including maps, sets, priority-queues, stacks, deques; and algorithms.
GraphSC: Parallel Secure Computation Made Easy
This work builds Graph SC, a framework that provides a programming paradigm that allows non-cryptography experts to write secure code, brings parallelism to such secure implementations, and meets the need for obliviousness, thereby not leaking any private information.
Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus
Solida, a decentralized blockchain protocol based on reconfigurable Byzantine consensus augmented by proof-of-work, improves on Bitcoin in confirmation time, and provides safety and liveness assuming the adversary control less than one-third of the total mining power.
Solidus: An Incentive-compatible Cryptocurrency Based on Permissionless Byzantine Consensus
Solidus improves on Bitcoin in confirmation time, and provides safety and liveness assuming Byzantine players and the largest coalition of rational players collectively control less than one-third of the computation power.
Communication Complexity of Byzantine Agreement, Revisited
This paper proves that disallowing after-the-fact removal is necessary for achieving subquadratic-communication BA, and shows a new sub quadratic binary BA construction that achieves near- optimal resilience and expected constant rounds under standard cryptographic assumptions and a public-key infrastructure (PKI).
Sync HotStuff: Simple and Practical Synchronous State Machine Replication
This work presents Sync HotStuff, a surprisingly simple and intuitive synchronous BFT solution that achieves consensus with a latency of 2Δ in the steady state (where Δ is a synchronous message delay upper bound), which is comparable to the best known partially synchronous solution.
Asymptotically Tight Bounds for Composing ORAM with PIR
This paper achieves a sub-logarithmic bandwidth blowup of \(O(\log _{d} N)\) (where d is a free parameter) without using expensive computation by using a d-ary tree and a two server private information retrieval (PIR) protocol based on inexpensive XOR operations at the servers.
OptORAMa: Optimal Oblivious RAM
Oblivious RAM (ORAM), first introduced in the ground-breaking work of Goldreich and Ostrovsky (STOC ’87 and J. ACM ’96) is a technique for provably obfuscating programs’ access patterns, such that