The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem. - Vadim Lyubashevsky (APPROX-RANDOM, 2005)

On Random High Density Subset Sums - Vadim Lyubashevsky (Electron. Colloquium Comput. Complex., 2005)

Generalized Compact Knapsacks are Collision Resistant - Vadim Lyubashevsky; Daniele Micciancio (Electron. Colloquium Comput. Complex., 2005)

On Bounded Distance Decoding for General Lattices. - Yi-Kai Liu 001; Vadim Lyubashevsky; Daniele Micciancio (APPROX-RANDOM, 2006)

SWIFFT: A Modest Proposal for FFT Hashing. - Vadim Lyubashevsky; Daniele Micciancio; Chris Peikert; Alon Rosen (FSE, 2008)

Lattice-Based Identification Schemes Secure Under Active Attacks. - Vadim Lyubashevsky (Public Key Cryptography, 2008)

The nc-Unique Shortest Vector Problem is Hard. - Vadim Lyubashevsky (IACR Cryptol. ePrint Arch., 2008)

Towards practical lattice-based cryptography. - Vadim Lyubashevsky (2008)

Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures. - Vadim Lyubashevsky (ASIACRYPT, 2009)

On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem. - Vadim Lyubashevsky; Daniele Micciancio (CRYPTO, 2009)

A Note on the Distribution of the Distance from a Lattice. - Ishay Haviv; Vadim Lyubashevsky; Oded Regev 001 (Discret. Comput. Geom., 2009)

Public-Key Cryptographic Primitives Provably as Secure as Subset Sum. - Vadim Lyubashevsky; Adriana Palacio; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2009)

Search to decision reduction for the learning with errors over rings problem. - Vadim Lyubashevsky (ITW, 2011)

Lattice Signatures Without Trapdoors. - Vadim Lyubashevsky (IACR Cryptol. ePrint Arch., 2011)

Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems. - Tim Güneysu; Vadim Lyubashevsky; Thomas Pöppelmann (CHES, 2012)

Lapin: An Efficient Authentication Protocol Based on Ring-LPN. - Stefan Heyse; Eike Kiltz; Vadim Lyubashevsky; Christof Paar; Krzysztof Pietrzak (FSE, 2012)

From Selective to Full Security: Semi-Generic Transformations in the Standard Model. - Michel Abdalla; Dario Fiore 001; Vadim Lyubashevsky (IACR Cryptol. ePrint Arch., 2012)

Lattice Signatures and Bimodal Gaussians. - Léo Ducas; Alain Durmus; Tancrède Lepoint; Vadim Lyubashevsky (IACR Cryptol. ePrint Arch., 2013)

Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs. - Vadim Lyubashevsky; Daniel Masny (IACR Cryptol. ePrint Arch., 2013)

Asymptotically Effi cient Lattice-Based Digital Signatures. - Vadim Lyubashevsky; Daniele Micciancio (IACR Cryptol. ePrint Arch., 2013)

A Toolkit for Ring-LWE Cryptography. - Vadim Lyubashevsky; Chris Peikert; Oded Regev 001 (IACR Cryptol. ePrint Arch., 2013)

On Ideal Lattices and Learning with Errors over Rings. - Vadim Lyubashevsky; Chris Peikert; Oded Regev 001 (J. ACM, 2013)

Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures. - Fabrice Benhamouda; Jan Camenisch; Stephan Krenn; Vadim Lyubashevsky; Gregory Neven (ASIACRYPT (1), 2014)

Efficient Identity-Based Encryption over NTRU Lattices. - Léo Ducas; Vadim Lyubashevsky; Thomas Prest (ASIACRYPT (2), 2014)

Efficient Zero-Knowledge Proofs for Commitments from Learning With Errors over Rings. - Fabrice Benhamouda; Stephan Krenn; Vadim Lyubashevsky; Krzysztof Pietrzak (IACR Cryptol. ePrint Arch., 2014)

E fficient Identity-Based Encryption over NTRU Lattices. - Léo Ducas; Vadim Lyubashevsky; Thomas Prest (IACR Cryptol. ePrint Arch., 2014)

Simple Lattice Trapdoor Sampling from a Broad Class of Distributions. - Vadim Lyubashevsky; Daniel Wichs (IACR Cryptol. ePrint Arch., 2014)

Quadratic Time, Linear Space Algorithms for Gram-Schmidt Orthogonalization and Gaussian Sampling in Structured Lattices. - Vadim Lyubashevsky; Thomas Prest (IACR Cryptol. ePrint Arch., 2015)

Lattice-Based Signatures: Optimization and Implementation on Reconfigurable Hardware. - Tim Güneysu; Vadim Lyubashevsky; Thomas Pöppelmann (IEEE Trans. Computers, 2015)

Digital Signatures Based on the Hardness of Ideal Lattice Problems in all Rings. - Vadim Lyubashevsky (IACR Cryptol. ePrint Arch., 2016)

The Whole is Less than the Sum of its Parts: Constructing More Efficient Lattice-Based AKEs. - Rafaël Del Pino; Vadim Lyubashevsky; David Pointcheval (IACR Cryptol. ePrint Arch., 2016)

Tightly Secure Signatures From Lossy Identification Schemes. - Michel Abdalla; Pierre-Alain Fouque; Vadim Lyubashevsky; Mehdi Tibouchi (J. Cryptol., 2016)

Simple Amortized Proofs of Shortness for Linear Relations over Polynomial Rings. - Carsten Baum; Vadim Lyubashevsky (IACR Cryptol. ePrint Arch., 2017)

CRYSTALS - Kyber: a CCA-secure module-lattice-based KEM. - Joppe W. Bos; Léo Ducas; Eike Kiltz; Tancrède Lepoint; Vadim Lyubashevsky; John M. Schanck; Peter Schwabe; Damien Stehlé (IACR Cryptol. ePrint Arch., 2017)

CRYSTALS - Dilithium: Digital Signatures from Module Lattices. - Léo Ducas; Tancrède Lepoint; Vadim Lyubashevsky; Peter Schwabe; Gregor Seiler; Damien Stehlé (IACR Cryptol. ePrint Arch., 2017)

A Concrete Treatment of Fiat-Shamir Signatures in the Quantum Random-Oracle Model. - Eike Kiltz; Vadim Lyubashevsky; Christian Schaffner (IACR Cryptol. ePrint Arch., 2017)

One-Shot Verifiable Encryption from Lattices. - Vadim Lyubashevsky; Gregory Neven (IACR Cryptol. ePrint Arch., 2017)

Partially Splitting Rings for Faster Lattice-Based Zero-Knowledge Proofs. - Vadim Lyubashevsky; Gregor Seiler (IACR Cryptol. ePrint Arch., 2017)

Amortization with Fewer Equations for Proving Knowledge of Small Secrets. - Rafaël Del Pino; Vadim Lyubashevsky (IACR Cryptol. ePrint Arch., 2017)

Practical Quantum-Safe Voting from Lattices. - Rafaël del Pino; Vadim Lyubashevsky; Gregory Neven; Gregor Seiler (IACR Cryptol. ePrint Arch., 2017)

Short, Invertible Elements in Partially Splitting Cyclotomic Rings and Applications to Lattice-Based Zero-Knowledge Proofs. - Vadim Lyubashevsky; Gregor Seiler (EUROCRYPT (1), 2018)

CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM. - Joppe W. Bos; Léo Ducas; Eike Kiltz; Tancrède Lepoint; Vadim Lyubashevsky; John M. Schanck; Peter Schwabe; Gregor Seiler; Damien Stehlé (EuroS&P, 2018)

More Efficient Commitments from Structured Lattice Assumptions. - Carsten Baum; Ivan Damgård; Vadim Lyubashevsky; Sabine Oechsner; Chris Peikert (SCN, 2018)

Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing. - Zvika Brakerski; Vadim Lyubashevsky; Vinod Vaikuntanathan; Daniel Wichs (Electron. Colloquium Comput. Complex., 2018)

Sub-Linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits. - Carsten Baum; Jonathan Bootle; Andrea Cerulli; Rafaël Del Pino; Jens Groth; Vadim Lyubashevsky (IACR Cryptol. ePrint Arch., 2018)

Lattice-Based Group Signatures and Zero-Knowledge Proofs of Automorphism Stability. - Rafaël Del Pino; Vadim Lyubashevsky; Gregor Seiler (IACR Cryptol. ePrint Arch., 2018)

Asymptotically Efficient Lattice-Based Digital Signatures. - Vadim Lyubashevsky; Daniele Micciancio (J. Cryptol., 2018)

CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme. - Léo Ducas; Eike Kiltz; Tancrède Lepoint; Vadim Lyubashevsky; Peter Schwabe; Gregor Seiler; Damien Stehlé (IACR Trans. Cryptogr. Hardw. Embed. Syst., 2018)

A Framework for Efficient Lattice-Based DAA. - Liqun Chen 002; Nada El Kassem; Anja Lehmann; Vadim Lyubashevsky (CYSARM@CCS, 2019)

Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs. - Jonathan Bootle; Vadim Lyubashevsky; Gregor Seiler (IACR Cryptol. ePrint Arch., 2019)

Short Discrete Log Proofs for FHE and Ring-LWE Ciphertexts. - Rafaël del Pino; Vadim Lyubashevsky; Gregor Seiler (IACR Cryptol. ePrint Arch., 2019)

NTTRU: Truly Fast NTRU Using NTT. - Vadim Lyubashevsky; Gregor Seiler (IACR Trans. Cryptogr. Hardw. Embed. Syst., 2019)

Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions. - Jonathan Bootle; Anja Lehmann; Vadim Lyubashevsky; Gregor Seiler (PQCrypto, 2020)

Practical Product Proofs for Lattice Commitments. - Thomas Attema; Vadim Lyubashevsky; Gregor Seiler (IACR Cryptol. ePrint Arch., 2020)

A non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge. - Jonathan Bootle; Vadim Lyubashevsky; Ngoc Khanh Nguyen 001; Gregor Seiler (IACR Cryptol. ePrint Arch., 2020)

More Efficient Amortization of Exact Zero-Knowledge Proofs for LWE. - Jonathan Bootle; Vadim Lyubashevsky; Ngoc Khanh Nguyen 001; Gregor Seiler (IACR Cryptol. ePrint Arch., 2020)

Practical Lattice-Based Zero-Knowledge Proofs for Integer Relations. - Vadim Lyubashevsky; Ngoc Khanh Nguyen 001; Gregor Seiler (IACR Cryptol. ePrint Arch., 2020)

Shorter Lattice-Based Zero-Knowledge Proofs via One-Time Commitments. - Vadim Lyubashevsky; Ngoc Khanh Nguyen 001; Gregor Seiler (IACR Cryptol. ePrint Arch., 2020)

A Thorough Treatment of Highly-Efficient NTRU Instantiations. - Julien Duman; Kathrin Hövelmanns; Eike Kiltz; Vadim Lyubashevsky; Gregor Seiler; Dominique Unruh (IACR Cryptol. ePrint Arch., 2021)

Faster Lattice-Based KEMs via a Generic Fujisaki-Okamoto Transform Using Prefix Hashing. - Julien Duman; Eike Kiltz; Kathrin Hövelmanns; Vadim Lyubashevsky; Gregor Seiler (IACR Cryptol. ePrint Arch., 2021)

Practical Non-interactive Publicly Verifiable Secret Sharing with Thousands of Parties. - Craig Gentry; Shai Halevi; Vadim Lyubashevsky (IACR Cryptol. ePrint Arch., 2021)

Shorter Lattice-Based Group Signatures via "Almost Free" Encryption and Other Optimizations. - Vadim Lyubashevsky; Ngoc Khanh Nguyen 001; Maxime Plançon; Gregor Seiler (IACR Cryptol. ePrint Arch., 2021)

SMILE: Set Membership from Ideal Lattices with Applications to Ring Signatures and Confidential Transactions. - Vadim Lyubashevsky; Ngoc Khanh Nguyen 001; Gregor Seiler (IACR Cryptol. ePrint Arch., 2021)

Non-applicability of the Gaborit&Aguilar-Melchor patent to Kyber and Saber. - Vadim Lyubashevsky; Damien Stehlé (IACR Cryptol. ePrint Arch., 2021)

BLOOM: Bimodal Lattice One-Out-of-Many Proofs and Applications. - Vadim Lyubashevsky; Ngoc Khanh Nguyen 001 (IACR Cryptol. ePrint Arch., 2022)

Efficient Lattice-Based Blind Signatures via Gaussian One-Time Signatures. - Vadim Lyubashevsky; Ngoc Khanh Nguyen 001; Maxime Plançon (IACR Cryptol. ePrint Arch., 2022)

Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and More General. - Vadim Lyubashevsky; Ngoc Khanh Nguyen 001; Maxime Plançon (IACR Cryptol. ePrint Arch., 2022)

Lattice-Based Blind Signatures: Short, Efficient, and Round-Optimal. - Ward Beullens; Vadim Lyubashevsky; Ngoc Khanh Nguyen 001; Gregor Seiler (IACR Cryptol. ePrint Arch., 2023)

A Framework for Practical Anonymous Credentials from Lattices. - Jonathan Bootle; Vadim Lyubashevsky; Ngoc Khanh Nguyen 001; Alessandro Sorniotti (IACR Cryptol. ePrint Arch., 2023)

Basic Lattice Cryptography: The concepts behind Kyber (ML-KEM) and Dilithium (ML-DSA). - Vadim Lyubashevsky (IACR Cryptol. ePrint Arch., 2024)

The LaZer Library: Lattice-Based Zero Knowledge and Succinct Proofs for Quantum-Safe Privacy. - Vadim Lyubashevsky; Gregor Seiler; Patrick Steuer (IACR Cryptol. ePrint Arch., 2024)

Efficient Verifiable Mixnets from Lattices, Revisited. - Jonathan Bootle; Vadim Lyubashevsky; Antonio Merino-Gallardo (IACR Cryptol. ePrint Arch., 2025)