| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Daniele Micciancio |
Inapproximability of the Shortest Vector Problem: Toward a Deterministic Reduction.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Daniele Micciancio, Chris Peikert |
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller. |
EUROCRYPT |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio, Petros Mol |
Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions. |
IACR Cryptology ePrint Archive |
2011 |
DBLP BibTeX RDF |
|
| 1 | Daniele Micciancio, Chris Peikert |
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller. |
IACR Cryptology ePrint Archive |
2011 |
DBLP BibTeX RDF |
|
| 1 | Daniele Micciancio |
Shortest Vector Problem. |
Encyclopedia of Cryptography and Security (2nd Ed.) |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio |
Lattice-Based Cryptography. |
Encyclopedia of Cryptography and Security (2nd Ed.) |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio |
Closest Vector Problem. |
Encyclopedia of Cryptography and Security (2nd Ed.) |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio |
The Geometry of Lattice Cryptography. |
FOSAD |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio, Petros Mol |
Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions. |
CRYPTO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Daniele Micciancio |
A first glimpse of cryptography's Holy Grail. |
Commun. ACM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio |
The RSA Group is Pseudo-Free. |
J. Cryptology |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio, Panagiotis Voulgaris |
Faster Exponential Time Algorithms for the Shortest Vector Problem. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Daniele Micciancio |
Computational Soundness, Co-induction, and Encryption Cycles. |
EUROCRYPT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio (eds.) |
Theory of Cryptography, 7th Theory of Cryptography Conference, TCC 2010, Zurich, Switzerland, February 9-11, 2010. Proceedings |
TCC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio, Panagiotis Voulgaris |
A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Panagiotis Voulgaris, Daniele Micciancio |
Faster exponential time algorithms for the shortest vector problem. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Daniele Micciancio |
Computational soundness, co-induction, and encryption cycles. |
IACR Cryptology ePrint Archive |
2009 |
DBLP BibTeX RDF |
|
| 1 | Daniele Micciancio |
Pseudo-randomness and partial information in symbolic security analysis. |
IACR Cryptology ePrint Archive |
2009 |
DBLP BibTeX RDF |
|
| 1 | Vadim Lyubashevsky, Daniele Micciancio |
On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem. |
CRYPTO |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio, Saurabh Panjwani |
Optimal communication complexity of generic multicast key distribution. |
IEEE/ACM Trans. Netw. |
2008 |
DBLP DOI BibTeX RDF |
nested encryption, security, multicast, lower bounds, secret sharing, key distribution |
| 1 | Daniele Micciancio |
Shortest Vector Problem. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio |
Efficient reductions among lattice problems. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen |
SWIFFT: A Modest Proposal for FFT Hashing. |
FSE |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio, Antonio Nicolosi |
Efficient bounded distance decoders for Barnes-Wall lattices. |
ISIT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio, Scott Yilek |
The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization. |
TCC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim Lyubashevsky, Daniele Micciancio |
Asymptotically Efficient Lattice-Based Digital Signatures. |
TCC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Alejandro Hevia, Daniele Micciancio |
An Indistinguishability-Based Characterization of Anonymous Channels. |
Privacy Enhancing Technologies |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio |
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions. |
Computational Complexity |
2007 |
DBLP DOI BibTeX RDF |
11H06, Subject classification. 68Q17, 94B15 |
| 1 | Daniele Micciancio, Oded Regev |
Worst-Case to Average-Case Reductions Based on Gaussian Measures. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Chekuri, Daniele Micciancio |
Special Issue: FOCS 2003. |
J. Comput. Syst. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio, Saurabh Panjwani |
Corrupting One vs. Corrupting Many: The Case of Broadcast and Multicast Encryption. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim Lyubashevsky, Daniele Micciancio |
Generalized Compact Knapsacks Are Collision Resistant. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio, Shien Jin Ong, Amit Sahai, Salil P. Vadhan |
Concurrent Zero Knowledge Without Complexity Assumptions. |
TCC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Yi-Kai Liu, Vadim Lyubashevsky, Daniele Micciancio |
On Bounded Distance Decoding for General Lattices. |
APPROX-RANDOM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim Lyubashevsky, Daniele Micciancio |
Generalized Compact Knapsacks are Collision Resistant |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Daniele Micciancio, Shien Jin Ong, Amit Sahai, Salil P. Vadhan |
Concurrent Zero Knowledge without Complexity Assumptions |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Daniele Micciancio, Shien Jin Ong, Amit Sahai, Salil P. Vadhan |
Concurrent Zero Knowledge without Complexity Assumptions. |
IACR Cryptology ePrint Archive |
2005 |
DBLP BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Daniele Micciancio, Oded Regev |
The complexity of the covering radius problem. |
Computational Complexity |
2005 |
DBLP DOI BibTeX RDF |
11H06, 11H31, 68Q25, 94B05, Subject classification. 68Q17 |
| 1 | Daniele Micciancio |
Shortest Vector Problem. |
Encyclopedia of Cryptography and Security |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio |
Lattice Based Cryptography. |
Encyclopedia of Cryptography and Security |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio |
Closest Vector Problem. |
Encyclopedia of Cryptography and Security |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Alejandro Hevia, Daniele Micciancio |
Simultaneous broadcast revisited. |
PODC |
2005 |
DBLP DOI BibTeX RDF |
parallel broadcast, independence, secure function evaluation |
| 1 | Daniele Micciancio |
The RSA Group is Pseudo-Free. |
EUROCRYPT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio, Saurabh Panjwani |
Adaptive Security of Symbolic Encryption. |
TCC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio, Bogdan Warinschi |
Completeness Theorems for the Abadi-Rogaway Language of Encrypted Expressions. |
Journal of Computer Security |
2004 |
DBLP BibTeX RDF |
|
| 1 | Daniele Micciancio |
Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Daniele Micciancio |
Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions. |
IACR Cryptology ePrint Archive |
2004 |
DBLP BibTeX RDF |
|
| 1 | Uriel Feige, Daniele Micciancio |
The inapproximability of lattice and coding problems with preprocessing. |
J. Comput. Syst. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio |
Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio, Saurabh Panjwani |
Optimal Communication Complexity of Generic Multicast Key Distribution. |
EUROCRYPT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio, Bogdan Warinschi |
Soundness of Formal Encryption in the Presence of Active Adversaries. |
TCC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio, Oded Regev |
Worst-Case to Average-Case Reductions Based on Gaussian Measures. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Daniele Micciancio, Oded Regev |
The Complexity of the Covering Radius Problem on Lattices and Codes. |
IEEE Conference on Computational Complexity |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio |
Almost perfect lattices, the covering radius problem, and applications to Ajtai's connection factor |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Daniele Micciancio |
A Note on the Minimal Volume of Almost Cubic Parallelepipeds. |
Discrete & Computational Geometry |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilya Dumer, Daniele Micciancio, Madhu Sudan |
Hardness of approximating the minimum distance of a linear code. |
IEEE Transactions on Information Theory |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio, Erez Petrank |
Simulatable Commitments and Efficient Concurrent Zero-Knowledge. |
EUROCRYPT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Mihir Bellare, Daniele Micciancio, Bogdan Warinschi |
Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions. |
EUROCRYPT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio, Salil P. Vadhan |
Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More. |
CRYPTO |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio, Erez Petrank |
Efficient and Concurrent Zero-Knowledge from any public coin HVZK protocol |
Electronic Colloquium on Computational Complexity (ECCC) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Daniele Micciancio, Erez Petrank |
Efficient and Concurrent Zero-Knowledge from any public coin HVZK protocol. |
IACR Cryptology ePrint Archive |
2002 |
DBLP BibTeX RDF |
|
| 1 | Alejandro Hevia, Daniele Micciancio |
The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes. |
ASIACRYPT |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Tal Malkin, Daniele Micciancio, Sara K. Miner |
Efficient Generic Forward-Secure Signatures with an Unbounded Number Of Time Periods. |
EUROCRYPT |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Rosario Gennaro, Daniele Micciancio |
Cryptanalysis of a Pseudorandom Generator Based on Braid Groups. |
EUROCRYPT |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio |
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions from Worst-Case Complexity Assumptions. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
cyclic lattices, worst-case average-case connection, Knapsack problem, one-way functions |
| 1 | Daniele Micciancio |
Improved Cryptographic Hash Functions with Worst-Case/Average-Case Connection. (PDF / PS) |
IEEE Conference on Computational Complexity |
2002 |
DBLP DOI BibTeX RDF |
worst-case/average-case connection, computational complexity, cryptography, hash functions, lattices |
| 1 | Uriel Feige, Daniele Micciancio |
The Inapproximability of Lattice and Coding Problems with Preprocessing. (PDF / PS) |
IEEE Conference on Computational Complexity |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio |
Improved cryptographic hash functions with worst-case/average-case connection. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Tal Malkin, Daniele Micciancio, Sara Miner More |
Composition and Efficiency Tradeoffs for Forward-Secure Digital Signatures. |
IACR Cryptology ePrint Archive |
2001 |
DBLP BibTeX RDF |
|
| 1 | Daniele Micciancio |
The hardness of the closest vector problem with preprocessing. |
IEEE Transactions on Information Theory |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio |
Improving Lattice Based Cryptosystems Using the Hermite Normal Form. |
CaLC |
2001 |
DBLP DOI BibTeX RDF |
Lattices, public-key encryption, trapdoor functions |
| 1 | Daniele Micciancio, Bogdan Warinschi |
A linear space algorithm for computing the herite normal form. |
ISSAC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio, Bogdan Warinschi |
A Linear Space Algorithm for Computing the Hermite Normal Form |
Electronic Colloquium on Computational Complexity (ECCC) |
2000 |
DBLP BibTeX RDF |
|
| 1 | Daniele Micciancio |
The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant. |
SIAM J. Comput. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Daniele Micciancio, Shmuel Safra, Jean-Pierre Seifert |
Approximating Shortest Lattice Vectors is not Harder than Approximating Closest Lattice Vectors. |
Inf. Process. Lett. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilya Dumer, Daniele Micciancio, Madhu Sudan |
Hardness of Approximating the Minimum Distance of a Linear Code |
Electronic Colloquium on Computational Complexity (ECCC) |
1999 |
DBLP BibTeX RDF |
|
| 1 | 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) |
1999 |
DBLP BibTeX RDF |
|
| 1 | Ran Canetti, Juan A. Garay, Gene Itkis, Daniele Micciancio, Moni Naor, Benny Pinkas |
Multicast Security: A Taxonomy and Some Efficient Constructions. |
INFOCOM |
1999 |
DBLP BibTeX RDF |
|
| 1 | Ilya Dumer, Daniele Micciancio, Madhu Sudan |
Hardness of Approximating the Minimum Distance of a Linear Code. |
FOCS |
1999 |
DBLP DOI BibTeX RDF |
minimum distance problem, computational complexity, hardness of approximation, linear codes |
| 1 | Daniele Micciancio |
The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant. |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Daniele Micciancio |
The Shortest Vector in a Lattice is Hard to Approximate to Within Some Constant. |
FOCS |
1998 |
DBLP DOI BibTeX RDF |
non-approximability, Sauer's lemma, lattices, shortest vector problem |
| 1 | Ran Canetti, Daniele Micciancio, Omer Reingold |
Perfectly One-Way Probabilistic Hash Functions (Preliminary Version). |
STOC |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Sabrina Mantaci, Daniele Micciancio |
An Algorithm for the Solution of Tree Equations. |
TAPSOFT |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Mihir Bellare, Daniele Micciancio |
A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost. |
EUROCRYPT |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Mihir Bellare, Shafi Goldwasser, Daniele Micciancio |
"Pseudo-Random" Number Generation Within Cryptographic Algorithms: The DDS Case. |
CRYPTO |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio |
Oblivious Data Structures: Applications to Cryptography. |
STOC |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Giorgio Levi, Daniele Micciancio |
Analysis of Pure PROLOG Programs. |
GULP-PRODE |
1995 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")