Daniele Micciancio

14.9k citations
73 papers · 2.5k indexed · 1 hit paper · h-index 23

Daniele Micciancio

67 papers receiving 2.4k citations

Hit Papers

Worst‐Case to Average‐Case Reductions Based on Gaussian M...3472007202620132019100200300

Peers

Daniele Micciancio
Comparison fields: 5 of 67
  • Artificial Intelligence 1.9k
  • Computational Theory and Mathematics 900
  • Computer Networks and Communications 857
  • Information Systems 418
  • Computer Vision and Pattern Recognition 326
Replace Jacques Stern with:
Jacques Stern France
Leonid A. Levin United States
Michael Ben-Or Israel
C. P. Schnorr Germany
Paul Beame United States
Victor Shoup United States
S. Goldwasser United States
Arjen K. Lenstra United States
Rasmus Pagh Denmark
Alexander Barg United States
Daniele Micciancio relative to Jacques Stern France Jacques Stern's profile →
Citations per field
00.5×1.5×
Jacques Stern · 1×
Citations per year

Countries citing papers authored by Daniele Micciancio

Since Specialization
Citations

This map shows the geographic impact of Daniele Micciancio's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Daniele Micciancio with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Daniele Micciancio more than expected).

Fields of papers citing papers by Daniele Micciancio

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Daniele Micciancio. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Daniele Micciancio. The network helps show where Daniele Micciancio may publish in the future.

Co-authorship network

The 25 scholars most cited alongside Daniele Micciancio, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Daniele Micciancio Line = papers co-authored together Daniele Micciancio links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown
#Work
1 20250
2 20235
3 202113
4
201812
5
201216
6 20101
7
Efficient reductions among lattice problems
200819
8 20087
9
Generalized Compact Knapsacks are Collision Resistant
20057
10 200429
11
Simulatable Commitments and Efficient Concurrent Zero-Knowledge
20030
12
Statistical zero-knowledge proofs with efficient provers: Lattice problems and more
20032
13
Foundations for Group Signatures: Simplified Requirements and a Construction Based on General Assumptions
20031
14 2002187
15
Completeness Theorems for the Abadi-Rogaway Language of Encrypted Expressions
20021
16 20023
17
Approximating Shortest Lattice Vectors is Not Harder Than Approximating Closest Lattice Vectors.
19991
18
Perfectly One-Way Probabilistic Hash Functions
19989
19
The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant.
19982
20 19952

About Daniele Micciancio

Daniele Micciancio is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications, having authored 73 papers that have together received 2.5k indexed citations. Recurring topics across this work include Cryptography and Data Security (48 papers), Complexity and Algorithms in Graphs (27 papers), Coding theory and cryptography (18 papers), Chaos-based Image/Signal Encryption (11 papers), Cryptographic Implementations and Security (10 papers), semigroups and automata theory (9 papers), Computability, Logic, AI Algorithms (9 papers) and Advanced Authentication Protocols Security (7 papers). The work is most often cited by research in Artificial Intelligence (1.9k citations), Computational Theory and Mathematics (900 citations) and Computer Networks and Communications (857 citations). Daniele Micciancio has collaborated with scholars based in United States, Israel and Netherlands. Frequent co-authors include Oded Regev, Shafi Goldwasser, S. Goldwasser, Ran Canetti, Panagiotis Voulgaris, Gene Itkis, Benny Pinkas, Juan A. Garay, Madhu Sudan and Ilya Dumer. Their work appears in journals such as IEEE Transactions on Information Theory, Communications of the ACM and IEEE/ACM Transactions on Networking.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026