| 2026 | CRYPTO | Orthus: Practical Sublinear Batch-Verification of Lattice Relations from Standard Assumptions. | Madalina Bolboceanu, Jonathan Bootle, Vadim Lyubashevsky, Antonio Merino-Gallardo, Gregor Seiler |
| 2025 | PKC | Efficient Verifiable Mixnets from Lattices, Revisited. | Jonathan Bootle, Vadim Lyubashevsky, Antonio Merino-Gallardo |
| 2024 | CCS | The LaZer Library: Lattice-Based Zero Knowledge and Succinct Proofs for Quantum-Safe Privacy. | Vadim Lyubashevsky, Gregor Seiler, Patrick Steuer |
| 2023 | CCS | Lattice-Based Blind Signatures: Short, Efficient, and Round-Optimal. | Ward Beullens, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler |
| 2023 | CRYPTO | A Framework for Practical Anonymous Credentials from Lattices. | Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Alessandro Sorniotti |
| 2023 | PKC | A Thorough Treatment of Highly-Efficient NTRU Instantiations. | Julien Duman, Kathrin Hvelmanns, Eike Kiltz, Vadim Lyubashevsky, Gregor Seiler, Dominique Unruh |
| 2022 | ASIACRYPT | BLOOM: Bimodal Lattice One-out-of-Many Proofs and Applications. | Vadim Lyubashevsky, Ngoc Khanh Nguyen |
| 2022 | CRYPTO | Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and More General. | Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Planon |
| 2022 | EuroCrypt | Practical Non-interactive Publicly Verifiable Secret Sharing with Thousands of Parties. | Craig Gentry, Shai Halevi, Vadim Lyubashevsky |
| 2022 | PKC | Efficient Lattice-Based Blind Signatures via Gaussian One-Time Signatures. | Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Planon |
| 2021 | ASIACRYPT | Shorter Lattice-Based Group Signatures via "Almost Free" Encryption and Other Optimizations. | Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Planon, Gregor Seiler |
| 2021 | CCS | Faster Lattice-Based KEMs via a Generic Fujisaki-Okamoto Transform Using Prefix Hashing. | Julien Duman, Kathrin Hvelmanns, Eike Kiltz, Vadim Lyubashevsky, Gregor Seiler |
| 2021 | CRYPTO | SMILE: Set Membership from Ideal Lattices with Applications to Ring Signatures and Confidential Transactions. | Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler |
| 2021 | ESORICS | More Efficient Amortization of Exact Zero-Knowledge Proofs for LWE. | Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler |
| 2021 | PKC | Shorter Lattice-Based Zero-Knowledge Proofs via One-Time Commitments. | Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler |
| 2020 | CCS | Practical Lattice-Based Zero-Knowledge Proofs for Integer Relations. | Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler |
| 2020 | CRYPTO | Practical Product Proofs for Lattice Commitments. | Thomas Attema, Vadim Lyubashevsky, Gregor Seiler |
| 2020 | CRYPTO | A Non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge. | Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler |
| 2020 | PQCrypto | Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions. | Jonathan Bootle, Anja Lehmann, Vadim Lyubashevsky, Gregor Seiler |
| 2019 | CCS | A Framework for Efficient Lattice-Based DAA. | Liqun Chen, Nada El Kassem, Anja Lehmann, Vadim Lyubashevsky |
| 2019 | CRYPTO | Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs. | Jonathan Bootle, Vadim Lyubashevsky, Gregor Seiler |
| 2019 | EuroCrypt | Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing. | Zvika Brakerski, Vadim Lyubashevsky, Vinod Vaikuntanathan, Daniel Wichs |
| 2019 | PKC | Short Discrete Log Proofs for FHE and Ring-LWE Ciphertexts. | Rafal del Pino, Vadim Lyubashevsky, Gregor Seiler |
| 2018 | CCS | Lattice-Based Group Signatures and Zero-Knowledge Proofs of Automorphism Stability. | Rafal del Pino, Vadim Lyubashevsky, Gregor Seiler |
| 2018 | CRYPTO | Sub-linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits. | Carsten Baum, Jonathan Bootle, Andrea Cerulli, Rafal del Pino, Jens Groth, Vadim Lyubashevsky |
| 2018 | EuroCrypt | A Concrete Treatment of Fiat-Shamir Signatures in the Quantum Random-Oracle Model. | Eike Kiltz, Vadim Lyubashevsky, Christian Schaffner |
| 2018 | EuroCrypt | Short, Invertible Elements in Partially Splitting Cyclotomic Rings and Applications to Lattice-Based Zero-Knowledge Proofs. | Vadim Lyubashevsky, Gregor Seiler |
| 2018 | SCN | More Efficient Commitments from Structured Lattice Assumptions. | Carsten Baum, Ivan Damgrd, Vadim Lyubashevsky, Sabine Oechsner, Chris Peikert |
| 2017 | CCS | Practical Quantum-Safe Voting from Lattices. | Rafal del Pino, Vadim Lyubashevsky, Gregory Neven, Gregor Seiler |
| 2017 | CRYPTO | Amortization with Fewer Equations for Proving Knowledge of Small Secrets. | Rafal del Pino, Vadim Lyubashevsky |
| 2017 | EuroCrypt | One-Shot Verifiable Encryption from Lattices. | Vadim Lyubashevsky, Gregory Neven |
| 2016 | ASIACRYPT | Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings. | Vadim Lyubashevsky |
| 2016 | SCN | The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs. | Rafal del Pino, Vadim Lyubashevsky, David Pointcheval |
| 2015 | ESORICS | Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings. | Fabrice Benhamouda, Stephan Krenn, Vadim Lyubashevsky, Krzysztof Pietrzak |
| 2015 | EuroCrypt | Quadratic Time, Linear Space Algorithms for Gram-Schmidt Orthogonalization and Gaussian Sampling in Structured Lattices. | Vadim Lyubashevsky, Thomas Prest |
| 2015 | PKC | Simple Lattice Trapdoor Sampling from a Broad Class of Distributions. | Vadim Lyubashevsky, Daniel Wichs |
| 2014 | ASIACRYPT | Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures. | Fabrice Benhamouda, Jan Camenisch, Stephan Krenn, Vadim Lyubashevsky, Gregory Neven |
| 2014 | ASIACRYPT | Efficient Identity-Based Encryption over NTRU Lattices. | Lo Ducas, Vadim Lyubashevsky, Thomas Prest |
| 2013 | CRYPTO | Lattice Signatures and Bimodal Gaussians. | Lo Ducas, Alain Durmus, Tancrde Lepoint, Vadim Lyubashevsky |
| 2013 | CRYPTO | Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs. | Vadim Lyubashevsky, Daniel Masny |
| 2013 | EuroCrypt | A Toolkit for Ring-LWE Cryptography. | Vadim Lyubashevsky, Chris Peikert, Oded Regev |
| 2012 | CHES | Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems. | Tim Gneysu, Vadim Lyubashevsky, Thomas Pppelmann |
| 2012 | EuroCrypt | Tightly-Secure Signatures from Lossy Identification Schemes. | Michel Abdalla, Pierre-Alain Fouque, Vadim Lyubashevsky, Mehdi Tibouchi |
| 2012 | EuroCrypt | Lattice Signatures without Trapdoors. | Vadim Lyubashevsky |
| 2012 | FSE | Lapin: An Efficient Authentication Protocol Based on Ring-LPN. | Stefan Heyse, Eike Kiltz, Vadim Lyubashevsky, Christof Paar, Krzysztof Pietrzak |
| 2012 | PKC | From Selective to Full Security: Semi-generic Transformations in the Standard Model. | Michel Abdalla, Dario Fiore, Vadim Lyubashevsky |
| 2011 | ITW | Search to decision reduction for the learning with errors over rings problem. | Vadim Lyubashevsky |
| 2010 | EuroCrypt | On Ideal Lattices and Learning with Errors over Rings. | Vadim Lyubashevsky, Chris Peikert, Oded Regev |
| 2010 | TCC | Public-Key Cryptographic Primitives Provably as Secure as Subset Sum. | Vadim Lyubashevsky, Adriana Palacio, Gil Segev |
| 2009 | ASIACRYPT | Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures. | Vadim Lyubashevsky |
| 2009 | CRYPTO | On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem. | Vadim Lyubashevsky, Daniele Micciancio |
| 2008 | FSE | SWIFFT: A Modest Proposal for FFT Hashing. | Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen |
| 2008 | PKC | Lattice-Based Identification Schemes Secure Under Active Attacks. | Vadim Lyubashevsky |
| 2008 | TCC | Asymptotically Efficient Lattice-Based Digital Signatures. | Vadim Lyubashevsky, Daniele Micciancio |
| 2006 | ICALP | Generalized Compact Knapsacks Are Collision Resistant. | Vadim Lyubashevsky, Daniele Micciancio |