Daniele Micciancio

According to our database1, Daniele Micciancio authored at least 132 papers between 1995 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Semi-parallel Logistic Regression for GWAS on Encrypted Data.
IACR Cryptology ePrint Archive, 2019

Homomorphic Encryption for Finite Automata.
IACR Cryptology ePrint Archive, 2019

Homomorphic Encryption Standard.
IACR Cryptology ePrint Archive, 2019

Symbolic Encryption with Pseudorandom Keys.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Building an Efficient Lattice Gadget Toolkit: Subgaussian Sampling and More.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

2018
On the Hardness of Learning With Errors with Binary Secrets.
Theory of Computing, 2018

Asymptotically Efficient Lattice-Based Digital Signatures.
J. Cryptology, 2018

Ring packing and amortized FHEW bootstrapping.
IACR Cryptology ePrint Archive, 2018

On the Hardness of Learning With Errors with Binary Secrets.
IACR Cryptology ePrint Archive, 2018

On the Bit Security of Cryptographic Primitives.
IACR Cryptology ePrint Archive, 2018

Symbolic security of garbled circuits.
IACR Cryptology ePrint Archive, 2018

Building an Efficient Lattice Gadget Toolkit: Subgaussian Sampling and More.
IACR Cryptology ePrint Archive, 2018

Implementing Token-Based Obfuscation under (Ring) LWE.
IACR Cryptology ePrint Archive, 2018

Equational Security Proofs of Oblivious Transfer Protocols.
Proceedings of the Public-Key Cryptography - PKC 2018, 2018

Ring Packing and Amortized FHEW Bootstrapping.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

On the Bit Security of Cryptographic Primitives.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

Faster Gaussian Sampling for Trapdoor Lattices with Arbitrary Modulus.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

Symbolic Security of Garbled Circuits.
Proceedings of the 31st IEEE Computer Security Foundations Symposium, 2018

2017
Gaussian Sampling over the Integers: Efficient, Generic, Constant-Time.
IACR Cryptology ePrint Archive, 2017

Faster Gaussian Sampling for Trapdoor Lattices with Arbitrary Modulus.
IACR Cryptology ePrint Archive, 2017

Creating Cryptographic Challenges Using Multi-Party Computation: The LWE Challenge.
IACR Cryptology ePrint Archive, 2017

Gaussian Sampling over the Integers: Efficient, Generic, Constant-Time.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

2016
Shortest Vector Problem.
Encyclopedia of Algorithms, 2016

Equational Security Proofs of Oblivious Transfer Protocols.
IACR Cryptology ePrint Archive, 2016

Compactness vs Collusion Resistance in Functional Encryption.
IACR Cryptology ePrint Archive, 2016

Compactness vs Collusion Resistance in Functional Encryption.
Proceedings of the Theory of Cryptography - 14th International Conference, 2016

Practical, Predictable Lattice Basis Reduction.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

Creating Cryptographic Challenges Using Multi-Party Computation: The LWE Challenge.
Proceedings of the 3rd ACM International Workshop on ASIA Public-Key Cryptography, 2016

2015
Practical, Predictable Lattice Basis Reduction.
IACR Cryptology ePrint Archive, 2015

Fast Lattice Point Enumeration with Minimal Overhead.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

2014
Fast Lattice Point Enumeration with Minimal Overhead.
IACR Cryptology ePrint Archive, 2014

FHE Bootstrapping in less than a second.
IACR Cryptology ePrint Archive, 2014

Improved Short Lattice Signatures in the Standard Model.
IACR Cryptology ePrint Archive, 2014

Improved Short Lattice Signatures in the Standard Model.
Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

Locally Dense Codes.
Proceedings of the IEEE 29th Conference on Computational Complexity, 2014

2013
A Deterministic Single Exponential Time Algorithm for Most Lattice Problems Based on Voronoi Cell Computations.
SIAM J. Comput., 2013

Hardness of SIS and LWE with Small Parameters.
IACR Cryptology ePrint Archive, 2013

Asymptotically Effi cient Lattice-Based Digital Signatures.
IACR Cryptology ePrint Archive, 2013

Locally Dense Codes.
Electronic Colloquium on Computational Complexity (ECCC), 2013

Algorithms for the Densest Sub-Lattice Problem.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

An equational approach to secure multi-party computation.
Proceedings of the Innovations in Theoretical Computer Science, 2013

Hardness of SIS and LWE with Small Parameters.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2012
Inapproximability of the Shortest Vector Problem: Toward a Deterministic Reduction.
Theory of Computing, 2012

Inapproximability of the Shortest Vector Problem: Toward a Deterministic Reduction.
Electronic Colloquium on Computational Complexity (ECCC), 2012

Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller.
Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

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

Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller.
IACR Cryptology ePrint Archive, 2011

Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions.
IACR Cryptology ePrint Archive, 2011

The Geometry of Lattice Cryptography.
Proceedings of the Foundations of Security Analysis and Design VI, 2011

Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions.
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

2010
Cryptographic Functions from Worst-Case Complexity Assumptions.
Proceedings of the LLL Algorithm - Survey and Applications, 2010

The RSA Group is Pseudo-Free.
J. Cryptology, 2010

A Deterministic Single Exponential Time Algorithm for Most Lattice Problems based on Voronoi Cell Computations.
Electronic Colloquium on Computational Complexity (ECCC), 2010

A first glimpse of cryptography's Holy Grail.
Commun. ACM, 2010

A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Faster Exponential Time Algorithms for the Shortest Vector Problem.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Computational Soundness, Co-induction, and Encryption Cycles.
Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

2009
Pseudo-randomness and partial information in symbolic security analysis.
IACR Cryptology ePrint Archive, 2009

Computational soundness, co-induction, and encryption cycles.
IACR Cryptology ePrint Archive, 2009

Faster exponential time algorithms for the shortest vector problem.
Electronic Colloquium on Computational Complexity (ECCC), 2009

On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem.
Proceedings of the Advances in Cryptology, 2009

2008
Optimal communication complexity of generic multicast key distribution.
IEEE/ACM Trans. Netw., 2008

The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Asymptotically Efficient Lattice-Based Digital Signatures.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Efficient reductions among lattice problems.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

An Indistinguishability-Based Characterization of Anonymous Channels.
Proceedings of the Privacy Enhancing Technologies, 2008

Efficient bounded distance decoders for Barnes-Wall lattices.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

SWIFFT: A Modest Proposal for FFT Hashing.
Proceedings of the Fast Software Encryption, 15th International Workshop, 2008

2007
Worst-Case to Average-Case Reductions Based on Gaussian Measures.
SIAM J. Comput., 2007

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

2006
Special Issue: FOCS 2003.
J. Comput. Syst. Sci., 2006

Concurrent Zero Knowledge Without Complexity Assumptions.
Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

Corrupting One vs. Corrupting Many: The Case of Broadcast and Multicast Encryption.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Generalized Compact Knapsacks Are Collision Resistant.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

On Bounded Distance Decoding for General Lattices.
Proceedings of the Approximation, 2006

2005
Closest Vector Problem.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

Concurrent Zero Knowledge without Complexity Assumptions.
IACR Cryptology ePrint Archive, 2005

Generalized Compact Knapsacks are Collision Resistant
Electronic Colloquium on Computational Complexity (ECCC), 2005

Concurrent Zero Knowledge without Complexity Assumptions
Electronic Colloquium on Computational Complexity (ECCC), 2005

The complexity of the covering radius problem.
Computational Complexity, 2005

Adaptive Security of Symbolic Encryption.
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

Simultaneous broadcast revisited.
Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

The RSA Group is Pseudo-Free.
Proceedings of the Advances in Cryptology, 2005

2004
Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor.
SIAM J. Comput., 2004

The inapproximability of lattice and coding problems with preprocessing.
J. Comput. Syst. Sci., 2004

Completeness Theorems for the Abadi-Rogaway Language of Encrypted Expressions.
Journal of Computer Security, 2004

Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions.
IACR Cryptology ePrint Archive, 2004

Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions
Electronic Colloquium on Computational Complexity (ECCC), 2004

Soundness of Formal Encryption in the Presence of Active Adversaries.
Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004

Worst-Case to Average-Case Reductions Based on Gaussian Measures.
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

Optimal Communication Complexity of Generic Multicast Key Distribution.
Proceedings of the Advances in Cryptology, 2004

The Complexity of the Covering Radius Problem on Lattices and Codes.
Proceedings of the 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 2004

2003
Hardness of approximating the minimum distance of a linear code.
IEEE Trans. Information Theory, 2003

Almost perfect lattices, the covering radius problem, and applications to Ajtai's connection factor
Electronic Colloquium on Computational Complexity (ECCC), 2003

A Note on the Minimal Volume of Almost Cubic Parallelepipeds.
Discrete & Computational Geometry, 2003

Simulatable Commitments and Efficient Concurrent Zero-Knowledge.
Proceedings of the Advances in Cryptology, 2003

Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions.
Proceedings of the Advances in Cryptology, 2003

Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More.
Proceedings of the Advances in Cryptology, 2003

2002
Efficient and Concurrent Zero-Knowledge from any public coin HVZK protocol.
IACR Cryptology ePrint Archive, 2002

Efficient and Concurrent Zero-Knowledge from any public coin HVZK protocol
Electronic Colloquium on Computational Complexity (ECCC), 2002

Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions from Worst-Case Complexity Assumptions.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

Efficient Generic Forward-Secure Signatures with an Unbounded Number Of Time Periods.
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.
Proceedings of the Advances in Cryptology - EUROCRYPT 2002, International Conference on the Theory and Applications of Cryptographic Techniques, Amsterdam, The Netherlands, April 28, 2002

Improved Cryptographic Hash Functions with Worst-Case/Average-Case Connection.
Proceedings of the 17th Annual IEEE Conference on Computational Complexity, 2002

The Inapproximability of Lattice and Coding Problems with Preprocessing.
Proceedings of the 17th Annual IEEE Conference on Computational Complexity, 2002

The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes.
Proceedings of the Advances in Cryptology, 2002

Complexity of lattice problems - a cryptograhic perspective.
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.
IEEE Trans. Information Theory, 2001

Composition and Efficiency Tradeoffs for Forward-Secure Digital Signatures.
IACR Cryptology ePrint Archive, 2001

A linear space algorithm for computing the herite normal form.
Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, 2001

Improving Lattice Based Cryptosystems Using the Hermite Normal Form.
Proceedings of the Cryptography and Lattices, International Conference, 2001

2000
The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant.
SIAM J. Comput., 2000

A Linear Space Algorithm for Computing the Hermite Normal Form
Electronic Colloquium on Computational Complexity (ECCC), 2000

1999
Approximating Shortest Lattice Vectors is not Harder than Approximating Closest Lattice Vectors.
Inf. Process. Lett., 1999

Lattice Based Cryptography: A Global Improvement.
IACR Cryptology ePrint Archive, 1999

Hardness of Approximating the Minimum Distance of a Linear Code
Electronic Colloquium on Computational Complexity (ECCC), 1999

Approximating Shortest Lattice Vectors is Not Harder Than Approximating Closest Lattice Vectors.
Electronic Colloquium on Computational Complexity (ECCC), 1999

Multicast Security: A Taxonomy and Some Efficient Constructions.
Proceedings of the Proceedings IEEE INFOCOM '99, 1999

Hardness of Approximating the Minimum Distance of a Linear Code.
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

1998
On the hardness of the shortest vector problem.
PhD thesis, 1998

An Efficient Non-Interactive Statistical Zero-Knowledge Proof System for Quasi-Safe Prime Products.
IACR Cryptology ePrint Archive, 1998

The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant.
Electronic Colloquium on Computational Complexity (ECCC), 1998

Perfectly One-Way Probabilistic Hash Functions (Preliminary Version).
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

The Shortest Vector in a Lattice is Hard to Approximate to Within Some Constant.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

An Efficient Non-Interactive Statistical Zero-Knowledge Proof System for Quasi-Safe Prime Products.
Proceedings of the CCS '98, 1998

1997
A New Paradigm for Collision-free Hashing: Incrementality at Reduced Cost.
IACR Cryptology ePrint Archive, 1997

An Algorithm for the Solution of Tree Equations.
Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

Oblivious Data Structures: Applications to Cryptography.
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost.
Proceedings of the Advances in Cryptology, 1997

"Pseudo-Random" Number Generation Within Cryptographic Algorithms: The DDS Case.
Proceedings of the Advances in Cryptology, 1997

1995
Analysis of Pure PROLOG Programs.
Proceedings of the 1995 Joint Conference on Declarative Programming, 1995


  Loading...