Daniele Micciancio's Home Page
I am full 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)
- Optimal communication complexity of generic multicast key distribution -
IEEE/ACM Trans. on Networking,
16(4):803-813 (2008).
- Efficient bounded distance decoders
for Barnes-Wall lattices -
ISIT 2008.
- An indistinguishability-based characterization of anonymous channels
-
PETS 2008
- Lattice-Based Cryptography
- In Post Quantum Cryptography (2009)
- The RSA group is pseudo-free
- J. of Cryptology
[To appear]
-
On Bounded Distance Decoding, Unique Shortest Vectors,
and the Minimum Distance Problem -
CRYPTO 2009
- Computational soundness, co-induction, and encryption cycles
-
IACR ePrint TR 2009/227
[Manuscript]
- Pseudo-randomness and partial information in symbolic security analysis
-
IACR ePrint TR 2009/249
[Manuscript]
- Faster exponential time algorithms
for the shortest vector problem -
SODA 2010
[To appear]
(Prelim. version ECCC TR09-065.)
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),
TCC 2010 PC chair (Zurich, Switzerland)
Students
Current PhD students:
Scott Yilek,
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).