News

January 2022

New work with William, Yuxuan, Luyao, Fan, and Yulin on empirically analyzing Ethereum EIP-1559.
Nibesh’s work on synchronous distributed key generation (together with Adithya and Aniket) is up on eprint.

December 2021

Nibesh’s work on good-case latency of rotating leader BFT protocols (together with Ittai) won the Best Paper Award at OPODIS 2021.
Chenghong’s work together with Johes and Ashwin on an outsourced database using MPC and differential privacy, IncShrink, has been accepted in SIGMOD 2022.
[Blog post] A blog post explaining the good-case latency of a rotating leader BFT protocol together with Nibesh and Ittai.

November 2021

BFT Protocol Forensics paper is recognized as a Best Paper Runner Up at ACM CCS 2021.

October 2021

[Blog post] What is the intuition behind Nakamoto consensus? How does proof-of-work relate to it? How does network synchrony play a role in its security? Learn more about it through this recent post on Decentralized Thoughts.
New work with Amey, Chen-Da, and Julian on adaptively secure communication efficient BFT for long messages is up on print.

September 2021

Sravya presents our work on communication efficient protocols with trusted hardware at DISC’21. Video link.
Presented a talk on Bringing Synchronous Consensus Closer to Practice at IIT Madras.

Research

I am generally interested in applied cryptography and blockchains. I am currently focusing on two research topics:
1. Robust and efficient design of blockchain protocols.
2. Efficient privacy-preserving computation.

Teaching

Spring ’22: Computer Security (CompSci 351-S22)

Past classes:
Fall’20, Fall’21: Computer Security (CompSci 351-F20, CompSci 351-F21)
Fall’19, Fall’21: Blockchain Consensus (CompSci 590-F19, CompSci 590-F21)
Spring’21: Applied Cryptography (CompSci 590-03)

I'm looking for students

I am always looking for highly motivated Ph.D. students. If you are interested in working on any of these topics, then: