| 2024 | CRYPTO | Hintless Single-Server Private Information Retrieval. | Baiyu Li, Daniele Micciancio, Mariana Raykova, Mark Schultz |
| 2024 | PKC | SoK: Learning with Errors, Circular Security, and Fully Homomorphic Encryption. | Daniele Micciancio, Vinod Vaikuntanathan |
| 2024 | PKC | Faster Amortized FHEW Bootstrapping Using Ring Automorphisms. | Gabrielle De Micheli, Duhyeong Kim, Daniele Micciancio, Adam Suhl |
| 2024 | TCC | Bit Security: Optimal Adversaries, Equivalence Results, and a Toolbox for Computational-Statistical Security Analysis. | Daniele Micciancio, Mark Schultz-Wu |
| 2023 | CRYPTO | Error Correction and Ciphertext Quantization in Lattice Cryptography. | Daniele Micciancio, Mark Schultz |
| 2023 | CRYPTO | Reductions from Module Lattices to Free Module Lattices, and Application to Dequantizing Module-LLL. | Gabrielle De Micheli, Daniele Micciancio, Alice Pellet-Mary, Nam Tran |
| 2023 | EuroCrypt | Efficient FHEW Bootstrapping with Small Evaluation Keys, and Applications to Threshold Homomorphic Encryption. | Yongwoo Lee, Daniele Micciancio, Andrey Kim, Rakyong Choi, Maxim Deryabin, Jieun Eom, Donghoon Yoo |
| 2023 | ISLPED | Efficient Machine Learning on Encrypted Data Using Hyperdimensional Computing. | Yujin Nam, Minxuan Zhou, Saransh Gupta, Gabrielle De Micheli, Rosario Cammarota, Chris Wilkerson, Daniele Micciancio, Tajana Rosing |
| 2022 | ASIACRYPT | Large-Precision Homomorphic Sign Evaluation Using FHEW/TFHE Bootstrapping. | Zeyu Liu, Daniele Micciancio, Yuriy Polyakov |
| 2022 | CCS | OpenFHE: Open-Source Fully Homomorphic Encryption Library. | Ahmad Al Badawi, Jack Bates, Flvio 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 | CRYPTO | Securing Approximate Homomorphic Encryption Using Differential Privacy. | Baiyu Li, Daniele Micciancio, Mark Schultz, Jessica Sorrell |
| 2021 | CCS | Bootstrapping in FHEW-like Cryptosystems. | Daniele Micciancio, Yuriy Polyakov |
| 2021 | EuroCrypt | On the Security of Homomorphic Encryption on Approximate Numbers. | Baiyu Li, Daniele Micciancio |
| 2021 | SP | Diogenes: Lightweight Scalable RSA Modulus Generation with a Dishonest Majority. | Megan Chen, Carmit Hazay, Yuval Ishai, Yuriy Kashnikov, Daniele Micciancio, Tarik Riviere, Abhi Shelat, Muthuramakrishnan Venkitasubramaniam, Ruihan Wang |
| 2020 | ASIACRYPT | Simpler Statistically Sender Private Oblivious Transfer from Ideals of Cyclotomic Integers. | Daniele Micciancio, Jessica Sorrell |
| 2020 | PKC | Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography. | Nicholas Genise, Daniele Micciancio, Chris Peikert, Michael Walter |
| 2019 | ASIACRYPT | Homomorphic Encryption for Finite Automata. | Nicholas Genise, Craig Gentry, Shai Halevi, Baiyu Li, Daniele Micciancio |
| 2019 | EuroCrypt | Building an Efficient Lattice Gadget Toolkit: Subgaussian Sampling and More. | Nicholas Genise, Daniele Micciancio, Yuriy Polyakov |
| 2019 | EuroCrypt | Symbolic Encryption with Pseudorandom Keys. | Daniele Micciancio |
| 2018 | EuroCrypt | Faster Gaussian Sampling for Trapdoor Lattices with Arbitrary Modulus. | Nicholas Genise, Daniele Micciancio |
| 2018 | EuroCrypt | On the Bit Security of Cryptographic Primitives. | Daniele Micciancio, Michael Walter |
| 2018 | ICALP | Ring Packing and Amortized FHEW Bootstrapping. | Daniele Micciancio, Jessica Sorrell |
| 2018 | PKC | Equational Security Proofs of Oblivious Transfer Protocols. | Baiyu Li, Daniele Micciancio |
| 2017 | CRYPTO | Gaussian Sampling over the Integers: Efficient, Generic, Constant-Time. | Daniele Micciancio, Michael Walter |
| 2016 | CCS | Creating Cryptographic Challenges Using Multi-Party Computation: The LWE Challenge. | Johannes Buchmann, Niklas Bscher, Florian Gpfert, Stefan Katzenbeisser, Juliane Krmer, Daniele Micciancio, Sander Siim, Christine van Vredendaal, Michael Walter |
| 2016 | EuroCrypt | Practical, Predictable Lattice Basis Reduction. | Daniele Micciancio, Michael Walter |
| 2016 | TCC | Compactness vs Collusion Resistance in Functional Encryption. | Baiyu Li, Daniele Micciancio |
| 2015 | EuroCrypt | FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second. | Lo Ducas, Daniele Micciancio |
| 2015 | SODA | Fast Lattice Point Enumeration with Minimal Overhead. | Daniele Micciancio, Michael Walter |
| 2014 | CRYPTO | Improved Short Lattice Signatures in the Standard Model. | Lo Ducas, Daniele Micciancio |
| 2013 | CRYPTO | Hardness of SIS and LWE with Small Parameters. | Daniele Micciancio, Chris Peikert |
| 2013 | SODA | Algorithms for the Densest Sub-Lattice Problem. | Daniel Dadush, Daniele Micciancio |
| 2012 | EuroCrypt | Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller. | Daniele Micciancio, Chris Peikert |
| 2011 | CRYPTO | Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions. | Daniele Micciancio, Petros Mol |
| 2010 | EuroCrypt | Computational Soundness, Co-induction, and Encryption Cycles. | Daniele Micciancio |
| 2010 | SODA | Faster Exponential Time Algorithms for the Shortest Vector Problem. | Daniele Micciancio, Panagiotis Voulgaris |
| 2010 | STOC | A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations. | Daniele Micciancio, Panagiotis Voulgaris |
| 2009 | CRYPTO | On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem. | Vadim Lyubashevsky, Daniele Micciancio |
| 2008 | FSE | SWIFFT: A Modest Proposal for FFT Hashing. | Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen |
| 2008 | ISIT | Efficient bounded distance decoders for Barnes-Wall lattices. | Daniele Micciancio, Antonio Nicolosi |
| 2008 | SODA | Efficient reductions among lattice problems. | Daniele Micciancio |
| 2008 | TCC | Asymptotically Efficient Lattice-Based Digital Signatures. | Vadim Lyubashevsky, Daniele Micciancio |
| 2008 | TCC | The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization. | Daniele Micciancio, Scott Yilek |
| 2006 | ICALP | Generalized Compact Knapsacks Are Collision Resistant. | Vadim Lyubashevsky, Daniele Micciancio |
| 2006 | ICALP | Corrupting One vs. Corrupting Many: The Case of Broadcast and Multicast Encryption. | Daniele Micciancio, Saurabh Panjwani |
| 2006 | TCC | Concurrent Zero Knowledge Without Complexity Assumptions. | Daniele Micciancio, Shien Jin Ong, Amit Sahai, Salil P. Vadhan |
| 2005 | EuroCrypt | The RSA Group is Pseudo-Free. | Daniele Micciancio |
| 2005 | PODC | Simultaneous broadcast revisited. | Alejandro Hevia, Daniele Micciancio |
| 2005 | TCC | Adaptive Security of Symbolic Encryption. | Daniele Micciancio, Saurabh Panjwani |
| 2004 | EuroCrypt | Optimal Communication Complexity of Generic Multicast Key Distribution. | Daniele Micciancio, Saurabh Panjwani |
| 2004 | FOCS | Worst-Case to Average-Case Reductions Based on Gaussian Measures. | Daniele Micciancio, Oded Regev |
| 2004 | TCC | Soundness of Formal Encryption in the Presence of Active Adversaries. | Daniele Micciancio, Bogdan Warinschi |
| 2003 | CRYPTO | Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More. | Daniele Micciancio, Salil P. Vadhan |
| 2003 | EuroCrypt | Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions. | Mihir Bellare, Daniele Micciancio, Bogdan Warinschi |
| 2003 | EuroCrypt | Simulatable Commitments and Efficient Concurrent Zero-Knowledge. | Daniele Micciancio, Erez Petrank |
| 2002 | ASIACRYPT | The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes. | Alejandro Hevia, Daniele Micciancio |
| 2002 | EuroCrypt | Cryptanalysis of a Pseudorandom Generator Based on Braid Groups. | Rosario Gennaro, Daniele Micciancio |
| 2002 | EuroCrypt | Efficient Generic Forward-Secure Signatures with an Unbounded Number Of Time Periods. | Tal Malkin, Daniele Micciancio, Sara K. Miner |
| 2002 | FOCS | Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions from Worst-Case Complexity Assumptions. | Daniele Micciancio |
| 2002 | STOC | Improved cryptographic hash functions with worst-case/average-case connection. | Daniele Micciancio |
| 2001 | ISSAC | A linear space algorithm for computing the herite normal form. | Daniele Micciancio, Bogdan Warinschi |
| 1999 | FOCS | Hardness of Approximating the Minimum Distance of a Linear Code. | Ilya Dumer, Daniele Micciancio, Madhu Sudan |
| 1999 | INFOCOM | Multicast Security: A Taxonomy and Some Efficient Constructions. | Ran Canetti, Juan A. Garay, Gene Itkis, Daniele Micciancio, Moni Naor, Benny Pinkas |
| 1998 | CCS | An Efficient Non-Interactive Statistical Zero-Knowledge Proof System for Quasi-Safe Prime Products. | Rosario Gennaro, Daniele Micciancio, Tal Rabin |
| 1998 | FOCS | The Shortest Vector in a Lattice is Hard to Approximate to Within Some Constant. | Daniele Micciancio |
| 1998 | STOC | Perfectly One-Way Probabilistic Hash Functions (Preliminary Version). | Ran Canetti, Daniele Micciancio, Omer Reingold |
| 1997 | CRYPTO | "Pseudo-Random" Number Generation Within Cryptographic Algorithms: The DDS Case. | Mihir Bellare, Shafi Goldwasser, Daniele Micciancio |
| 1997 | EuroCrypt | A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost. | Mihir Bellare, Daniele Micciancio |
| 1997 | STOC | Oblivious Data Structures: Applications to Cryptography. | Daniele Micciancio |