Daniele Micciancio

Cited by

	All	Since 2017
Citations	14654	6742
h-index	49	36
i10-index	80	69

1400

700

350

1050

19992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202255 66 94 130 207 280 342 432 391 460 440 557 579 564 603 863 759 853 987 1110 1072 1247 1304 1018

Public access

View all

20 articles

1 article

available

not available

Based on funding mandates

Co-authors

Vadim LyubashevskyIBM Research Europe, ZurichVerified email at zurich.ibm.com
Chris PeikertProfessor, Computer Science and Engineering, University of MichiganVerified email at alum.mit.edu
Oded RegevProfessor of Computer ScienceVerified email at cims.nyu.edu
Bogdan WarinschiUniversity of Bristol and DfinityVerified email at cs.bris.ac.uk
Ran CanettiProfessor of Computer Science, Boston UniversityVerified email at bu.edu
Mihir BellareProfessor, Department of Computer Science and Engineering, University of California San Diego (UCSD)Verified email at eng.ucsd.edu
Juan GarayProfessor, Texas A&M University, Computer Science & EngineeringVerified email at TAMU.EDU
Benny PinkasBar Ilan UniversityVerified email at biu.ac.il
Gene ItkisMIT Lincoln LaboratoryVerified email at ll.mit.edu
Moni NaorProfessor of Computer Science, Weizmann Institute of ScienceVerified email at weizmann.ac.il
Panagiotis VoulgarisUCSDVerified email at cs.ucsd.edu
Michael WalterIST AustriaVerified email at ist.ac.at
Baiyu LiUC San DiegoVerified email at cs.ucsd.edu
Léo DucasCWI, Amsterdam, The NetherlandsVerified email at cwi.nl
Shai HaleviResearch Fellow, Algorand FoundationVerified email at alum.mit.edu
Nicholas GeniseSRI InternationalVerified email at sri.com
Alon RosenBocconi UniversityVerified email at unibocconi.it
Sara Miner MoreAssociate Teaching Professor, Johns Hopkins UniversityVerified email at cs.jhu.edu
Tal MalkinProfessor of Computer Science, Columbia UniversityVerified email at columbia.edu
Saurabh PanjwaniNoneVerified email at ispirt.in

Daniele Micciancio

Professor of computer science, UCSD

Verified email at eng.ucsd.edu - Homepage

Cryptography Computational Complexity Algorithms


Title Sort by citations Sort by year Sort by 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	1163	2007
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	1137	1999
Trapdoors for lattices: Simpler, tighter, faster, smaller D Micciancio, C Peikert Annual International Conference on the Theory and Applications of …, 2012	1089	2012
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	923	2003
Lattice-based cryptography D Micciancio, O Regev Post-quantum cryptography, 147-191, 2009	885	2009
Complexity of lattice problems: a cryptographic perspective D Micciancio, S Goldwasser Springer Science & Business Media, 2002	877	2002
FHEW: bootstrapping homomorphic encryption in less than a second L Ducas, D Micciancio Annual international conference on the theory and applications of …, 2015	566	2015
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	440*	2001
Generalized compact knapsacks, cyclic lattices, and efficient one-way functions D Micciancio computational complexity 16 (4), 365-411, 2007	404*	2007
Generalized compact knapsacks are collision resistant V Lyubashevsky, D Micciancio International Colloquium on Automata, Languages, and Programming, 144-155, 2006	397	2006
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	348	2010
Hardness of SIS and LWE with small parameters D Micciancio, C Peikert Annual Cryptology Conference, 21-39, 2013	326	2013
SWIFFT: A modest proposal for FFT hashing V Lyubashevsky, D Micciancio, C Peikert, A Rosen International workshop on fast software encryption, 54-72, 2008	299	2008
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	298	1997
Soundness of formal encryption in the presence of active adversaries D Micciancio, B Warinschi Theory of Cryptography Conference, 133-151, 2004	274	2004
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	256	2010
Improving lattice based cryptosystems using the Hermite normal form D Micciancio International Cryptography and Lattices Conference, 126-145, 2001	235	2001
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	231	2002
Asymptotically efficient lattice-based digital signatures V Lyubashevsky, D Micciancio Journal of Cryptology 31 (3), 774-797, 2018	228*	2018
Perfectly one-way probabilistic hash functions (preliminary version) R Canetti, D Micciancio, O Reingold Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998	212	1998

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors