Satisfiability and Computer Algebra [video]

• Qualifying Exam, 13 April 2022

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

• UC Berkeley, 3 June 2022
• ZK Study Club, 28 April 2022
• Stanford Computer Forum, 6 April 2022
• Stanford Security Lunch, 9 February 2022

SAT Solving in the Serverless Cloud

• FMCAD 2021, 21 October 2021

A Survey of Circuit Languages [slides]

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

CirC: Common Infrastructure for Circuit Compilation [slides]

• Cornell, 15 June 2022
• Oakland, 25 May 2022
• Georgia Tech, 17 March 2022
• UC Berkeley, 11 February 2022
• Stanford Computer Forum, 13 September 2021
• UCSD, 26 April 2021
• ZK Study Club
• SRI CSL Seminar, 28 January 2021
• Stanford Software Lunch, 15 October 2020

Scaling Verifiable Computation Using Efficient Set Accumulators [slides]

• USENIX Security 2020, 14 August 2020
• MIT, 13 August 2020
• Stanford Software Lunch, 30 January 2020
• Stanford Security Lunch, 2 October 2019

DRAT-based Bit-Vector Proofs in CVC4

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