I’m an Assistant Professor of Computer Science at Yale University. My research spans computer security and applied cryptography, with a focus on building trustworthy systems through decentralization, verifiability, and accountability.
My work has been deployed by Chainlink, Oasis Labs, Flashbots, and others. I initiated what is now known as zkTLS β my protocols are implemented by numerous projects including Reclaim, zkPass, and TLSNotary.
A unifying theme of my research is building trustworthy computer systems through three approaches: (1) decentralization, which enables programs to run on consensus networks without a trusted operator; (2) confidential and verifiable computation, which uses cryptographic proofs or trusted hardware to let users verify correct execution or protect private inputs; and (3) accountability, which gives users evidence of misbehavior. We develop foundational building blocks with the goal of enabling real-world applications in finance, identity, social media, and AI.
When payments are tied to volume β content promotion billed by reach, healthcare services reimbursed per patient β clients must trust the platform’s self-reported numbers. VAR introduces a cryptographic primitive that fixes this: the paying party can verify the count of users served without learning individual identities. We demonstrate it with TrueReach, a system for verifiable content promotion on Bluesky.
Generating ZK proofs for large-scale computations is computationally expensive. Distributing the work across many provers achieves near-linear speedup. We also study pricing and fair allocation of prover work in open markets.
MEV arises when block producers reorder, insert, or censor transactions for profit, harming user fairness and creating centralization incentives. We measure these effects empirically and work on mitigations.
Censorship occurs when block producers deliberately exclude transactions β motivated by bribes, regulatory pressure, or competitive advantage. We study mitigations including inclusion lists and multi-proposer BFT protocols.
Open networks expose participants to traffic analysis and deanonymization. We build anonymity primitives for decentralized systems: ZIPNet, a DC-net protocol for anonymous broadcast (implemented by Flashbots), and Qelect, the first post-quantum SSLE protocol that hides block proposer identities in consensus.
Town Crier and DECO were among the first to establish verifiable provenance of TLS-encrypted web data β turning any HTTPS site into a source of verifiable claims β initiating the zkTLS area, with protocols now deployed by Chainlink and numerous startups.
TEEs offer strong confidentiality and integrity but are vulnerable to side channels. We design systems that tolerate, detect, or economically disincentivize leakage.