Vadim Lyubashevsky

Orcid: 0009-0003-5149-264X

According to our database1, Vadim Lyubashevsky authored at least 71 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
The LaZer Library: Lattice-Based Zero Knowledge and Succinct Proofs for Quantum-Safe Privacy.
IACR Cryptol. ePrint Arch., 2024

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

2023
A Framework for Practical Anonymous Credentials from Lattices.
IACR Cryptol. ePrint Arch., 2023

Lattice-Based Blind Signatures: Short, Efficient, and Round-Optimal.
IACR Cryptol. ePrint Arch., 2023

2022
Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and More General.
IACR Cryptol. ePrint Arch., 2022

Efficient Lattice-Based Blind Signatures via Gaussian One-Time Signatures.
IACR Cryptol. ePrint Arch., 2022

BLOOM: Bimodal Lattice One-Out-of-Many Proofs and Applications.
IACR Cryptol. ePrint Arch., 2022

2021
Non-applicability of the Gaborit&Aguilar-Melchor patent to Kyber and Saber.
IACR Cryptol. ePrint Arch., 2021

SMILE: Set Membership from Ideal Lattices with Applications to Ring Signatures and Confidential Transactions.
IACR Cryptol. ePrint Arch., 2021

Shorter Lattice-Based Group Signatures via "Almost Free" Encryption and Other Optimizations.
IACR Cryptol. ePrint Arch., 2021

Practical Non-interactive Publicly Verifiable Secret Sharing with Thousands of Parties.
IACR Cryptol. ePrint Arch., 2021

Faster Lattice-Based KEMs via a Generic Fujisaki-Okamoto Transform Using Prefix Hashing.
IACR Cryptol. ePrint Arch., 2021

A Thorough Treatment of Highly-Efficient NTRU Instantiations.
IACR Cryptol. ePrint Arch., 2021

2020
Shorter Lattice-Based Zero-Knowledge Proofs via One-Time Commitments.
IACR Cryptol. ePrint Arch., 2020

Practical Lattice-Based Zero-Knowledge Proofs for Integer Relations.
IACR Cryptol. ePrint Arch., 2020

More Efficient Amortization of Exact Zero-Knowledge Proofs for LWE.
IACR Cryptol. ePrint Arch., 2020

A non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge.
IACR Cryptol. ePrint Arch., 2020

Practical Product Proofs for Lattice Commitments.
IACR Cryptol. ePrint Arch., 2020

Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions.
Proceedings of the Post-Quantum Cryptography - 11th International Conference, 2020

2019
NTTRU: Truly Fast NTRU Using NTT.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2019

Short Discrete Log Proofs for FHE and Ring-LWE Ciphertexts.
IACR Cryptol. ePrint Arch., 2019

Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs.
IACR Cryptol. ePrint Arch., 2019

A Framework for Efficient Lattice-Based DAA.
Proceedings of the 1st ACM Workshop on Workshop on Cyber-Security Arms Race, 2019

2018
CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2018

Asymptotically Efficient Lattice-Based Digital Signatures.
J. Cryptol., 2018

Lattice-Based Group Signatures and Zero-Knowledge Proofs of Automorphism Stability.
IACR Cryptol. ePrint Arch., 2018

Sub-Linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits.
IACR Cryptol. ePrint Arch., 2018

Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing.
Electron. Colloquium Comput. Complex., 2018

More Efficient Commitments from Structured Lattice Assumptions.
Proceedings of the Security and Cryptography for Networks - 11th International Conference, 2018

CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM.
Proceedings of the 2018 IEEE European Symposium on Security and Privacy, 2018

Short, Invertible Elements in Partially Splitting Cyclotomic Rings and Applications to Lattice-Based Zero-Knowledge Proofs.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

2017
Practical Quantum-Safe Voting from Lattices.
IACR Cryptol. ePrint Arch., 2017

Amortization with Fewer Equations for Proving Knowledge of Small Secrets.
IACR Cryptol. ePrint Arch., 2017

Partially Splitting Rings for Faster Lattice-Based Zero-Knowledge Proofs.
IACR Cryptol. ePrint Arch., 2017

One-Shot Verifiable Encryption from Lattices.
IACR Cryptol. ePrint Arch., 2017

A Concrete Treatment of Fiat-Shamir Signatures in the Quantum Random-Oracle Model.
IACR Cryptol. ePrint Arch., 2017

CRYSTALS - Dilithium: Digital Signatures from Module Lattices.
IACR Cryptol. ePrint Arch., 2017

CRYSTALS - Kyber: a CCA-secure module-lattice-based KEM.
IACR Cryptol. ePrint Arch., 2017

Simple Amortized Proofs of Shortness for Linear Relations over Polynomial Rings.
IACR Cryptol. ePrint Arch., 2017

2016
Tightly Secure Signatures From Lossy Identification Schemes.
J. Cryptol., 2016

The Whole is Less than the Sum of its Parts: Constructing More Efficient Lattice-Based AKEs.
IACR Cryptol. ePrint Arch., 2016

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

2015
Lattice-Based Signatures: Optimization and Implementation on Reconfigurable Hardware.
IEEE Trans. Computers, 2015

Quadratic Time, Linear Space Algorithms for Gram-Schmidt Orthogonalization and Gaussian Sampling in Structured Lattices.
IACR Cryptol. ePrint Arch., 2015

2014
Simple Lattice Trapdoor Sampling from a Broad Class of Distributions.
IACR Cryptol. ePrint Arch., 2014

E fficient Identity-Based Encryption over NTRU Lattices.
IACR Cryptol. ePrint Arch., 2014

Efficient Zero-Knowledge Proofs for Commitments from Learning With Errors over Rings.
IACR Cryptol. ePrint Arch., 2014

Efficient Identity-Based Encryption over NTRU Lattices.
Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014

Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures.
Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014

2013
On Ideal Lattices and Learning with Errors over Rings.
J. ACM, 2013

A Toolkit for Ring-LWE Cryptography.
IACR Cryptol. ePrint Arch., 2013

Asymptotically Effi cient Lattice-Based Digital Signatures.
IACR Cryptol. ePrint Arch., 2013

Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs.
IACR Cryptol. ePrint Arch., 2013

Lattice Signatures and Bimodal Gaussians.
IACR Cryptol. ePrint Arch., 2013

2012
From Selective to Full Security: Semi-Generic Transformations in the Standard Model.
IACR Cryptol. ePrint Arch., 2012

Lapin: An Efficient Authentication Protocol Based on Ring-LPN.
Proceedings of the Fast Software Encryption - 19th International Workshop, 2012

Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems.
Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2012, 2012

2011
Lattice Signatures Without Trapdoors.
IACR Cryptol. ePrint Arch., 2011

Search to decision reduction for the learning with errors over rings problem.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

2009
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum.
IACR Cryptol. ePrint Arch., 2009

A Note on the Distribution of the Distance from a Lattice.
Discret. Comput. Geom., 2009

On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem.
Proceedings of the Advances in Cryptology, 2009

Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures.
Proceedings of the Advances in Cryptology, 2009

2008
Towards practical lattice-based cryptography.
PhD thesis, 2008

The n<sup>c</sup>-Unique Shortest Vector Problem is Hard.
IACR Cryptol. ePrint Arch., 2008

Lattice-Based Identification Schemes Secure Under Active Attacks.
Proceedings of the Public Key Cryptography, 2008

SWIFFT: A Modest Proposal for FFT Hashing.
Proceedings of the Fast Software Encryption, 15th International Workshop, 2008

2006
On Bounded Distance Decoding for General Lattices.
Proceedings of the Approximation, 2006

2005
Generalized Compact Knapsacks are Collision Resistant
Electron. Colloquium Comput. Complex., 2005

On Random High Density Subset Sums
Electron. Colloquium Comput. Complex., 2005

The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem.
Proceedings of the Approximation, 2005


  Loading...