Vadim Lyubashevsky

ORCID

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 69

Top Venues

IACR Cryptol. ePrint Arch.

CRYPTO (2)

CCS

EUROCRYPT (1)

University of California, San Diego, USA (PHD)

Education History

University of California, San Diego, USA

PHD

Publications

Vadim Lyubashevsky
Basic Lattice Cryptography: The concepts behind Kyber (ML-KEM) and Dilithium (ML-DSA). IACR Cryptol. ePrint Arch. 2024 (2024)
Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Alessandro Sorniotti
A Framework for Practical Anonymous Credentials from Lattices. IACR Cryptol. ePrint Arch. 2023 (2023)
Ward Beullens, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler
Lattice-Based Blind Signatures: Short, Efficient, and Round-Optimal. IACR Cryptol. ePrint Arch. 2023 (2023)
Ward Beullens, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler
Lattice-Based Blind Signatures: Short, Efficient, and Round-Optimal. CCS (2023)
Julien Duman, Kathrin Hövelmanns, Eike Kiltz, Vadim Lyubashevsky, Gregor Seiler, Dominique Unruh
A Thorough Treatment of Highly-Efficient NTRU Instantiations. Public Key Cryptography (1) (2023)
Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Alessandro Sorniotti
A Framework for Practical Anonymous Credentials from Lattices. CRYPTO (2) (2023)
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon
Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and More General. CRYPTO (2) (2022)
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon
Efficient Lattice-Based Blind Signatures via Gaussian One-Time Signatures. Public Key Cryptography (2) (2022)
Craig Gentry, Shai Halevi, Vadim Lyubashevsky
Practical Non-interactive Publicly Verifiable Secret Sharing with Thousands of Parties. EUROCRYPT (1) (2022)
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon
Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and More General. IACR Cryptol. ePrint Arch. 2022 (2022)
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon
Efficient Lattice-Based Blind Signatures via Gaussian One-Time Signatures. IACR Cryptol. ePrint Arch. 2022 (2022)
Vadim Lyubashevsky, Ngoc Khanh Nguyen
BLOOM: Bimodal Lattice One-out-of-Many Proofs and Applications. ASIACRYPT (4) (2022)
Vadim Lyubashevsky, Ngoc Khanh Nguyen
BLOOM: Bimodal Lattice One-Out-of-Many Proofs and Applications. IACR Cryptol. ePrint Arch. 2022 (2022)
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler
SMILE: Set Membership from Ideal Lattices with Applications to Ring Signatures and Confidential Transactions. CRYPTO (2) (2021)
Julien Duman, Eike Kiltz, Kathrin Hövelmanns, Vadim Lyubashevsky, Gregor Seiler
Faster Lattice-Based KEMs via a Generic Fujisaki-Okamoto Transform Using Prefix Hashing. IACR Cryptol. ePrint Arch. 2021 (2021)
Vadim Lyubashevsky, Damien Stehlé
Non-applicability of the Gaborit&Aguilar-Melchor patent to Kyber and Saber. IACR Cryptol. ePrint Arch. 2021 (2021)
Julien Duman, Kathrin Hövelmanns, Eike Kiltz, Vadim Lyubashevsky, Gregor Seiler
Faster Lattice-Based KEMs via a Generic Fujisaki-Okamoto Transform Using Prefix Hashing. CCS (2021)
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler
SMILE: Set Membership from Ideal Lattices with Applications to Ring Signatures and Confidential Transactions. IACR Cryptol. ePrint Arch. 2021 (2021)
Julien Duman, Kathrin Hövelmanns, Eike Kiltz, Vadim Lyubashevsky, Gregor Seiler, Dominique Unruh
A Thorough Treatment of Highly-Efficient NTRU Instantiations. IACR Cryptol. ePrint Arch. 2021 (2021)
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon, Gregor Seiler
Shorter Lattice-Based Group Signatures via "Almost Free" Encryption and Other Optimizations. IACR Cryptol. ePrint Arch. 2021 (2021)
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler
Shorter Lattice-Based Zero-Knowledge Proofs via One-Time Commitments. Public Key Cryptography (1) (2021)
Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler
More Efficient Amortization of Exact Zero-Knowledge Proofs for LWE. ESORICS (2) (2021)
Craig Gentry, Shai Halevi, Vadim Lyubashevsky
Practical Non-interactive Publicly Verifiable Secret Sharing with Thousands of Parties. IACR Cryptol. ePrint Arch. 2021 (2021)
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon, Gregor Seiler
Shorter Lattice-Based Group Signatures via "Almost Free" Encryption and Other Optimizations. ASIACRYPT (4) (2021)
Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler
A non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge. IACR Cryptol. ePrint Arch. 2020 (2020)
Thomas Attema, Vadim Lyubashevsky, Gregor Seiler
Practical Product Proofs for Lattice Commitments. IACR Cryptol. ePrint Arch. 2020 (2020)
Jonathan Bootle, Anja Lehmann, Vadim Lyubashevsky, Gregor Seiler
Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions. PQCrypto (2020)
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler
Shorter Lattice-Based Zero-Knowledge Proofs via One-Time Commitments. IACR Cryptol. ePrint Arch. 2020 (2020)
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler
Practical Lattice-Based Zero-Knowledge Proofs for Integer Relations. IACR Cryptol. ePrint Arch. 2020 (2020)
Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler
More Efficient Amortization of Exact Zero-Knowledge Proofs for LWE. IACR Cryptol. ePrint Arch. 2020 (2020)
Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler
A Non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge. CRYPTO (2) (2020)
Thomas Attema, Vadim Lyubashevsky, Gregor Seiler
Practical Product Proofs for Lattice Commitments. CRYPTO (2) (2020)
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler
Practical Lattice-Based Zero-Knowledge Proofs for Integer Relations. CCS (2020)
Rafaël del Pino, Vadim Lyubashevsky, Gregor Seiler
Short Discrete Log Proofs for FHE and Ring-LWE Ciphertexts. Public Key Cryptography (1) (2019)
Vadim Lyubashevsky, Gregor Seiler
NTTRU: Truly Fast NTRU Using NTT. IACR Cryptol. ePrint Arch. 2019 (2019)
Zvika Brakerski, Vadim Lyubashevsky, Vinod Vaikuntanathan, Daniel Wichs
Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing. EUROCRYPT (3) (2019)
Jonathan Bootle, Vadim Lyubashevsky, Gregor Seiler
Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs. IACR Cryptol. ePrint Arch. 2019 (2019)
Rafaël del Pino, Vadim Lyubashevsky, Gregor Seiler
Short Discrete Log Proofs for FHE and Ring-LWE Ciphertexts. IACR Cryptol. ePrint Arch. 2019 (2019)
Jonathan Bootle, Vadim Lyubashevsky, Gregor Seiler
Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs. CRYPTO (1) (2019)
Vadim Lyubashevsky, Gregor Seiler
NTTRU: Truly Fast NTRU Using NTT. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2019 (3) (2019)
Liqun Chen, Nada El Kassem, Anja Lehmann, Vadim Lyubashevsky
A Framework for Efficient Lattice-Based DAA. CYSARM@CCS (2019)
Eike Kiltz, Vadim Lyubashevsky, Christian Schaffner
A Concrete Treatment of Fiat-Shamir Signatures in the Quantum Random-Oracle Model. EUROCRYPT (3) (2018)
Carsten Baum, Jonathan Bootle, Andrea Cerulli, Rafaël Del Pino, Jens Groth, Vadim Lyubashevsky
Sub-Linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits. IACR Cryptol. ePrint Arch. 2018 (2018)
Rafaël Del Pino, Vadim Lyubashevsky, Gregor Seiler
Lattice-Based Group Signatures and Zero-Knowledge Proofs of Automorphism Stability. IACR Cryptol. ePrint Arch. 2018 (2018)
Zvika Brakerski, Vadim Lyubashevsky, Vinod Vaikuntanathan, Daniel Wichs
Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing. IACR Cryptol. ePrint Arch. 2018 (2018)
Rafaël del Pino, Vadim Lyubashevsky, Gregor Seiler
Lattice-Based Group Signatures and Zero-Knowledge Proofs of Automorphism Stability. CCS (2018)
Léo Ducas, Eike Kiltz, Tancrède Lepoint, Vadim Lyubashevsky, Peter Schwabe, Gregor Seiler, Damien Stehlé
CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2018 (1) (2018)
Zvika Brakerski, Vadim Lyubashevsky, Vinod Vaikuntanathan, Daniel Wichs
Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing. Electron. Colloquium Comput. Complex. 25 (2018)
Carsten Baum, Jonathan Bootle, Andrea Cerulli, Rafaël del Pino, Jens Groth, Vadim Lyubashevsky
Sub-linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits. CRYPTO (2) (2018)
Vadim Lyubashevsky, Daniele Micciancio
Asymptotically Efficient Lattice-Based Digital Signatures. J. Cryptol. 31 (3) (2018)
Vadim Lyubashevsky, Gregor Seiler
Short, Invertible Elements in Partially Splitting Cyclotomic Rings and Applications to Lattice-Based Zero-Knowledge Proofs. EUROCRYPT (1) (2018)
Joppe W. Bos, Léo Ducas, Eike Kiltz, Tancrède Lepoint, Vadim Lyubashevsky, John M. Schanck, Peter Schwabe, Gregor Seiler, Damien Stehlé
CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM. EuroS&P (2018)
Carsten Baum, Ivan Damgård, Vadim Lyubashevsky, Sabine Oechsner, Chris Peikert
More Efficient Commitments from Structured Lattice Assumptions. SCN (2018)
Vadim Lyubashevsky, Gregor Seiler
Partially Splitting Rings for Faster Lattice-Based Zero-Knowledge Proofs. IACR Cryptol. ePrint Arch. 2017 (2017)
Vadim Lyubashevsky, Gregory Neven
One-Shot Verifiable Encryption from Lattices. IACR Cryptol. ePrint Arch. 2017 (2017)
Joppe W. Bos, Léo Ducas, Eike Kiltz, Tancrède Lepoint, Vadim Lyubashevsky, John M. Schanck, Peter Schwabe, Damien Stehlé
CRYSTALS - Kyber: a CCA-secure module-lattice-based KEM. IACR Cryptol. ePrint Arch. 2017 (2017)
Carsten Baum, Vadim Lyubashevsky
Simple Amortized Proofs of Shortness for Linear Relations over Polynomial Rings. IACR Cryptol. ePrint Arch. 2017 (2017)
Léo Ducas, Tancrède Lepoint, Vadim Lyubashevsky, Peter Schwabe, Gregor Seiler, Damien Stehlé
CRYSTALS - Dilithium: Digital Signatures from Module Lattices. IACR Cryptol. ePrint Arch. 2017 (2017)
Rafaël del Pino, Vadim Lyubashevsky, Gregory Neven, Gregor Seiler
Practical Quantum-Safe Voting from Lattices. IACR Cryptol. ePrint Arch. 2017 (2017)
Rafaël del Pino, Vadim Lyubashevsky, Gregory Neven, Gregor Seiler
Practical Quantum-Safe Voting from Lattices. CCS (2017)
Vadim Lyubashevsky, Gregory Neven
One-Shot Verifiable Encryption from Lattices. EUROCRYPT (1) (2017)
Eike Kiltz, Vadim Lyubashevsky, Christian Schaffner
A Concrete Treatment of Fiat-Shamir Signatures in the Quantum Random-Oracle Model. IACR Cryptol. ePrint Arch. 2017 (2017)
Rafaël Del Pino, Vadim Lyubashevsky
Amortization with Fewer Equations for Proving Knowledge of Small Secrets. IACR Cryptol. ePrint Arch. 2017 (2017)
Rafaël del Pino, Vadim Lyubashevsky
Amortization with Fewer Equations for Proving Knowledge of Small Secrets. CRYPTO (3) (2017)
Rafaël Del Pino, Vadim Lyubashevsky, David Pointcheval
The Whole is Less than the Sum of its Parts: Constructing More Efficient Lattice-Based AKEs. IACR Cryptol. ePrint Arch. 2016 (2016)
Michel Abdalla, Pierre-Alain Fouque, Vadim Lyubashevsky, Mehdi Tibouchi
Tightly Secure Signatures From Lossy Identification Schemes. J. Cryptol. 29 (3) (2016)
Vadim Lyubashevsky
Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings. ASIACRYPT (2) (2016)
Vadim Lyubashevsky
Digital Signatures Based on the Hardness of Ideal Lattice Problems in all Rings. IACR Cryptol. ePrint Arch. 2016 (2016)
Rafaël del Pino, Vadim Lyubashevsky, David Pointcheval
The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs. SCN (2016)
Vadim Lyubashevsky, Thomas Prest
Quadratic Time, Linear Space Algorithms for Gram-Schmidt Orthogonalization and Gaussian Sampling in Structured Lattices. IACR Cryptol. ePrint Arch. 2015 (2015)
Vadim Lyubashevsky, Daniel Wichs
Simple Lattice Trapdoor Sampling from a Broad Class of Distributions. Public Key Cryptography (2015)
Vadim Lyubashevsky, Thomas Prest
Quadratic Time, Linear Space Algorithms for Gram-Schmidt Orthogonalization and Gaussian Sampling in Structured Lattices. EUROCRYPT (1) (2015)
Fabrice Benhamouda, Stephan Krenn, Vadim Lyubashevsky, Krzysztof Pietrzak
Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings. ESORICS (1) (2015)
Tim Güneysu, Vadim Lyubashevsky, Thomas Pöppelmann
Lattice-Based Signatures: Optimization and Implementation on Reconfigurable Hardware. IEEE Trans. Computers 64 (7) (2015)
Léo Ducas, Vadim Lyubashevsky, Thomas Prest
Efficient Identity-Based Encryption over NTRU Lattices. ASIACRYPT (2) (2014)
Vadim Lyubashevsky, Daniel Wichs
Simple Lattice Trapdoor Sampling from a Broad Class of Distributions. IACR Cryptol. ePrint Arch. 2014 (2014)
Fabrice Benhamouda, Stephan Krenn, Vadim Lyubashevsky, Krzysztof Pietrzak
Efficient Zero-Knowledge Proofs for Commitments from Learning With Errors over Rings. IACR Cryptol. ePrint Arch. 2014 (2014)
Léo Ducas, Vadim Lyubashevsky, Thomas Prest
E fficient Identity-Based Encryption over NTRU Lattices. IACR Cryptol. ePrint Arch. 2014 (2014)
Fabrice Benhamouda, Jan Camenisch, Stephan Krenn, Vadim Lyubashevsky, Gregory Neven
Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures. ASIACRYPT (1) (2014)
Léo Ducas, Alain Durmus, Tancrède Lepoint, Vadim Lyubashevsky
Lattice Signatures and Bimodal Gaussians. CRYPTO (1) (2013)
Vadim Lyubashevsky, Daniel Masny
Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs. CRYPTO (2) (2013)
Vadim Lyubashevsky, Chris Peikert, Oded Regev
On Ideal Lattices and Learning with Errors over Rings. J. ACM 60 (6) (2013)
Léo Ducas, Alain Durmus, Tancrède Lepoint, Vadim Lyubashevsky
Lattice Signatures and Bimodal Gaussians. IACR Cryptol. ePrint Arch. 2013 (2013)
Vadim Lyubashevsky, Daniele Micciancio
Asymptotically Effi cient Lattice-Based Digital Signatures. IACR Cryptol. ePrint Arch. 2013 (2013)
Vadim Lyubashevsky, Chris Peikert, Oded Regev
A Toolkit for Ring-LWE Cryptography. IACR Cryptol. ePrint Arch. 2013 (2013)
Michel Abdalla, Pierre-Alain Fouque, Vadim Lyubashevsky, Mehdi Tibouchi
Tightly-Secure Signatures From Lossy Identification Schemes. IACR Cryptol. ePrint Arch. 2013 (2013)
Vadim Lyubashevsky, Chris Peikert, Oded Regev
A Toolkit for Ring-LWE Cryptography. EUROCRYPT (2013)
Vadim Lyubashevsky, Daniel Masny
Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs. IACR Cryptol. ePrint Arch. 2013 (2013)
Stefan Heyse, Eike Kiltz, Vadim Lyubashevsky, Christof Paar, Krzysztof Pietrzak
Lapin: An Efficient Authentication Protocol Based on Ring-LPN. FSE (2012)
Michel Abdalla, Dario Fiore, Vadim Lyubashevsky
From Selective to Full Security: Semi-generic Transformations in the Standard Model. Public Key Cryptography (2012)
Tim Güneysu, Vadim Lyubashevsky, Thomas Pöppelmann
Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems. CHES (2012)
Vadim Lyubashevsky
Lattice Signatures without Trapdoors. EUROCRYPT (2012)
Michel Abdalla, Dario Fiore, Vadim Lyubashevsky
From Selective to Full Security: Semi-Generic Transformations in the Standard Model. IACR Cryptol. ePrint Arch. 2012 (2012)
Michel Abdalla, Pierre-Alain Fouque, Vadim Lyubashevsky, Mehdi Tibouchi
Tightly-Secure Signatures from Lossy Identification Schemes. EUROCRYPT (2012)
Vadim Lyubashevsky, Chris Peikert, Oded Regev
On Ideal Lattices and Learning with Errors Over Rings. IACR Cryptol. ePrint Arch. 2012 (2012)
Vadim Lyubashevsky
Lattice Signatures Without Trapdoors. IACR Cryptol. ePrint Arch. 2011 (2011)
Vadim Lyubashevsky
Search to decision reduction for the learning with errors over rings problem. ITW (2011)
Vadim Lyubashevsky, Chris Peikert, Oded Regev
On Ideal Lattices and Learning with Errors over Rings. EUROCRYPT (2010)
Vadim Lyubashevsky, Adriana Palacio, Gil Segev
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum. TCC (2010)
Vadim Lyubashevsky, Daniele Micciancio
On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem. CRYPTO (2009)

Vadim Lyubashevsky.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Vadim Lyubashevsky