Follow
Daniele Micciancio
Daniele Micciancio
Professor of computer science, UCSD
Verified email at eng.ucsd.edu - Homepage
Title
Cited by
Cited by
Year
Worst-case to average-case reductions based on Gaussian measures
D Micciancio, O Regev
SIAM Journal on Computing 37 (1), 267-302, 2007
12422007
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller.
D Micciancio, C Peikert
Eurocrypt 7237, 700-718, 2012
12012012
Multicast security: A taxonomy and some efficient constructions
R Canetti, J Garay, G Itkis, D Micciancio, M Naor, B Pinkas
IEEE INFOCOM'99. Conference on Computer Communications. Proceedings …, 1999
11411999
Lattice-based cryptography
D Micciancio, O Regev
Post-quantum cryptography, 147-191, 2009
9762009
Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions
M Bellare, D Micciancio, B Warinschi
Advances in Cryptology—EUROCRYPT 2003: International Conference on the …, 2003
9642003
Complexity of lattice problems: a cryptographic perspective
D Micciancio, S Goldwasser
Springer Science & Business Media, 2002
9172002
FHEW: bootstrapping homomorphic encryption in less than a second
L Ducas, D Micciancio
Advances in Cryptology--EUROCRYPT 2015: 34th Annual International Conference …, 2015
6832015
The shortest vector in a lattice is hard to approximate to within some constant
D Micciancio
SIAM journal on Computing 30 (6), 2008-2035, 2001
457*2001
Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
D Micciancio
computational complexity 16, 365-411, 2007
425*2007
Generalized compact knapsacks are collision resistant
V Lyubashevsky, D Micciancio
Automata, Languages and Programming: 33rd International Colloquium, ICALP …, 2006
4232006
A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
D Micciancio, P Voulgaris
Proceedings of the forty-second ACM symposium on Theory of computing, 351-358, 2010
3722010
Hardness of SIS and LWE with small parameters
D Micciancio, C Peikert
Advances in Cryptology–CRYPTO 2013: 33rd Annual Cryptology Conference, Santa …, 2013
3472013
SWIFFT: A modest proposal for FFT hashing
V Lyubashevsky, D Micciancio, C Peikert, A Rosen
Fast Software Encryption: 15th International Workshop, FSE 2008, Lausanne …, 2008
3102008
A new paradigm for collision-free hashing: Incrementality at reduced cost
M Bellare, D Micciancio
Advances in Cryptology—EUROCRYPT’97: International Conference on the Theory …, 1997
3051997
Soundness of formal encryption in the presence of active adversaries
D Micciancio, B Warinschi
Theory of Cryptography: First Theory of Cryptography Conference, TCC 2004 …, 2004
2802004
Faster exponential time algorithms for the shortest vector problem
D Micciancio, P Voulgaris
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
2762010
Improving lattice based cryptosystems using the Hermite normal form
D Micciancio
Cryptography and Lattices: International Conference, CaLC 2001 Providence …, 2001
2412001
Asymptotically efficient lattice-based digital signatures
V Lyubashevsky, D Micciancio
Journal of Cryptology 31, 774-797, 2018
240*2018
Efficient generic forward-secure signatures with an unbounded number of time periods
T Malkin, D Micciancio, S Miner
Advances in Cryptology—EUROCRYPT 2002: International Conference on the …, 2002
2392002
The hardness of the closest vector problem with preprocessing
D Micciancio
IEEE Transactions on Information Theory 47 (3), 1212-1215, 2001
2232001
The system can't perform the operation now. Try again later.
Articles 1–20