Talks

Satisfiability and Computer Algebra [video]

  • Qualifying Exam, April 2022

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

  • 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]

  • 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