Daniele Micciancio

DBLP Scholar AI2 ACM IACR ORCID MO GitHub MGP MSA Aminer Geek and Poke twitter instagram LinkedIn


Research Teaching Papers Book


[Picture] [Cover] [Cover (Japanese)] [Post Quantum Cryptography] [The LLL Algorithm] [TCC 2010]

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.


Most recent papers (full list)

  1. Interactive Proofs for Lattice Problems
    In Providing Sound Foundations for Cryptography

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

  3. Homomorphic Encryption for Finite Automata
    with Genise, Gentry, Halevi and Li. IACR ePrint 2019/176
    ePrint pdf dblp

  4. Building an Efficient Lattice Gadget Toolkit: Subgaussian Sampling and More
    with Genise and Polyakov. Eurocrypt 2019, to appear
    ePrint pdf dblp

  5. Symbolic Encryption with Pseudorandom Keys
    Eurocrypt 2019, to appear
    DOI ePrint pdf

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

  7. On the Hardness of Learning With Errors with Binary Secrets
    Theory of Computing, 14(13), 2018.
    DOI ePrint pdf

  8. Ring packing and amortized FHEW bootstrapping
    with J. Sorrell. ICALP 2018
    DOI ePrint pdf dblp

  9. Symbolic Security of Garbled Circuits
    with B. Li. CSF 2018
    doi ePrint pdf dblp

  10. On the Bit Security of Cryptographic Primitives
    with M. Walter. Eurocrypt 2018
    DOI ePrint pdf dblp

  11. Faster Gaussian Sampling for Trapdoor Lattices with Arbitrary Modulus
    with N. Genise. Eurocrypt 2018
    DOI ePrint pdf dblp Slides

  12. Equational Security Proofs of Oblivious Transfer Protocols
    with B. Li. PKC 2018
    DOI ePrint pdf dblp

  13. Asymptotically efficient lattice-based digital signatures
    with V. Lyubashevsky. J. Cryptology (2018)
    DOI ePrint pdf dblp


Professional Activities


Graduate Students and Postdocs

Current Students: Baiyu Li, Nicholas Genise, Jessica Sorrell, Michael Borkowski, 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).

Past Postdocs: Leo Ducas, Nadia Heninger, Marc Fischlin.