Vadim Lyubashevsky

Maxime Plançon

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

BLOOM: Bimodal Lattice One-out-of-Many Proofs and Applications.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2022, 2022

2021

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

[BibT_eX]

[DOI]

Damien Stehlé

IACR Cryptol. ePrint Arch., 2021

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

[BibT_eX]

[DOI]

Proceedings of the Public-Key Cryptography - PKC 2021, 2021

More Efficient Amortization of Exact Zero-Knowledge Proofs for LWE.

[BibT_eX]

[DOI]

Proceedings of the Computer Security - ESORICS 2021, 2021

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

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

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

[BibT_eX]

[DOI]

Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

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

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

2020

Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions.

[BibT_eX]

[DOI]

Proceedings of the Post-Quantum Cryptography - 11th International Conference, 2020

A Non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

Practical Product Proofs for Lattice Commitments.

[BibT_eX]

[DOI]

Thomas Attema

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

Practical Lattice-Based Zero-Knowledge Proofs for Integer Relations.

[BibT_eX]

[DOI]

Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

2019

NTTRU: Truly Fast NTRU Using NTT.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Short Discrete Log Proofs for FHE and Ring-LWE Ciphertexts.

[BibT_eX]

[DOI]

Proceedings of the Public-Key Cryptography - PKC 2019, 2019

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

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

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

[BibT_eX]

[DOI]

Jonathan Bootle

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

A Framework for Efficient Lattice-Based DAA.

[BibT_eX]

[DOI]

Proceedings of the 1st ACM Workshop on Workshop on Cyber-Security Arms Race, 2019

2018

CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme.

[BibT_eX]

[DOI]

IACR Trans. Cryptogr. Hardw. Embed. Syst., 2018

More Efficient Commitments from Structured Lattice Assumptions.

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks - 11th International Conference, 2018

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

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

Eike Kiltz

Christian Schaffner

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

Sub-linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

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

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017

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

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

CRYSTALS - Dilithium: Digital Signatures from Module Lattices.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

CRYSTALS - Kyber: a CCA-secure module-lattice-based KEM.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Simple Amortized Proofs of Shortness for Linear Relations over Polynomial Rings.

[BibT_eX]

[DOI]

Carsten Baum

IACR Cryptol. ePrint Arch., 2017

One-Shot Verifiable Encryption from Lattices.

[BibT_eX]

[DOI]

Gregory Neven

Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

Amortization with Fewer Equations for Proving Knowledge of Small Secrets.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

Practical Quantum-Safe Voting from Lattices.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

2016

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

[BibT_eX]

[DOI]

David Pointcheval

Proceedings of the Security and Cryptography for Networks - 10th International Conference, 2016

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

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

2015

Lattice-Based Signatures: Optimization and Implementation on Reconfigurable Hardware.

[BibT_eX]

[DOI]

Tim Güneysu

Thomas Pöppelmann

IEEE Trans. Computers, 2015

Simple Lattice Trapdoor Sampling from a Broad Class of Distributions.

[BibT_eX]

[DOI]

Daniel Wichs

Proceedings of the Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30, 2015

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

[BibT_eX]

[DOI]

Thomas Prest

Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

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

[BibT_eX]

[DOI]

Proceedings of the Computer Security - ESORICS 2015, 2015

2014

E fficient Identity-Based Encryption over NTRU Lattices.

[BibT_eX]

[DOI]

Léo Ducas

Thomas Prest

IACR Cryptol. ePrint Arch., 2014

Efficient Identity-Based Encryption over NTRU Lattices.

[BibT_eX]

[DOI]

Léo Ducas

Thomas Prest

Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014

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

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014

2013

Asymptotically Effi cient Lattice-Based Digital Signatures.

[BibT_eX]

[DOI]

Daniele Micciancio

IACR Cryptol. ePrint Arch., 2013

A Toolkit for Ring-LWE Cryptography.

[BibT_eX]

[DOI]

Chris Peikert

Oded Regev

Proceedings of the Advances in Cryptology, 2013

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

[BibT_eX]

[DOI]

Daniel Masny

Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

Lattice Signatures and Bimodal Gaussians.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2012

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

[BibT_eX]

[DOI]

Michel Abdalla

Dario Fiore

Proceedings of the Public Key Cryptography - PKC 2012, 2012

Lapin: An Efficient Authentication Protocol Based on Ring-LPN.

[BibT_eX]

[DOI]

Proceedings of the Fast Software Encryption - 19th International Workshop, 2012

Lattice Signatures without Trapdoors.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

Tightly-Secure Signatures from Lossy Identification Schemes.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

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

[BibT_eX]

[DOI]

Tim Güneysu

Thomas Pöppelmann

Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2012, 2012

2011

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

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE Information Theory Workshop, 2011

2010

Public-Key Cryptographic Primitives Provably as Secure as Subset Sum.

[BibT_eX]

[DOI]

Adriana Palacio

Gil Segev

Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

On Ideal Lattices and Learning with Errors over Rings.

[BibT_eX]

[DOI]

Chris Peikert

Oded Regev

Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

2009

A Note on the Distribution of the Distance from a Lattice.

[BibT_eX]

[DOI]

Ishay Haviv

Oded Regev

Discret. Comput. Geom., 2009

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

[BibT_eX]

[DOI]