Daniele is a professor in the Computer Science and Engineering department at the University of California, San Diego and, in 2019, he was elected as a Fellow of the IACR. His main focus is on the foundations of lattice-based cryptography and its advanced applications, including fully homomorphic encryption.  Overall, he has published many classic papers that relate to lattice methods, including working with Chris Peikert on "Trapdoors for lattices", and with Oded Regev on the "Worst-case to average-case reductions based on Gaussian methods".  Daniele has also contributed greatly to the advancement of bootstrapping methods, including defining the DM/FHEW method - along with Leo Ducas. 

He published a book on the "Complexity of Lattice Problems - A cryptographic perspective" with Shafi Goldwasser, and his paper on "Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions" was given a FOCS 20 years test of time award in 2022. This paper led to the theoretical foundation of efficient lattice based cryptography. His paper with Regev also received the FOCS ToT award in 2024.