**Memory Hard Functions, Random Oracles, Graph Pebbling and Extractor Arguments**. CSoI Seminar 2019. [Slides]**Memory Hard Functions and Password Hashing**. Purdue PURPL Fest 2019 [Video]**Data-Independent Memory Hard Functions: New Attacks and Stronger Constructions**. CRYPTO 2019. [Slides] [Video]**Sustained Space Complexity**. Purdue Crypto Reading Group (Spring 2019). [Slides]**Bandwith Hard Functions: Reductions and Lower Bounds**. CCS 2018. [Slides] [Longer Version] [Video]**On the Economics of Offline Password Cracking**. 39th IEEE Symposium on Security and Privacy (S&P 2018) [Slides] [Video]**Memory Hard Functions and Human Authentication**. CERIAS Security Seminar 2017. [Slides] [Video]**On the Depth-Robustness and Cumulative Pebbling Cost of Argon2i**. TCC 2017. [Slides]**Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions**. CCS 2017. [Slides] [Video]**Towards a Theory of Data Independent Memory Hard Functions**. Real World Crypto 2017. [Slides] [Video]**Designing Proofs of Human Word for Cryptocurrency and Beyond**. TCC 2016b [Slides]**Towards a Theory of Data Independent Memory Hard Functions**. Charles River Crypto Day (Fall 2016). [Slides]**Attacking Data Independent Memory Hard Functions**. CMU Computer Science Distinguished Lecture 2016. [Slides]**Towards a Theory of Data Independent Memory Hard Functions**. Simons Institute at Berkeley. Simons Institute Cryptography Reunion 2016. [Slides]**Efficiently Computing Data Independent Memory Hard Functions**. CRYPTO 2016. [Slides] [Video]**CASH: A Cost Asymmetric Secure Hash Algorithm for Optimal Password Protection**. CSF 2016. [Slides]

**Towards Human Computable Passwords**. ITCS 2017. [Slides] [Video]**Usable and Secure Human Authentication**CERIAS Security Seminar at Purdue University, Fall 2016. [Slides]**Towards Human Computable Passwords**. Heidelberg Laureate Forum Workshop 2015. [Slides]**Human Computable Passwords**. Magic 77: A Celbration of Manuel Blum (2015) [Slides]**Human Computable Passwords**. Harvard CRCS Seminar 2015.**Human Computable Passwords**. CMU Theory Lunch Fall 2014. [Slides]**Towards Usable Human Authentication Protocols**. Boston University Security Seminar. Fall 2015.**Spaced Repetition and Mnemonics Enable Recall of Multiple Strong Passwords.**NDSS 2015 [Slides (PDF)] [PowerPoint]**Naturally Rehearsing Passwords**. Simons Institute at Berkeley. Securing Computation Workshop 2015**Naturally Rehearsing Passwords**. ASIACRYPT 2013. [Slides]**Naturally Rehearsing Passwords**. CRYPT Rump Session 2013 . [Slides]**Naturally Rehearsing Passwords**. NSF TRUST Conference Fall 2013. [Slides]**Usable and Secure Human Authentication**Berkeley ICSI 2014.**Usable and Secure Human Authentication**University of Maryland, Fall 2014. [Slides]**Usable and Secure Human Authentication**Princeton CITP Luncheon Series 2014. [Slides] [Video]**Usable and Secure Human Authentication**Stanford Security Seminar 2014.**Usable and Secure Password Management**CMU CyLab Research Talk 2012.-
**GOTCHA Password Hackers!**AISec 2013. [Slides] **Optimizing Password Composition Policies**CMU Theory Lunch Seminar Spring 2013 [Slides]**Optimizing Password Composition Policies**. EC 2013.[Slides]

**Releasing a Differentially Private Password Frequency Corpus from 70 Million Yahoo! Passwords**. DIMACS/Northeast Big Data Hub Workshop on Overcoming Barriers to Data Sharing including Privacy and Fairness. October 23-24. [Slides]**Differentially Private Integer Partitions And Their Applications**. Spotlight Talk at Theory and Practice of Differential Privacy Workshop. 2016. [Slides]**Differentially Private Password Frequency Lists: Or, How to release statistics from 70 million passwords (on purpose)**. NDSS 2016 [Slides]**Node Differential Privacy**. Simons Institute at Berkeley. Cryptography 2015. Differential Privacy Reading Group. [Slides]**The Johnson-Lindenstrauss Transform Itself Preserves Differential Privacy**. Simons Institute at Berkeley. Cryptography 2015. Differential Privacy Reading Group. [Slides]**Differentially Private Analysis of Social Networks via Restricted Sensitivity**. ITCS 2013.-
**Differentially Private Analysis of Social Networks via Restricted Sensitivity**. CMU Theory Lunch 2012. [Slides] **Resolving the Complexity of Some Data Privacy Problems**. ICALP 2010 [Slides]**A Complete Classification of the Computational Complexity of K-Anonymity**. CMU Theory Lunch Fall 2007 [Slides]

**Adaptive Regret Minimization in Bounded Memory Games**. GameSec 2013 [Slides]-
**Adaptive Regret Minimization in Bounded Memory Games**. CMU CyLab Student Seminar. Fall 2013. [Slides] **Regret Minimization in Bounded Memory Games**. CMU Theory Lunch 2010 [Slides]

**Relaxed Locally Correctable Codes in Computationally Bounded Channels**. IEEE ISIT 2019 [Slides]