Daniele Micciancio

Daniele Micciancio is a leading authority in cryptography, complexity theory, and lattice-based cryptographic primitives. He is currently a Professor in the Computer Science and Engineering Department at the University of California, San Diego (UCSD), where he has been a faculty member since 1999. He received his Ph.D. in Computer Science from the Massachusetts Institute of Technology (MIT) in 1998.

Dr. Micciancio’s foundational research focuses on the computational complexity of lattice problems, worst-to-average-case reductions, fully homomorphic encryption, and efficient post-quantum cryptographic schemes. He co-authored the influential book Complexity of Lattice Problems: A Cryptographic Perspective and has published numerous classic papers detailing lattice trapdoors, compact knapsacks, and advanced bootstrapping methods.

Throughout his career, Dr. Micciancio has been recognized with prestigious honors, including the NSF CAREER Award (2001), a Hellman Fellowship (2001), a Sloan Fellowship (2003), and multiple FOCS Test of Time Awards (2022, 2024). In 2019, he was named a Fellow of the International Association for Cryptologic Research (IACR) for his pioneering contributions to lattice-based cryptography.