Talks
- Batch Arguments and More [slides]
BUSec Crypto Seminar 2022, Virtual
UC Berkeley Crypto Seminar 2022
- SNARGs for P from LWE [slides]
FOCS 2021, Virtual
- Pursuing the Limits of Cryptography [slides]
Ph.D. Defense, 2021, Johns Hopkins University
- Non-Interactive Batch Arguments for NP from Standard Assumptions [slides][video]
CRYPTO 2021, Virtual
- SNARGs and BARGs from LWE [slides]
Simons Institute - Lattices: Algorithms, Complexity, and Cryptography Reunion, Virtual
- Towards Efficiency-Preserving Round Compression in MPC [slides][video]
ASIACRYPT 2020, Virtual
Ruhr-Universität Bochum Cryptography Reading Group, Virtual [slides]
- From Blockchains to Nash [slides]
University of Wisconsin-Madison Reading Group, Virtual
- Characterizing Deterministic-Prover Zero Knowledge [slides][video]
TCC 2020, Virtual
- Round Optimal Secure Multiparty Computation from Minimal Assumptions [slides][video]
TCC 2020, Virtual
Tel Aviv University Cryptography Seminar, Tel Aviv
DC Area Crypto Day Fall 2019, Richmond [slides]
- The Round Complexity of Secure Computation Against Covert Adversaries [slides][video]
SCN 2020, Virtual
- Finding a Nash Equilibrium is No Easier than Breaking Fiat-Shamir [slides]
NIST Cryptography Reading Group, Gaithersburg
JHU Theory Seminar, Baltimore
- Founding Secure Computation on Blockchains [slides][video]
Eurocrypt 2019, Darmstadt
- A New Approach to Round-Optimal Secure Multiparty Computation [slides][video]
Crypto 2017, Santa Barbara
Microsoft Research India Reading Group, Bangalore
- Significantly Improved Multi-bit Differentials for Reduced Round Salsa and ChaCha [slides]
FSE 2017, Tokyo
tikzpeople
For my talks, I use tikzpeople, which is a great LaTeX package to include people shaped figures on your slides/papers. But if like me, you'd rather use PowerPoint to make your slides, you can download a ("terribly sinful"- Nils) zip file containg some PNG conversions of the figures here (version with flat colors can be found here). Brownie points if you use the Sith Duck.