Daniele Micciancio's Home Page

[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 an associate 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. Worst-case to average-case reductions based on Gaussian measure - SIAM J. on Computing 37(1):267-302 (2007).
2. Generalized compact knapsaks, cyclic lattices, and efficient one-way functions - Computational Complexity, 16(4):365-411 (2007).
3. Cryptographic functions from worst-case complexity assumptions - LLL+25.
4. Efficient reductions among lattice problems - SODA 2008.
5. Asymptotically efficient lattice-based digital signatures - TCC 2008
6. The round-complexity of black-box zero-knowledge: a combinatorial characterization - TCC 2008
7. SWIFFT: a modest proposal for FFT hashing - FSE 2008
8. Optimal communication complexity of generic multicast key distribution - IEEE/ACM Trans. on Networking, To appear (2008).
9. Efficient bounded distance decoders for Barnes-Wall lattices - ISIT 2008.
10. An indistinguishability-based characterization of anonymous channels - PETS 2008

---

Professional Activities

• Guest Editor for Journal of Computer and System Sciences (FOCS 2003 special issue)
• Program Committee member for FOCS 2001 (Las Vegas, NV, USA), FOCS 2003 (Cambridge, MA, USA), TCC 2004 (Cambridge, MA, USA), Eurocrypt 2004 (Interlaken, Switzerland), Crypto 2004 (Santa Barbara, CA, USA), TCC 2006 (Cambridge, MA, USA), FCC 2006 (Venice, Italy), Crypto 2006 (Santa Barbara, CA, USA), FOCS 2007 (Providence, RI, USA), ANTS 2008 (Banff, AB, Canada), SCN 2008 (Amalfi, Italy), TCC 2009 (San Francisco, CA, USA)