Classical hardness of learning with errors. - Zvika Brakerski; Adeline Langlois; Chris Peikert; Oded Regev 001; Damien Stehlé (STOC, 2013)

Lattice-Based Group Signatures with Logarithmic Signature Size. - Fabien Laguillaumie; Adeline Langlois; Benoît Libert; Damien Stehlé (IACR Cryptol. ePrint Arch., 2013)

Improved Parameters and an Implementation of Graded Encoding Schemes from Ideal Lattices. - Martin R. Albrecht; Catalin Cocis; Fabien Laguillaumie; Adeline Langlois (IACR Cryptol. ePrint Arch., 2014)

GGHLite: More Efficient Multilinear Maps from Ideal Lattices. - Adeline Langlois; Damien Stehlé; Ron Steinfeld (IACR Cryptol. ePrint Arch., 2014)

Lattice - Based Cryptography - Security Foundations and Constructions. (Cryptographie reposant sur les réseaux Euclidiens - Fondations de sécurité et Constructions). - Adeline Langlois (2014)

Implementing Candidate Graded Encoding Schemes from Ideal Lattices. - Martin R. Albrecht; Catalin Cocis; Fabien Laguillaumie; Adeline Langlois (ASIACRYPT (2), 2015)

Worst-case to average-case reductions for module lattices. - Adeline Langlois; Damien Stehlé (Des. Codes Cryptogr., 2015)

Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance. - Shi Bai 001; Adeline Langlois; Tancrède Lepoint; Damien Stehlé; Ron Steinfeld (IACR Cryptol. ePrint Arch., 2015)

Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges. - Guillaume Bonnoron; Caroline Fontaine; Guy Gogniat; Vincent Herbert; Vianney Lapôtre; Vincent Migliore; Adeline Roux-Langlois (C2SI, 2017)

From Identification Using Rejection Sampling to Signatures via the Fiat-Shamir Transform: Application to the BLISS Signature. - Pauline Bert; Adeline Roux-Langlois (IWSEC, 2018)

Practical Implementation of Ring-SIS/LWE Based Signature and IBE. - Pauline Bert; Pierre-Alain Fouque; Adeline Roux-Langlois; Mohamed Sabt (PQCrypto, 2018)

Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather than the Statistical Distance. - Shi Bai 001; Tancrède Lepoint; Adeline Roux-Langlois; Amin Sakzad; Damien Stehlé; Ron Steinfeld (J. Cryptol., 2018)

A lattice-based group signature scheme with verifier-local revocation. - San Ling; Khoa Nguyen 002; Adeline Roux-Langlois; Huaxiong Wang (Theor. Comput. Sci., 2018)

Middle-Product Learning with Rounding Problem and its Applications. - Shi Bai 001; Katharina Boudgoust; Dipayan Das 001; Adeline Roux-Langlois; Weiqiang Wen; Zhenfei Zhang (IACR Cryptol. ePrint Arch., 2019)

Constant-Size Lattice-Based Group Signature with Forward Security in the Standard Model. - Sébastien Canard; Adela Georgescu; Guillaume Kaim; Adeline Roux-Langlois; Jacques Traoré (ProvSec, 2020)

Twisted-PHS: Using the Product Formula to Solve Approx-SVP in Ideal Lattices. - Olivier Bernard 002; Adeline Roux-Langlois (IACR Cryptol. ePrint Arch., 2020)

Lattice-based (Partially) Blind Signature without Restart. - Samuel Bouaziz-Ermann; Sébastien Canard; Gautier Eberhart; Guillaume Kaim; Adeline Roux-Langlois; Jacques Traoré (IACR Cryptol. ePrint Arch., 2020)

Towards Classical Hardness of Module-LWE: The Linear Rank Case. - Katharina Boudgoust; Corentin Jeudy; Adeline Roux-Langlois; Weiqiang Wen (IACR Cryptol. ePrint Arch., 2020)

Post-quantum Online Voting Scheme. - Guillaume Kaim; Sébastien Canard; Adeline Roux-Langlois; Jacques Traoré (Financial Cryptography Workshops, 2021)

Implementation of Lattice Trapdoors on Modules and Applications. - Pauline Bert; Gautier Eberhart; Lucas Prabel; Adeline Roux-Langlois; Mohamed Sabt (PQCrypto, 2021)

Log-S-unit lattices using Explicit Stickelberger Generators to solve Approx Ideal-SVP. - Olivier Bernard 002; Andrea Lesavourey; Tuong-Huy Nguyen; Adeline Roux-Langlois (IACR Cryptol. ePrint Arch., 2021)

On the Hardness of Module-LWE with Binary Secret. - Katharina Boudgoust; Corentin Jeudy; Adeline Roux-Langlois; Weiqiang Wen (IACR Cryptol. ePrint Arch., 2021)

Compressed Linear Aggregate Signatures Based on Module Lattices. - Katharina Boudgoust; Adeline Roux-Langlois (IACR Cryptol. ePrint Arch., 2021)

Log-S-unit Lattices Using Explicit Stickelberger Generators to Solve Approx Ideal-SVP. - Olivier Bernard 002; Andrea Lesavourey; Tuong-Huy Nguyen; Adeline Roux-Langlois (ASIACRYPT (3), 2022)

Entropic Hardness of Module-LWE from Module-NTRU. - Katharina Boudgoust; Corentin Jeudy; Adeline Roux-Langlois; Weiqiang Wen (IACR Cryptol. ePrint Arch., 2022)

Lattice-Based Signature with Efficient Protocols, Revisited. - Corentin Jeudy; Adeline Roux-Langlois; Olivier Sanders (IACR Cryptol. ePrint Arch., 2022)

Identity-Based Encryption from Lattices Using Approximate Trapdoors. - Malika Izabachène; Lucas Prabel; Adeline Roux-Langlois (ACISP, 2023)

Lattice Signature with Efficient Protocols, Application to Anonymous Credentials. - Corentin Jeudy; Adeline Roux-Langlois; Olivier Sanders (CRYPTO (2), 2023)

Faster Secret Keys for (T)FHE. - Loris Bergerat; Ilaria Chillotti; Damien Ligier; Jean-Baptiste Orfila; Adeline Roux-Langlois; Samuel Tap (IACR Cryptol. ePrint Arch., 2023)

A Generic Transform from Multi-Round Interactive Proof to NIZK. - Pierre-Alain Fouque; Adela Georgescu; Chen Qian 002; Adeline Roux-Langlois; Weiqiang Wen (IACR Cryptol. ePrint Arch., 2023)

Revisiting Preimage Sampling for Lattices. - Corentin Jeudy; Adeline Roux-Langlois; Olivier Sanders (IACR Cryptol. ePrint Arch., 2023)

On the Hardness of Module Learning with Errors with Short Distributions. - Katharina Boudgoust; Corentin Jeudy; Adeline Roux-Langlois; Weiqiang Wen (J. Cryptol., 2023)

New Secret Keys for Enhanced Performance in (T)FHE. - Loris Bergerat; Ilaria Chillotti; Damien Ligier; Jean-Baptiste Orfila; Adeline Roux-Langlois; Samuel Tap (CCS, 2024)

Phoenix: Hash-and-Sign with Aborts from Lattice Gadgets. - Corentin Jeudy; Adeline Roux-Langlois; Olivier Sanders (PQCrypto (1), 2024)

Practical Post-Quantum Signatures for Privacy. - Sven Argo; Tim Güneysu; Corentin Jeudy; Georg Land; Adeline Roux-Langlois; Olivier Sanders (IACR Cryptol. ePrint Arch., 2024)

Overfull: Too Large Aggregate Signatures Based on Lattices. - Katharina Boudgoust; Adeline Roux-Langlois (Comput. J., 2024)