Vadim Lyubashevsky

contact information

Cryptography Researcher
Zurich Research Laboratory, Ruschlikon, Switzerland
+41 dash

724

links

Professional Associations

Professional Associations: International Association for Cryptologic Research (IACR)

2022

BLOOM: Bimodal Lattice One-Out-of-Many Proofs and Applications
Vadim Lyubashevsky, Ngoc Khanh Nguyen
ASIACRYPT, 2022

Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and More General
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plancon
CRYPTO, 2022

Efficient Lattice-Based Blind Signatures via Gaussian One-Time Signatures
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plancon
PKC, 2022

Practical Non-interactive Publicly Verifiable Secret Sharing with Thousands of Parties
Craig Gentry, Shai Halevi, Vadim Lyubashevsky
Eurocrypt, 2022

2021

Shorter Lattice-Based Group Signatures via "Almost Free" Encryption and Other Optimizations
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler, Maxime Plancon
Asiacrypt, 2021

Faster Lattice-Based KEMs via a Generic Fujisaki-Okamoto Transform Using Prefix Hashing
Julien Duman, Kathrin Hovelmanns, Eike Kiltz, Vadim Lyubashevsky, Gregor Seiler
CCS, 2021

More Efficient Amortization of Exact Zero-Knowledge Proofs for LWE
Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler
ESORICS, 2021

SMILE: Set Membership from Ideal Lattices with Applications to Ring Signatures and Confidential Transactions
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler
Crypto, 2021

Shorter Lattice-Based Zero-Knowledge Proofs via One-Time Commitments
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler
PKC, 2021

2020

Practical Lattice-Based Zero-Knowledge Proofs for Integer Relations
Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler
CCS, 2020

Practical Product Proofs for Lattice Commitments
Thomas Attema, Vadim Lyubashevsky, Gregor Seiler
Crypto, 2020

A non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge
Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler
Crypto, 2020

Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions
Jonathan Bootle, Anja Lehmann, Vadim Lyubashevsky, Gregor Seiler
PQ Crypto, 2020

2019

A Framework for Efficient Lattice-Based DAA
Liqun Chen, 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
Crypto, 2019

NTTRU: Truly Fast NTRU Using NTT
Vadim Lyubashevsky, Gregor Seiler
CHES, 2019

Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing
Zvika Brakerski, Vadim Lyubashevsky, Vinod Vaikuntanathan, Daniel Wichs
Eurocrypt, 2019

Short Discrete Log Proofs for FHE and Ring-LWE Ciphertexts
Rafael del Pino, Vadim Lyubashevsky, Gregor Seiler
PKC, 2019

2018

Lattice-Based Group Signatures and Zero-Knowledge Proofs of Automorphism Stability
Rafael del Pino, Vadim Lyubashevsky, Gregor Seiler
CCS, 2018

Asymptotically Efficient Lattice-Based Digital Signatures
Vadim Lyubashevsky, Daniele Micciancio
J. Cryptology 31(3), 774--797, 2018

More Efficient Commitments from Structured Lattice Assumptions
Carsten Baum, Ivan Damgard, Vadim Lyubashevsky, Sabine Oechsner, Chris Peikert
SCN, 2018

Sub-Linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits
Carsten Baum, Jonathan Bootle, Andrea Cerulli, Rafael del Pino, Jens Groth, Vadim Lyubashevsky
Crypto, 2018

CRYSTALS-Kyber: a CCA-Secure Module-Lattice-Based KEM
Joppe W. Bos, Leo Ducas, Eike Kiltz, Tancrede Lepoint, Vadim Lyubashevsky, John M. Schanck, Peter Schwabe, Gregor Seiler, Damien Stehle
Euro S&P, 2018

CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme
Leo Ducas, Eike Kiltz, Tancrede Lepoint, Vadim Lyubashevsky, Peter Schwabe, Gregor Seiler, Damien Stehle
CHES 2018(1), 238--268

Short, Invertible Elements in Partially Splitting Cyclotomic Rings and Applications to Lattice-Based Zero-Knowledge Proofs
Vadim Lyubashevsky, Gregor Seiler
Eurocrypt, 2018

A Concrete Treatment of Fiat-Shamir Signatures in the Quantum Random-Oracle Model
Eike Kiltz, Vadim Lyubashevsky, Christian Schaffner
Eurocrypt, 2018

2017

Practical Quantum-Safe Voting from Lattices
Rafael del Pino, Vadim Lyubashevsky, Gregory Neven, Gregor Seiler
CCS, 2017

Amortization with Fewer Equations for Proving Knowledge of Small Secrets
Rafael del Pino, Vadim Lyubashevsky
Crypto, 2017

One-Shot Verifiable Encryption from Lattices
Vadim Lyubashevsky, Gregory Neven
Eurocrypt, 2017

2016

Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings
Vadim Lyubashevsky
Asiacrypt, 2016

The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs
Rafael del Pino, Vadim Lyubashevsky, David Pointcheval
SCN, 2016

Tightly Secure Signatures From Lossy Identification Schemes
Michel Abdalla, Pierre-Alain Fouque, Vadim Lyubashevsky, Mehdi Tibouchi
J. Cryptology 29(3), 597--631, 2016

2015

Lattice-Based Signatures: Optimization and Implementation on Reconfigurable Hardware
Tim Guneysu, Vadim Lyubashevsky, Thomas Poppelmann
IEEE Trans. Computers 64(7), 1954--1967, 2015

Simple Lattice Trapdoor Sampling from a Broad Class of Distributions
Vadim Lyubashevsky, Daniel Wichs
PKC, 2015

Quadratic Time, Linear Space Algorithms for Gram-Schmidt Orthogonalization and Gaussian Sampling in Structured Lattices
Vadim Lyubashevsky, Thomas Prest
Eurocrypt, 2015

Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
Fabrice Benhamouda, Stephan Krenn, Vadim Lyubashevsky, Krzysztof Pietrzak
ESORICS, 2015

2014

Efficient Identity-Based Encryption over NTRU Lattices
Leo Ducas, Vadim Lyubashevsky, Thomas Prest
Asiacrypt, 2014

Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures
Fabrice Benhamouda, Jan Camenisch, Stephan Krenn, Vadim Lyubashevsky, Gregory Neven
Asiacrypt, 2014

2013

On Ideal Lattices and Learning with Errors over Rings
Vadim Lyubashevsky, Chris Peikert, Oded Regev
J. ACM 60(6), 43:1--43:35, 2013

A Toolkit for Ring-LWE Cryptography
Vadim Lyubashevsky, Chris Peikert, Oded Regev
Eurocrypt, 2013

Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs
Vadim Lyubashevsky, Daniel Masny
Crypto, 2013

Lattice Signatures and Bimodal Gaussians
Leo Ducas, Alain Durmus, Tancrede Lepoint, Vadim Lyubashevsky
Crypto, 2013

2012

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

Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
Tim Guneysu, Vadim Lyubashevsky, Thomas Poppelmann
CHES, 2012

From Selective to Full Security: Semi-generic Transformations in the Standard Model
Michel Abdalla, Dario Fiore, Vadim Lyubashevsky
PKC , 2012

Lattice Signatures without Trapdoors
Vadim Lyubashevsky
Eurocrypt, 2012

Tightly-Secure Signatures from Lossy Identification Schemes
Michel Abdalla, Pierre-Alain Fouque, Vadim Lyubashevsky, Mehdi Tibouchi
Eurocrypt, 2012

2011

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

2010

On Ideal Lattices and Learning with Errors over Rings
Vadim Lyubashevsky, Chris Peikert, Oded Regev
Eurocrypt, 2010

Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
Vadim Lyubashevsky, Adriana Palacio, Gil Segev
TCC, 2010

2009

On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
Vadim Lyubashevsky, Daniele Micciancio
Crypto, 2009

Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
Vadim Lyubashevsky
Asiacrypt, 2009

A Note on the Distribution of the Distance from a Lattice
Ishay Haviv, Vadim Lyubashevsky, Oded Regev
Discrete \& Computational Geometry 41(1), 162--176, 2009

2008

Lattice-Based Identification Schemes Secure Under Active Attacks
Vadim Lyubashevsky
PKC, 2008

SWIFFT: A Modest Proposal for FFT Hashing
Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen
FSE, 2008

Asymptotically Efficient Lattice-Based Digital Signatures
Vadim Lyubashevsky, Daniele Micciancio
TCC, 2008

2006

Generalized Compact Knapsacks Are Collision Resistant
Vadim Lyubashevsky, Daniele Micciancio
ICALP, 2006

On Bounded Distance Decoding for General Lattices
Yi-Kai Liu, Vadim Lyubashevsky, Daniele Micciancio
APPROX-RANDOM, 2006

2005

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

Projects and Groups

Security, Privacy & Blockchain @ IBM Research – Zurich

Vadim Lyubashevsky gen_feedback_link(leftr, rightr);