2026 Daniele Micciancio: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	57	3753	3648	1794	1730	130	19289

Daniele Micciancio publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Daniele Micciancio sits on this spectrum.

32 publications 991+

This scientist: 130 publications — 19th percentile

19% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Daniele Micciancio D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Daniele Micciancio sits on this spectrum.

30 D-Index 131+

This scientist: 57 D-Index — 74th percentile

74% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

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

1651
Citations
Trapdoors for lattices: simpler, tighter, faster, smaller

Daniele Micciancio;Chris Peikert

1408
Citations
Multicast security: a taxonomy and some efficient constructions

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

1169
Citations
Lattice Based Cryptography.

Daniele Micciancio

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

Mihir Bellare;Daniele Micciancio;Bogdan Warinschi

1005
Citations
Complexity of lattice problems : a cryptographic perspective

Daniele Micciancio;S. Goldwasser

882
Citations
FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second

Léo Ducas;Daniele Micciancio

854
Citations
Generalized Compact Knapsacks Are Collision Resistant

Vadim Lyubashevsky;Daniele Micciancio

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

Daniele Micciancio;Panagiotis Voulgaris

687
Citations
Complexity of lattice problems

Daniele Micciancio;S. Goldwasser

415
Citations
Hardness of SIS and LWE with Small Parameters.

Daniele Micciancio;Chris Peikert

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

Daniele Micciancio

379
Citations
SWIFFT: A Modest Proposal for FFT Hashing

Vadim Lyubashevsky;Daniele Micciancio;Chris Peikert;Alon Rosen

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

Daniele Micciancio

337
Citations
Soundness of Formal Encryption in the Presence of Active Adversaries

Daniele Micciancio;Bogdan Warinschi

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

Mihir Bellare;Daniele Micciancio

315
Citations
The hardness of the closest vector problem with preprocessing

D. Micciancio

296
Citations
Asymptotically Efficient Lattice-Based Digital Signatures

Vadim Lyubashevsky;Daniele Micciancio

267
Citations
Improving Lattice Based Cryptosystems Using the Hermite Normal Form

Daniele Micciancio

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

Tal Malkin;Daniele Micciancio;Sara Miner

251
Citations
Faster exponential time algorithms for the shortest vector problem

Daniele Micciancio;Panagiotis Voulgaris

231
Citations

Frequent Co-Authors

Bogdan Warinschi University of Bristol

Shafi Goldwasser University of California, Berkeley

Mihir Bellare University of California, San Diego

Vadim Lyubashevsky IBM (Switzerland)

Oded Regev Courant Institute of Mathematical Sciences

Salil P. Vadhan Harvard University

Chris Peikert University of Michigan–Ann Arbor

Ran Canetti Boston University

Amit Sahai University of California, Los Angeles

Erez Petrank Technion – Israel Institute of Technology

External Links

Personal website of Daniele Micciancio Google Scholar page

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

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.