Address: University of California, San Diego
Computer Science & Engineering Department
9500 Gilman Drive, Mail code 0404. La Jolla, CA 92093-5004, USA
Phone: (858) 822-2577. Fax: (858) 534-7029
E-mail: daniele(at)cs.ucsd.edu
I am a professor in the Computer Science & Engineering department at the University of California, San Diego. I am a member of the Cryptography and Security group and the Theory of Computation group. My research interests include:
See research projects and publications web pages for more information about my research. If you want to know more about lattices and their cryptographic applications, take course CSE206A: Lattice Algorithms and Applications (usually offered every two or three years) or read my book Complexity of lattice problems: a cryptographic perspective.
On the Security of Homomorphic Encryption on Approximate Numbers
with Li.
IACR ePrint 2020/1533
Diogenes: Lightweight Scalable RSA Modulus Generation with a Dishonest Majority
with Chen, Hazay, Ishai, Kashnikov, Riviere, shelat, Venkitasubramaniam and Wang.
SSP (Oakland) 2021
Implementing Token-Based Obfuscation under (Ring) LWE
with Chen, Genise, Polyakov & Rohloff.
WHAC 2020
Simpler Statistically Sender Private Oblivious Transfer from Ideals of Cyclotomic Integers
with Sorrell.
Asiacrypt 2020
Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography
with Genise, Peikert and Walters.
PKC 2020
Bootstrapping in FHEW-like Cryptosystems
with Polyakov. IACR ePrint 2020/086.
Fully Homomorphic Encryption from the ground up
Invited talk at Eurocrypt 2019
Interactive Proofs for Lattice Problems
In Providing Sound Foundations for Cryptography, O. Goldreich (ed.), pp. 565-597. ACM Books 2019
Semi-parallel Logistic Regression for GWAS on Encrypted Data
with Kim, Song and Li.
BMC Medical Genomics 13(99), 2020)
First place at iDASH 2018 Track 2 (Homomorphic Encryption) competition.
Homomorphic Encryption for Finite Automata
with Genise, Gentry, Halevi and Li. Asiacrypt 2019
Building an Efficient Lattice Gadget Toolkit: Subgaussian Sampling and More
with Genise and Polyakov. Eurocrypt 2019
Symbolic Encryption with Pseudorandom Keys
Eurocrypt 2019
Current Students: Baiyu Li, Jessica Sorrell, Mark Schultz.
Past students: Fritz Schneider (MS 2002), Bogdan Warinschi (PhD 2004), Alejandro Hevia (PhD 2006), Saurabh Panjwani (PhD 2007), Vadim Lyubashevsky (PhD 2008), Scott Yilek (PhD 2010), Panagiotis Voulgaris (PhD 2011), Petros Mol (PhD 2013), Radeshyam Balasundaram (MS 2015), Michael Walter (PhD 2017), Evan Roncevich (MS 2018). Nicholas Genise (PhD 2019),
Past Postdocs: Leo Ducas, Nadia Heninger, Marc Fischlin.