Daniele Micciancio

Cited by

	All	Since 2018
Citations	16358	7420
h-index	51	38
i10-index	85	72

1500

750

375

1125

199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202363 65 98 130 211 301 352 433 395 466 445 542 587 579 616 858 763 858 939 1128 1083 1281 1312 1443 1161

Public access

View all

23 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
Bogdan WarinschiUniversity of Bristol and DfinityVerified email at cs.bris.ac.uk
Oded RegevProfessor of Computer ScienceVerified email at cims.nyu.edu
Ran CanettiProfessor of Computer Science, Boston UniversityVerified email at bu.edu
Baiyu LiGoogleVerified email at cs.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
Shai HaleviSenior Principal Applied Scientist, AWS CryptographyVerified email at alum.mit.edu
Michael WalterIST AustriaVerified email at ist.ac.at
Léo DucasCWI, Amsterdam, The NetherlandsVerified email at cwi.nl
Panagiotis VoulgarisUCSDVerified email at cs.ucsd.edu
Sara Miner MoreAssociate Teaching Professor, Johns Hopkins UniversityVerified email at cs.jhu.edu
Amit SahaiSymantec Chair Professor of Computer Science; Professor of Mathematics (by courtesy), UCLAVerified email at cs.ucla.edu
Tal MalkinProfessor of Computer Science, Columbia UniversityVerified email at columbia.edu
Alon RosenBocconi UniversityVerified email at unibocconi.it
Saurabh PanjwaniNoneVerified email at ispirt.in
Omer ReingoldStanford UniversityVerified email at stanford.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
Worst-case to average-case reductions based on Gaussian measures D Micciancio, O Regev SIAM Journal on Computing 37 (1), 267-302, 2007	1295	2007
Trapdoors for lattices: Simpler, tighter, faster, smaller D Micciancio, C Peikert Annual International Conference on the Theory and Applications of …, 2012	1254	2012
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	1166	1999
Lattice-based cryptography D Micciancio, O Regev Post-quantum cryptography, 147-191, 2009	1006	2009
Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions M Bellare, D Micciancio, B Warinschi Advances in Cryptology—EUROCRYPT 2003: International Conference on the …, 2003	978	2003
Complexity of lattice problems: a cryptographic perspective D Micciancio, S Goldwasser Springer Science & Business Media, 2002	945	2002
FHEW: bootstrapping homomorphic encryption in less than a second L Ducas, D Micciancio Annual international conference on the theory and applications of …, 2015	735	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	473*	2001
Generalized compact knapsacks are collision resistant V Lyubashevsky, D Micciancio International Colloquium on Automata, Languages, and Programming, 144-155, 2006	438	2006
Generalized compact knapsacks, cyclic lattices, and efficient one-way functions D Micciancio computational complexity 16, 365-411, 2007	435*	2007
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	379	2010
Hardness of SIS and LWE with small parameters D Micciancio, C Peikert Annual cryptology conference, 21-39, 2013	361	2013
SWIFFT: A modest proposal for FFT hashing V Lyubashevsky, D Micciancio, C Peikert, A Rosen Fast Software Encryption: 15th International Workshop, FSE 2008, Lausanne …, 2008	315	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	305	1997
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	284	2010
Soundness of formal encryption in the presence of active adversaries D Micciancio, B Warinschi Theory of Cryptography Conference, 133-151, 2004	280	2004
Homomorphic encryption security standard M Albrecht, M Chase, H Chen, J Ding, S Goldwasser, S Gorbunov, ... HomomorphicEncryption. org, Toronto, Canada, Tech. Rep 11, 2018	247	2018
Improving lattice based cryptosystems using the Hermite normal form D Micciancio International Cryptography and Lattices Conference, 126-145, 2001	247	2001
Asymptotically efficient lattice-based digital signatures V Lyubashevsky, D Micciancio Journal of Cryptology 31, 774-797, 2018	244*	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	239	2002

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