I am a postdoctoral researcher at the University of Michigan, hosted by Ke Wu. I received my Ph.D. in Computer Science from Duke University in 2026, advised by Kartik Nayak and Fan Zhang.

My research studies the security of decentralized systems when the parties running them act strategically. I combine cryptography and algorithmic game theory to design protocols that remain secure when block proposers, builders, and users maximize their own profit. Recent work covers censorship resistance and inclusion lists, transaction fee mechanisms under parallel execution, transaction ordering and MEV, and the trade-off between censorship resistance and throughput in multi-proposer consensus.

I have collaborated with researchers at the Ethereum Foundation, Flashbots, Category Labs, and Common Prefix. If you would like to collaborate, feel free to contact me at wsarisht@umich.edu.

News

Older news
  • May 2026Perils of Parallelism accepted at SBC 2026.
  • May 2026Perils of Parallelism accepted at USENIX Security 2026.
  • May 2026Talk on Perils of Parallelism at the Designing DeFi (D²) Workshop 2026.
  • Apr 2026Talk at the University of Michigan on Data Independent Order Policy Enforcement.
  • Apr 2026Censorship Resistance vs Throughput in Multi-Proposer BFT Protocols accepted at CCS 2026.
  • Apr 2026Talk at Yale Applied Cryptography Lab on Perils of Parallelism.
  • Mar 2026Defended my PhD thesis.
  • Dec 2025Talk at CCE on Perils of Parallelism.
  • Nov 2025Joining the Program Committees for CCS 2026 and EC 2026.
  • Aug 2025Talk on AUCIL at MEV-SBC 2025.
  • Jul 2025Won first prize (among eight projects) at the IC3 Summer Camp 2025.
  • Jun 2024Received an Ethereum Research Grant to improve Ethereum’s censorship resistance.

Publications

* equal contribution

  1. USENIX Sec'26

    Perils of Parallelism: Transaction Fee Mechanisms under Execution Uncertainty

    Authors: Sarisht Wadhwa*, Aviv Yaish*, Fan Zhang, Kartik Nayak

    In: 35th USENIX Security Symposium (USENIX Security 2026). Also accepted at SBC 2026

  2. CCS'26

    Censorship Resistance vs Throughput in Multi-Proposer BFT Protocols

    Authors: Fatima Elsheimy*, Ioannis Kaklamanis*, Sarisht Wadhwa*, Charalampos Papamanthou, Fan Zhang

    In: ACM SIGSAC Conference on Computer and Communications Security (CCS 2026)

  3. AFT'26

    Price of Censorship: Censorship Resistance and Throughput Under Rational Concurrent Proposers

    Authors: Aditya Saraf, Ioannis Kaklamanis, Sarisht Wadhwa, Fatima Elsheimy

    In: 8th Conference on Advances in Financial Technologies (AFT 2026), LIPIcs

  4. 2025

    Censorship-Resistant Sealed-Bid Auctions on Blockchains

    Authors: Orestis Alpos, Lioba Heimbach, Kartik Nayak, Sarisht Wadhwa (alphabetical order)

    In: Cryptology ePrint Archive, 2025/2127

  5. 2025

    Differentially Private Aggregate Hints in MEV-Share

    Authors: Jonathan Passerat-Palmbach, Sarisht Wadhwa

    In: arXiv:2508.14284

  6. 2025

    AUCIL: An Inclusion List Design for Rational Parties

    Authors: Sarisht Wadhwa, Julian Ma, Thomas Thiery, Barnabé Monnot, Luca Zanolini, Fan Zhang, Kartik Nayak

    In: Cryptology ePrint Archive, 2025/194

  7. CCS'24

    Data Independent Order Policy Enforcement: Limitations and Solutions

    Authors: Sarisht Wadhwa, Luca Zanolini, Francesco D'Amato, Aditya Asgaonkar, Chengrui Fang, Fan Zhang, Kartik Nayak

    In: ACM SIGSAC Conference on Computer and Communications Security (CCS 2024)

  8. NDSS'23

    He-HTLC: Revisiting incentives in HTLC

    Authors: Sarisht Wadhwa*, Jannis Stöter*, Fan Zhang, Kartik Nayak

    In: Network and Distributed System Security Symposium (NDSS 2023)

  9. SIGMOD'19

    Efficiently Answering Regular Simple Path Queries on Large Labeled Networks

    Authors: Sarisht Wadhwa, Anagh Prasad, Sayan Ranu, Amitabha Bagchi, Srikanta Bedathur

    In: ACM International Conference on Management of Data (SIGMOD 2019)

Talks

Service

Program Committee

External Reviewer

Education

Positions

Teaching

Grants and Awards

Writing