Vadim Lyubashevsky

发表

The nc-Unique Shortest Vector Problem is Hard

Vadim Lyubashevsky, Vadim Lyubashevsky, 2008, IACR Cryptol. ePrint Arch..

More Efficient Amortization of Exact Zero-Knowledge Proofs for LWE

Vadim Lyubashevsky, Jonathan Bootle, Ngoc Khanh Nguyen, 2020, IACR Cryptol. ePrint Arch..

Simple Lattice Trapdoor Sampling from a Broad Class of Distributions

Daniel Wichs, Vadim Lyubashevsky, Daniel Wichs, 2015, Public Key Cryptography.

CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme

Damien Stehlé, Peter Schwabe, Eike Kiltz, 2018, IACR Trans. Cryptogr. Hardw. Embed. Syst..

Lattice-Based Group Signatures and Zero-Knowledge Proofs of Automorphism Stability

Vadim Lyubashevsky, Gregor Seiler, Rafaël Del Pino, 2018, IACR Cryptol. ePrint Arch..

Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs

Vadim Lyubashevsky, Jonathan Bootle, Gregor Seiler, 2019, IACR Cryptol. ePrint Arch..

SWIFFT: A Modest Proposal for FFT Hashing

Chris Peikert, Alon Rosen, Daniele Micciancio, 2008, FSE.

NTTRU: Truly Fast NTRU Using NTT

Vadim Lyubashevsky, Gregor Seiler, Vadim Lyubashevsky, 2019, IACR Cryptol. ePrint Arch..

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

Vadim Lyubashevsky, Vadim Lyubashevsky, 2005, APPROX-RANDOM.

On Ideal Lattices and Learning with Errors over Rings

Chris Peikert, Vadim Lyubashevsky, Oded Regev, 2010, JACM.

Shorter Lattice-Based Zero-Knowledge Proofs via One-Time Commitments

Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler, 2020, IACR Cryptol. ePrint Arch..

Asymptotically Effi cient Lattice-Based Digital Signatures

Daniele Micciancio, Vadim Lyubashevsky, 2008, IACR Cryptol. ePrint Arch..

Public-Key Cryptographic Primitives Provably as Secure as Subset Sum

Gil Segev, Vadim Lyubashevsky, Adriana Palacio, 2010, TCC.

On Random High Density Subset Sums

Vadim Lyubashevsky, 2005, Electron. Colloquium Comput. Complex..

Partially Splitting Rings for Faster Lattice-Based Zero-Knowledge Proofs

Vadim Lyubashevsky, Gregor Seiler, 2017, IACR Cryptol. ePrint Arch..

Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings

Stephan Krenn, Fabrice Benhamouda, Vadim Lyubashevsky, 2015, ESORICS.

Practical Lattice-Based Zero-Knowledge Proofs for Integer Relations

Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler, 2020, IACR Cryptol. ePrint Arch..

Tightly-Secure Signatures from Lossy Identification Schemes

Mehdi Tibouchi, Vadim Lyubashevsky, Pierre-Alain Fouque, 2012, EUROCRYPT.

A Note on the Distribution of the Distance from a Lattice

Vadim Lyubashevsky, Oded Regev, Ishay Haviv, 2009, Discret. Comput. Geom..

Lapin: An Efficient Authentication Protocol Based on Ring-LPN

Christof Paar, Eike Kiltz, Stefan Heyse, 2012, FSE.

From Selective to Full Security: Semi-Generic Transformations in the Standard Model

Dario Fiore, Vadim Lyubashevsky, Michel Abdalla, 2012, IACR Cryptol. ePrint Arch..

On Bounded Distance Decoding for General Lattices

Daniele Micciancio, Vadim Lyubashevsky, Yi-Kai Liu, 2006, APPROX-RANDOM.

Practical Product Proofs for Lattice Commitments

Vadim Lyubashevsky, Gregor Seiler, Thomas Attema, 2020, IACR Cryptol. ePrint Arch..

Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing

Vinod Vaikuntanathan, Zvika Brakerski, Daniel Wichs, 2019, IACR Cryptol. ePrint Arch..

A Concrete Treatment of Fiat-Shamir Signatures in the Quantum Random-Oracle Model

Eike Kiltz, Christian Schaffner, Vadim Lyubashevsky, 2018, IACR Cryptol. ePrint Arch..

Tightly Secure Signatures From Lossy Identification Schemes

Mehdi Tibouchi, Vadim Lyubashevsky, Pierre-Alain Fouque, 2015, Journal of Cryptology.

A Framework for Efficient Lattice-Based DAA

Anja Lehmann, Liqun Chen, Vadim Lyubashevsky, 2019, CYSARM@CCS.

On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem

Daniele Micciancio, Vadim Lyubashevsky, Vadim Lyubashevsky, 2009, CRYPTO.

Short Discrete Log Proofs for FHE and Ring-LWE Ciphertexts

Vadim Lyubashevsky, Gregor Seiler, Rafaël del Pino, 2019, IACR Cryptol. ePrint Arch..

Amortization with Fewer Equations for Proving Knowledge of Small Secrets

Vadim Lyubashevsky, Rafaël Del Pino, Rafaël del Pino, 2017, CRYPTO.

CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM

Damien Stehlé, Peter Schwabe, Eike Kiltz, 2017, 2018 IEEE European Symposium on Security and Privacy (EuroS&P).

Lattice Signatures and Bimodal Gaussians

Léo Ducas, Tancrède Lepoint, Alain Durmus, 2013, IACR Cryptol. ePrint Arch..

Lattice-Based Identification Schemes Secure Under Active Attacks

Vadim Lyubashevsky, Vadim Lyubashevsky, 2008, Public Key Cryptography.

Simple Amortized Proofs of Shortness for Linear Relations over Polynomial Rings

Vadim Lyubashevsky, Carsten Baum, 2017, IACR Cryptol. ePrint Arch..

Sub-Linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits

Jens Groth, Vadim Lyubashevsky, Carsten Baum, 2018, IACR Cryptol. ePrint Arch..

Short, Invertible Elements in Partially Splitting Cyclotomic Rings and Applications to Lattice-Based Zero-Knowledge Proofs

Vadim Lyubashevsky, Gregor Seiler, Vadim Lyubashevsky, 2018, EUROCRYPT.

On Ideal Lattices and Learning with Errors over Rings

Chris Peikert, Vadim Lyubashevsky, Oded Regev, 2010, EUROCRYPT.

Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions

Anja Lehmann, Vadim Lyubashevsky, Jonathan Bootle, 2020, PQCrypto.

Lattice-Based Signatures: Optimization and Implementation on Reconfigurable Hardware

Tim Güneysu, Vadim Lyubashevsky, Thomas Pöppelmann, 2015, IEEE Transactions on Computers.

A non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge

Vadim Lyubashevsky, Jonathan Bootle, Ngoc Khanh Nguyen, 2020, IACR Cryptol. ePrint Arch..

Generalized Compact Knapsacks Are Collision Resistant

Daniele Micciancio, Vadim Lyubashevsky, Vadim Lyubashevsky, 2006, ICALP.

Quadratic Time, Linear Space Algorithms for Gram-Schmidt Orthogonalization and Gaussian Sampling in Structured Lattices

Vadim Lyubashevsky, Thomas Prest, Vadim Lyubashevsky, 2015, EUROCRYPT.

Asymptotically Efficient Lattice-Based Digital Signatures

Daniele Micciancio, Vadim Lyubashevsky, Vadim Lyubashevsky, 2018, Journal of Cryptology.

Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures

Vadim Lyubashevsky, Vadim Lyubashevsky, 2009, ASIACRYPT.

Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings

Vadim Lyubashevsky, Vadim Lyubashevsky, 2016, ASIACRYPT.

Towards practical lattice-based cryptography

Vadim Lyubashevsky, Vadim Lyubashevsky, 2008 .

Efficient Identity-Based Encryption over NTRU Lattices

Léo Ducas, Vadim Lyubashevsky, Thomas Prest, 2014, ASIACRYPT.

CRYSTALS - Dilithium: Digital Signatures from Module Lattices

Damien Stehlé, Peter Schwabe, Léo Ducas, 2017, IACR Cryptol. ePrint Arch..

Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems

Tim Güneysu, Vadim Lyubashevsky, Thomas Pöppelmann, 2012, CHES.

More Efficient Commitments from Structured Lattice Assumptions

Ivan Damgård, Chris Peikert, Sabine Oechsner, 2018, SCN.

The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs

David Pointcheval, Vadim Lyubashevsky, Rafaël del Pino, 2016, SCN.

Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures

Jan Camenisch, Gregory Neven, Stephan Krenn, 2014, ASIACRYPT.

One-Shot Verifiable Encryption from Lattices

Gregory Neven, Vadim Lyubashevsky, G. Neven, 2017, EUROCRYPT.

Practical Quantum-Safe Voting from Lattices

Gregory Neven, Vadim Lyubashevsky, Gregor Seiler, 2017, IACR Cryptol. ePrint Arch..

Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs

Vadim Lyubashevsky, Daniel Masny, 2013, IACR Cryptol. ePrint Arch..

Search to decision reduction for the learning with errors over rings problem

Vadim Lyubashevsky, 2011, 2011 IEEE Information Theory Workshop.

Lattice Signatures Without Trapdoors

Vadim Lyubashevsky, Vadim Lyubashevsky, 2012, IACR Cryptol. ePrint Arch..

A Toolkit for Ring-LWE Cryptography

Chris Peikert, Vadim Lyubashevsky, Oded Regev, 2013, IACR Cryptol. ePrint Arch..

A Thorough Treatment of Highly-Efficient NTRU Instantiations

Eike Kiltz, Dominique Unruh, Kathrin Hövelmanns, 2021, IACR Cryptol. ePrint Arch..

Efficient Lattice-Based Blind Signatures via Gaussian One-Time Signatures

Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plançon, 2022, IACR Cryptology ePrint Archive.

Non-applicability of the Gaborit&Aguilar-Melchor patent to Kyber and Saber

Damien Stehlé, Vadim Lyubashevsky, 2021, IACR Cryptol. ePrint Arch..

SMILE: Set Membership from Ideal Lattices with Applications to Ring Signatures and Confidential Transactions

Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler, 2021, IACR Cryptol. ePrint Arch..

Practical Non-interactive Publicly Verifiable Secret Sharing with Thousands of Parties

Craig Gentry, Shai Halevi, Vadim Lyubashevsky, 2021, IACR Cryptol. ePrint Arch..

Faster Lattice-Based KEMs via a Generic Fujisaki-Okamoto Transform Using Prefix Hashing

Eike Kiltz, Kathrin Hövelmanns, Vadim Lyubashevsky, 2021, IACR Cryptol. ePrint Arch..

Shorter Lattice-Based Group Signatures via "Almost Free" Encryption and Other Optimizations

Vadim Lyubashevsky, Ngoc Khanh Nguyen, Gregor Seiler, 2021, ASIACRYPT.

CRYSTALS-Kyber Algorithm Specifications And Supporting Documentation

Damien Stehlé, Peter Schwabe, Eike Kiltz, 2017 .

Provably Secure FFT Hashing

Chris Peikert, Alon Rosen, Daniele Micciancio, 2006 .