Daniele Micciancio received a PhD in computer science from the Massachusetts Institute of Technology in 1998, and joined the faculty of the University of California, San Diego in 1999, where he is currently a Professor in the Computer Science and Engineering department. His primary research areas are cryptography and theoretical computer science. Daniele is most known for his work on the complexity of lattice problems, lattice algorithms, and the foundation of lattice cryptography. He received several awards, including the Matchey Award for best student paper at FOCS 1998, Sprowls award for best PhD thesis at MIT EECS department in 1999, NSF CAREER award in 2001, Hellman fellowship in 2001, and Alfred P. Sloan Research Fellowship in 2003. His recent work on lattices includes the first algorithm to solve the Closest Vector Problem in single exponential time and an efficient method for trapdoor lattice generation useful in many applications of lattice cryptography.
- Lattices: Algorithms, Complexity, and Cryptography, Spring 2020. Visiting Scientist, Program Organizer and Workshop Organizer.
- Cryptography, Summer 2015. Visiting Scientist and Workshop Organizer.