# zbMATH — the first resource for mathematics

## Micciancio, Daniele

Compute Distance To:
 Author ID: micciancio.daniele Published as: Micciancio, D.; Micciancio, Daniele External Links: MGP
 Documents Indexed: 72 Publications since 1997, including 8 Books
all top 5

#### Co-Authors

 18 single-authored 6 Lyubashevsky, Vadim 4 Walter, Michael 3 Boldyreva, Alexandra 3 Genise, Nicholas 3 Li, Baiyu 3 Panjwani, Saurabh 3 Peikert, Chris 3 Regev, Oded 3 Ristenpart, Thomas 3 Voulgaris, Panagiotis 3 Warinschi, Bogdan 2 Bellare, Mihir 2 Ducas, Léo 2 Goldwasser, Shafi 2 Hevia, Alejandro 2 Vadhan, Salil P. 1 Canetti, Ran 1 Dadush, Daniel 1 Dumer, Ilya I. 1 Feige, Uriel 1 Gennaro, Rosario 1 Gentry, Craig 1 Goldreich, Oded 1 Guruswami, Venkatesan 1 Halevi, Shai 1 Liu, Yi-Kai 1 Malkin, Tal G. 1 Miner, Sara K. 1 Mol, Petros 1 Ong, Shien Jin 1 Petrank, Erez 1 Polyakov, Yuriy 1 Reingold, Omer 1 Rosen, Alon 1 Safra, Shmuel 1 Sahai, Amit 1 Seifert, Jean-Pierre 1 Sudan, Madhu 1 Tessaro, Stefano 1 Yilek, Scott
all top 5

#### Serials

 7 Lecture Notes in Computer Science 4 SIAM Journal on Computing 2 IEEE Transactions on Information Theory 2 Journal of Cryptology 2 Computational Complexity 2 Theory of Computing 1 Information Processing Letters 1 Journal of Computer and System Sciences 1 Discrete & Computational Geometry 1 The Kluwer International Series in Engineering and Computer Science
all top 5

#### Fields

 57 Information and communication theory, circuits (94-XX) 34 Computer science (68-XX) 10 Number theory (11-XX) 7 General and overarching topics; collections (00-XX) 7 Convex and discrete geometry (52-XX) 3 Combinatorics (05-XX) 2 Numerical analysis (65-XX) 1 Linear and multilinear algebra; matrix theory (15-XX) 1 Group theory and generalizations (20-XX) 1 Statistics (62-XX) 1 Quantum theory (81-XX) 1 Operations research, mathematical programming (90-XX)

#### Citations contained in zbMATH

54 Publications have been cited 914 times in 537 Documents Cited by Year
Trapdoors for lattices: simpler, tighter, faster, smaller. Zbl 1297.94090
Micciancio, Daniele; Peikert, Chris
2012
Complexity of lattice problems. A cryptographic perspective. Zbl 1140.94010
Micciancio, Daniele; Goldwasser, Shafi
2002
Worst-case to average-case reductions based on Gaussian measures. Zbl 1142.68037
Micciancio, Daniele; Regev, Oded
2007
Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions. Zbl 1287.94085
Micciancio, Daniele; Mol, Petros
2011
Lattice-based cryptography. Zbl 1161.81324
Micciancio, Daniele; Regev, Oded
2009
Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions. Zbl 1038.94552
Bellare, Mihir; Micciancio, Daniele; Warinschi, Bogdan
2003
Generalized compact knapsacks are collision resistant. Zbl 1133.68353
2006
The shortest vector in a lattice is hard to approximate to within some constant. Zbl 0980.68054
Micciancio, Daniele
2001
Generalized compact knapsacks, cyclic lattices, and efficient one-way functions. Zbl 1133.68024
Micciancio, Daniele
2007
A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations. Zbl 1293.68172
Micciancio, Daniele; Voulgaris, Panagiotis
2010
SWIFFT: a modest proposal for FFT hashing. Zbl 1154.68403
Lyubashevsky, Vadim; Micciancio, Daniele; Peikert, Chris; Rosen, Alon
2008
Asymptotically efficient lattice-based digital signatures. Zbl 1162.94389
2008
FHEW: bootstrapping homomorphic encryption in less than a second. Zbl 1370.94509
Ducas, Léo; Micciancio, Daniele
2015
Soundness of formal encryption in the presence of active adversaries. Zbl 1197.94198
Micciancio, Daniele; Warinschi, Bogdan
2004
Perfectly one-way probabilistic hash functions. (Preliminary version). Zbl 1029.68536
Canetti, Ran; Micciancio, Daniele; Reingold, Omer
1998
On bounded distance decoding, unique shortest vectors, and the minimum distance problem. Zbl 1252.94084
2009
Faster exponential time algorithms for the shortest vector problem. Zbl 1288.94076
Micciancio, Daniele; Voulgaris, Panagiotis
2010
Efficient generic forward-secure signatures with an unbounded number of time periods. Zbl 1056.94522
Malkin, Tal; Micciancio, Daniele; Miner, Sara
2002
Hardness of SIS and LWE with small parameters. Zbl 1310.94161
Micciancio, Daniele; Peikert, Chris
2013
Statistical zero-knowledge proofs with efficient provers: lattice problems and more. Zbl 1122.68448
2003
A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations. Zbl 1275.68079
Micciancio, Daniele; Voulgaris, Panagiotis
2013
Hardness of approximating the minimum distance of a linear code. Zbl 1063.68055
Dumer, Ilya; Micciancio, Daniele; Sudan, Madhu
2003
Improving lattice based cryptosystems using the Hermite normal form. Zbl 1006.94529
Micciancio, Daniele
2001
Practical, predictable lattice basis reduction. Zbl 1385.94062
Micciancio, Daniele; Walter, Michael
2016
A linear space algorithm for computing the Hermite normal form. Zbl 1356.68288
Micciancio, Daniele; Warinschi, Bogdan
2001
The complexity of the covering radius problem. Zbl 1085.68063
Guruswami, Venkatesan; Micciancio, Daniele; Regev, Oded
2005
The hardness of the closest vector problem with preprocessing. Zbl 1005.68078
Micciancio, Daniele
2001
Almost perfect lattices, the covering radius problem, and applications to Ajtai’s connection factor. Zbl 1112.68067
Micciancio, Daniele
2004
Efficient reductions among lattice problems. Zbl 1192.68913
Micciancio, Daniele
2008
The provable security of graph-based one-time signatures and extensions to algebraic signature schemes. Zbl 1065.94563
Hevia, Alejandro; Micciancio, Daniele
2002
Approximating shortest lattice vectors is not harder than approximating closest lattice vectors. Zbl 0999.68085
Goldreich, O.; Micciancio, D.; Safra, S.; Seifert, J.-P.
1999
Compactness vs collusion resistance in functional encryption. Zbl 1412.94189
Li, Baiyu; Micciancio, Daniele
2016
Adaptive security of symbolic encryption. Zbl 1079.68555
Micciancio, Daniele; Panjwani, Saurabh
2005
‘Pseudo-random’ number generation within cryptographic algorithms: The DDS case. Zbl 0893.94044
Bellare, Mihir; Goldwasser, Shafi; Micciancio, Daniele
1997
Improved short lattice signatures in the standard model. Zbl 1345.94058
Ducas, Léo; Micciancio, Daniele
2014
On bounded distance decoding for general lattices. Zbl 1155.94409
Liu, Yi-Kai; Lyubashevsky, Vadim; Micciancio, Daniele
2006
Concurrent zero knowledge without complexity assumptions. Zbl 1112.94017
Micciancio, Daniele; Ong, Shien Jin; Sahai, Amit; Vadhan, Salil
2006
Optimal communication complexity of generic multicast key distribution. Zbl 1122.94388
Micciancio, Daniele; Panjwani, Saurabh
2004
The inapproximability of lattice and coding problems with preprocessing. Zbl 1106.68046
Feige, Uriel; Micciancio, Daniele
2004
Oblivious data structures: Applications to cryptography. Zbl 0963.68066
Micciancio, Daniele
1999
Fast lattice point enumeration with minimal overhead. Zbl 1372.68140
Micciancio, Daniele; Walter, Michael
2015
Inapproximability of the shortest vector problem: toward a deterministic reduction. Zbl 1282.68127
Micciancio, Daniele
2012
Simulatable commitments and efficient concurrent zero-knowledge. Zbl 1037.68742
Micciancio, Daniele; Petrank, Erez
2003
An equational approach to secure multi-party computation. Zbl 1362.68080
Micciancio, Daniele; Tessaro, Stefano
2013
Cryptographic functions from worst-case complexity assumptions. Zbl 1191.94098
Micciancio, Daniele
2010
Corrupting one vs. corrupting many: the case of broadcast and multicast encryption. Zbl 1133.94347
Micciancio, Daniele; Panjwani, Saurabh
2006
Equational security proofs of oblivious transfer protocols. Zbl 1439.94040
Li, Baiyu; Micciancio, Daniele
2018
The RSA group is pseudo-free. Zbl 1182.94044
Micciancio, Daniele
2010
Theory of cryptography. 7th theory of cryptography conference, TCC 2010, Zurich, Switzerland, February 9–11, 2010. Proceedings. Zbl 1181.94004
Micciancio, Daniele (ed.)
2010
The RSA group is pseudo-free. Zbl 1137.94352
Micciancio, Daniele
2005
On the hardness of learning with errors with binary secrets. Zbl 1412.68072
Micciancio, Daniele
2018
Faster Gaussian sampling for trapdoor lattices with arbitrary modulus. Zbl 1423.94073
Genise, Nicholas; Micciancio, Daniele
2018
Hevia, Alejandro; Micciancio, Daniele
2005
Improved cryptographic hash functions with worst-case/average-case connection. Zbl 1192.94103
Micciancio, Daniele
2002
Equational security proofs of oblivious transfer protocols. Zbl 1439.94040
Li, Baiyu; Micciancio, Daniele
2018
On the hardness of learning with errors with binary secrets. Zbl 1412.68072
Micciancio, Daniele
2018
Faster Gaussian sampling for trapdoor lattices with arbitrary modulus. Zbl 1423.94073
Genise, Nicholas; Micciancio, Daniele
2018
Practical, predictable lattice basis reduction. Zbl 1385.94062
Micciancio, Daniele; Walter, Michael
2016
Compactness vs collusion resistance in functional encryption. Zbl 1412.94189
Li, Baiyu; Micciancio, Daniele
2016
FHEW: bootstrapping homomorphic encryption in less than a second. Zbl 1370.94509
Ducas, Léo; Micciancio, Daniele
2015
Fast lattice point enumeration with minimal overhead. Zbl 1372.68140
Micciancio, Daniele; Walter, Michael
2015
Improved short lattice signatures in the standard model. Zbl 1345.94058
Ducas, Léo; Micciancio, Daniele
2014
Hardness of SIS and LWE with small parameters. Zbl 1310.94161
Micciancio, Daniele; Peikert, Chris
2013
A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations. Zbl 1275.68079
Micciancio, Daniele; Voulgaris, Panagiotis
2013
An equational approach to secure multi-party computation. Zbl 1362.68080
Micciancio, Daniele; Tessaro, Stefano
2013
Trapdoors for lattices: simpler, tighter, faster, smaller. Zbl 1297.94090
Micciancio, Daniele; Peikert, Chris
2012
Inapproximability of the shortest vector problem: toward a deterministic reduction. Zbl 1282.68127
Micciancio, Daniele
2012
Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions. Zbl 1287.94085
Micciancio, Daniele; Mol, Petros
2011
A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations. Zbl 1293.68172
Micciancio, Daniele; Voulgaris, Panagiotis
2010
Faster exponential time algorithms for the shortest vector problem. Zbl 1288.94076
Micciancio, Daniele; Voulgaris, Panagiotis
2010
Cryptographic functions from worst-case complexity assumptions. Zbl 1191.94098
Micciancio, Daniele
2010
The RSA group is pseudo-free. Zbl 1182.94044
Micciancio, Daniele
2010
Theory of cryptography. 7th theory of cryptography conference, TCC 2010, Zurich, Switzerland, February 9–11, 2010. Proceedings. Zbl 1181.94004
Micciancio, Daniele (ed.)
2010
Lattice-based cryptography. Zbl 1161.81324
Micciancio, Daniele; Regev, Oded
2009
On bounded distance decoding, unique shortest vectors, and the minimum distance problem. Zbl 1252.94084
2009
SWIFFT: a modest proposal for FFT hashing. Zbl 1154.68403
Lyubashevsky, Vadim; Micciancio, Daniele; Peikert, Chris; Rosen, Alon
2008
Asymptotically efficient lattice-based digital signatures. Zbl 1162.94389
2008
Efficient reductions among lattice problems. Zbl 1192.68913
Micciancio, Daniele
2008
Worst-case to average-case reductions based on Gaussian measures. Zbl 1142.68037
Micciancio, Daniele; Regev, Oded
2007
Generalized compact knapsacks, cyclic lattices, and efficient one-way functions. Zbl 1133.68024
Micciancio, Daniele
2007
Generalized compact knapsacks are collision resistant. Zbl 1133.68353
2006
On bounded distance decoding for general lattices. Zbl 1155.94409
Liu, Yi-Kai; Lyubashevsky, Vadim; Micciancio, Daniele
2006
Concurrent zero knowledge without complexity assumptions. Zbl 1112.94017
Micciancio, Daniele; Ong, Shien Jin; Sahai, Amit; Vadhan, Salil
2006
Corrupting one vs. corrupting many: the case of broadcast and multicast encryption. Zbl 1133.94347
Micciancio, Daniele; Panjwani, Saurabh
2006
The complexity of the covering radius problem. Zbl 1085.68063
Guruswami, Venkatesan; Micciancio, Daniele; Regev, Oded
2005
Adaptive security of symbolic encryption. Zbl 1079.68555
Micciancio, Daniele; Panjwani, Saurabh
2005
The RSA group is pseudo-free. Zbl 1137.94352
Micciancio, Daniele
2005
Hevia, Alejandro; Micciancio, Daniele
2005
Soundness of formal encryption in the presence of active adversaries. Zbl 1197.94198
Micciancio, Daniele; Warinschi, Bogdan
2004
Almost perfect lattices, the covering radius problem, and applications to Ajtai’s connection factor. Zbl 1112.68067
Micciancio, Daniele
2004
Optimal communication complexity of generic multicast key distribution. Zbl 1122.94388
Micciancio, Daniele; Panjwani, Saurabh
2004
The inapproximability of lattice and coding problems with preprocessing. Zbl 1106.68046
Feige, Uriel; Micciancio, Daniele
2004
Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions. Zbl 1038.94552
Bellare, Mihir; Micciancio, Daniele; Warinschi, Bogdan
2003
Statistical zero-knowledge proofs with efficient provers: lattice problems and more. Zbl 1122.68448
2003
Hardness of approximating the minimum distance of a linear code. Zbl 1063.68055
Dumer, Ilya; Micciancio, Daniele; Sudan, Madhu
2003
Simulatable commitments and efficient concurrent zero-knowledge. Zbl 1037.68742
Micciancio, Daniele; Petrank, Erez
2003
Complexity of lattice problems. A cryptographic perspective. Zbl 1140.94010
Micciancio, Daniele; Goldwasser, Shafi
2002
Efficient generic forward-secure signatures with an unbounded number of time periods. Zbl 1056.94522
Malkin, Tal; Micciancio, Daniele; Miner, Sara
2002
The provable security of graph-based one-time signatures and extensions to algebraic signature schemes. Zbl 1065.94563
Hevia, Alejandro; Micciancio, Daniele
2002
Improved cryptographic hash functions with worst-case/average-case connection. Zbl 1192.94103
Micciancio, Daniele
2002
The shortest vector in a lattice is hard to approximate to within some constant. Zbl 0980.68054
Micciancio, Daniele
2001
Improving lattice based cryptosystems using the Hermite normal form. Zbl 1006.94529
Micciancio, Daniele
2001
A linear space algorithm for computing the Hermite normal form. Zbl 1356.68288
Micciancio, Daniele; Warinschi, Bogdan
2001
The hardness of the closest vector problem with preprocessing. Zbl 1005.68078
Micciancio, Daniele
2001
Approximating shortest lattice vectors is not harder than approximating closest lattice vectors. Zbl 0999.68085
Goldreich, O.; Micciancio, D.; Safra, S.; Seifert, J.-P.
1999
Oblivious data structures: Applications to cryptography. Zbl 0963.68066
Micciancio, Daniele
1999
Perfectly one-way probabilistic hash functions. (Preliminary version). Zbl 1029.68536
Canetti, Ran; Micciancio, Daniele; Reingold, Omer
1998
‘Pseudo-random’ number generation within cryptographic algorithms: The DDS case. Zbl 0893.94044
Bellare, Mihir; Goldwasser, Shafi; Micciancio, Daniele
1997
all top 5

#### Cited by 1,001 Authors

 13 Futa, Yuichi 13 Shidama, Yasunari 8 Brakerski, Zvika 8 Canetti, Ran 8 Okazaki, Hiroyuki 8 Stehlé, Damien 8 Vaikuntanathan, Vinod 8 Wang, Huaxiong 8 Yasuda, Masaya 7 Libert, Benoît 7 Ling, San 7 Lyubashevsky, Vadim 7 Micciancio, Daniele 7 Nguyen, Khoa 7 Peikert, Chris 6 Bellare, Mihir 6 Bitansky, Nir 6 Buchmann, Johannes A. 6 Costa, Sueli Irene Rodrigues 6 Hu, Yupu 6 Regev, Oded 6 Waters, Brent 5 Cheng, Xiangguo 5 Fouque, Pierre-Alain 5 Fukshansky, Lenny 5 Gutierrez, Jaime 5 Hao, Rong 5 Herold, Gottfried 5 Ishai, Yuval 5 Kapron, Bruce M. 5 Kong, Fanyu 5 Lee, Moon Sung 5 Lepoint, Tancrède 5 Lindner, Richard 5 Ma, Chunguang 5 Rothblum, Guy N. 5 Sahai, Amit 5 Steinfeld, Ron 5 Susilo, Willy 5 Yu, Jia 4 Albrecht, Martin R. 4 Boneh, Dan 4 Chandrasekaran, Karthekeyan 4 Fuchsbauer, Georg 4 Grigorescu, Elena 4 Haviv, Ishay 4 Hofheinz, Dennis 4 Khot, Subhash Ajit 4 Kiltz, Eike 4 Kirshanova, Elena 4 Koshiba, Takeshi 4 Liu, Mingjie 4 Mouhartem, Fabrice 4 Nishimaki, Ryo 4 Pointcheval, David 4 Rosen, Alon 4 Rückert, Markus 4 Schneider, Michael 4 Shparlinski, Igor E. 4 Wang, Baocang 4 Xagawa, Keita 4 Xu, Guangwu 3 Abdalla, Michel 3 Abe, Masayuki 3 Aggarwal, Divesh 3 Ananth, Prabhanjan Vijendra 3 Backes, Michael 3 Bai, Shi 3 Biasse, Jean-François 3 Blazy, Olivier 3 Boyen, Xavier 3 Camenisch, Jan L. 3 Chen, Hao 3 Chen, Kefei 3 Chen, Yilei 3 Cortier, Véronique 3 Dadush, Daniel 3 Gaborit, Philippe 3 Galbraith, Steven D. 3 Gama, Nicolas 3 Gandikota, Venkata 3 Garcia, Stephan Ramon 3 Goldwasser, Shafi 3 Groth, Jens 3 Guo, Siyao 3 Ibeas, Álvar 3 Katsumata, Shuichi 3 Kirchner, Paul 3 Kogure, Jun 3 Koppula, Venkata 3 Lei, Hao 3 Li, Guowen 3 Li, Jiamei 3 Masny, Daniel 3 May, Alexander 3 Neven, Gregory 3 Ostrovsky, Rafail 3 Pietrzak, Krzysztof 3 Plantard, Thomas 3 Poulakis, Dimitrios ...and 901 more Authors
all top 5

#### Cited in 85 Serials

 45 Journal of Cryptology 35 Designs, Codes and Cryptography 31 Theoretical Computer Science 16 Information Sciences 13 Formalized Mathematics 9 Information Processing Letters 9 Journal of Mathematical Cryptology 7 Journal of Symbolic Computation 7 SIAM Journal on Discrete Mathematics 6 Journal of Computer and System Sciences 6 Algorithmica 5 Discrete Applied Mathematics 5 Journal of Number Theory 5 SIAM Journal on Computing 5 Information and Computation 5 Applicable Algebra in Engineering, Communication and Computing 4 Mathematics of Computation 4 Groups, Complexity, Cryptology 4 Theory of Computing 4 SIAM Journal on Applied Algebra and Geometry 3 Discrete Mathematics 3 Computing 3 Discrete & Computational Geometry 3 International Journal of Foundations of Computer Science 3 Linear Algebra and its Applications 3 Mathematical Programming. Series A. Series B 3 Computational Complexity 3 Mathematical Problems in Engineering 3 Theory of Computing Systems 3 Journal of Combinatorial Optimization 3 LMS Journal of Computation and Mathematics 3 Frontiers of Computer Science 2 Computers & Mathematics with Applications 2 Applied Mathematics and Computation 2 Journal of Algebra 2 Chinese Annals of Mathematics. Series B 2 Journal of Automated Reasoning 2 Journal of Global Optimization 2 Experimental Mathematics 2 Finite Fields and their Applications 2 Advances in Mathematics of Communications 2 Algorithms 2 Science China. Information Sciences 2 Symmetry 1 Bulletin of the Australian Mathematical Society 1 Journal of Mathematical Physics 1 Problems of Information Transmission 1 Reviews of Modern Physics 1 Beiträge zur Algebra und Geometrie 1 Journal of Pure and Applied Algebra 1 Mathematische Annalen 1 Proceedings of the American Mathematical Society 1 Synthese 1 Transactions of the American Mathematical Society 1 Operations Research Letters 1 Japan Journal of Industrial and Applied Mathematics 1 Discrete Event Dynamic Systems 1 European Journal of Operational Research 1 International Journal of Computer Mathematics 1 Bulletin of the American Mathematical Society. New Series 1 Distributed Computing 1 SIAM Journal on Optimization 1 Computational and Applied Mathematics 1 Soft Computing 1 Wuhan University Journal of Natural Sciences (WUJNS) 1 The Journal of Logic and Algebraic Programming 1 Foundations of Computational Mathematics 1 Journal of Systems Science and Complexity 1 Journal of Applied Mathematics 1 Quantum Information Processing 1 Journal of Algebra and its Applications 1 Discrete Optimization 1 Journal of Shanghai Jiaotong University (Science) 1 International Journal of Number Theory 1 Mathematics in Computer Science 1 Frontiers of Mathematics in China 1 Journal of Topology and Analysis 1 Cryptography and Communications 1 $$p$$-Adic Numbers, Ultrametric Analysis, and Applications 1 RAIRO. Theoretical Informatics and Applications 1 Quanta 1 ACM Transactions on Computation Theory 1 Pacific Journal of Mathematics for Industry 1 Open Mathematics 1 Journal of Algebra, Combinatorics, Discrete Structures and Applications
all top 5

#### Cited in 27 Fields

 386 Information and communication theory, circuits (94-XX) 169 Computer science (68-XX) 100 Number theory (11-XX) 25 Convex and discrete geometry (52-XX) 23 Operations research, mathematical programming (90-XX) 22 Quantum theory (81-XX) 21 Combinatorics (05-XX) 17 Commutative algebra (13-XX) 15 Linear and multilinear algebra; matrix theory (15-XX) 13 Mathematical logic and foundations (03-XX) 11 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 8 Group theory and generalizations (20-XX) 7 Algebraic geometry (14-XX) 6 Statistics (62-XX) 5 Order, lattices, ordered algebraic structures (06-XX) 4 Probability theory and stochastic processes (60-XX) 3 Functional analysis (46-XX) 3 Systems theory; control (93-XX) 2 General topology (54-XX) 2 Numerical analysis (65-XX) 2 Biology and other natural sciences (92-XX) 1 General and overarching topics; collections (00-XX) 1 Field theory and polynomials (12-XX) 1 Measure and integration (28-XX) 1 Approximations and expansions (41-XX) 1 Harmonic analysis on Euclidean spaces (42-XX) 1 Statistical mechanics, structure of matter (82-XX)