Daniele Micciancio

Research Teaching Papers Book

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:

• Algorithms, Complexity and cryptographic applications of lattice and coding problems
• Symbolic analysis of cryptographic protocols (formal methods for computer and network security)
• Many other topics in cryptography (e.g., zero knowledge proofs, cryptographic primitives with special properties)

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.

Most recent works (full list)

1. Fully Homomorphic Encryption from the ground up
   Invited talk at Eurocrypt 2019
   

2. Interactive Proofs for Lattice Problems
   In Providing Sound Foundations for Cryptography, O. Goldreich (ed.), pp. 565-597. ACM Books 2019
   

3. Semi-parallel Logistic Regression for GWAS on Encrypted Data
   with Kim, Song and Li. IACR ePrint 2019/294.
   BMC Medical Genomics 2019 (to appear)
   First place at iDASH 2018 Track 2 (Homomorphic Encryption) competition.
   

4. Homomorphic Encryption for Finite Automata
   with Genise, Gentry, Halevi and Li. Asiacrypt 2019 (to appear)
   

5. Building an Efficient Lattice Gadget Toolkit: Subgaussian Sampling and More
   with Genise and Polyakov. Eurocrypt 2019
   

6. Symbolic Encryption with Pseudorandom Keys
   Eurocrypt 2019
   

7. Implementing Token-Based Obfuscation under (Ring) LWE
   with Chen, Genise, Polyakov and Rohloff. IACR ePrint 2018/1222
   

8. On the Hardness of Learning With Errors with Binary Secrets
   Theory of Computing, 14(13), 2018.
   

9. Asymptotically efficient lattice-based digital signatures
   with V. Lyubashevsky. J. Cryptology (2018)
   

Professional Activities

• Journals: SIAM J. on Computing (Associate Editor), J. of Cryptology (Associate Editor), Information and Computation (Associate Editor), Journal of Computer and System Sciences (Guest Editor, FOCS 2003 special issue)
• Program Committees: FOCS 2001, FOCS 2003, TCC 2004, Eurocrypt 2004, Crypto 2004, TCC 2006, FCC 2006, Crypto 2006, FOCS 2007, ANTS 2008, SCN 2008, TCC 2009 , TCC 2010 (PC chair), CT-RSA 2011, STOC 2011, Crypto 2011, PQC 2011, TCC 2012, Crypto 2012 Eurocrypt 2013 CT-RSA 2014 SCN 2014 CRYPTO 2015 FOCS 2016 CRYPTO 2018 CRYPTO 2019 (PC chair) CRYPTO 2020 (PC chair)
• General Chair TCC 2014
• Member of ACM SIGACT and IACR

Graduate Students and Postdocs

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.