Daniele Micciancio
Artificial Intelligence · 2002–2020
A researcher in the Science corpus: 14 papers; trusts 48 researchers and is trusted by 91 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 116 citations into it; #2,390 of 36,961 by trust here, #3,957 by citations
- Computational Theory and Mathematics — 73 citations into it; #242 of 12,489 by trust here, #544 by citations
- Computer Vision and Pattern Recognition — 19 citations into it; #4,196 of 21,973 by trust here, #6,852 by citations
- Information Systems — 18 citations into it; #5,096 of 9,233 by trust here, #6,588 by citations
- Computer Networks and Communications — 14 citations into it; #559 of 9,996 by trust here, #2,447 by citations
- Privacy & Security — 10 citations into it
- Electrical and Electronic Engineering — 5 citations into it
- Statistics and Probability — 5 citations into it
Whom Daniele Micciancio trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Chris Peikert
- Oded Regev
- Craig Gentry
- Vadim Lyubashevsky
- Richard M. Karp
- Zvika Brakerski
- Oded Goldreich
- Dan Boneh
- Shafi Goldwasser
- Brent Waters
Who trusts Daniele Micciancio overall
- Vadim Lyubashevsky
- Oded Regev
- Chris Peikert
- Damien Stehlé
- Adeline Langlois
- Dan Boneh
- Zvika Brakerski
- Craig Gentry
- Shai Halevi
- Richard Lindner
Papers from Daniele Micciancio's perspective
Ordered by how strongly the researchers Daniele Micciancio trusts endorse each paper. Same corpus, a different order for every researcher.
- Trapdoors for hard lattices and new cryptographic constructions
- On lattices, learning with errors, random linear codes, and cryptography
- Predicting Lattice Reduction (International Conference on the Theory and Application of Cryptographic Techniques)
- Noise-tolerant learning, the parity problem, and the statistical query model (Symposium on the Theory of Computing)
- Lossy trapdoor functions and their applications (SIAM journal on computing (Print))
- New lattice based cryptographic constructions
- On Ideal Lattices and Learning with Errors over Rings
- Collision-Free Hashing from Lattice Problems
- Fully homomorphic encryption using ideal lattices
- Generating hard instances of lattice problems (extended abstract)
Their papers
- Homomorphic Encryption Standard (2019) — 295 citations
- Worst-case to average-case reductions based on Gaussian measures (2004) — 1,292 citations
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller (2012) — 1,302 citations
- Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions (2002) — 390 citations
- A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations (2010) — 356 citations
- Hardness of SIS and LWE with Small Parameters (2013) — 340 citations
- Faster exponential time algorithms for the shortest vector problem (2010) — 275 citations
- Complexity of lattice problems (2002) — 403 citations
- Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography (2020) — 51 citations
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second (2015) — 935 citations
- SWIFFT: A Modest Proposal for FFT Hashing (2008) — 311 citations
- Generalized Compact Knapsacks Are Collision Resistant (2006) — 389 citations
- Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions (2003) — 785 citations
- Complexity of lattice problems - a cryptographic perspective (2002) — 661 citations