Daniele Micciancio
Affiliations: | Computer Science and Engineering | University of California, San Diego, La Jolla, CA |
Area:
Computer ScienceGoogle:
"Daniele Micciancio"Children
Sign in to add traineeBogdan Warinschi | grad student | 2004 | UCSD |
Alejandro Hevia | grad student | 2006 | UCSD |
Saurabh K. Panjwani | grad student | 2007 | UCSD |
Vadim Lyubashevsky | grad student | 2008 | UCSD |
Scott C. Yilek | grad student | 2010 | UCSD |
Panagiotis Voulgaris | grad student | 2011 | UCSD |
Petros Mol | grad student | 2013 | UCSD |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Kim M, Song Y, Li B, et al. (2020) Semi-Parallel logistic regression for GWAS on encrypted data. Bmc Medical Genomics. 13: 99 |
Ducas L, Micciancio D. (2015) FHEW: Bootstrapping homomorphic encryption in less than a second Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9056: 617-640 |
Ducas L, Micciancio D. (2014) Improved short lattice signatures in the standard model Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8616: 335-352 |
Micciancio D. (2012) Inapproximability of the Shortest Vector Problem: Toward a Deterministic Reduction Theory of Computing. 8: 487-512 |
Micciancio D. (2011) The geometry of lattice cryptography Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6858: 185-210 |
Micciancio D, Mol P. (2011) Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6841: 465-484 |
Micciancio D. (2010) A first glimpse of cryptography's Holy Grail Communications of the Acm. 53: 96 |
Micciancio D, Voulgaris P. (2010) A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations Proceedings of the Annual Acm Symposium On Theory of Computing. 351-358 |
Micciancio D. (2010) The RSA group is pseudo-free Journal of Cryptology. 23: 169-186 |
Lyubashevsky V, Micciancio D. (2009) On bounded distance decoding, unique shortest vectors, and the minimum distance problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5677: 577-594 |