Vadim Lyubashevsky

IBM Research - Zurich — Switzerland

Computer Science · Physical Sciences

40h-index10.2kcitations102works7.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Cryptography and Data Security(91), Complexity and Algorithms in Graphs(44), Cryptographic Implementations and Security(24), Cryptography and Residue Arithmetic(21), Privacy-Preserving Technologies in Data(20)

Publications102 total

Efficient Verifiable Mixnets from Lattices, Revisited
Lecture notes in computer science·2025· 1 cited
The LaZer Library: Lattice-Based Zero Knowledge and Succinct Proofs for Quantum-Safe Privacy
2024· 13 citedOpen Access
Lattice-Based Blind Signatures: Short, Efficient, and Round-Optimal
2023· 22 citedOpen Access
A Thorough Treatment of Highly-Efficient NTRU Instantiations
Lecture notes in computer science·2023· 17 cited
A Framework for Practical Anonymous Credentials from Lattices
Lecture notes in computer science·2023· 21 cited
Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and More General
Lecture notes in computer science·2022· 100 cited
BLOOM: Bimodal Lattice One-out-of-Many Proofs and Applications
Lecture notes in computer science·2022· 20 citedOpen Access
Practical Non-interactive Publicly Verifiable Secret Sharing with Thousands of Parties
Lecture notes in computer science·2022· 54 cited
Efficient Lattice-Based Blind Signatures via Gaussian One-Time Signatures
Lecture notes in computer science·2022· 17 cited
Faster Lattice-Based KEMs via a Generic Fujisaki-Okamoto Transform Using Prefix Hashing
2021· 1 citedOpen Access
Lattice-based digital signatures
National Science Review·2021· 5 citedOpen Access
SMILE: Set Membership from Ideal Lattices with Applications to Ring Signatures and Confidential Transactions
Lecture notes in computer science·2021· 48 cited
More Efficient Amortization of Exact Zero-Knowledge Proofs for LWE
Lecture notes in computer science·2021· 3 cited
Non-applicability of the Gaborit&Aguilar-Melchor patent to Kyber and Saber
HAL (Le Centre pour la Communication Scientifique Directe)·2021Open Access
SMILE: Set Membership from Ideal Lattices with Applications to Ring Signatures and Confidential Transactions.
IACR Cryptology ePrint Archive·2021
Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations
Lecture notes in computer science·2021· 31 cited
Shorter Lattice-Based Zero-Knowledge Proofs via One-Time Commitments
Lecture notes in computer science·2021· 50 cited
Practical Lattice-Based Zero-Knowledge Proofs for Integer Relations
2020· 41 cited
Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions
Lecture notes in computer science·2020· 2 cited
A Non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge
Lecture notes in computer science·2020· 50 cited
page 1 of 6Next →

Frequent Co-authors

Gregor Seiler(17), Daniele Micciancio(8), Ngoc Khanh Nguyen(7), Chris Peikert(5), Léo Ducas(5), Eike Kiltz(4), Tancrède Lepoint(4), Rafaël del Pino(4), Oded Regev(3), Peter Schwabe(3), Damien Stehlé(3), Gregory Neven(3), Jonathan Bootle(3), Thomas Prest(2), Carsten Baum(2), Maxime Plançon(2), Fabrice Benhamouda(2), Stephan Krenn(2), Krzysztof Pietrzak(2), Daniel Wichs(2)