Daniele Micciancio

发表

Closest Vector Problem

Daniele Micciancio, 2005, Encyclopedia of Cryptography and Security.

Inapproximability of the Shortest Vector Problem: Toward a Deterministic Reduction

Daniele Micciancio, Daniele Micciancio, 2012, Theory Comput..

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

Mihir Bellare, Daniele Micciancio, M. Bellare, 1997, EUROCRYPT.

Completeness Theorems for the Abadi-Rogaway Language of Encrypted Expressions

Bogdan Warinschi, Daniele Micciancio, Daniele Micciancio, 2004, J. Comput. Secur..

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

Daniele Micciancio, Michael Walter, Daniele Micciancio, 2017, CRYPTO.

An Algorithm for the Solution of Tree Equations

Sabrina Mantaci, Daniele Micciancio, 1997, TAPSOFT.

Closest Vector Problem

Daniele Micciancio, Daniele Micciancio, 2011, Encyclopedia of Cryptography and Security.

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

Daniele Micciancio, Daniele Micciancio, 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

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

Daniele Micciancio, Petros Mol, Daniele Micciancio, 2011, CRYPTO.

Implementing Token-Based Obfuscation under (Ring) LWE

Cheng Chen, Daniele Micciancio, Kurt Rohloff, 2018, IACR Cryptol. ePrint Arch..

Semi-Parallel logistic regression for GWAS on encrypted data

Daniele Micciancio, Yongsoo Song, Baiyu Li, 2020, BMC Medical Genomics.

SWIFFT: A Modest Proposal for FFT Hashing

Chris Peikert, Alon Rosen, Daniele Micciancio, 2008, FSE.

Advances in Cryptology – CRYPTO 2020: 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part II

Thomas Ristenpart, Daniele Micciancio, 2020, CRYPTO.

Faster exponential time algorithms for the shortest vector problem

Daniele Micciancio, Panagiotis Voulgaris, Daniele Micciancio, 2010, SODA '10.

Asymptotically Effi cient Lattice-Based Digital Signatures

Daniele Micciancio, Vadim Lyubashevsky, 2008, IACR Cryptol. ePrint Arch..

Shortest Vector Problem

Daniele Micciancio, 2005, Encyclopedia of Cryptography and Security.

Perfectly One-Way Probabilistic Hash Functions

Ran Canetti, Omer Reingold, Daniele Micciancio, 1998, Symposium on the Theory of Computing.

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

Daniele Micciancio, 2007, computational complexity.

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

Daniele Micciancio, 2000, SIAM J. Comput..

Hardness of SIS and LWE with Small Parameters

Chris Peikert, Daniele Micciancio, Chris Peikert, 2013, CRYPTO.

Shortest Vector Problem

Daniele Micciancio, Daniele Micciancio, 2011, Encyclopedia of Cryptography and Security.

Advances in Cryptology – CRYPTO 2020: 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part III

Thomas Ristenpart, Daniele Micciancio, 2020, CRYPTO.

The complexity of the covering radius problem on lattices and codes

Venkatesan Guruswami, Daniele Micciancio, Oded Regev, 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

Locally Dense Codes

Daniele Micciancio, Daniele Micciancio, 2014, 2014 IEEE 29th Conference on Computational Complexity (CCC).

An equational approach to secure multi-party computation

Stefano Tessaro, Daniele Micciancio, Stefano Tessaro, 2013, ITCS '13.

Algorithms for the Densest Sub-Lattice Problem

Daniel Dadush, Daniele Micciancio, D. Dadush, 2013, SODA.

Approximating Shortest Lattice Vectors is Not Harder Than Approximating Closest Lattice Vectors

Jean-Pierre Seifert, Oded Goldreich, Shmuel Safra, 1999, Electron. Colloquium Comput. Complex..

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

Erez Petrank, Daniele Micciancio, 2002, IACR Cryptol. ePrint Arch..

Cryptanalysis of a Pseudorandom Generator Based on Braid Groups

Rosario Gennaro, Daniele Micciancio, R. Gennaro, 2002, EUROCRYPT.

Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography

Michael Walter, Chris Peikert, Daniele Micciancio, 2020, IACR Cryptol. ePrint Arch..

Theory of Cryptography

Daniele Micciancio, 2010, Lecture Notes in Computer Science.

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

Stefan Katzenbeisser, Daniele Micciancio, Juliane Krämer, 2016, AsiaPKC '16.

On Bounded Distance Decoding for General Lattices

Daniele Micciancio, Vadim Lyubashevsky, Yi-Kai Liu, 2006, APPROX-RANDOM.

On the Bit Security of Cryptographic Primitives

Daniele Micciancio, Michael Walter, Daniele Micciancio, 2018, IACR Cryptol. ePrint Arch..

Simpler Statistically Sender Private Oblivious Transfer from Ideals of Cyclotomic Integers

Daniele Micciancio, Jessica Sorrell, Daniele Micciancio, 2020, IACR Cryptol. ePrint Arch..

The complexity of the covering radius problem

Venkatesan Guruswami, Daniele Micciancio, Oded Regev, 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

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

Daniele Micciancio, 2002, STOC '02.

Software-Based Attestation

Srdjan Capkun, Qijun Gu, Tor Helleseth, 2011, Encyclopedia of Cryptography and Security.

On the hardness of the shortest vector problem

Daniele Micciancio, Daniele Micciancio, 1998 .

Bootstrapping in FHEW-like Cryptosystems

Daniele Micciancio, Yuriy Polyakov, Daniele Micciancio, 2021, IACR Cryptol. ePrint Arch..

Speaker Identification and Verification (SIV)

Srdjan Capkun, Qijun Gu, Tor Helleseth, 2011, Encyclopedia of Cryptography and Security.

An Indistinguishability-Based Characterization of Anonymous Channels

Daniele Micciancio, Alejandro Hevia, Daniele Micciancio, 2008, Privacy Enhancing Technologies.

The RSA Group is Pseudo-Free

Daniele Micciancio, Daniele Micciancio, 2005, Journal of Cryptology.

An efficient non-interactive statistical zero-knowledge proof system for quasi-safe prime products

Tal Rabin, Rosario Gennaro, Daniele Micciancio, 1998, CCS '98.

A Deterministic Single Exponential Time Algorithm for Most Lattice Problems based on Voronoi Cell Computations ( Extended Abstract )

Daniele Micciancio, Panagiotis Voulgaris, Daniele Micciancio, 2009 .

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

Daniele Micciancio, Vadim Lyubashevsky, Vadim Lyubashevsky, 2009, CRYPTO.

Theory of Cryptography

Bogdan Warinschi, Daniele Micciancio, Daniele Micciancio, 2004, Lecture Notes in Computer Science.

Faster Gaussian Sampling for Trapdoor Lattices with Arbitrary Modulus

Daniele Micciancio, Nicholas Genise, Daniele Micciancio, 2018, IACR Cryptol. ePrint Arch..

The inapproximability of lattice and coding problems with preprocessing

Uriel Feige, Daniele Micciancio, 2004, J. Comput. Syst. Sci..

Compactness vs Collusion Resistance in Functional Encryption

Daniele Micciancio, Baiyu Li, Daniele Micciancio, 2016, IACR Cryptol. ePrint Arch..

Improved Short Lattice Signatures in the Standard Model

Léo Ducas, Daniele Micciancio, Daniele Micciancio, 2014, CRYPTO.

Proceedings of the 7th international conference on Theory of Cryptography

Daniele Micciancio, Daniele Micciancio, 2010 .

Shortest Vector Problem

Daniele Micciancio, Daniele Micciancio, 2005, Encyclopedia of Cryptography and Security.

The RSA Group is Pseudo-Free

Daniele Micciancio, 2009, Journal of Cryptology.

Multicast security: a taxonomy and some efficient constructions

Moni Naor, Benny Pinkas, Ran Canetti, 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

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

Mihir Bellare, Bogdan Warinschi, Daniele Micciancio, 2003, EUROCRYPT.

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

Daniele Micciancio, Daniele Micciancio, 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

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

Daniele Micciancio, Scott Yilek, 2008, TCC.

Ring Packing and Amortized FHEW Bootstrapping

Daniele Micciancio, Jessica Sorrell, 2018, ICALP.

Efficient Generic Forward-Secure Signatures with an Unbounded Number Of Time Periods

Tal Malkin, Daniele Micciancio, Sara Miner More, 2002, EUROCRYPT.

Computational soundness, co-induction, and encryption cycles

Daniele Micciancio, Daniele Micciancio, 2010, IACR Cryptol. ePrint Arch..

A Note on the Minimal Volume of Almost Cubic Parallelepipeds

Daniele Micciancio, 2003, Discret. Comput. Geom..

Analysis of Pure PROLOG Programs

Giorgio Levi, Daniele Micciancio, G. Levi, 1995, GULP-PRODE.

Interactive Proof Systems

Shafi Goldwasser, Daniele Micciancio, 2002 .

Efficient cryptography based on lattices

Chris Peikert, Alon Rosen, Daniele Micciancio, 2012 .

FHE Bootstrapping in less than a second

Léo Ducas, Daniele Micciancio, 2014, IACR Cryptol. ePrint Arch..

Asymptotically Ecient Lattice-Based Digital Signatures (TCC 2008)

Daniele Micciancio, Vladimir Lyubashevsky, 2009 .

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

Daniele Micciancio, Saurabh Panjwani, S. Panjwani, 2006, ICALP.

Diogenes: Lightweight Scalable RSA Modulus Generation with a Dishonest Majority

Abhi Shelat, Yuval Ishai, Carmit Hazay, 2021, 2021 IEEE Symposium on Security and Privacy (SP).

On the Security of Homomorphic Encryption on Approximate Numbers

Daniele Micciancio, Baiyu Li, Daniele Micciancio, 2020, IACR Cryptol. ePrint Arch..

The hardness of the closest vector problem with preprocessing

Daniele Micciancio, Daniele Micciancio, 2001, IEEE Trans. Inf. Theory.

Building an Efficient Lattice Gadget Toolkit: Subgaussian Sampling and More

Daniele Micciancio, Yuriy Polyakov, Nicholas Genise, 2019, IACR Cryptol. ePrint Arch..

A first glimpse of cryptography's Holy Grail

Daniele Micciancio, Daniele Micciancio, 2010, CACM.

Oblivious data structures: applications to cryptography

Daniele Micciancio, Daniele Micciancio, 1997, STOC '97.

Cryptographic Functions from Worst-Case Complexity Assumptions

Daniele Micciancio, Daniele Micciancio, 2010, The LLL Algorithm.

Simulatable Commitments and Efficient Concurrent Zero-Knowledge

Erez Petrank, Daniele Micciancio, Daniele Micciancio, 2003, EUROCRYPT.

Foundations for Group Signatures: Simplified Requirements and a Construction Based on General Assumptions

Mihir Bellare, Bogdan Warinschi, Daniele Micciancio, 2003 .

Symbolic Security of Garbled Circuits

Daniele Micciancio, Baiyu Li, Daniele Micciancio, 2018, 2018 IEEE 31st Computer Security Foundations Symposium (CSF).

Erratum to: Theory of Cryptography

Daniele Micciancio, D. Micciancio, 2010, Theory of Cryptography Conference.

Homomorphic Encryption for Finite Automata

Craig Gentry, Shai Halevi, Daniele Micciancio, 2019, IACR Cryptol. ePrint Arch..

Issues in Multicast Security: A Taxonomy and E cient Constructions

Moni Naor, Benny Pinkas, Ran Canetti, 1999, IEEE Conference on Computer Communications.

The Geometry of Lattice Cryptography

Daniele Micciancio, Daniele Micciancio, 2011, FOSAD.

Shortest Vector Problem

Daniele Micciancio, 2005, Encyclopedia of Algorithms.

Practical, Predictable Lattice Basis Reduction

Daniele Micciancio, Michael Walter, Daniele Micciancio, 2016, EUROCRYPT.

Efficient reductions among lattice problems

Daniele Micciancio, Daniele Micciancio, 2008, SODA '08.

Pseudo-randomness and partial information in symbolic security analysis

Daniele Micciancio, Daniele Micciancio, 2009, IACR Cryptol. ePrint Arch..

Worst-case to average-case reductions based on Gaussian measures

Daniele Micciancio, Oded Regev, O. Regev, 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

The shortest vector in a lattice is hard to approximate to within some constant

Daniele Micciancio, Daniele Micciancio, 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

Perfectly one-way probabilistic hashing

Ran Canetti, Omer Reingold, Daniele Micciancio, 1998 .

Complexity of lattice problems

Shafi Goldwasser, Daniele Micciancio, S. Goldwasser, 2002 .

Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller

Chris Peikert, Daniele Micciancio, Chris Peikert, 2012, IACR Cryptol. ePrint Arch..

Interactive proofs for lattice problems

Daniele Micciancio, Daniele Micciancio, 2019, Providing Sound Foundations for Cryptography.

Generalized Compact Knapsacks Are Collision Resistant

Daniele Micciancio, Vadim Lyubashevsky, Vadim Lyubashevsky, 2006, ICALP.

Lattice-Based Cryptography

Daniele Micciancio, Daniele Micciancio, 2011, Encyclopedia of Cryptography and Security.

Adaptive Security of Symbolic Encryption

Daniele Micciancio, Saurabh Panjwani, S. Panjwani, 2005, TCC.

Soundness of Formal Encryption in the Presence of Active Adversaries

Bogdan Warinschi, Daniele Micciancio, Daniele Micciancio, 2004, TCC.

Perfectly one-way probabilistic hash functions (preliminary version)

Ran Canetti, Omer Reingold, Daniele Micciancio, 1998, STOC '98.

Concurrent Zero Knowledge without Complexity Assumptions

Amit Sahai, Daniele Micciancio, Salil P. Vadhan, 2006, Electron. Colloquium Comput. Complex..

Complexity of lattice problems - a cryptographic perspective

Shafi Goldwasser, Daniele Micciancio, S. Goldwasser, 2002, The Kluwer international series in engineering and computer science.

FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second

Léo Ducas, Daniele Micciancio, Daniele Micciancio, 2015, EUROCRYPT.

Special Issue: FOCS 2003

Daniele Micciancio, Chandra Chekuri, 2006, J. Comput. Syst. Sci..

Advanced Homomorphic Encryption its Applications and Derivatives (AHEAD)

Craig Gentry, Dan Boneh, Shai Halevi, 2013 .

Asymptotically Efficient Lattice-Based Digital Signatures

Daniele Micciancio, Vadim Lyubashevsky, Vadim Lyubashevsky, 2018, Journal of Cryptology.

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

Mihir Bellare, Shafi Goldwasser, Daniele Micciancio, 1997, CRYPTO.

Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor

Daniele Micciancio, 2003, SIAM J. Comput..

Fast Lattice Point Enumeration with Minimal Overhead

Daniele Micciancio, Michael Walter, Daniele Micciancio, 2015, SODA.

On the Hardness of Learning With Errors with Binary Secrets

Daniele Micciancio, Daniele Micciancio, 2018, IACR Cryptol. ePrint Arch..

The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes

Daniele Micciancio, Alejandro Hevia, Daniele Micciancio, 2002, ASIACRYPT.

The inapproximability of lattice and coding problems with preprocessing

Uriel Feige, Daniele Micciancio, U. Feige, 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

Homomorphic Encryption Standard

Amit Sahai, Satyanarayana V. Lokam, Vinod Vaikuntanathan, 2019, IACR Cryptol. ePrint Arch..

Worst-case to average-case reductions based on Gaussian measures

Daniele Micciancio, Oded Regev, 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

Improving Lattice Based Cryptosystems Using the Hermite Normal Form

Daniele Micciancio, Daniele Micciancio, 2001, CaLC.

Hardness of approximating the minimum distance of a linear code

Madhu Sudan, Daniele Micciancio, Ilya Dumer, 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

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

Daniele Micciancio, Salil P. Vadhan, S. Vadhan, 2003, CRYPTO.

Symbolic Encryption with Pseudorandom Keys

Daniele Micciancio, Daniele Micciancio, 2019, EUROCRYPT.

Optimal Communication Complexity of Generic Multicast Key Distribution

Daniele Micciancio, Saurabh Panjwani, 2004, EUROCRYPT.

International Symposium on Symbolic and Algebraic Computation, ISSAC - 2001

Bogdan Warinschi, Daniele Micciancio, Daniele Micciancio, 2001 .

Simultaneous broadcast revisited

Daniele Micciancio, Alejandro Hevia, 2005, PODC '05.

Hardness of approximating the minimum distance of a linear code

Madhu Sudan, Daniele Micciancio, Ilya Dumer, 1999, IEEE Trans. Inf. Theory.

A linear space algorithm for computing the hermite normal form

Bogdan Warinschi, Daniele Micciancio, Daniele Micciancio, 2001, ISSAC '01.

Composition and Efficiency Tradeoffs for Forward-Secure Digital Signatures

Tal Malkin, Daniele Micciancio, Sara Miner More, 2001, IACR Cryptol. ePrint Arch..

Towards Computationally Sound Symbolic Security Analysis

Daniele Micciancio, 2004 .

Equational Security Proofs of Oblivious Transfer Protocols

Daniele Micciancio, Baiyu Li, Daniele Micciancio, 2018, IACR Cryptol. ePrint Arch..

Lattice-Based Cryptography

Daniele Micciancio, 2011, Encyclopedia of Cryptography and Security.

Lattice Based Cryptography: A Global Improvement

Daniele Micciancio, 1999, IACR Cryptol. ePrint Arch..

Optimal communication complexity of generic multicast key distribution

Daniele Micciancio, Saurabh Panjwani, 2008, IEEE/ACM Trans. Netw..

The validity problem for extended regular expressions

Daniele Micciancio, 1996 .

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

Daniele Micciancio, Panagiotis Voulgaris, 2013, SIAM J. Comput..

Efficient bounded distance decoders for Barnes-Wall lattices

Daniele Micciancio, Antonio Nicolosi, 2008, 2008 IEEE International Symposium on Information Theory.

Foundations of group signatures: Formal de ni-tions

Mihir Bellare, Bogdan Warinschi, Daniele Micciancio, 2003 .

Stronger average case to worst case connections

Daniele Micciancio, Oded Regev, O. Regev, 2004 .

Theory of cryptography : 7th Theory of Cryptography Conference, TCC 2010, Zurich, Switzerland, February 9-11, 2010 : proceedings

Daniele Micciancio, 2010 .

Provably Secure FFT Hashing

Chris Peikert, Alon Rosen, Daniele Micciancio, 2006 .

An Oblivious Data Structure and its Applications toCryptographyDaniele

Daniele Micciancio, 1997 .

Using Hypergraph Homomorphisms to Guess Three Secrets

Daniele Micciancio, Nathan Segerlind, .