Daniele Micciancio

Citata da

	Tutte	Dal 2020
Citazioni	19445	8113
Indice H	57	42
i10-index	89	74

2100

1050

525

1575

19992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202561 65 100 135 211 295 347 443 397 472 464 539 601 575 636 864 773 871 948 1144 1145 1279 1318 1456 1808 2033 213

Accesso pubblico

Visualizza tutto

28 articoli

2 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

Shafi Goldwasserprofessor of computer science at UC BerkeleyEmail verificata su csail.mit.edu
Vadim LyubashevskyIBM Research Europe, ZurichEmail verificata su zurich.ibm.com
Chris PeikertProfessor, Computer Science and Engineering, University of MichiganEmail verificata su alum.mit.edu
Yuriy PolyakovPrincipal Scientist, Duality TechnologiesEmail verificata su dualitytech.com
Nicholas GeniseApple Inc.Email verificata su apple.com
Bogdan WarinschiUniversity of Bristol and DfinityEmail verificata su cs.bris.ac.uk
Oded RegevProfessor of Computer ScienceEmail verificata su cims.nyu.edu
Vinod VaikuntanathanProfessor of Computer Science, Massachusetts Institute of TechnologyEmail verificata su csail.mit.edu
Ran CanettiProfessor of Computer Science, Boston UniversityEmail verificata su bu.edu
Baiyu LiGoogleEmail verificata su cs.ucsd.edu
Shai HaleviSenior Principal Applied Scientist, AWS CryptographyEmail verificata su alum.mit.edu
Mihir BellareProfessor, Dept. of Computer Science and Engineering, University of California San Diego (UCSD)Email verificata su ucsd.edu
Moni NaorProfessor of Computer Science, Weizmann Institute of ScienceEmail verificata su weizmann.ac.il
Léo DucasCWI, Amsterdam & Leiden University, The NetherlandsEmail verificata su cwi.nl
Juan GarayProfessor, Texas A&M University, Computer Science & EngineeringEmail verificata su TAMU.EDU
Benny PinkasBar Ilan UniversityEmail verificata su biu.ac.il
Gene ItkisMIT Lincoln LaboratoryEmail verificata su ll.mit.edu
Amit SahaiSymantec Chair Professor of Computer Science; Professor of Mathematics (by courtesy), UCLAEmail verificata su cs.ucla.edu
Panagiotis VoulgarisUCSDEmail verificata su cs.ucsd.edu
Ahmad Al BadawiSenior Scientist in Applied CryptographyEmail verificata su u.nus.edu

Segui

Daniele Micciancio

Professor of Computer Science, University of California San Diego

Email verificata su cs.ucsd.edu - Home page

Cryptography Algorithms Computational Complexity


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
Trapdoors for lattices: Simpler, tighter, faster, smaller D Micciancio, C Peikert Annual International Conference on the Theory and Applications of …, 2012	1538	2012
Worst-case to average-case reductions based on Gaussian measures D Micciancio, O Regev SIAM Journal on Computing 37 (1), 267, 2007	1521	2007
Lattice-based cryptography D Micciancio, O Regev Post-quantum cryptography, 147-191, 2009	1228	2009
Multicast security: A taxonomy and some efficient constructions R Canetti, J Garay, G Itkis, D Micciancio, M Naor, B Pinkas INFOCOM'99. Eighteenth Annual Joint Conference of the IEEE Computer and …, 1999	1179	1999
FHEW: bootstrapping homomorphic encryption in less than a second L Ducas, D Micciancio Annual international conference on the theory and applications of …, 2015	1055	2015
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	1032	2003
Complexity of lattice problems: a cryptographic perspective D Micciancio, S Goldwasser Springer Netherlands, 2002	1031	2002
Homomorphic encryption standard M Albrecht, M Chase, H Chen, J Ding, S Goldwasser, S Gorbunov, ... Protecting privacy through homomorphic encryption, 31-62, 2021	580*	2021
The shortest vector in a lattice is hard to approximate to within some constant D Micciancio SIAM J. on Computing 30 (6), 2008-2035, 2001	510*	2001
Generalized compact knapsacks, cyclic lattices, and efficient one-way functions D Micciancio Computational Complexity 16 (4), 365-411, 2007	488*	2007
Generalized compact knapsacks are collision resistant V Lyubashevsky, D Micciancio International Colloquium on Automata, Languages, and Programming, 144-155, 2006	479	2006
Hardness of SIS and LWE with small parameters D Micciancio, C Peikert Annual cryptology conference, 21-39, 2013	432	2013
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	423	2010
SWIFFT: A modest proposal for FFT hashing V Lyubashevsky, D Micciancio, C Peikert, A Rosen Fast Software Encryption, 54-72, 2008	365	2008
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	334	2010
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	326	1997
Soundness of formal encryption in the presence of active adversaries D Micciancio, B Warinschi Theory of Cryptography Conference, 133-151, 2004	285	2004
Asymptotically efficient lattice-based digital signatures V Lyubashevsky, D Micciancio Journal of Cryptology 31, 774-797, 2018	274*	2018
Improving lattice based cryptosystems using the Hermite normal form D Micciancio Cryptography and Lattices, 126-145, 2001	263	2001
Efficient generic forward-secure signatures with an unbounded number of time periods T Malkin, D Micciancio, S Miner Advances in Cryptology—Eurocrypt 2002, 400-417, 2002	250	2002

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori