D
Daniele Micciancio
Researcher at University of California, San Diego
Publications - 162
Citations - 14470
Daniele Micciancio is an academic researcher from University of California, San Diego. The author has contributed to research in topics: Lattice problem & Encryption. The author has an hindex of 55, co-authored 162 publications receiving 12709 citations. Previous affiliations of Daniele Micciancio include Massachusetts Institute of Technology & University of California, Los Angeles.
Papers
More filters
Book ChapterDOI
Trapdoors for lattices: simpler, tighter, faster, smaller
Daniele Micciancio,Chris Peikert +1 more
TL;DR: In this article, the authors give new methods for generating and using "strong trapdoors" in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), and asymptotically optimal with very small hidden constants.
Proceedings ArticleDOI
Multicast security: a taxonomy and some efficient constructions
TL;DR: A taxonomy of multicast scenarios on the Internet and an improved solution to the key revocation problem are presented, which can be regarded as a 'midpoint' between traditional message authentication codes and digital signatures.
Journal ArticleDOI
Worst-Case to Average-Case Reductions Based on Gaussian Measures
Daniele Micciancio,Oded Regev +1 more
TL;DR: It is shown that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost linear in the dimension of the lattice, and it is proved that the distribution that one obtains after adding Gaussian noise to a lattice has the following interesting property.
Book ChapterDOI
Foundations of group signatures: formal definitions, simplified requirements, and a construction based on general assumptions
TL;DR: In this article, the authors provide theoretical foundations for the group signature primitive and prove the existence of a construct meeting their definitions based only on the sole assumption that trapdoor permutations exist.
Book
Complexity of lattice problems : a cryptographic perspective
TL;DR: This chapter discusses low-Degree Hypergraphs, Cryptographic Functions, and Interactive Proof Systems, and some of the algorithms used in these systems.