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 papers (full list)

1. Algorithms for the Densest Sub-lattice Problem - Manuscript.
2. Inapproximability of the Shortest Vector Problem: Toward a deterministic reduction - Submitted to Theory of Computing open access journal.
3. A Deterministic Single Exponential Time Algorithm for Most Lattice Problems based on Voronoi Cell Computations - Submitted by invitation to SIAM J. Computing special issue, 2012. Preliminary version in STOC'10. (Slides)
4. Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller - Eurocrypt 2012 (April 2012)
5. The Geometry of Lattice Cryptography - FOSAD 2011 (August 2011)
6. Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions - CRYPTO 2011 (August 2011)

Professional Activities

• Guest Editor of Journal of Computer and System Sciences (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
• Member of ACM SIGACT and IACR

Students

Current PhD students: Petros Mol, Daniel Martin, Orazio Puglisi (visiting student).

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).