World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
57
Citations
19289
World Ranking
3753
National Ranking
1793

Research.com Recognitions

  • 2003 - Fellow of Alfred P. Sloan Foundation
  • 2001 - Hellman Fellow

Overview

Daniele Micciancio is affiliated with the University of California, San Diego in the United States. Their research contributions span the field of Computer Science, with a particular focus on areas such as Artificial Intelligence, Computational Theory and Mathematics, and Information Systems.

Their research topics cover diverse aspects of cryptography and data security, privacy-preserving technologies in data, and complexity and algorithms in graphs. More specifically, their work includes cryptographic implementations and security, cryptography and residue arithmetic, coding theory and cryptography, and chaos-based image and signal encryption.

Micciancio's publication record includes articles in several notable venues. Recent papers include:

  • "Collaborative privacy-preserving analysis of oncological data using multiparty homomorphic encryption," 2023, Proceedings of the National Academy of Sciences
  • "Semi-Parallel logistic regression for GWAS on encrypted data," 2020, BMC Medical Genomics
  • "Simulation-Secure Threshold PKE from LWE with Polynomial Modulus," 2025, IACR Communications in Cryptology
  • "Fully Composable Homomorphic Encryption," 2025, IACR Communications in Cryptology

Frequent publication venues include:

  • IACR Communications in Cryptology (2 publications)
  • Proceedings of the National Academy of Sciences (1 publication)
  • BMC Medical Genomics (1 publication)

Their collaborative work often features recurring coauthors, including Baiyu Li, Mark Schultz-Wu, Thomas Ristenpart, Yuriy Polyakov, and Jessica Sorrell.

In addition to articles, Micciancio has contributed to several books published by Springer Science+Business Media. These include multiple editions of "Advances in Cryptology - CRYPTO 2020," which have varying citation counts.

The scientist has received recognition in the form of awards, notably being named a Fellow of the Alfred P. Sloan Foundation in 2003 and a Hellman Fellow in 2001.

Best Publications

  • Worst-Case to Average-Case Reductions Based on Gaussian Measures

    Daniele Micciancio;Oded Regev

  • Trapdoors for lattices: simpler, tighter, faster, smaller

    Daniele Micciancio;Chris Peikert

  • Multicast security: a taxonomy and some efficient constructions

    R. Canetti;J. Garay;G. Itkis;D. Micciancio

  • Lattice Based Cryptography.

    Daniele Micciancio

  • Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions

    Mihir Bellare;Daniele Micciancio;Bogdan Warinschi

  • Complexity of lattice problems : a cryptographic perspective

    Daniele Micciancio;S. Goldwasser

  • FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second

    Léo Ducas;Daniele Micciancio

  • Generalized Compact Knapsacks Are Collision Resistant

    Vadim Lyubashevsky;Daniele Micciancio

  • A Deterministic Single Exponential Time Algorithm for Most Lattice Problems Based on Voronoi Cell Computations

    Daniele Micciancio;Panagiotis Voulgaris

  • Complexity of lattice problems

    Daniele Micciancio;S. Goldwasser

  • Hardness of SIS and LWE with Small Parameters.

    Daniele Micciancio;Chris Peikert

  • The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant

    Daniele Micciancio

  • SWIFFT: A Modest Proposal for FFT Hashing

    Vadim Lyubashevsky;Daniele Micciancio;Chris Peikert;Alon Rosen

  • Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions

    Daniele Micciancio

  • Soundness of Formal Encryption in the Presence of Active Adversaries

    Daniele Micciancio;Bogdan Warinschi

  • A New Paradigm for Collision-free Hashing: Incrementality at Reduced Cost.

    Mihir Bellare;Daniele Micciancio

  • The hardness of the closest vector problem with preprocessing

    D. Micciancio

  • Asymptotically Efficient Lattice-Based Digital Signatures

    Vadim Lyubashevsky;Daniele Micciancio

  • Improving Lattice Based Cryptosystems Using the Hermite Normal Form

    Daniele Micciancio

  • Efficient generic forward-secure signatures with an unbounded number of time periods

    Tal Malkin;Daniele Micciancio;Sara Miner

  • Faster exponential time algorithms for the shortest vector problem

    Daniele Micciancio;Panagiotis Voulgaris

Frequent Co-Authors

Bogdan Warinschi
Bogdan Warinschi University of Bristol
Shafi Goldwasser
Shafi Goldwasser University of California, Berkeley
Mihir Bellare
Mihir Bellare University of California, San Diego
Vadim Lyubashevsky
Vadim Lyubashevsky IBM (Switzerland)
Oded Regev
Oded Regev Courant Institute of Mathematical Sciences
Salil P. Vadhan
Salil P. Vadhan Harvard University
Chris Peikert
Chris Peikert University of Michigan–Ann Arbor
Ran Canetti
Ran Canetti Boston University
Amit Sahai
Amit Sahai University of California, Los Angeles
Erez Petrank
Erez Petrank Technion – Israel Institute of Technology

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring an online degree can be a flexible and cost-effective way to advance your career in Computer Science or pivot into related fields. Students seeking a shorter commitment might consider online associate degrees, which can fast-track entry into tech roles or build a foundation for further study.

If affordability is your main concern, researching the cheapest online colleges is essential. Lower tuition rates can lessen your financial burden while still delivering the credentials needed to compete in the workforce.

For those interested in the business side of technology, obtaining a degree from the cheapest online business management degree programs opens pathways to tech management and lead roles. Similarly, an online engineering degree is a logical step for blending Computer Science skills with applied engineering. Exploring the cheapest online engineering degree options can help maximize ROI and job prospects.

Whether your end goal is software development, IT management, or engineering innovation, these affordable online pathways make higher education and dynamic tech careers more accessible than ever before.

Best Scientists Citing Daniele Micciancio

Trending Scientists