Daniele Micciancio

ORCID

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 60

Top Venues

IACR Cryptol. ePrint Arch.

EUROCRYPT (1)

ASIACRYPT (2)

CRYPTO (5)

Massachusetts Institute of Technology, Cambridge, MA, USA (PHD)

Education History

Massachusetts Institute of Technology, Cambridge, MA, USA

PHD

Publications

Baiyu Li, Daniele Micciancio, Mariana Raykova, Mark Schultz
Hintless Single-Server Private Information Retrieval. CRYPTO (9) (2024)
Daniele Micciancio, Vinod Vaikuntanathan
SoK: Learning with Errors, Circular Security, and Fully Homomorphic Encryption. Public Key Cryptography (4) (2024)
Gabrielle De Micheli, Duhyeong Kim, Daniele Micciancio, Adam Suhl
Faster Amortized FHEW Bootstrapping Using Ring Automorphisms. Public Key Cryptography (4) (2024)
Andreea Alexandru, Ahmad Al Badawi, Daniele Micciancio, Yuriy Polyakov
Application-Aware Approximate Homomorphic Encryption: Configuring FHE for Practical Use. IACR Cryptol. ePrint Arch. 2024 (2024)
Gabrielle De Micheli, Daniele Micciancio, Alice Pellet-Mary, Nam Tran
Reductions from module lattices to free module lattices, and application to dequantizing module-LLL. IACR Cryptol. ePrint Arch. 2023 (2023)
Yongwoo Lee, Daniele Micciancio, Andrey Kim, Rakyong Choi, Maxim Deryabin, Jieun Eom, Donghoon Yoo
Efficient FHEW Bootstrapping with Small Evaluation Keys, and Applications to Threshold Homomorphic Encryption. EUROCRYPT (3) (2023)
Daniele Micciancio, Mark Schultz
Error Correction and Ciphertext Quantization in Lattice Cryptography. IACR Cryptol. ePrint Arch. 2023 (2023)
Yujin Nam, Minxuan Zhou, Saransh Gupta, Gabrielle De Micheli, Rosario Cammarota, Chris Wilkerson, Daniele Micciancio, Tajana Rosing
Efficient Machine Learning on Encrypted Data Using Hyperdimensional Computing. ISLPED (2023)
Baiyu Li, Daniele Micciancio, Mariana Raykova, Mark Schultz
Hintless Single-Server Private Information Retrieval. IACR Cryptol. ePrint Arch. 2023 (2023)
Daniele Micciancio, Adam Suhl
Simulation-Secure Threshold PKE from LWE with Polynomial Modulus. IACR Cryptol. ePrint Arch. 2023 (2023)
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
Collaborative Privacy-Preserving Analysis of Oncological Data using Multiparty Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2023 (2023)
Gabrielle De Micheli, Duhyeong Kim, Daniele Micciancio, Adam Suhl
Faster Amortized FHEW bootstrapping using Ring Automorphisms. IACR Cryptol. ePrint Arch. 2023 (2023)
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
OpenFHE: Open-Source Fully Homomorphic Encryption Library. IACR Cryptol. ePrint Arch. 2022 (2022)
Gabrielle De Micheli, Daniele Micciancio
A fully classical LLL algorithm for modules. IACR Cryptol. ePrint Arch. 2022 (2022)
Baiyu Li, Daniele Micciancio, Mark Schultz, Jessica Sorrell
Securing Approximate Homomorphic Encryption Using Differential Privacy. CRYPTO (1) (2022)
Daniele Micciancio, Mark Schultz
Error Correction and Ciphertext Quantization in Lattice Cryptography. CRYPTO (5) (2022)
Yongwoo Lee, Daniele Micciancio, Andrey Kim, Rakyong Choi, Maxim Deryabin, Jieun Eom, Donghoon Yoo
Efficient FHEW Bootstrapping with Small Evaluation Keys, and Applications to Threshold Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2022 (2022)
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
OpenFHE: Open-Source Fully Homomorphic Encryption Library. WAHC@CCS (2022)
Gabrielle De Micheli, Daniele Micciancio, Alice Pellet-Mary, Nam Tran
Reductions from Module Lattices to Free Module Lattices, and Application to Dequantizing Module-LLL. CRYPTO (5) (2022)
Zeyu Liu, Daniele Micciancio, Yuriy Polyakov
Large-Precision Homomorphic Sign Evaluation Using FHEW/TFHE Bootstrapping. ASIACRYPT (2) (2022)
Baiyu Li, Daniele Micciancio, Mark Schultz, Jessica Sorrell
Securing Approximate Homomorphic Encryption Using Differential Privacy. IACR Cryptol. ePrint Arch. 2022 (2022)
Zeyu Liu, Daniele Micciancio, Yuriy Polyakov
Large-Precision Homomorphic Sign Evaluation using FHEW/TFHE Bootstrapping. IACR Cryptol. ePrint Arch. 2021 (2021)
Daniele Micciancio, Yuriy Polyakov
Bootstrapping in FHEW-like Cryptosystems. WAHC@CCS (2021)
Baiyu Li, Daniele Micciancio
On the Security of Homomorphic Encryption on Approximate Numbers. EUROCRYPT (1) (2021)
Megan Chen, Carmit Hazay, Yuval Ishai, Yuriy Kashnikov, Daniele Micciancio, Tarik Riviere, Abhi Shelat, Muthu Venkitasubramaniam, Ruihan Wang
Diogenes: Lightweight Scalable RSA Modulus Generation with a Dishonest Majority. IEEE Symposium on Security and Privacy (2021)
Megan Chen, Carmit Hazay, Yuval Ishai, Yuriy Kashnikov, Daniele Micciancio, Tarik Riviere, Abhi Shelat, Muthuramakrishnan Venkitasubramaniam, Ruihan Wang
Diogenes: Lightweight Scalable RSA Modulus Generation with a Dishonest Majority. IACR Cryptol. ePrint Arch. 2020 (2020)
Daniele Micciancio, Yuriy Polyakov
Bootstrapping in FHEW-like Cryptosystems. IACR Cryptol. ePrint Arch. 2020 (2020)
Daniele Micciancio, Jessica Sorrell
Simpler Statistically Sender Private Oblivious Transfer from Ideals of Cyclotomic Integers. IACR Cryptol. ePrint Arch. 2020 (2020)
Nicholas Genise, Daniele Micciancio, Chris Peikert, Michael Walter
Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography. Public Key Cryptography (1) (2020)
Nicholas Genise, Daniele Micciancio, Chris Peikert, Michael Walter
Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography. IACR Cryptol. ePrint Arch. 2020 (2020)
Baiyu Li, Daniele Micciancio
On the Security of Homomorphic Encryption on Approximate Numbers. IACR Cryptol. ePrint Arch. 2020 (2020)
Daniele Micciancio, Jessica Sorrell
Simpler Statistically Sender Private Oblivious Transfer from Ideals of Cyclotomic Integers. ASIACRYPT (2) (2020)
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
Homomorphic Encryption Standard. IACR Cryptol. ePrint Arch. 2019 (2019)
Miran Kim, Yongsoo Song, Baiyu Li, Daniele Micciancio
Semi-parallel Logistic Regression for GWAS on Encrypted Data. IACR Cryptol. ePrint Arch. 2019 (2019)
Nicholas Genise, Craig Gentry, Shai Halevi, Baiyu Li, Daniele Micciancio
Homomorphic Encryption for Finite Automata. IACR Cryptol. ePrint Arch. 2019 (2019)
Nicholas Genise, Daniele Micciancio, Yuriy Polyakov
Building an Efficient Lattice Gadget Toolkit: Subgaussian Sampling and More. EUROCRYPT (2) (2019)
Nicholas Genise, Craig Gentry, Shai Halevi, Baiyu Li, Daniele Micciancio
Homomorphic Encryption for Finite Automata. ASIACRYPT (2) (2019)
Daniele Micciancio
Symbolic Encryption with Pseudorandom Keys. EUROCRYPT (3) (2019)
Nicholas Genise, Daniele Micciancio
Faster Gaussian Sampling for Trapdoor Lattices with Arbitrary Modulus. EUROCRYPT (1) (2018)
Daniele Micciancio
On the Hardness of Learning With Errors with Binary Secrets. Theory Comput. 14 (1) (2018)
Daniele Micciancio, Jessica Sorrell
Ring Packing and Amortized FHEW Bootstrapping. ICALP (2018)
Daniele Micciancio, Michael Walter
On the Bit Security of Cryptographic Primitives. IACR Cryptol. ePrint Arch. 2018 (2018)
Daniele Micciancio, Jessica Sorrell
Ring packing and amortized FHEW bootstrapping. IACR Cryptol. ePrint Arch. 2018 (2018)
Nicholas Genise, Daniele Micciancio, Yuriy Polyakov
Building an Efficient Lattice Gadget Toolkit: Subgaussian Sampling and More. IACR Cryptol. ePrint Arch. 2018 (2018)
Baiyu Li, Daniele Micciancio
Symbolic security of garbled circuits. IACR Cryptol. ePrint Arch. 2018 (2018)
Cheng Chen, Nicholas Genise, Daniele Micciancio, Yuriy Polyakov, Kurt Rohloff
Implementing Token-Based Obfuscation under (Ring) LWE. IACR Cryptol. ePrint Arch. 2018 (2018)
Daniele Micciancio
On the Hardness of Learning With Errors with Binary Secrets. IACR Cryptol. ePrint Arch. 2018 (2018)
Baiyu Li, Daniele Micciancio
Equational Security Proofs of Oblivious Transfer Protocols. Public Key Cryptography (1) (2018)
Vadim Lyubashevsky, Daniele Micciancio
Asymptotically Efficient Lattice-Based Digital Signatures. J. Cryptol. 31 (3) (2018)
Daniele Micciancio, Michael Walter
On the Bit Security of Cryptographic Primitives. EUROCRYPT (1) (2018)
Baiyu Li, Daniele Micciancio
Symbolic Security of Garbled Circuits. CSF (2018)
Daniele Micciancio, Michael Walter
Gaussian Sampling over the Integers: Efficient, Generic, Constant-Time. IACR Cryptol. ePrint Arch. 2017 (2017)
Johannes Buchmann, Niklas Büscher, Florian Göpfert, Stefan Katzenbeisser, Juliane Krämer, Daniele Micciancio, Sander Siim, Christine van Vredendaal, Michael Walter
Creating Cryptographic Challenges Using Multi-Party Computation: The LWE Challenge. IACR Cryptol. ePrint Arch. 2017 (2017)
Nicholas Genise, Daniele Micciancio
Faster Gaussian Sampling for Trapdoor Lattices with Arbitrary Modulus. IACR Cryptol. ePrint Arch. 2017 (2017)
Daniele Micciancio, Michael Walter
Gaussian Sampling over the Integers: Efficient, Generic, Constant-Time. CRYPTO (2) (2017)
Johannes Buchmann, Niklas Büscher, Florian Göpfert, Stefan Katzenbeisser, Juliane Krämer, Daniele Micciancio, Sander Siim, Christine van Vredendaal, Michael Walter
Creating Cryptographic Challenges Using Multi-Party Computation: The LWE Challenge. AsiaPKC@AsiaCCS (2016)
Baiyu Li, Daniele Micciancio
Compactness vs Collusion Resistance in Functional Encryption. TCC (B2) (2016)
Daniele Micciancio, Michael Walter
Practical, Predictable Lattice Basis Reduction. EUROCRYPT (1) (2016)
Baiyu Li, Daniele Micciancio
Equational Security Proofs of Oblivious Transfer Protocols. IACR Cryptol. ePrint Arch. 2016 (2016)
Baiyu Li, Daniele Micciancio
Compactness vs Collusion Resistance in Functional Encryption. IACR Cryptol. ePrint Arch. 2016 (2016)
Daniele Micciancio, Michael Walter
Practical, Predictable Lattice Basis Reduction. IACR Cryptol. ePrint Arch. 2015 (2015)
Daniele Micciancio, Michael Walter
Fast Lattice Point Enumeration with Minimal Overhead. SODA (2015)
Léo Ducas, Daniele Micciancio
FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second. EUROCRYPT (1) (2015)
Léo Ducas, Daniele Micciancio
FHE Bootstrapping in less than a second. IACR Cryptol. ePrint Arch. 2014 (2014)
Léo Ducas, Daniele Micciancio
Improved Short Lattice Signatures in the Standard Model. IACR Cryptol. ePrint Arch. 2014 (2014)
Daniele Micciancio
Locally Dense Codes. Computational Complexity Conference (2014)
Daniele Micciancio, Michael Walter
Fast Lattice Point Enumeration with Minimal Overhead. IACR Cryptol. ePrint Arch. 2014 (2014)
Léo Ducas, Daniele Micciancio
Improved Short Lattice Signatures in the Standard Model. CRYPTO (1) (2014)
Daniele Micciancio, Chris Peikert
Hardness of SIS and LWE with Small Parameters. CRYPTO (1) (2013)
Daniele Micciancio, Chris Peikert
Hardness of SIS and LWE with Small Parameters. IACR Cryptol. ePrint Arch. 2013 (2013)
Vadim Lyubashevsky, Daniele Micciancio
Asymptotically Effi cient Lattice-Based Digital Signatures. IACR Cryptol. ePrint Arch. 2013 (2013)
Daniele Micciancio, Panagiotis Voulgaris
A Deterministic Single Exponential Time Algorithm for Most Lattice Problems Based on Voronoi Cell Computations. SIAM J. Comput. 42 (3) (2013)
Daniel Dadush, Daniele Micciancio
Algorithms for the Densest Sub-Lattice Problem. SODA (2013)
Daniele Micciancio
Locally Dense Codes. Electron. Colloquium Comput. Complex. 20 (2013)
Daniele Micciancio, Stefano Tessaro
An equational approach to secure multi-party computation. ITCS (2013)
Daniele Micciancio
Inapproximability of the Shortest Vector Problem: Toward a Deterministic Reduction. Electron. Colloquium Comput. Complex. 19 (2012)
Daniele Micciancio
Inapproximability of the Shortest Vector Problem: Toward a Deterministic Reduction. Theory Comput. 8 (1) (2012)
Daniele Micciancio, Chris Peikert
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller. EUROCRYPT (2012)
Daniele Micciancio, Petros Mol
Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions. CRYPTO (2011)
Daniele Micciancio
The Geometry of Lattice Cryptography. FOSAD (2011)
Daniele Micciancio, Chris Peikert
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller. IACR Cryptol. ePrint Arch. 2011 (2011)
Daniele Micciancio, Petros Mol
Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions. IACR Cryptol. ePrint Arch. 2011 (2011)
Daniele Micciancio, Panagiotis Voulgaris
A Deterministic Single Exponential Time Algorithm for Most Lattice Problems based on Voronoi Cell Computations. Electron. Colloquium Comput. Complex. 17 (2010)
Daniele Micciancio
A first glimpse of cryptography's Holy Grail. Commun. ACM 53 (3) (2010)
Daniele Micciancio
The RSA Group is Pseudo-Free. J. Cryptol. 23 (2) (2010)
Daniele Micciancio, Panagiotis Voulgaris
A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations. STOC (2010)
Daniele Micciancio, Panagiotis Voulgaris
Faster Exponential Time Algorithms for the Shortest Vector Problem. SODA (2010)
Daniele Micciancio
Computational Soundness, Co-induction, and Encryption Cycles. EUROCRYPT (2010)
Vadim Lyubashevsky, Daniele Micciancio
On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem. CRYPTO (2009)
Daniele Micciancio
Pseudo-randomness and partial information in symbolic security analysis. IACR Cryptol. ePrint Arch. 2009 (2009)
Panagiotis Voulgaris, Daniele Micciancio
Faster exponential time algorithms for the shortest vector problem. Electron. Colloquium Comput. Complex. 16 (2009)
Daniele Micciancio
Computational soundness, co-induction, and encryption cycles. IACR Cryptol. ePrint Arch. 2009 (2009)
Vadim Lyubashevsky, Daniele Micciancio
Asymptotically Efficient Lattice-Based Digital Signatures. TCC (2008)
Daniele Micciancio
Efficient reductions among lattice problems. SODA (2008)
Alejandro Hevia, Daniele Micciancio
An Indistinguishability-Based Characterization of Anonymous Channels. Privacy Enhancing Technologies (2008)
Daniele Micciancio, Scott Yilek
The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization. TCC (2008)
Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen
SWIFFT: A Modest Proposal for FFT Hashing. FSE (2008)
Daniele Micciancio, Saurabh Panjwani
Optimal communication complexity of generic multicast key distribution. IEEE/ACM Trans. Netw. 16 (4) (2008)
Daniele Micciancio, Antonio Nicolosi
Efficient bounded distance decoders for Barnes-Wall lattices. ISIT (2008)
Daniele Micciancio, Oded Regev
Worst-Case to Average-Case Reductions Based on Gaussian Measures. SIAM J. Comput. 37 (1) (2007)

Daniele Micciancio.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Daniele Micciancio