Daniele Micciancio
According to our database^{1},
Daniele Micciancio
authored at least 100 papers
between 1995 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at orcid.org

at github.com

at dl.acm.org
On csauthors.net:
Bibliography
2020
IACR Cryptol. ePrint Arch., 2020
IACR Cryptol. ePrint Arch., 2020
IACR Cryptol. ePrint Arch., 2020
2019
IACR Cryptol. ePrint Arch., 2019
IACR Cryptol. ePrint Arch., 2019
IACR Cryptol. ePrint Arch., 2019
Proceedings of the Advances in Cryptology  EUROCRYPT 2019, 2019
Proceedings of the Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, 2019
2018
Theory Comput., 2018
J. Cryptology, 2018
IACR Cryptol. ePrint Arch., 2018
IACR Cryptol. ePrint Arch., 2018
IACR Cryptol. ePrint Arch., 2018
IACR Cryptol. ePrint Arch., 2018
IACR Cryptol. ePrint Arch., 2018
2017
IACR Cryptol. ePrint Arch., 2017
IACR Cryptol. ePrint Arch., 2017
Creating Cryptographic Challenges Using MultiParty Computation: The LWE Challenge.
IACR Cryptol. ePrint Arch., 2017
2016
Encyclopedia of Algorithms, 2016
IACR Cryptol. ePrint Arch., 2016
IACR Cryptol. ePrint Arch., 2016
2015
IACR Cryptol. ePrint Arch., 2015
Proceedings of the Advances in Cryptology  EUROCRYPT 2015, 2015
2014
IACR Cryptol. ePrint Arch., 2014
IACR Cryptol. ePrint Arch., 2014
IACR Cryptol. ePrint Arch., 2014
2013
IACR Cryptol. ePrint Arch., 2013
IACR Cryptol. ePrint Arch., 2013
Electronic Colloquium on Computational Complexity (ECCC), 2013
Proceedings of the TwentyFourth Annual ACMSIAM Symposium on Discrete Algorithms, 2013
Proceedings of the Innovations in Theoretical Computer Science, 2013
2012
Inapproximability of the Shortest Vector Problem: Toward a Deterministic Reduction.
Theory Comput., 2012
2011
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011
IACR Cryptol. ePrint Arch., 2011
Pseudorandom Knapsacks and the Sample Complexity of LWE SearchtoDecision Reductions.
IACR Cryptol. ePrint Arch., 2011
Proceedings of the Foundations of Security Analysis and Design VI, 2011
2010
Proceedings of the LLL Algorithm  Survey and Applications, 2010
J. Cryptology, 2010
A Deterministic Single Exponential Time Algorithm for Most Lattice Problems based on Voronoi Cell Computations.
Electronic Colloquium on Computational Complexity (ECCC), 2010
Commun. ACM, 2010
2009
IACR Cryptol. ePrint Arch., 2009
IACR Cryptol. ePrint Arch., 2009
Electronic Colloquium on Computational Complexity (ECCC), 2009
On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem.
Proceedings of the Advances in Cryptology, 2009
2008
Proceedings of the Encyclopedia of Algorithms  2008 Edition, 2008
IEEE/ACM Trans. Netw., 2008
The RoundComplexity of BlackBox ZeroKnowledge: A Combinatorial Characterization.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008
Proceedings of the Nineteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2008
Proceedings of the Privacy Enhancing Technologies, 2008
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008
Proceedings of the Fast Software Encryption, 15th International Workshop, 2008
2007
SIAM J. Comput., 2007
Comput. Complex., 2007
2006
J. Comput. Syst. Sci., 2006
Corrupting One vs. Corrupting Many: The Case of Broadcast and Multicast Encryption.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006
Proceedings of the Approximation, 2006
2005
Proceedings of the Encyclopedia of Cryptography and Security, 2005
Proceedings of the Encyclopedia of Cryptography and Security, 2005
Proceedings of the Encyclopedia of Cryptography and Security, 2005
Electronic Colloquium on Computational Complexity (ECCC), 2005
Electronic Colloquium on Computational Complexity (ECCC), 2005
Comput. Complex., 2005
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005
Proceedings of the TwentyFourth Annual ACM Symposium on Principles of Distributed Computing, 2005
2004
J. Comput. Syst. Sci., 2004
J. Comput. Secur., 2004
Generalized compact knapsacks, cyclic lattices, and efficient oneway functions from worstcase complexity assumptions
Electronic Colloquium on Computational Complexity (ECCC), 2004
Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004
Proceedings of the 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 2004
2003
Almost perfect lattices, the covering radius problem, and applications to Ajtai's connection factor
Electronic Colloquium on Computational Complexity (ECCC), 2003
Discret. Comput. Geom., 2003
Proceedings of the Advances in Cryptology, 2003
Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions.
Proceedings of the Advances in Cryptology, 2003
Statistical ZeroKnowledge Proofs with Efficient Provers: Lattice Problems and More.
Proceedings of the Advances in Cryptology, 2003
2002
Electronic Colloquium on Computational Complexity (ECCC), 2002
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002
Efficient Generic ForwardSecure Signatures with an Unbounded Number Of Time Periods.
Proceedings of the Advances in Cryptology  EUROCRYPT 2002, International Conference on the Theory and Applications of Cryptographic Techniques, Amsterdam, The Netherlands, April 28, 2002
Proceedings of the Advances in Cryptology  EUROCRYPT 2002, International Conference on the Theory and Applications of Cryptographic Techniques, Amsterdam, The Netherlands, April 28, 2002
The Provable Security of GraphBased OneTime Signatures and Extensions to Algebraic Signature Schemes.
Proceedings of the Advances in Cryptology, 2002
Complexity of lattice problems  a cryptograhic perspective.
The Kluwer international series in engineering and computer science 671, Springer, ISBN: 9780792376880, 2002
2001
IEEE Trans. Inf. Theory, 2001
IACR Cryptol. ePrint Arch., 2001
Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, 2001
Proceedings of the Cryptography and Lattices, International Conference, 2001
2000
Electronic Colloquium on Computational Complexity (ECCC), 2000
1999
Approximating Shortest Lattice Vectors is not Harder than Approximating Closest Lattice Vectors.
Inf. Process. Lett., 1999
IACR Cryptol. ePrint Arch., 1999
Electronic Colloquium on Computational Complexity (ECCC), 1999
Proceedings of the Proceedings IEEE INFOCOM '99, 1999
1998
PhD thesis, 1998
An Efficient NonInteractive Statistical ZeroKnowledge Proof System for QuasiSafe Prime Products.
IACR Cryptol. ePrint Arch., 1998
Electronic Colloquium on Computational Complexity (ECCC), 1998
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998
1997
IACR Cryptol. ePrint Arch., 1997
Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997
Proceedings of the TwentyNinth Annual ACM Symposium on the Theory of Computing, 1997
Proceedings of the Advances in Cryptology, 1997
1995
Analysis of Pure PROLOG Programs.
Proceedings of the 1995 Joint Conference on Declarative Programming, 1995