Daniele Micciancio
Daniele Micciancio
Professor of computer science, UCSD
Dirección de correo verificada de eng.ucsd.edu - Página principal
TítuloCitado porAño
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
10541999
Worst-case to average-case reductions based on Gaussian measures
D Micciancio, O Regev
SIAM Journal on Computing 37 (1), 267-302, 2007
8382007
Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions
M Bellare, D Micciancio, B Warinschi
International Conference on the Theory and Applications of Cryptographic …, 2003
7712003
Complexity of lattice problems: a cryptographic perspective
D Micciancio, S Goldwasser
Springer Science & Business Media, 2012
7382012
Trapdoors for lattices: Simpler, tighter, faster, smaller
D Micciancio, C Peikert
Annual International Conference on the Theory and Applications of …, 2012
6702012
Lattice-based cryptography
D Micciancio, O Regev
Post-quantum cryptography, 147-191, 2009
6062009
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
384*2001
Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
D Micciancio
computational complexity 16 (4), 365-411, 2007
307*2007
Generalized compact knapsacks are collision resistant
V Lyubashevsky, D Micciancio
International Colloquium on Automata, Languages, and Programming, 144-155, 2006
2902006
FHEW: bootstrapping homomorphic encryption in less than a second
L Ducas, D Micciancio
Annual International Conference on the Theory and Applications of …, 2015
2852015
A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
D Micciancio, P Voulgaris
SIAM Journal on Computing 42 (3), 1364-1391, 2013
2792013
A new paradigm for collision-free hashing: Incrementality at reduced cost
M Bellare, D Micciancio
International Conference on the Theory and Applications of Cryptographic …, 1997
2661997
Soundness of formal encryption in the presence of active adversaries
D Micciancio, B Warinschi
Theory of Cryptography Conference, 133-151, 2004
2522004
SWIFFT: A modest proposal for FFT hashing
V Lyubashevsky, D Micciancio, C Peikert, A Rosen
International Workshop on Fast Software Encryption, 54-72, 2008
2492008
Improving lattice based cryptosystems using the Hermite normal form
D Micciancio
International Cryptography and Lattices Conference, 126-145, 2001
2122001
Hardness of SIS and LWE with small parameters
D Micciancio, C Peikert
Annual Cryptology Conference, 21-39, 2013
2092013
Efficient generic forward-secure signatures with an unbounded number of time periods
T Malkin, D Micciancio, S Miner
International Conference on the Theory and Applications of Cryptographic …, 2002
1902002
Perfectly one-way probabilistic hash functions (preliminary version)
R Canetti, D Micciancio, O Reingold
Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998
1871998
Hardness of approximating the minimum distance of a linear code
I Dumer, D Micciancio, M Sudan
IEEE Transactions on Information Theory 49 (1), 22-37, 2003
1782003
Asymptotically efficient lattice-based digital signatures
V Lyubashevsky, D Micciancio
Journal of Cryptology 31 (3), 774-797, 2018
174*2018
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20