Daniele Micciancio

According to our database, Daniele Micciancio authored at least 116 papers between 1995 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Application-Aware Approximate Homomorphic Encryption: Configuring FHE for Practical Use.

Andreea Alexandru, Ahmad Al Badawi, Daniele Micciancio, Yuriy Polyakov

IACR Cryptol. ePrint Arch., 2024

SoK: Learning with Errors, Circular Security, and Fully Homomorphic Encryption.

Daniele Micciancio, Vinod Vaikuntanathan

Proceedings of the Public-Key Cryptography - PKC 2024, 2024

2023

Reductions from module lattices to free module lattices, and application to dequantizing module-LLL.

Gabrielle De Micheli, Daniele Micciancio, Alice Pellet-Mary, Nam Tran

IACR Cryptol. ePrint Arch., 2023

Faster Amortized FHEW bootstrapping using Ring Automorphisms.

Gabrielle De Micheli, Duhyeong Kim, Daniele Micciancio, Adam Suhl

IACR Cryptol. ePrint Arch., 2023

Simulation-Secure Threshold PKE from LWE with Polynomial Modulus.

Daniele Micciancio, Adam Suhl

IACR Cryptol. ePrint Arch., 2023

Error Correction and Ciphertext Quantization in Lattice Cryptography.

Daniele Micciancio, Mark Schultz

IACR Cryptol. ePrint Arch., 2023

Hintless Single-Server Private Information Retrieval.

Baiyu Li, Daniele Micciancio, Mariana Raykova, Mark Schultz

IACR Cryptol. ePrint Arch., 2023

Collaborative Privacy-Preserving Analysis of Oncological Data using Multiparty Homomorphic Encryption.

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

IACR Cryptol. ePrint Arch., 2023

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

Proceedings of the IEEE/ACM International Symposium on Low Power Electronics and Design, 2023

2022

A fully classical LLL algorithm for modules.

Gabrielle De Micheli, Daniele Micciancio

IACR Cryptol. ePrint Arch., 2022

Securing Approximate Homomorphic Encryption Using Differential Privacy.

Baiyu Li, Daniele Micciancio, Mark Schultz, Jessica Sorrell

IACR Cryptol. ePrint Arch., 2022

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

IACR Cryptol. ePrint Arch., 2022

OpenFHE: Open-Source Fully Homomorphic Encryption Library.

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

IACR Cryptol. ePrint Arch., 2022

2021

Large-Precision Homomorphic Sign Evaluation using FHEW/TFHE Bootstrapping.

Zeyu Liu, Daniele Micciancio, Yuriy Polyakov

IACR Cryptol. ePrint Arch., 2021

2020

Simpler Statistically Sender Private Oblivious Transfer from Ideals of Cyclotomic Integers.

Daniele Micciancio, Jessica Sorrell

IACR Cryptol. ePrint Arch., 2020

Bootstrapping in FHEW-like Cryptosystems.

Daniele Micciancio, Yuriy Polyakov

IACR Cryptol. ePrint Arch., 2020

On the Security of Homomorphic Encryption on Approximate Numbers.

Baiyu Li, Daniele Micciancio

IACR Cryptol. ePrint Arch., 2020

Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography.

Nicholas Genise, Daniele Micciancio, Chris Peikert, Michael Walter

IACR Cryptol. ePrint Arch., 2020

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

IACR Cryptol. ePrint Arch., 2020

2019

Semi-parallel Logistic Regression for GWAS on Encrypted Data.

Miran Kim, Yongsoo Song, Baiyu Li, Daniele Micciancio

IACR Cryptol. ePrint Arch., 2019

Homomorphic Encryption for Finite Automata.

Nicholas Genise, Craig Gentry, Shai Halevi, Baiyu Li, Daniele Micciancio

IACR Cryptol. ePrint Arch., 2019

Homomorphic Encryption Standard.

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

IACR Cryptol. ePrint Arch., 2019

Symbolic Encryption with Pseudorandom Keys.

Daniele Micciancio

Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Interactive proofs for lattice problems.

Daniele Micciancio

Proceedings of the Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, 2019

2018

On the Hardness of Learning With Errors with Binary Secrets.

Daniele Micciancio

Theory Comput., 2018

Asymptotically Efficient Lattice-Based Digital Signatures.

Vadim Lyubashevsky, Daniele Micciancio

J. Cryptol., 2018

Ring packing and amortized FHEW bootstrapping.

Daniele Micciancio, Jessica Sorrell

IACR Cryptol. ePrint Arch., 2018

On the Bit Security of Cryptographic Primitives.

Daniele Micciancio, Michael Walter

IACR Cryptol. ePrint Arch., 2018

Symbolic security of garbled circuits.

Baiyu Li, Daniele Micciancio

IACR Cryptol. ePrint Arch., 2018

Building an Efficient Lattice Gadget Toolkit: Subgaussian Sampling and More.

Nicholas Genise, Daniele Micciancio, Yuriy Polyakov

IACR Cryptol. ePrint Arch., 2018

Implementing Token-Based Obfuscation under (Ring) LWE.

Cheng Chen, Nicholas Genise, Daniele Micciancio, Yuriy Polyakov, Kurt Rohloff

IACR Cryptol. ePrint Arch., 2018

2017

Gaussian Sampling over the Integers: Efficient, Generic, Constant-Time.

Daniele Micciancio, Michael Walter

IACR Cryptol. ePrint Arch., 2017

Faster Gaussian Sampling for Trapdoor Lattices with Arbitrary Modulus.

Nicholas Genise, Daniele Micciancio

IACR Cryptol. ePrint Arch., 2017

Creating Cryptographic Challenges Using Multi-Party Computation: The LWE Challenge.

Johannes Buchmann, Niklas Büscher, Florian Göpfert, Stefan Katzenbeisser, Juliane Krämer, Daniele Micciancio, Sander Siim, Christine van Vredendaal, Michael Walter

IACR Cryptol. ePrint Arch., 2017

2016

Shortest Vector Problem.

Daniele Micciancio

Encyclopedia of Algorithms, 2016

Equational Security Proofs of Oblivious Transfer Protocols.

Baiyu Li, Daniele Micciancio

IACR Cryptol. ePrint Arch., 2016

Compactness vs Collusion Resistance in Functional Encryption.

Baiyu Li, Daniele Micciancio

IACR Cryptol. ePrint Arch., 2016

2015

Practical, Predictable Lattice Basis Reduction.

Daniele Micciancio, Michael Walter

IACR Cryptol. ePrint Arch., 2015

FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second.

Léo Ducas, Daniele Micciancio

Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

2014

Fast Lattice Point Enumeration with Minimal Overhead.

Daniele Micciancio, Michael Walter

IACR Cryptol. ePrint Arch., 2014

FHE Bootstrapping in less than a second.

Léo Ducas, Daniele Micciancio

IACR Cryptol. ePrint Arch., 2014

Improved Short Lattice Signatures in the Standard Model.

Léo Ducas, Daniele Micciancio

IACR Cryptol. ePrint Arch., 2014

2013

Hardness of SIS and LWE with Small Parameters.

Daniele Micciancio, Chris Peikert

IACR Cryptol. ePrint Arch., 2013

Asymptotically Effi cient Lattice-Based Digital Signatures.

Vadim Lyubashevsky, Daniele Micciancio

IACR Cryptol. ePrint Arch., 2013

Locally Dense Codes.

Daniele Micciancio

Electron. Colloquium Comput. Complex., 2013

Algorithms for the Densest Sub-Lattice Problem.

Daniel Dadush, Daniele Micciancio

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

An equational approach to secure multi-party computation.

Daniele Micciancio, Stefano Tessaro

Proceedings of the Innovations in Theoretical Computer Science, 2013

2012

Inapproximability of the Shortest Vector Problem: Toward a Deterministic Reduction.

Daniele Micciancio

Theory Comput., 2012

2011

Shortest Vector Problem.

Daniele Micciancio

Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Lattice-Based Cryptography.

Daniele Micciancio

Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Closest Vector Problem.

Daniele Micciancio

Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller.

Daniele Micciancio, Chris Peikert

IACR Cryptol. ePrint Arch., 2011

Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions.

Daniele Micciancio, Petros Mol

IACR Cryptol. ePrint Arch., 2011

The Geometry of Lattice Cryptography.

Daniele Micciancio

Proceedings of the Foundations of Security Analysis and Design VI, 2011

2010

Cryptographic Functions from Worst-Case Complexity Assumptions.

Daniele Micciancio

Proceedings of the LLL Algorithm - Survey and Applications, 2010

The RSA Group is Pseudo-Free.

Daniele Micciancio

J. Cryptol., 2010

A Deterministic Single Exponential Time Algorithm for Most Lattice Problems based on Voronoi Cell Computations.

Daniele Micciancio, Panagiotis Voulgaris

Electron. Colloquium Comput. Complex., 2010

A first glimpse of cryptography's Holy Grail.

Daniele Micciancio

Commun. ACM, 2010

2009

Pseudo-randomness and partial information in symbolic security analysis.

Daniele Micciancio

IACR Cryptol. ePrint Arch., 2009

Computational soundness, co-induction, and encryption cycles.

Daniele Micciancio

IACR Cryptol. ePrint Arch., 2009

Faster exponential time algorithms for the shortest vector problem.

Panagiotis Voulgaris, Daniele Micciancio

Electron. Colloquium Comput. Complex., 2009

On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem.

Vadim Lyubashevsky, Daniele Micciancio

Proceedings of the Advances in Cryptology, 2009

2008

Shortest Vector Problem.

Daniele Micciancio

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Optimal communication complexity of generic multicast key distribution.

Daniele Micciancio, Saurabh Panjwani

IEEE/ACM Trans. Netw., 2008

The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization.

Daniele Micciancio, Scott Yilek

Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Efficient reductions among lattice problems.

Daniele Micciancio

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

An Indistinguishability-Based Characterization of Anonymous Channels.

Alejandro Hevia, Daniele Micciancio

Proceedings of the Privacy Enhancing Technologies, 2008

Efficient bounded distance decoders for Barnes-Wall lattices.

Daniele Micciancio, Antonio Nicolosi

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

SWIFFT: A Modest Proposal for FFT Hashing.

Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen

Proceedings of the Fast Software Encryption, 15th International Workshop, 2008

2007

Worst-Case to Average-Case Reductions Based on Gaussian Measures.

Daniele Micciancio, Oded Regev

SIAM J. Comput., 2007

Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions.

Daniele Micciancio

Comput. Complex., 2007

2006

Special Issue: FOCS 2003.

Chandra Chekuri, Daniele Micciancio

J. Comput. Syst. Sci., 2006

Corrupting One vs. Corrupting Many: The Case of Broadcast and Multicast Encryption.

Daniele Micciancio, Saurabh Panjwani

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

On Bounded Distance Decoding for General Lattices.

Yi-Kai Liu, Vadim Lyubashevsky, Daniele Micciancio

Proceedings of the Approximation, 2006

2005

Shortest Vector Problem.

Daniele Micciancio

Proceedings of the Encyclopedia of Cryptography and Security, 2005

Lattice Based Cryptography.

Daniele Micciancio

Proceedings of the Encyclopedia of Cryptography and Security, 2005

Closest Vector Problem.

Daniele Micciancio

Proceedings of the Encyclopedia of Cryptography and Security, 2005

Generalized Compact Knapsacks are Collision Resistant

Vadim Lyubashevsky, Daniele Micciancio

Electron. Colloquium Comput. Complex., 2005

Concurrent Zero Knowledge without Complexity Assumptions

Daniele Micciancio, Shien Jin Ong, Amit Sahai, Salil P. Vadhan

Electron. Colloquium Comput. Complex., 2005

The complexity of the covering radius problem.

Venkatesan Guruswami, Daniele Micciancio, Oded Regev

Comput. Complex., 2005

Adaptive Security of Symbolic Encryption.

Daniele Micciancio, Saurabh Panjwani

Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Simultaneous broadcast revisited.

Alejandro Hevia, Daniele Micciancio

Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

2004

The inapproximability of lattice and coding problems with preprocessing.

Uriel Feige, Daniele Micciancio

J. Comput. Syst. Sci., 2004

Completeness Theorems for the Abadi-Rogaway Language of Encrypted Expressions.

Daniele Micciancio, Bogdan Warinschi

J. Comput. Secur., 2004

Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions

Daniele Micciancio

Electron. Colloquium Comput. Complex., 2004

Soundness of Formal Encryption in the Presence of Active Adversaries.

Daniele Micciancio, Bogdan Warinschi

Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004

The Complexity of the Covering Radius Problem on Lattices and Codes.

Venkatesan Guruswami, Daniele Micciancio, Oded Regev

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

Daniele Micciancio

Electron. Colloquium Comput. Complex., 2003

A Note on the Minimal Volume of Almost Cubic Parallelepipeds.

Daniele Micciancio

Discret. Comput. Geom., 2003

Simulatable Commitments and Efficient Concurrent Zero-Knowledge.

Daniele Micciancio, Erez Petrank

Proceedings of the Advances in Cryptology, 2003

Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions.

Mihir Bellare, Daniele Micciancio, Bogdan Warinschi

Proceedings of the Advances in Cryptology, 2003

Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More.

Daniele Micciancio, Salil P. Vadhan

Proceedings of the Advances in Cryptology, 2003

2002

Efficient and Concurrent Zero-Knowledge from any public coin HVZK protocol

Daniele Micciancio, Erez Petrank

Electron. Colloquium Comput. Complex., 2002

Improved cryptographic hash functions with worst-case/average-case connection.

Daniele Micciancio

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.

Tal Malkin, Daniele Micciancio, Sara K. Miner

Proceedings of the Advances in Cryptology - EUROCRYPT 2002, International Conference on the Theory and Applications of Cryptographic Techniques, Amsterdam, The Netherlands, April 28, 2002

Cryptanalysis of a Pseudorandom Generator Based on Braid Groups.

Rosario Gennaro, Daniele Micciancio

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.

Alejandro Hevia, Daniele Micciancio

Proceedings of the Advances in Cryptology, 2002

Complexity of lattice problems - a cryptographic perspective.

Daniele Micciancio, Shafi Goldwasser

The Kluwer international series in engineering and computer science 671, Springer, ISBN: 978-0-7923-7688-0, 2002

2001

The hardness of the closest vector problem with preprocessing.

Daniele Micciancio

IEEE Trans. Inf. Theory, 2001

Composition and Efficiency Tradeoffs for Forward-Secure Digital Signatures.

Tal Malkin, Daniele Micciancio, Sara Miner More

IACR Cryptol. ePrint Arch., 2001

A linear space algorithm for computing the herite normal form.

Daniele Micciancio, Bogdan Warinschi

Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, 2001

Improving Lattice Based Cryptosystems Using the Hermite Normal Form.

Daniele Micciancio

Proceedings of the Cryptography and Lattices, International Conference, 2001

2000

A Linear Space Algorithm for Computing the Hermite Normal Form

Daniele Micciancio, Bogdan Warinschi

Electron. Colloquium Comput. Complex., 2000

1999

Approximating Shortest Lattice Vectors is not Harder than Approximating Closest Lattice Vectors.

Oded Goldreich, Daniele Micciancio, Shmuel Safra, Jean-Pierre Seifert

Inf. Process. Lett., 1999

Lattice Based Cryptography: A Global Improvement.

Daniele Micciancio

IACR Cryptol. ePrint Arch., 1999

Hardness of Approximating the Minimum Distance of a Linear Code

Ilya Dumer, Daniele Micciancio, Madhu Sudan

Electron. Colloquium Comput. Complex., 1999

Multicast Security: A Taxonomy and Some Efficient Constructions.

Ran Canetti, Juan A. Garay, Gene Itkis, Daniele Micciancio, Moni Naor, Benny Pinkas

Proceedings of the Proceedings IEEE INFOCOM '99, 1999

1998

On the hardness of the shortest vector problem.

Daniele Micciancio

PhD thesis, 1998

An Efficient Non-Interactive Statistical Zero-Knowledge Proof System for Quasi-Safe Prime Products.

Rosario Gennaro, Daniele Micciancio, Tal Rabin

IACR Cryptol. ePrint Arch., 1998

The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant.

Daniele Micciancio

Electron. Colloquium Comput. Complex., 1998

Perfectly One-Way Probabilistic Hash Functions (Preliminary Version).

Ran Canetti, Daniele Micciancio, Omer Reingold

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

1997

A New Paradigm for Collision-free Hashing: Incrementality at Reduced Cost.

Mihir Bellare, Daniele Micciancio

IACR Cryptol. ePrint Arch., 1997

An Algorithm for the Solution of Tree Equations.

Sabrina Mantaci, Daniele Micciancio

Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

Oblivious Data Structures: Applications to Cryptography.

Daniele Micciancio

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

"Pseudo-Random" Number Generation Within Cryptographic Algorithms: The DDS Case.

Mihir Bellare, Shafi Goldwasser, Daniele Micciancio

Proceedings of the Advances in Cryptology, 1997

1995

Analysis of Pure PROLOG Programs.

Giorgio Levi, Daniele Micciancio

Proceedings of the 1995 Joint Conference on Declarative Programming, 1995