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:

• Complexity of lattice and coding problems (and their applications to cryptography)
• 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 three years) or read my book Complexity of lattice problems: a cryptographic perspective.

Most recent papers (full list)

1. Cryptographic Functions from Worst-Case Complexity Assumptions - The LLL Algorithm: Survey and Applications, Springer (December 2009)
2. Faster exponential time algorithms for the shortest vector problem - SODA 2010 (January 2010)
3. The RSA group is pseudo-free - J. of Cryptology 23(2):169-186 (April 2010)
4. Computational soundness, co-induction, and encryption cycles - Eurocrypt 2010 (May 2010)
5. Duality in Lattice Crypography - Slides from invited talk at PKC 2010 (May 2010)
6. A Deterministic Single Exponential Time Algorithm for Most Lattice Problems based on Voronoi Cell Computations - STOC 2010 (June 2010). (Slides from Barriers II workshop talk.)

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
• Member of ACM SIGACT and IACR

Students

Current PhD students: Panagiotis Voulgaris, Petros Mol

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