Daniele Micciancio

	2012
89		Daniele Micciancio, Chris Peikert: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller. EUROCRYPT 2012: 700-718
88		Daniele Micciancio: Inapproximability of the Shortest Vector Problem: Toward a Deterministic Reduction. Electronic Colloquium on Computational Complexity (ECCC) 19: 20 (2012)
	2011
87		Daniele Micciancio, Petros Mol: Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions. CRYPTO 2011: 465-484
86		Daniele Micciancio: The Geometry of Lattice Cryptography. FOSAD 2011: 185-210
85		Daniele Micciancio: Shortest Vector Problem. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1196-1197
84		Daniele Micciancio: Closest Vector Problem. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 212-214
83		Daniele Micciancio: Lattice-Based Cryptography. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 713-715
82		Daniele Micciancio, Chris Peikert: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller. IACR Cryptology ePrint Archive 2011: 501 (2011)
81		Daniele Micciancio, Petros Mol: Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions. IACR Cryptology ePrint Archive 2011: 521 (2011)
	2010
80		Daniele Micciancio: Theory of Cryptography, 7th Theory of Cryptography Conference, TCC 2010, Zurich, Switzerland, February 9-11, 2010. Proceedings Springer 2010
79		Daniele Micciancio: Computational Soundness, Co-induction, and Encryption Cycles. EUROCRYPT 2010: 362-380
78		Daniele Micciancio, Panagiotis Voulgaris: Faster Exponential Time Algorithms for the Shortest Vector Problem. SODA 2010: 1468-1480
77		Daniele Micciancio, Panagiotis Voulgaris: A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations. STOC 2010: 351-358
76		Daniele Micciancio: A first glimpse of cryptography's Holy Grail. Commun. ACM 53(3): 96 (2010)
75		Daniele Micciancio, Panagiotis Voulgaris: A Deterministic Single Exponential Time Algorithm for Most Lattice Problems based on Voronoi Cell Computations. Electronic Colloquium on Computational Complexity (ECCC) 17: 14 (2010)
74		Daniele Micciancio: The RSA Group is Pseudo-Free. J. Cryptology 23(2): 169-186 (2010)
	2009
73		Vadim Lyubashevsky, Daniele Micciancio: On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem. CRYPTO 2009: 577-594
72		Panagiotis Voulgaris, Daniele Micciancio: Faster exponential time algorithms for the shortest vector problem. Electronic Colloquium on Computational Complexity (ECCC) 16: 65 (2009)
71		Daniele Micciancio: Computational soundness, co-induction, and encryption cycles. IACR Cryptology ePrint Archive 2009: 227 (2009)
70		Daniele Micciancio: Pseudo-randomness and partial information in symbolic security analysis. IACR Cryptology ePrint Archive 2009: 249 (2009)
	2008
69		Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen: SWIFFT: A Modest Proposal for FFT Hashing. FSE 2008: 54-72
68		Daniele Micciancio, Antonio Nicolosi: Efficient bounded distance decoders for Barnes-Wall lattices. ISIT 2008: 2484-2488
67		Alejandro Hevia, Daniele Micciancio: An Indistinguishability-Based Characterization of Anonymous Channels. Privacy Enhancing Technologies 2008: 24-43
66		Daniele Micciancio: Efficient reductions among lattice problems. SODA 2008: 84-93
65		Vadim Lyubashevsky, Daniele Micciancio: Asymptotically Efficient Lattice-Based Digital Signatures. TCC 2008: 37-54
64		Daniele Micciancio, Scott Yilek: The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization. TCC 2008: 535-552
63		Daniele Micciancio: Shortest Vector Problem. Encyclopedia of Algorithms 2008
62		Daniele Micciancio, Saurabh Panjwani: Optimal communication complexity of generic multicast key distribution. IEEE/ACM Trans. Netw. 16(4): 803-813 (2008)
	2007
61		Daniele Micciancio: Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions. Computational Complexity 16(4): 365-411 (2007)
60		Daniele Micciancio, Oded Regev: Worst-Case to Average-Case Reductions Based on Gaussian Measures. SIAM J. Comput. 37(1): 267-302 (2007)
	2006
59		Yi-Kai Liu, Vadim Lyubashevsky, Daniele Micciancio: On Bounded Distance Decoding for General Lattices. APPROX-RANDOM 2006: 450-461
58		Vadim Lyubashevsky, Daniele Micciancio: Generalized Compact Knapsacks Are Collision Resistant. ICALP (2) 2006: 144-155
57		Daniele Micciancio, Saurabh Panjwani: Corrupting One vs. Corrupting Many: The Case of Broadcast and Multicast Encryption. ICALP (2) 2006: 70-82
56		Daniele Micciancio, Shien Jin Ong, Amit Sahai, Salil P. Vadhan: Concurrent Zero Knowledge Without Complexity Assumptions. TCC 2006: 1-20
55		Chandra Chekuri, Daniele Micciancio: Special Issue: FOCS 2003. J. Comput. Syst. Sci. 72(2): 205 (2006)
	2005
54		Daniele Micciancio: The RSA Group is Pseudo-Free. EUROCRYPT 2005: 387-403
53		Alejandro Hevia, Daniele Micciancio: Simultaneous broadcast revisited. PODC 2005: 324-333
52		Daniele Micciancio, Saurabh Panjwani: Adaptive Security of Symbolic Encryption. TCC 2005: 169-187
51		Daniele Micciancio: Closest Vector Problem. Encyclopedia of Cryptography and Security 2005
50		Daniele Micciancio: Lattice Based Cryptography. Encyclopedia of Cryptography and Security 2005
49		Daniele Micciancio: Shortest Vector Problem. Encyclopedia of Cryptography and Security 2005
48		Venkatesan Guruswami, Daniele Micciancio, Oded Regev: The complexity of the covering radius problem. Computational Complexity 14(2): 90-121 (2005)
47		Daniele Micciancio, Shien Jin Ong, Amit Sahai, Salil P. Vadhan: Concurrent Zero Knowledge without Complexity Assumptions Electronic Colloquium on Computational Complexity (ECCC)(093): (2005)
46		Vadim Lyubashevsky, Daniele Micciancio: Generalized Compact Knapsacks are Collision Resistant Electronic Colloquium on Computational Complexity (ECCC)(142): (2005)
45		Daniele Micciancio, Shien Jin Ong, Amit Sahai, Salil P. Vadhan: Concurrent Zero Knowledge without Complexity Assumptions. IACR Cryptology ePrint Archive 2005: 286 (2005)
	2004
44		Daniele Micciancio, Saurabh Panjwani: Optimal Communication Complexity of Generic Multicast Key Distribution. EUROCRYPT 2004: 153-170
43		Daniele Micciancio, Oded Regev: Worst-Case to Average-Case Reductions Based on Gaussian Measures. FOCS 2004: 372-381
42		Venkatesan Guruswami, Daniele Micciancio, Oded Regev: The Complexity of the Covering Radius Problem on Lattices and Codes. IEEE Conference on Computational Complexity 2004: 161-173
41		Daniele Micciancio, Bogdan Warinschi: Soundness of Formal Encryption in the Presence of Active Adversaries. TCC 2004: 133-151
40		Daniele Micciancio: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions Electronic Colloquium on Computational Complexity (ECCC)(095): (2004)
39		Daniele Micciancio: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions. IACR Cryptology ePrint Archive 2004: 286 (2004)
38		Uriel Feige, Daniele Micciancio: The inapproximability of lattice and coding problems with preprocessing. J. Comput. Syst. Sci. 69(1): 45-67 (2004)
37		Daniele Micciancio, Bogdan Warinschi: Completeness Theorems for the Abadi-Rogaway Language of Encrypted Expressions. Journal of Computer Security 12(1): 99-130 (2004)
36		Daniele Micciancio: Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor. SIAM J. Comput. 34(1): 118-169 (2004)
	2003
35		Daniele Micciancio, Salil P. Vadhan: Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More. CRYPTO 2003: 282-298
34		Daniele Micciancio, Erez Petrank: Simulatable Commitments and Efficient Concurrent Zero-Knowledge. EUROCRYPT 2003: 140-159
33		Mihir Bellare, Daniele Micciancio, Bogdan Warinschi: Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions. EUROCRYPT 2003: 614-629
32		Daniele Micciancio: A Note on the Minimal Volume of Almost Cubic Parallelepipeds. Discrete & Computational Geometry 29(1): 133-138 (2003)
31		Daniele Micciancio: Almost perfect lattices, the covering radius problem, and applications to Ajtai's connection factor Electronic Colloquium on Computational Complexity (ECCC)(066): (2003)
30		Ilya Dumer, Daniele Micciancio, Madhu Sudan: Hardness of approximating the minimum distance of a linear code. IEEE Transactions on Information Theory 49(1): 22-37 (2003)
	2002
29		Alejandro Hevia, Daniele Micciancio: The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes. ASIACRYPT 2002: 379-396
28		Rosario Gennaro, Daniele Micciancio: Cryptanalysis of a Pseudorandom Generator Based on Braid Groups. EUROCRYPT 2002: 1-13
27		Tal Malkin, Daniele Micciancio, Sara K. Miner: Efficient Generic Forward-Secure Signatures with an Unbounded Number Of Time Periods. EUROCRYPT 2002: 400-417
26		Daniele Micciancio: Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions from Worst-Case Complexity Assumptions. FOCS 2002: 356-365
25		Uriel Feige, Daniele Micciancio: The Inapproximability of Lattice and Coding Problems with Preprocessing. IEEE Conference on Computational Complexity 2002: 44-52
24		Daniele Micciancio: Improved Cryptographic Hash Functions with Worst-Case/Average-Case Connection. IEEE Conference on Computational Complexity 2002: 9
23		Daniele Micciancio: Improved cryptographic hash functions with worst-case/average-case connection. STOC 2002: 609-618
22		Daniele Micciancio, Erez Petrank: Efficient and Concurrent Zero-Knowledge from any public coin HVZK protocol Electronic Colloquium on Computational Complexity (ECCC)(045): (2002)
21		Daniele Micciancio, Erez Petrank: Efficient and Concurrent Zero-Knowledge from any public coin HVZK protocol. IACR Cryptology ePrint Archive 2002: 90 (2002)
	2001
20		Daniele Micciancio: Improving Lattice Based Cryptosystems Using the Hermite Normal Form. CaLC 2001: 126-145
19		Daniele Micciancio, Bogdan Warinschi: A linear space algorithm for computing the herite normal form. ISSAC 2001: 231-236
18		Tal Malkin, Daniele Micciancio, Sara Miner More: Composition and Efficiency Tradeoffs for Forward-Secure Digital Signatures. IACR Cryptology ePrint Archive 2001: 34 (2001)
17		Daniele Micciancio: The hardness of the closest vector problem with preprocessing. IEEE Transactions on Information Theory 47(3): 1212-1215 (2001)
	2000
16		Daniele Micciancio, Bogdan Warinschi: A Linear Space Algorithm for Computing the Hermite Normal Form Electronic Colloquium on Computational Complexity (ECCC) 7(74): (2000)
15		Daniele Micciancio: The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant. SIAM J. Comput. 30(6): 2008-2035 (2000)
	1999
14		Ilya Dumer, Daniele Micciancio, Madhu Sudan: Hardness of Approximating the Minimum Distance of a Linear Code. FOCS 1999: 475-485
13		Ran Canetti, Juan A. Garay, Gene Itkis, Daniele Micciancio, Moni Naor, Benny Pinkas: Multicast Security: A Taxonomy and Some Efficient Constructions. INFOCOM 1999: 708-716
12		Oded Goldreich, Daniele Micciancio, Shmuel Safra, Jean-Pierre Seifert: Approximating Shortest Lattice Vectors is Not Harder Than Approximating Closest Lattice Vectors. Electronic Colloquium on Computational Complexity (ECCC) 6(2): (1999)
11		Ilya Dumer, Daniele Micciancio, Madhu Sudan: Hardness of Approximating the Minimum Distance of a Linear Code Electronic Colloquium on Computational Complexity (ECCC) 6(29): (1999)
10		Oded Goldreich, Daniele Micciancio, Shmuel Safra, Jean-Pierre Seifert: Approximating Shortest Lattice Vectors is not Harder than Approximating Closest Lattice Vectors. Inf. Process. Lett. 71(2): 55-61 (1999)
	1998
9		Rosario Gennaro, Daniele Micciancio, Tal Rabin: An Efficient Non-Interactive Statistical Zero-Knowledge Proof System for Quasi-Safe Prime Products. ACM Conference on Computer and Communications Security 1998: 67-72
8		Daniele Micciancio: The Shortest Vector in a Lattice is Hard to Approximate to Within Some Constant. FOCS 1998: 92-98
7		Ran Canetti, Daniele Micciancio, Omer Reingold: Perfectly One-Way Probabilistic Hash Functions (Preliminary Version). STOC 1998: 131-140
6		Daniele Micciancio: The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant. Electronic Colloquium on Computational Complexity (ECCC) 5(16): (1998)
	1997
5		Mihir Bellare, Shafi Goldwasser, Daniele Micciancio: "Pseudo-Random" Number Generation Within Cryptographic Algorithms: The DDS Case. CRYPTO 1997: 277-291
4		Mihir Bellare, Daniele Micciancio: A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost. EUROCRYPT 1997: 163-192
3		Daniele Micciancio: Oblivious Data Structures: Applications to Cryptography. STOC 1997: 456-464
2		Sabrina Mantaci, Daniele Micciancio: An Algorithm for the Solution of Tree Equations. TAPSOFT 1997: 417-428
	1995
1		Giorgio Levi, Daniele Micciancio: Analysis of Pure PROLOG Programs. GULP-PRODE 1995: 521-532

Coauthor Index

1	Mihir Bellare	[4] [5] [33]
2	Ran Canetti	[7] [13]
3	Chandra Chekuri	[55]
4	Ilya Dumer	[11] [14] [30]
5	Uriel Feige	[25] [38]
6	Juan A. Garay	[13]
7	Rosario Gennaro	[9] [28]
8	Oded Goldreich	[10] [12]
9	Shafi Goldwasser	[5]
10	Venkatesan Guruswami	[42] [48]
11	Alejandro Hevia	[29] [53] [67]
12	Gene Itkis	[13]
13	Giorgio Levi	[1]
14	Yi-Kai Liu	[59]
15	Vadim Lyubashevsky	[46] [58] [59] [65] [69] [73]
16	Tal Malkin	[18] [27]
17	Sabrina Mantaci	[2]
18	Petros Mol	[81] [87]
19	Sara Miner More (Sara K. Miner)	[18] [27]
20	Moni Naor	[13]
21	Antonio Nicolosi	[68]
22	Shien Jin Ong	[45] [47] [56]
23	Saurabh Panjwani	[44] [52] [57] [62]
24	Chris Peikert	[69] [82] [89]
25	Erez Petrank	[21] [22] [34]
26	Benny Pinkas	[13]
27	Tal Rabin	[9]
28	Oded Regev	[42] [43] [48] [60]
29	Omer Reingold	[7]
30	Alon Rosen	[69]
31	Shmuel Safra (Muli Safra)	[10] [12]
32	Amit Sahai	[45] [47] [56]
33	Jean-Pierre Seifert	[10] [12]
34	Madhu Sudan	[11] [14] [30]
35	Salil P. Vadhan	[35] [45] [47] [56]
36	Panagiotis Voulgaris	[72] [75] [77] [78]
37	Bogdan Warinschi	[16] [19] [33] [37] [41]
38	Scott Yilek	[64]

Colors in the list of coauthors

Last update Mon Jun 4 20:40:43 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page