Daniele Micciancio

186 papers A* 31A 9B 8Journal 86Unranked 34
YearRankTypeTitle / Venue / Authors
2026 J jnl
Application-Aware Approximate Homomorphic Encryption: Configuring FHE for Practical Use.
IACR Commun. Cryptol.
Andreea Alexandru, Ahmad Al Badawi, Daniele Micciancio, Yuriy Polyakov
2025 J jnl
Computationally-Sound Symbolic Cryptography in Lean.
IACR Cryptol. ePrint Arch.
Stefan Dziembowski, Grzegorz Fabianski, Daniele Micciancio, Rafal Stefanski
2025 J jnl
Fully Composable Homomorphic Encryption.
IACR Commun. Cryptol.
Daniele Micciancio
2024 J jnl
Application-Aware Approximate Homomorphic Encryption: Configuring FHE for Practical Use.
IACR Cryptol. ePrint Arch.
Andreea Alexandru, Ahmad Al Badawi, Daniele Micciancio, Yuriy Polyakov
2024 — conf
Bit Security: Optimal Adversaries, Equivalence Results, and a Toolbox for Computational-Statistical Security Analysis.
TCC (2)
Daniele Micciancio, Mark Schultz-Wu
2024 J jnl
Bit Security: optimal adversaries, equivalence results, and a toolbox for computational-statistical security analysis.
IACR Cryptol. ePrint Arch.
Daniele Micciancio, Mark Schultz-Wu
2024 — conf
Faster Amortized FHEW Bootstrapping Using Ring Automorphisms.
Public Key Cryptography (4)
Gabrielle De Micheli, Duhyeong Kim, Daniele Micciancio, Adam Suhl
2024 J jnl
Fully Composable Homomorphic Encryption.
IACR Cryptol. ePrint Arch.
Daniele Micciancio
2024 — conf
Hintless Single-Server Private Information Retrieval.
CRYPTO (9)
Baiyu Li, Daniele Micciancio, Mariana Raykova, Mark Schultz
2024 J jnl
Simulation-Secure Threshold PKE from LWE with Polynomial Modulus.
IACR Commun. Cryptol.
Daniele Micciancio, Adam Suhl
2024 — conf
SoK: Learning with Errors, Circular Security, and Fully Homomorphic Encryption.
Public Key Cryptography (4)
Daniele Micciancio, Vinod Vaikuntanathan
2023 J jnl
Collaborative Privacy-Preserving Analysis of Oncological Data using Multiparty Homomorphic Encryption.
IACR Cryptol. ePrint Arch.
Ravit Geva, Alexander Gusev, Yuriy Polyakov, Lior Liram, Oded Rosolio, Andreea Alexandru, Nicholas Genise, Marcelo Blatt, Zohar Duchin, Barliz Waissengrin, Dan Mirelman, Felix Bukstein, Deborah T. Blumenthal, Ido Wolf, Sharon Pelles-Avraham, Tali Schaffer, Lee A. Lavi, Daniele Micciancio, Vinod Vaikuntanathan, Ahmad Al Badawi, Shafi Goldwasser
2023 — conf
Efficient FHEW Bootstrapping with Small Evaluation Keys, and Applications to Threshold Homomorphic Encryption.
EUROCRYPT (3)
Yongwoo Lee, Daniele Micciancio, Andrey Kim, Rakyong Choi, Maxim Deryabin, Jieun Eom, Donghoon Yoo
2023 A conf
Efficient Machine Learning on Encrypted Data Using Hyperdimensional Computing.
ISLPED
Yujin Nam, Minxuan Zhou, Saransh Gupta, Gabrielle De Micheli, Rosario Cammarota, Chris Wilkerson, Daniele Micciancio, Tajana Rosing
2023 — conf
Error Correction and Ciphertext Quantization in Lattice Cryptography.
CRYPTO (5)
Daniele Micciancio, Mark Schultz
2023 J jnl
Error Correction and Ciphertext Quantization in Lattice Cryptography.
IACR Cryptol. ePrint Arch.
Daniele Micciancio, Mark Schultz
2023 J jnl
Faster Amortized FHEW bootstrapping using Ring Automorphisms.
IACR Cryptol. ePrint Arch.
Gabrielle De Micheli, Duhyeong Kim, Daniele Micciancio, Adam Suhl
2023 J jnl
Hintless Single-Server Private Information Retrieval.
IACR Cryptol. ePrint Arch.
Baiyu Li, Daniele Micciancio, Mariana Raykova, Mark Schultz
2023 — conf
Reductions from Module Lattices to Free Module Lattices, and Application to Dequantizing Module-LLL.
CRYPTO (5)
Gabrielle De Micheli, Daniele Micciancio, Alice Pellet-Mary, Nam Tran
2023 J jnl
Reductions from module lattices to free module lattices, and application to dequantizing module-LLL.
IACR Cryptol. ePrint Arch.
Gabrielle De Micheli, Daniele Micciancio, Alice Pellet-Mary, Nam Tran
2023 J jnl
Simulation-Secure Threshold PKE from LWE with Polynomial Modulus.
IACR Cryptol. ePrint Arch.
Daniele Micciancio, Adam Suhl
2022 J jnl
A fully classical LLL algorithm for modules.
IACR Cryptol. ePrint Arch.
Gabrielle De Micheli, Daniele Micciancio
2022 J jnl
Efficient FHEW Bootstrapping with Small Evaluation Keys, and Applications to Threshold Homomorphic Encryption.
IACR Cryptol. ePrint Arch.
Yongwoo Lee, Daniele Micciancio, Andrey Kim, Rakyong Choi, Maxim Deryabin, Jieun Eom, Donghoon Yoo
2022 — conf
Large-Precision Homomorphic Sign Evaluation Using FHEW/TFHE Bootstrapping.
ASIACRYPT (2)
Zeyu Liu, Daniele Micciancio, Yuriy Polyakov
2022 — conf
OpenFHE: Open-Source Fully Homomorphic Encryption Library.
WAHC@CCS
Ahmad Al Badawi, Jack Bates, Flávio Bergamaschi, David Bruce Cousins, Saroja Erabelli, Nicholas Genise, Shai Halevi, Hamish Hunt, Andrey Kim, Yongwoo Lee, Zeyu Liu, Daniele Micciancio, Ian Quah, Yuriy Polyakov, R. V. Saraswathy, Kurt Rohloff, Jonathan Saylor, Dmitriy Suponitsky, Matthew Triplett, Vinod Vaikuntanathan, Vincent Zucca
2022 J jnl
OpenFHE: Open-Source Fully Homomorphic Encryption Library.
IACR Cryptol. ePrint Arch.
Ahmad Al Badawi, Jack Bates, Flávio Bergamaschi, David Bruce Cousins, Saroja Erabelli, Nicholas Genise, Shai Halevi, Hamish Hunt, Andrey Kim, Yongwoo Lee, Zeyu Liu, Daniele Micciancio, Ian Quah, Yuriy Polyakov, R. V. Saraswathy, Kurt Rohloff, Jonathan Saylor, Dmitriy Suponitsky, Matthew Triplett, Vinod Vaikuntanathan, Vincent Zucca
2022 — conf
Securing Approximate Homomorphic Encryption Using Differential Privacy.
CRYPTO (1)
Baiyu Li, Daniele Micciancio, Mark Schultz, Jessica Sorrell
2022 J jnl
Securing Approximate Homomorphic Encryption Using Differential Privacy.
IACR Cryptol. ePrint Arch.
Baiyu Li, Daniele Micciancio, Mark Schultz, Jessica Sorrell
2021 — conf
Bootstrapping in FHEW-like Cryptosystems.
WAHC@CCS
Daniele Micciancio, Yuriy Polyakov
2021 A* conf
Diogenes: Lightweight Scalable RSA Modulus Generation with a Dishonest Majority.
SP
Megan Chen, Carmit Hazay, Yuval Ishai, Yuriy Kashnikov, Daniele Micciancio, Tarik Riviere, Abhi Shelat, Muthuramakrishnan Venkitasubramaniam, Ruihan Wang
2021 J jnl
Large-Precision Homomorphic Sign Evaluation using FHEW/TFHE Bootstrapping.
IACR Cryptol. ePrint Arch.
Zeyu Liu, Daniele Micciancio, Yuriy Polyakov
2021 — conf
On the Security of Homomorphic Encryption on Approximate Numbers.
EUROCRYPT (1)
Baiyu Li, Daniele Micciancio
2020 — ed.
Advances in Cryptology - CRYPTO 2020 - 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17-21, 2020, Proceedings, Part I
CRYPTO (1)
Daniele Micciancio, Thomas Ristenpart
2020 — ed.
Advances in Cryptology - CRYPTO 2020 - 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17-21, 2020, Proceedings, Part II
CRYPTO (2)
Daniele Micciancio, Thomas Ristenpart
2020 — ed.
Advances in Cryptology - CRYPTO 2020 - 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17-21, 2020, Proceedings, Part III
CRYPTO (3)
Daniele Micciancio, Thomas Ristenpart
2020 J jnl
Bootstrapping in FHEW-like Cryptosystems.
IACR Cryptol. ePrint Arch.
Daniele Micciancio, Yuriy Polyakov
2020 J jnl
Diogenes: Lightweight Scalable RSA Modulus Generation with a Dishonest Majority.
IACR Cryptol. ePrint Arch.
Megan Chen, Carmit Hazay, Yuval Ishai, Yuriy Kashnikov, Daniele Micciancio, Tarik Riviere, Abhi Shelat, Muthuramakrishnan Venkitasubramaniam, Ruihan Wang
2020 — conf
Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography.
Public Key Cryptography (1)
Nicholas Genise, Daniele Micciancio, Chris Peikert, Michael Walter
2020 J jnl
Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography.
IACR Cryptol. ePrint Arch.
Nicholas Genise, Daniele Micciancio, Chris Peikert, Michael Walter
2020 J jnl
On the Security of Homomorphic Encryption on Approximate Numbers.
IACR Cryptol. ePrint Arch.
Baiyu Li, Daniele Micciancio
2020 — conf
Simpler Statistically Sender Private Oblivious Transfer from Ideals of Cyclotomic Integers.
ASIACRYPT (2)
Daniele Micciancio, Jessica Sorrell
2020 J jnl
Simpler Statistically Sender Private Oblivious Transfer from Ideals of Cyclotomic Integers.
IACR Cryptol. ePrint Arch.
Daniele Micciancio, Jessica Sorrell
2019 — ed.
Advances in Cryptology - CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019, Proceedings, Part I
CRYPTO (1)
Alexandra Boldyreva, Daniele Micciancio
2019 — ed.
Advances in Cryptology - CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019, Proceedings, Part II
CRYPTO (2)
Alexandra Boldyreva, Daniele Micciancio
2019 — ed.
Advances in Cryptology - CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019, Proceedings, Part III
CRYPTO (3)
Alexandra Boldyreva, Daniele Micciancio
2019 — conf
Building an Efficient Lattice Gadget Toolkit: Subgaussian Sampling and More.
EUROCRYPT (2)
Nicholas Genise, Daniele Micciancio, Yuriy Polyakov
2019 J jnl
Homomorphic Encryption Standard.
IACR Cryptol. ePrint Arch.
Martin R. Albrecht, Melissa Chase, Hao Chen, Jintai Ding, Shafi Goldwasser, Sergey Gorbunov, Shai Halevi, Jeffrey Hoffstein, Kim Laine, Kristin E. Lauter, Satya Lokam, Daniele Micciancio, Dustin Moody, Travis Morrison, Amit Sahai, Vinod Vaikuntanathan
2019 — conf
Homomorphic Encryption for Finite Automata.
ASIACRYPT (2)
Nicholas Genise, Craig Gentry, Shai Halevi, Baiyu Li, Daniele Micciancio
2019 J jnl
Homomorphic Encryption for Finite Automata.
IACR Cryptol. ePrint Arch.
Nicholas Genise, Craig Gentry, Shai Halevi, Baiyu Li, Daniele Micciancio
2019 — ch.
Interactive proofs for lattice problems.
Providing Sound Foundations for Cryptography
Daniele Micciancio
2019 J jnl
Semi-parallel Logistic Regression for GWAS on Encrypted Data.
IACR Cryptol. ePrint Arch.
Miran Kim, Yongsoo Song, Baiyu Li, Daniele Micciancio
2019 — conf
Symbolic Encryption with Pseudorandom Keys.
EUROCRYPT (3)
Daniele Micciancio
2018 J jnl
Asymptotically Efficient Lattice-Based Digital Signatures.
J. Cryptol.
Vadim Lyubashevsky, Daniele Micciancio
2018 J jnl
Building an Efficient Lattice Gadget Toolkit: Subgaussian Sampling and More.
IACR Cryptol. ePrint Arch.
Nicholas Genise, Daniele Micciancio, Yuriy Polyakov
2018 — conf
Equational Security Proofs of Oblivious Transfer Protocols.
Public Key Cryptography (1)
Baiyu Li, Daniele Micciancio
2018 — conf
Faster Gaussian Sampling for Trapdoor Lattices with Arbitrary Modulus.
EUROCRYPT (1)
Nicholas Genise, Daniele Micciancio
2018 J jnl
Implementing Token-Based Obfuscation under (Ring) LWE.
IACR Cryptol. ePrint Arch.
Cheng Chen, Nicholas Genise, Daniele Micciancio, Yuriy Polyakov, Kurt Rohloff
2018 — conf
On the Bit Security of Cryptographic Primitives.
EUROCRYPT (1)
Daniele Micciancio, Michael Walter
2018 J jnl
On the Bit Security of Cryptographic Primitives.
IACR Cryptol. ePrint Arch.
Daniele Micciancio, Michael Walter
2018 J jnl
On the Hardness of Learning With Errors with Binary Secrets.
IACR Cryptol. ePrint Arch.
Daniele Micciancio
2018 J jnl
On the Hardness of Learning With Errors with Binary Secrets.
Theory Comput.
Daniele Micciancio
2018 A* conf
Ring Packing and Amortized FHEW Bootstrapping.
ICALP
Daniele Micciancio, Jessica Sorrell
2018 J jnl
Ring packing and amortized FHEW bootstrapping.
IACR Cryptol. ePrint Arch.
Daniele Micciancio, Jessica Sorrell
2018 A conf
Symbolic Security of Garbled Circuits.
CSF
Baiyu Li, Daniele Micciancio
2018 J jnl
Symbolic security of garbled circuits.
IACR Cryptol. ePrint Arch.
Baiyu Li, Daniele Micciancio
2017 J jnl
Creating Cryptographic Challenges Using Multi-Party Computation: The LWE Challenge.
IACR Cryptol. ePrint Arch.
Johannes Buchmann, Niklas Büscher, Florian Göpfert, Stefan Katzenbeisser, Juliane Krämer, Daniele Micciancio, Sander Siim, Christine van Vredendaal, Michael Walter
2017 J jnl
Faster Gaussian Sampling for Trapdoor Lattices with Arbitrary Modulus.
IACR Cryptol. ePrint Arch.
Nicholas Genise, Daniele Micciancio
2017 — conf
Gaussian Sampling over the Integers: Efficient, Generic, Constant-Time.
CRYPTO (2)
Daniele Micciancio, Michael Walter
2017 J jnl
Gaussian Sampling over the Integers: Efficient, Generic, Constant-Time.
IACR Cryptol. ePrint Arch.
Daniele Micciancio, Michael Walter
2016 — conf
Compactness vs Collusion Resistance in Functional Encryption.
TCC (B2)
Baiyu Li, Daniele Micciancio
2016 J jnl
Compactness vs Collusion Resistance in Functional Encryption.
IACR Cryptol. ePrint Arch.
Baiyu Li, Daniele Micciancio
2016 — conf
Creating Cryptographic Challenges Using Multi-Party Computation: The LWE Challenge.
AsiaPKC@AsiaCCS
Johannes Buchmann, Niklas Büscher, Florian Göpfert, Stefan Katzenbeisser, Juliane Krämer, Daniele Micciancio, Sander Siim, Christine van Vredendaal, Michael Walter
2016 J jnl
Equational Security Proofs of Oblivious Transfer Protocols.
IACR Cryptol. ePrint Arch.
Baiyu Li, Daniele Micciancio
2016 — conf
Practical, Predictable Lattice Basis Reduction.
EUROCRYPT (1)
Daniele Micciancio, Michael Walter
2016 — ch.
Shortest Vector Problem.
Encyclopedia of Algorithms
Daniele Micciancio
2015 — conf
FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second.
EUROCRYPT (1)
Léo Ducas, Daniele Micciancio
2015 A* conf
Fast Lattice Point Enumeration with Minimal Overhead.
SODA
Daniele Micciancio, Michael Walter
2015 J jnl
Practical, Predictable Lattice Basis Reduction.
IACR Cryptol. ePrint Arch.
Daniele Micciancio, Michael Walter
2014 J jnl
FHE Bootstrapping in less than a second.
IACR Cryptol. ePrint Arch.
Léo Ducas, Daniele Micciancio
2014 J jnl
Fast Lattice Point Enumeration with Minimal Overhead.
IACR Cryptol. ePrint Arch.
Daniele Micciancio, Michael Walter
2014 — conf
Improved Short Lattice Signatures in the Standard Model.
CRYPTO (1)
Léo Ducas, Daniele Micciancio
2014 J jnl
Improved Short Lattice Signatures in the Standard Model.
IACR Cryptol. ePrint Arch.
Léo Ducas, Daniele Micciancio
2014 A conf
Locally Dense Codes.
CCC
Daniele Micciancio
2013 J jnl
A Deterministic Single Exponential Time Algorithm for Most Lattice Problems Based on Voronoi Cell Computations.
SIAM J. Comput.
Daniele Micciancio, Panagiotis Voulgaris
2013 A* conf
Algorithms for the Densest Sub-Lattice Problem.
SODA
Daniel Dadush, Daniele Micciancio
2013 A conf
An equational approach to secure multi-party computation.
ITCS
Daniele Micciancio, Stefano Tessaro
2013 J jnl
Asymptotically Effi cient Lattice-Based Digital Signatures.
IACR Cryptol. ePrint Arch.
Vadim Lyubashevsky, Daniele Micciancio
2013 — conf
Hardness of SIS and LWE with Small Parameters.
CRYPTO (1)
Daniele Micciancio, Chris Peikert
2013 J jnl
Hardness of SIS and LWE with Small Parameters.
IACR Cryptol. ePrint Arch.
Daniele Micciancio, Chris Peikert
2013 J jnl
Locally Dense Codes.
Electron. Colloquium Comput. Complex.
Daniele Micciancio
2012 J jnl
Inapproximability of the Shortest Vector Problem: Toward a Deterministic Reduction.
Electron. Colloquium Comput. Complex.
Daniele Micciancio
2012 J jnl
Inapproximability of the Shortest Vector Problem: Toward a Deterministic Reduction.
Theory Comput.
Daniele Micciancio
2012 A* conf
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller.
EUROCRYPT
Daniele Micciancio, Chris Peikert
2011 — ch.
Closest Vector Problem.
Encyclopedia of Cryptography and Security (2nd Ed.)
Daniele Micciancio
2011 — ch.
Lattice-Based Cryptography.
Encyclopedia of Cryptography and Security (2nd Ed.)
Daniele Micciancio
2011 A* conf
Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions.
CRYPTO
Daniele Micciancio, Petros Mol
2011 J jnl
Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions.
IACR Cryptol. ePrint Arch.
Daniele Micciancio, Petros Mol
2011 — ch.
Shortest Vector Problem.
Encyclopedia of Cryptography and Security (2nd Ed.)
Daniele Micciancio
2011 — conf
The Geometry of Lattice Cryptography.
FOSAD
Daniele Micciancio
2011 J jnl
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller.
IACR Cryptol. ePrint Arch.
Daniele Micciancio, Chris Peikert
2010 J jnl
A Deterministic Single Exponential Time Algorithm for Most Lattice Problems based on Voronoi Cell Computations.
Electron. Colloquium Comput. Complex.
Daniele Micciancio, Panagiotis Voulgaris
2010 A* conf
A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations.
STOC
Daniele Micciancio, Panagiotis Voulgaris
2010 J jnl
A first glimpse of cryptography's Holy Grail.
Commun. ACM
Daniele Micciancio
2010 A* conf
Computational Soundness, Co-induction, and Encryption Cycles.
EUROCRYPT
Daniele Micciancio
2010 — ch.
Cryptographic Functions from Worst-Case Complexity Assumptions.
The LLL Algorithm
Daniele Micciancio
2010 A* conf
Faster Exponential Time Algorithms for the Shortest Vector Problem.
SODA
Daniele Micciancio, Panagiotis Voulgaris
2010 J jnl
The RSA Group is Pseudo-Free.
J. Cryptol.
Daniele Micciancio
2010 B ed.
Theory of Cryptography, 7th Theory of Cryptography Conference, TCC 2010, Zurich, Switzerland, February 9-11, 2010. Proceedings
TCC
Daniele Micciancio
2009 J jnl
Computational soundness, co-induction, and encryption cycles.
IACR Cryptol. ePrint Arch.
Daniele Micciancio
2009 J jnl
Faster exponential time algorithms for the shortest vector problem.
Electron. Colloquium Comput. Complex.
Panagiotis Voulgaris, Daniele Micciancio
2009 A* conf
On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem.
CRYPTO
Vadim Lyubashevsky, Daniele Micciancio
2009 J jnl
Pseudo-randomness and partial information in symbolic security analysis.
IACR Cryptol. ePrint Arch.
Daniele Micciancio
2008 A conf
An Indistinguishability-Based Characterization of Anonymous Channels.
Privacy Enhancing Technologies
Alejandro Hevia, Daniele Micciancio
2008 B conf
Asymptotically Efficient Lattice-Based Digital Signatures.
TCC
Vadim Lyubashevsky, Daniele Micciancio
2008 B conf
Efficient bounded distance decoders for Barnes-Wall lattices.
ISIT
Daniele Micciancio, Antonio Nicolosi
2008 A* conf
Efficient reductions among lattice problems.
SODA
Daniele Micciancio
2008 J jnl
Optimal communication complexity of generic multicast key distribution.
IEEE/ACM Trans. Netw.
Daniele Micciancio, Saurabh Panjwani
2008 A* conf
SWIFFT: A Modest Proposal for FFT Hashing.
FSE
Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen
2008 — ch.
Shortest Vector Problem.
Encyclopedia of Algorithms
Daniele Micciancio
2008 B conf
The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization.
TCC
Daniele Micciancio, Scott Yilek
2007 J jnl
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions.
Comput. Complex.
Daniele Micciancio
2007 J jnl
Worst-Case to Average-Case Reductions Based on Gaussian Measures.
SIAM J. Comput.
Daniele Micciancio, Oded Regev
2006 B conf
Concurrent Zero Knowledge Without Complexity Assumptions.
TCC
Daniele Micciancio, Shien Jin Ong, Amit Sahai, Salil P. Vadhan
2006 — conf
Corrupting One vs. Corrupting Many: The Case of Broadcast and Multicast Encryption.
ICALP (2)
Daniele Micciancio, Saurabh Panjwani
2006 — conf
Generalized Compact Knapsacks Are Collision Resistant.
ICALP (2)
Vadim Lyubashevsky, Daniele Micciancio
2006 — conf
On Bounded Distance Decoding for General Lattices.
APPROX-RANDOM
Yi-Kai Liu, Vadim Lyubashevsky, Daniele Micciancio
2006 J jnl
Special Issue: FOCS 2003.
J. Comput. Syst. Sci.
Chandra Chekuri, Daniele Micciancio
2005 B conf
Adaptive Security of Symbolic Encryption.
TCC
Daniele Micciancio, Saurabh Panjwani
2005 — ch.
Closest Vector Problem.
Encyclopedia of Cryptography and Security
Daniele Micciancio
2005 J jnl
Concurrent Zero Knowledge without Complexity Assumptions
Electron. Colloquium Comput. Complex.
Daniele Micciancio, Shien Jin Ong, Amit Sahai, Salil P. Vadhan
2005 J jnl
Concurrent Zero Knowledge without Complexity Assumptions.
IACR Cryptol. ePrint Arch.
Daniele Micciancio, Shien Jin Ong, Amit Sahai, Salil P. Vadhan
2005 J jnl
Generalized Compact Knapsacks are Collision Resistant
Electron. Colloquium Comput. Complex.
Vadim Lyubashevsky, Daniele Micciancio
2005 — ch.
Lattice Based Cryptography.
Encyclopedia of Cryptography and Security
Daniele Micciancio
2005 — ch.
Shortest Vector Problem.
Encyclopedia of Cryptography and Security
Daniele Micciancio
2005 A* conf
Simultaneous broadcast revisited.
PODC
Alejandro Hevia, Daniele Micciancio
2005 A* conf
The RSA Group is Pseudo-Free.
EUROCRYPT
Daniele Micciancio
2005 J jnl
The complexity of the covering radius problem.
Comput. Complex.
Venkatesan Guruswami, Daniele Micciancio, Oded Regev
2004 J jnl
Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor.
SIAM J. Comput.
Daniele Micciancio
2004 J jnl
Completeness Theorems for the Abadi-Rogaway Language of Encrypted Expressions.
J. Comput. Secur.
Daniele Micciancio, Bogdan Warinschi
2004 J jnl
Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions
Electron. Colloquium Comput. Complex.
Daniele Micciancio
2004 J jnl
Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions.
IACR Cryptol. ePrint Arch.
Daniele Micciancio
2004 A* conf
Optimal Communication Complexity of Generic Multicast Key Distribution.
EUROCRYPT
Daniele Micciancio, Saurabh Panjwani
2004 B conf
Soundness of Formal Encryption in the Presence of Active Adversaries.
TCC
Daniele Micciancio, Bogdan Warinschi
2004 A conf
The Complexity of the Covering Radius Problem on Lattices and Codes.
CCC
Venkatesan Guruswami, Daniele Micciancio, Oded Regev
2004 J jnl
The inapproximability of lattice and coding problems with preprocessing.
J. Comput. Syst. Sci.
Uriel Feige, Daniele Micciancio
2004 A* conf
Worst-Case to Average-Case Reductions Based on Gaussian Measures.
FOCS
Daniele Micciancio, Oded Regev
2003 J jnl
A Note on the Minimal Volume of Almost Cubic Parallelepipeds.
Discret. Comput. Geom.
Daniele Micciancio
2003 J jnl
Almost perfect lattices, the covering radius problem, and applications to Ajtai's connection factor
Electron. Colloquium Comput. Complex.
Daniele Micciancio
2003 A* conf
Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions.
EUROCRYPT
Mihir Bellare, Daniele Micciancio, Bogdan Warinschi
2003 J jnl
Hardness of approximating the minimum distance of a linear code.
IEEE Trans. Inf. Theory
Ilya Dumer, Daniele Micciancio, Madhu Sudan
2003 A* conf
Simulatable Commitments and Efficient Concurrent Zero-Knowledge.
EUROCRYPT
Daniele Micciancio, Erez Petrank
2003 A* conf
Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More.
CRYPTO
Daniele Micciancio, Salil P. Vadhan
2002 — book
Complexity of lattice problems - a cryptographic perspective.
Daniele Micciancio, Shafi Goldwasser
2002 A* conf
Cryptanalysis of a Pseudorandom Generator Based on Braid Groups.
EUROCRYPT
Rosario Gennaro, Daniele Micciancio
2002 A* conf
Efficient Generic Forward-Secure Signatures with an Unbounded Number Of Time Periods.
EUROCRYPT
Tal Malkin, Daniele Micciancio, Sara K. Miner
2002 J jnl
Efficient and Concurrent Zero-Knowledge from any public coin HVZK protocol
Electron. Colloquium Comput. Complex.
Daniele Micciancio, Erez Petrank
2002 J jnl
Efficient and Concurrent Zero-Knowledge from any public coin HVZK protocol.
IACR Cryptol. ePrint Arch.
Daniele Micciancio, Erez Petrank
2002 A* conf
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions from Worst-Case Complexity Assumptions.
FOCS
Daniele Micciancio
2002 A conf
Improved Cryptographic Hash Functions with Worst-Case/Average-Case Connection.
CCC
Daniele Micciancio
2002 A* conf
Improved cryptographic hash functions with worst-case/average-case connection.
STOC
Daniele Micciancio
2002 A conf
The Inapproximability of Lattice and Coding Problems with Preprocessing.
CCC
Uriel Feige, Daniele Micciancio
2002 A conf
The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes.
ASIACRYPT
Alejandro Hevia, Daniele Micciancio
2001 B conf
A linear space algorithm for computing the herite normal form.
ISSAC
Daniele Micciancio, Bogdan Warinschi
2001 J jnl
Composition and Efficiency Tradeoffs for Forward-Secure Digital Signatures.
IACR Cryptol. ePrint Arch.
Tal Malkin, Daniele Micciancio, Sara Miner More
2001 — conf
Improving Lattice Based Cryptosystems Using the Hermite Normal Form.
CaLC
Daniele Micciancio
2001 J jnl
The hardness of the closest vector problem with preprocessing.
IEEE Trans. Inf. Theory
Daniele Micciancio
2000 J jnl
A Linear Space Algorithm for Computing the Hermite Normal Form
Electron. Colloquium Comput. Complex.
Daniele Micciancio, Bogdan Warinschi
2000 J jnl
The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant.
SIAM J. Comput.
Daniele Micciancio
1999 J jnl
Approximating Shortest Lattice Vectors is Not Harder Than Approximating Closest Lattice Vectors.
Electron. Colloquium Comput. Complex.
Oded Goldreich, Daniele Micciancio, Shmuel Safra, Jean-Pierre Seifert
1999 J jnl
Approximating Shortest Lattice Vectors is not Harder than Approximating Closest Lattice Vectors.
Inf. Process. Lett.
Oded Goldreich, Daniele Micciancio, Shmuel Safra, Jean-Pierre Seifert
1999 J jnl
Hardness of Approximating the Minimum Distance of a Linear Code
Electron. Colloquium Comput. Complex.
Ilya Dumer, Daniele Micciancio, Madhu Sudan
1999 A* conf
Hardness of Approximating the Minimum Distance of a Linear Code.
FOCS
Ilya Dumer, Daniele Micciancio, Madhu Sudan
1999 J jnl
Lattice Based Cryptography: A Global Improvement.
IACR Cryptol. ePrint Arch.
Daniele Micciancio
1999 A* conf
Multicast Security: A Taxonomy and Some Efficient Constructions.
INFOCOM
Ran Canetti, Juan A. Garay, Gene Itkis, Daniele Micciancio, Moni Naor, Benny Pinkas
1998 A* conf
An Efficient Non-Interactive Statistical Zero-Knowledge Proof System for Quasi-Safe Prime Products.
CCS
Rosario Gennaro, Daniele Micciancio, Tal Rabin
1998 J jnl
An Efficient Non-Interactive Statistical Zero-Knowledge Proof System for Quasi-Safe Prime Products.
IACR Cryptol. ePrint Arch.
Rosario Gennaro, Daniele Micciancio, Tal Rabin
1998 — —
On the hardness of the shortest vector problem.
Daniele Micciancio
1998 A* conf
Perfectly One-Way Probabilistic Hash Functions (Preliminary Version).
STOC
Ran Canetti, Daniele Micciancio, Omer Reingold
1998 A* conf
The Shortest Vector in a Lattice is Hard to Approximate to Within Some Constant.
FOCS
Daniele Micciancio
1998 J jnl
The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant.
Electron. Colloquium Comput. Complex.
Daniele Micciancio
1997 A* conf
"Pseudo-Random" Number Generation Within Cryptographic Algorithms: The DDS Case.
CRYPTO
Mihir Bellare, Shafi Goldwasser, Daniele Micciancio
1997 A* conf
A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost.
EUROCRYPT
Mihir Bellare, Daniele Micciancio
1997 J jnl
A New Paradigm for Collision-free Hashing: Incrementality at Reduced Cost.
IACR Cryptol. ePrint Arch.
Mihir Bellare, Daniele Micciancio
1997 — conf
An Algorithm for the Solution of Tree Equations.
TAPSOFT
Sabrina Mantaci, Daniele Micciancio
1997 A* conf
Oblivious Data Structures: Applications to Cryptography.
STOC
Daniele Micciancio
1995 — conf
Analysis of Pure PROLOG Programs.
GULP-PRODE
Giorgio Levi, Daniele Micciancio