Daniele Micciancio

Daniele Micciancio received his 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-based cryptography. He received the Matchey Award (FOCS 1998), Sprowls Award (MIT EECS, 1999), CAREER Award (NSF, 2001), Hellman Fellowship (2001), Sloan Fellowship (2003), and two 20-years Test of Time Awards (FOCS 2022, FOCS 2024). In 1999 he was appointed Fellow of the IACR for his pioneering work on lattice cryptography and the complexity of lattice problems.