Follow
Daniele Micciancio
Daniele Micciancio
Professor of computer science, UCSD
Verified email at eng.ucsd.edu - Homepage
Title
Cited by
Cited by
Year
Worst-case to average-case reductions based on Gaussian measures
D Micciancio, O Regev
SIAM Journal on Computing 37 (1), 267-302, 2007
11862007
Multicast security: A taxonomy and some efficient constructions
R Canetti, J Garay, G Itkis, D Micciancio, M Naor, B Pinkas
IEEE INFOCOM'99. Conference on Computer Communications. Proceedings …, 1999
11401999
Trapdoors for lattices: Simpler, tighter, faster, smaller
D Micciancio, C Peikert
Annual International Conference on the Theory and Applications of …, 2012
11322012
Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions
M Bellare, D Micciancio, B Warinschi
International conference on the theory and applications of cryptographic …, 2003
9342003
Lattice-based cryptography
D Micciancio, O Regev
Post-quantum cryptography, 147-191, 2009
9192009
Complexity of lattice problems: a cryptographic perspective
D Micciancio, S Goldwasser
Springer Science & Business Media, 2002
8882002
FHEW: bootstrapping homomorphic encryption in less than a second
L Ducas, D Micciancio
Annual international conference on the theory and applications of …, 2015
5992015
The shortest vector in a lattice is hard to approximate to within some constant
D Micciancio
SIAM journal on Computing 30 (6), 2008-2035, 2001
444*2001
Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
D Micciancio
computational complexity 16 (4), 365-411, 2007
409*2007
Generalized compact knapsacks are collision resistant
V Lyubashevsky, D Micciancio
International Colloquium on Automata, Languages, and Programming, 144-155, 2006
4082006
A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
D Micciancio, P Voulgaris
Proceedings of the forty-second ACM symposium on Theory of computing, 351-358, 2010
3582010
Hardness of SIS and LWE with small parameters
D Micciancio, C Peikert
Annual Cryptology Conference, 21-39, 2013
3362013
SWIFFT: A modest proposal for FFT hashing
V Lyubashevsky, D Micciancio, C Peikert, A Rosen
International workshop on fast software encryption, 54-72, 2008
3052008
A new paradigm for collision-free hashing: Incrementality at reduced cost
M Bellare, D Micciancio
International Conference on the Theory and Applications of Cryptographic …, 1997
2981997
Soundness of formal encryption in the presence of active adversaries
D Micciancio, B Warinschi
Theory of Cryptography Conference, 133-151, 2004
2752004
Faster exponential time algorithms for the shortest vector problem
D Micciancio, P Voulgaris
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
2632010
Improving lattice based cryptosystems using the Hermite normal form
D Micciancio
International Cryptography and Lattices Conference, 126-145, 2001
2362001
Efficient generic forward-secure signatures with an unbounded number of time periods
T Malkin, D Micciancio, S Miner
International Conference on the Theory and Applications of Cryptographic …, 2002
2322002
Asymptotically efficient lattice-based digital signatures
V Lyubashevsky, D Micciancio
Journal of Cryptology 31 (3), 774-797, 2018
230*2018
The hardness of the closest vector problem with preprocessing
D Micciancio
IEEE Transactions on Information Theory 47 (3), 1212-1215, 2001
2142001
The system can't perform the operation now. Try again later.
Articles 1–20