Lattices Algorithms and Applications (CSE206A, formerly “Lattices in Cryptography and Cryptanalysis” CSE207C, CSE291). Topics: lattice approximation algorithms and their applications to cryptography. [Fall 1999, Winter 2002, Winter 2004, Spring 2007, Winter 2010, Winter 2010, Winter 2012, Spring 2014].
Foundation of cryptography (CSE207B, formerly CSE291). Course about foundational aspects of cryptography, with emphasis on topics related to complexity theory, e.g., hardness amplification, pseudorandomness, etc. [Winter 2001]
Computational complexity (CSE200): Introductory graduate course on computational complexity [Winter 2005, Winter 2006, Fall 2007]
Theory/Crypto seminar (CSE209A/B) […, Spring 2007, Fall 2007, Winter 2008, Fall 2010, Spring 2011, Spring 2012, Spring 2013, Winter 2014, Spring 2016]
Algorithms Design and Analysis (CSE202). Introductory graduate course on algorithms. [Spring 2002]
Advanced Algorithms (CSE203A): Advaced graduate course on algorithms. Topic: randomized and approximation algorithms. [Winter 2003]