Vadim Lyubashevsky

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