Daniele Micciancio

Cited by

	All	Since 2016
Citations	13340	6300
h-index	47	34
i10-index	75	63

1300

650

325

975

1999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202153 65 98 125 209 279 335 429 392 462 433 541 597 568 600 846 775 858 983 1115 1051 1273 1015

Public access

View all

16 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Vadim LyubashevskyIBM Research - 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
Léo DucasCWI, Amsterdam, The NetherlandsVerified email at cwi.nl
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
Salil VadhanVicky Joseph Professor of Computer Science and Applied Mathematics, Harvard UniversityVerified email at g.harvard.edu
Omer ReingoldStanford UniversityVerified email at stanford.edu
Amit SahaiSymantec Chair Professor of Computer Science, UCLA; Director of Center for Encrypted FunctionalitiesVerified email at cs.ucla.edu

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
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	1120	1999
Worst-case to average-case reductions based on Gaussian measures D Micciancio, O Regev SIAM Journal on Computing 37 (1), 267-302, 2007	1066	2007
Trapdoors for lattices: Simpler, tighter, faster, smaller D Micciancio, C Peikert Annual International Conference on the Theory and Applications of …, 2012	950	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	871	2003
Complexity of lattice problems: a cryptographic perspective D Micciancio, S Goldwasser Springer Science & Business Media, 2012	834	2012
Lattice-based cryptography D Micciancio, O Regev Post-quantum cryptography, 147-191, 2009	774	2009
FHEW: bootstrapping homomorphic encryption in less than a second L Ducas, D Micciancio Annual International Conference on the Theory and Applications of …, 2015	446	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	424*	2001
Generalized compact knapsacks, cyclic lattices, and efficient one-way functions D Micciancio computational complexity 16 (4), 365-411, 2007	377*	2007
Generalized compact knapsacks are collision resistant V Lyubashevsky, D Micciancio International Colloquium on Automata, Languages, and Programming, 144-155, 2006	360	2006
A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations D Micciancio, P Voulgaris SIAM Journal on Computing 42 (3), 1364-1391, 2013	326	2013
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	289	1997
Hardness of SIS and LWE with small parameters D Micciancio, C Peikert Annual Cryptology Conference, 21-39, 2013	283	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	282	2008
Soundness of formal encryption in the presence of active adversaries D Micciancio, B Warinschi Theory of Cryptography Conference, 133-151, 2004	267	2004
Improving lattice based cryptosystems using the Hermite normal form D Micciancio International Cryptography and Lattices Conference, 126-145, 2001	227	2001
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	220	2010
Asymptotically efficient lattice-based digital signatures V Lyubashevsky, D Micciancio Journal of Cryptology 31 (3), 774-797, 2018	216*	2018
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	216	2002
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 this author

Cited by

Co-authors