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. FHE bootstrapping in less than a second - with L. Ducas, ePrint 2014/816. Code available on github
  2. Fast Lattice Point Enumeration with Minimal Overhead - with M. Walter, SODA 2015 (to appear) ePrint
  3. Improved Short Lattice Signatures in the Standard Model - with L. Ducas, CRYPTO 2014 doi ePrint
  4. Locally Dense Codes - CCC 2014 doi eccc.
  5. Hardness of SIS and LWE with Small Parameters - with C. Peikert, Crypto 2013. doi ePrint. Invited to special issue of J. Cryptology
  6. An Equational Approach to Secure Multi-Party Computation - with S. Tessaro, ITCS 2013. pdf doi.
  7. Algorithms for the Densest Sub-lattice Problem - with D. Dadush, SODA 2013, pdf doi.

Professional Activities


Students

Current Graduate Students and Postdocs: Michael Walter, Leo Ducas

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)