Daniele Micciancio

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.

[BibT_eX]

[DOI]

Baiyu Li

Proceedings of the 31st IEEE Computer Security Foundations Symposium, 2018

2017

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

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

2016

Shortest Vector Problem.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Compactness vs Collusion Resistance in Functional Encryption.

[BibT_eX]

[DOI]

Baiyu Li

Proceedings of the Theory of Cryptography - 14th International Conference, 2016

Practical, Predictable Lattice Basis Reduction.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

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

[BibT_eX]

[DOI]

Christine van Vredendaal

Proceedings of the 3rd ACM International Workshop on ASIA Public-Key Cryptography, 2016

2015

Fast Lattice Point Enumeration with Minimal Overhead.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second.

[BibT_eX]

[DOI]

Léo Ducas

Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

2014

FHE Bootstrapping in less than a second.

[BibT_eX]

[DOI]

Léo Ducas

IACR Cryptol. ePrint Arch., 2014

Improved Short Lattice Signatures in the Standard Model.

[BibT_eX]

[DOI]

Léo Ducas

Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

Locally Dense Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE 29th Conference on Computational Complexity, 2014

2013

Asymptotically Effi cient Lattice-Based Digital Signatures.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Algorithms for the Densest Sub-Lattice Problem.

[BibT_eX]

[DOI]

Daniel Dadush

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

An equational approach to secure multi-party computation.

[BibT_eX]

[DOI]

Stefano Tessaro

Proceedings of the Innovations in Theoretical Computer Science, 2013

Hardness of SIS and LWE with Small Parameters.

[BibT_eX]

[DOI]

Chris Peikert

Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2012

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

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2012

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

[BibT_eX]

[DOI]

Chris Peikert

Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

2011

Shortest Vector Problem.

[BibT_eX]

[DOI]

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

Lattice-Based Cryptography.

[BibT_eX]

[DOI]

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

Closest Vector Problem.

[BibT_eX]

[DOI]

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

The Geometry of Lattice Cryptography.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

Petros Mol

Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

2010

Cryptographic Functions from Worst-Case Complexity Assumptions.

[BibT_eX]

[DOI]

Proceedings of the LLL Algorithm - Survey and Applications, 2010

A first glimpse of cryptography's Holy Grail.

[BibT_eX]

[DOI]

Commun. ACM, 2010

A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations.

[BibT_eX]

[DOI]

Panagiotis Voulgaris

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Faster Exponential Time Algorithms for the Shortest Vector Problem.

[BibT_eX]

[DOI]

Panagiotis Voulgaris

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Computational Soundness, Co-induction, and Encryption Cycles.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

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

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2009

2008

Shortest Vector Problem.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

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

[BibT_eX]

[DOI]

Scott Yilek

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

Asymptotically Efficient Lattice-Based Digital Signatures.

[BibT_eX]

[DOI]

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

Efficient reductions among lattice problems.

[BibT_eX]

[DOI]

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

An Indistinguishability-Based Characterization of Anonymous Channels.

[BibT_eX]

[DOI]

Alejandro Hevia

Proceedings of the Privacy Enhancing Technologies, 2008

Efficient bounded distance decoders for Barnes-Wall lattices.

[BibT_eX]

[DOI]

Antonio Nicolosi

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

SWIFFT: A Modest Proposal for FFT Hashing.

[BibT_eX]

[DOI]

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

2007

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

[BibT_eX]

[DOI]

Comput. Complex., 2007

2006

Special Issue: FOCS 2003.

[BibT_eX]

[DOI]

Chandra Chekuri

J. Comput. Syst. Sci., 2006

Concurrent Zero Knowledge Without Complexity Assumptions.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

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

[BibT_eX]

[DOI]

Saurabh Panjwani

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

Generalized Compact Knapsacks Are Collision Resistant.

[BibT_eX]

[DOI]

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

On Bounded Distance Decoding for General Lattices.

[BibT_eX]

[DOI]

Yi-Kai Liu

Proceedings of the Approximation, 2006

2005

Shortest Vector Problem.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Cryptography and Security, 2005

Lattice Based Cryptography.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Cryptography and Security, 2005

Closest Vector Problem.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Cryptography and Security, 2005

The complexity of the covering radius problem.

[BibT_eX]

[DOI]

Venkatesan Guruswami

Oded Regev

Comput. Complex., 2005

Adaptive Security of Symbolic Encryption.

[BibT_eX]

[DOI]

Saurabh Panjwani

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

Simultaneous broadcast revisited.

[BibT_eX]

[DOI]

Alejandro Hevia

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

The RSA Group is Pseudo-Free.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2005

2004

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

[BibT_eX]

[DOI]

J. Comput. Secur., 2004

Soundness of Formal Encryption in the Presence of Active Adversaries.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

Oded Regev

Proceedings of the 45th Symposium on Foundations of Computer Science, 2004

Optimal Communication Complexity of Generic Multicast Key Distribution.

[BibT_eX]

[DOI]

Saurabh Panjwani

Proceedings of the Advances in Cryptology, 2004

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

[BibT_eX]

[DOI]

Venkatesan Guruswami

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

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2003

A Note on the Minimal Volume of Almost Cubic Parallelepipeds.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2003

Simulatable Commitments and Efficient Concurrent Zero-Knowledge.

[BibT_eX]

[DOI]

Erez Petrank

Proceedings of the Advances in Cryptology, 2003

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

[BibT_eX]

[DOI]

Mihir Bellare

Proceedings of the Advances in Cryptology, 2003

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

[BibT_eX]

[DOI]

Salil P. Vadhan

Proceedings of the Advances in Cryptology, 2003

2002

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

[BibT_eX]

[DOI]

Erez Petrank

Electron. Colloquium Comput. Complex., 2002

Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions from Worst-Case Complexity Assumptions.

[BibT_eX]

[DOI]

Proceedings of the 43rd Symposium on Foundations of Computer Science, 2002

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

[BibT_eX]

[DOI]

Tal Malkin

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.

[BibT_eX]

[DOI]

Rosario Gennaro

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.

[BibT_eX]

[DOI]

Proceedings of the 17th Annual IEEE Conference on Computational Complexity, 2002

The Inapproximability of Lattice and Coding Problems with Preprocessing.

[BibT_eX]

[DOI]

Uriel Feige

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.

[BibT_eX]

[DOI]

Alejandro Hevia

Proceedings of the Advances in Cryptology, 2002

Complexity of lattice problems - a cryptographic perspective.

[BibT_eX]

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.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2001

Composition and Efficiency Tradeoffs for Forward-Secure Digital Signatures.

[BibT_eX]

[DOI]

Tal Malkin

Sara Miner More

IACR Cryptol. ePrint Arch., 2001

A linear space algorithm for computing the herite normal form.

[BibT_eX]

[DOI]

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

Improving Lattice Based Cryptosystems Using the Hermite Normal Form.

[BibT_eX]

[DOI]

Proceedings of the Cryptography and Lattices, International Conference, 2001

2000

A Linear Space Algorithm for Computing the Hermite Normal Form

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2000

1999

Lattice Based Cryptography: A Global Improvement.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 1999

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

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1999

Multicast Security: A Taxonomy and Some Efficient Constructions.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM '99, 1999

Hardness of Approximating the Minimum Distance of a Linear Code.

[BibT_eX]

[DOI]

Ilya Dumer

Madhu Sudan

Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

1998

On the hardness of the shortest vector problem.

[BibT_eX]

[DOI]

PhD thesis, 1998

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

[BibT_eX]

[DOI]

Ran Canetti

Omer Reingold

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Rosario Gennaro

Tal Rabin

Proceedings of the CCS '98, 1998

1997

An Algorithm for the Solution of Tree Equations.

[BibT_eX]

[DOI]

Sabrina Mantaci

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

Oblivious Data Structures: Applications to Cryptography.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Mihir Bellare

Proceedings of the Advances in Cryptology, 1997

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

[BibT_eX]

[DOI]

Mihir Bellare

Shafi Goldwasser

Proceedings of the Advances in Cryptology, 1997

1995

Analysis of Pure PROLOG Programs.

[BibT_eX]

Giorgio Levi