Daniele Micciancio

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


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