Security & Privacy through Programmable Cryptography, Compilation, and Verification [slides]

• Oregon, January 2025
• Cornell, February 2025
• UT Austin, February 2025
• CMU, February 2025
• Toronto, March 2025
• UC Los Angeles, March 2025
• UVA, March 2025
• Michigan, March 2025
• Georgia Tech, April 2025

Volatile and Persistent Memory for zkSNARKs via Algebraic Interactive Proofs

• UC Berkeley, December 2024
• UC Los Angeles, October 2024

Split Gröbner Bases for Satisfiability Modulo Finite Fields [slides]

• CAV, July 2024
• CENTAUR Lunch, July 2024
• Stanford Software Research Lunch, March 2024

Satisfiability Modulo Finite Fields, with applications to Zero-Knowledge Proofs [slides]

• UC Santa Barbara, October 2024
• University of Washington, May 2024
• New York University, October 2023
• University of Maryland, October 2023
• CMU Secure Blockchain Summit, May 2023 [slides]
• UC Berkeley, May 2023 [slides]
• CENTAUR Lunch, February 2023 [slides]
• Stanford Software Lunch, February 2023 [slides]

Satisfiability and Computer Algebra (Qualifying Exam) [video]

• Stanford, April 2022

Collaborative zkSNARKs: zero-knowledge proofs for distributed secrets [slides]

• University of Waterloo, CrySP Seminar, October 2024
• University of Pennsylvania, October 2023
• Boston University, September 2022
• Brown, September 2022
• UC Berkeley, June 2022
• ZK Study Club, April 2022
• Stanford Computer Forum, April 2022
• Stanford Security Lunch, February 2022

SAT Solving in the Serverless Cloud

• FMCAD 2021, October 2021

A Survey of Circuit Languages [slides]

• ZK Hack, October 2021
• ZK Language Rundown, May 2021
• Scaling Ethereum, April 2021

CirC: Common Infrastructure for Circuit Compilation [slides]

• University of Pennsylvania, October 2023
• Yale, September 2022
• MIT, September 2022
• Harvard, September 2022
• Cornell, June 2022
• Oakland, May 2022
• Georgia Tech, March 2022
• UC Berkeley, February 2022
• Stanford Computer Forum, September 2021
• UCSD, April 2021
• ZK Study Club
• SRI CSL Seminar, January 2021
• Stanford Software Lunch, October 2020

Scaling Verifiable Computation Using Efficient Set Accumulators [slides]

• USENIX Security 2020, August 2020
• MIT, August 2020
• Stanford Software Lunch, January 2020
• Stanford Security Lunch, October 2019

DRAT-based Bit-Vector Proofs in CVC4

• SAT 2019, July 2019
• Stanford Software Lunch, June 2019