Daniele Micciancio
Orcid: 0000-0003-3323-9985Affiliations:
- University of California, San Diego, USA
According to our database1,
Daniele Micciancio
authored at least 118 papers
between 1995 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on github.com
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
Bit Security: optimal adversaries, equivalence results, and a toolbox for computational-statistical security analysis.
IACR Cryptol. ePrint Arch., 2024
Application-Aware Approximate Homomorphic Encryption: Configuring FHE for Practical Use.
IACR Cryptol. ePrint Arch., 2024
IACR Commun. Cryptol., 2024
Proceedings of the Public-Key Cryptography - PKC 2024, 2024
2023
Reductions from module lattices to free module lattices, and application to dequantizing module-LLL.
IACR Cryptol. ePrint Arch., 2023
IACR Cryptol. ePrint Arch., 2023
IACR Cryptol. ePrint Arch., 2023
IACR Cryptol. ePrint Arch., 2023
Collaborative Privacy-Preserving Analysis of Oncological Data using Multiparty Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2023
Proceedings of the IEEE/ACM International Symposium on Low Power Electronics and Design, 2023
2022
IACR Cryptol. ePrint Arch., 2022
Efficient FHEW Bootstrapping with Small Evaluation Keys, and Applications to Threshold Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2022
IACR Cryptol. ePrint Arch., 2022
2021
IACR Cryptol. ePrint Arch., 2021
2020
Simpler Statistically Sender Private Oblivious Transfer from Ideals of Cyclotomic Integers.
IACR Cryptol. ePrint Arch., 2020
IACR Cryptol. ePrint Arch., 2020
IACR Cryptol. ePrint Arch., 2020
IACR Cryptol. ePrint Arch., 2020
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
IACR Cryptol. ePrint Arch., 2018
IACR Cryptol. ePrint Arch., 2018
2017
IACR Cryptol. ePrint Arch., 2017
IACR Cryptol. ePrint Arch., 2017
IACR Cryptol. ePrint Arch., 2017
2016
IACR Cryptol. ePrint Arch., 2016
IACR Cryptol. ePrint Arch., 2016
2015
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015
2014
IACR Cryptol. ePrint Arch., 2014
IACR Cryptol. ePrint Arch., 2014
2013
A Deterministic Single Exponential Time Algorithm for Most Lattice Problems Based on Voronoi Cell Computations.
SIAM J. Comput., 2013
IACR Cryptol. ePrint Arch., 2013
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
Proceedings of the Innovations in Theoretical Computer Science, 2013
2012
Electron. Colloquium Comput. Complex., 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 Search-to-Decision 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
2009
IACR Cryptol. ePrint Arch., 2009
IACR Cryptol. ePrint Arch., 2009
Electron. Colloquium Comput. Complex., 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
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008
Proceedings of the Nineteenth Annual ACM-SIAM 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
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
Electron. Colloquium Comput. Complex., 2005
Electron. Colloquium Comput. Complex., 2005
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005
Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005
2004
Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor.
SIAM J. Comput., 2004
J. Comput. Syst. Sci., 2004
J. Comput. Secur., 2004
Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions
Electron. Colloquium Comput. Complex., 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
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
Proceedings of the Advances in Cryptology, 2003
2002
Electron. Colloquium Comput. Complex., 2002
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002
Efficient Generic Forward-Secure 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 Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes.
Proceedings of the Advances in Cryptology, 2002
Complexity of lattice problems - a cryptographic perspective.
The Kluwer international series in engineering and computer science 671, Springer, ISBN: 978-0-7923-7688-0, 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
SIAM J. Comput., 2000
Electron. Colloquium Comput. Complex., 2000
1999
Approximating Shortest Lattice Vectors is not Harder than Approximating Closest Lattice Vectors.
Inf. Process. Lett., 1999
Electron. Colloquium Comput. Complex., 1999
Proceedings of the Proceedings IEEE INFOCOM '99, 1999
1998
An Efficient Non-Interactive Statistical Zero-Knowledge Proof System for Quasi-Safe Prime Products.
IACR Cryptol. ePrint Arch., 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 Twenty-Ninth 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