Daniele Micciancio

Dikutip oleh

	Semua	Sejak 2020
Kutipan	19568	8199
indeks-h	57	42
indeks-i10	91	77

2100

1050

525

1575

19992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202558 66 102 131 216 297 358 445 396 488 452 550 584 577 646 871 781 877 954 1164 1120 1304 1307 1456 1808 2044 274

Akses publik

Lihat semua

28 artikel

2 artikel

tersedia

tidak tersedia

Berdasarkan pada mandat pendanaan

Pengarang bersama

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

Ikuti

Daniele Micciancio

Professor of Computer Science, University of California San Diego

Email yang diverifikasi di cs.ucsd.edu - Beranda

Cryptography Algorithms Computational Complexity


Judul Urutkan menurut kutipan Urutkan menurut tahun Urutkan menurut judul	Dikutip oleh Dikutip oleh	Tahun
Trapdoors for lattices: Simpler, tighter, faster, smaller D Micciancio, C Peikert Annual International Conference on the Theory and Applications of …, 2012	1555	2012
Worst-case to average-case reductions based on Gaussian measures D Micciancio, O Regev SIAM Journal on Computing 37 (1), 267, 2007	1530	2007
Lattice-based cryptography D Micciancio, O Regev Post-quantum cryptography, 147-191, 2009	1229	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	1164	1999
FHEW: bootstrapping homomorphic encryption in less than a second L Ducas, D Micciancio Annual international conference on the theory and applications of …, 2015	1063	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	1051	2003
Complexity of lattice problems: a cryptographic perspective D Micciancio, S Goldwasser Springer Netherlands, 2002	1034	2002
Homomorphic encryption standard M Albrecht, M Chase, H Chen, J Ding, S Goldwasser, S Gorbunov, ... Protecting privacy through homomorphic encryption, 31-62, 2021	586*	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	517*	2001
Generalized compact knapsacks, cyclic lattices, and efficient one-way functions D Micciancio Computational Complexity 16 (4), 365-411, 2007	498*	2007
Generalized compact knapsacks are collision resistant V Lyubashevsky, D Micciancio International Colloquium on Automata, Languages, and Programming, 144-155, 2006	492	2006
Hardness of SIS and LWE with small parameters D Micciancio, C Peikert Annual cryptology conference, 21-39, 2013	442	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	421	2010
SWIFFT: A modest proposal for FFT hashing V Lyubashevsky, D Micciancio, C Peikert, A Rosen Fast Software Encryption, 54-72, 2008	366	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	328	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	324	1997
Openfhe: Open-source fully homomorphic encryption library A Al Badawi, J Bates, F Bergamaschi, DB Cousins, S Erabelli, N Genise, ... proceedings of the 10th workshop on encrypted computing & applied …, 2022	289	2022
Soundness of formal encryption in the presence of active adversaries D Micciancio, B Warinschi Theory of Cryptography Conference, 133-151, 2004	287	2004
Asymptotically efficient lattice-based digital signatures V Lyubashevsky, D Micciancio Journal of Cryptology 31, 774-797, 2018	276*	2018
Improving lattice based cryptosystems using the Hermite normal form D Micciancio Cryptography and Lattices, 126-145, 2001	256	2001

Sistem tidak dapat melakukan operasi ini. Coba lagi nanti.

Artikel 1–20

Kutipan per tahun

Kutipan duplikat

Kutipan yang digabung

Tambahkan pengarang bersamaPengarang bersama

Ikuti

Dikutip oleh

Pengarang bersama