Adeline Roux-Langlois

I am a CNRS researcher (Directrice de recherche) in the AMACC team of the GREYC laboratory in Caen, France.
I was previously in the CAPSULE team of the IRISA laboratory in Rennes.

Before I was a Postdoc at EPFL in the LASEC team. I completed my PhD in october 2014 at the ENS de Lyon,
in the AriC team of the LIP laboratory, under the supervision of Damien Stehlé.

Contact details

Office S3-349
GREYC, Caen
6 Boulevard du Maréchal Juin
Batiment Sciences 3, CS 14032
14032 CAEN cedex 5 - France

Phone: +33 (0)2 31 56 73 76
E-mail: adeline.roux-langlois [at] cnrs.fr

Service

• Co-responsible, with Eleonora Guerrini, of the French working group on Codes and Cryptographie (GT C2) since September 2024.
• Co-responsible, with Matthieu Dien, of the working group on gender equality named COPAINE at the GREYC laboratory since January 2024.
• Assistant Director of the CNRS Research Group on Security (GDR SI), CNRS, from September 2023 to October 2024.
• Program Committees:
  
  Eurocrypt 2021, 2024,
  Asiacrypt 2023,
  ACM CCS 2022, 2023,
  PKC 2018, 2023,
  CT-RSA 2022, 2023,
  ACISP 2022,
  Indocrypt 2017, 2018, 2021,
  CRYPTO 2019,
  IMACC 2019,
  Africacrypt 2018, 2019.
  
• Affiliated events chair of the conference Crypto 2024.

• ANR ASTRID AMIRAL, PI (2022-2025)
  AMélioration des sIgnatures reposant sur les Réseaux et Applications aux fonctionnaLités cryptographiques avancées.
  
• PEPR PQ-TLS (2022-2027)
  Post-quantum padlock for web browser.
  

• H2020 project PROMETHEUS (2018-2022)
  PRivacy preserving pOst-quantuM systEms from advanced crypTograpHic mEchanisms Using latticeS.
  
• BPI project RISQ, member (2017-2020)
  Regroupement de l'Industrie française pour la Sécurité Post-Quantique
• Labex Cominlabs TYREX, PI (2017-2019)
  SecuriTY of homomoRphic Encryption with eXotic structures

Publications

Conference papers

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

• Sven Argo, Tim Güneysu, Corentin Jeudy, Georg Land, Adeline Roux-Langlois and Olivier Sanders.
  Practical Post-Quantum Signatures for Privacy.
  Accepted in ACM CCS 2024.

• Léo Ackermann, Adeline Roux-Langlois and Alexandre Wallet.
  Public-key encryption from LIP (extended abstract)
  Accepted in WCC 2024.

• Corentin Jeudy, Adeline Roux-Langlois and Olivier Sanders.
  Phoenix: Hash-and-Sign with Aborts from Lattice Gadgets.
  Accepted in PQCrypto 2024.

• Corentin Jeudy, Adeline Roux-Langlois and Olivier Sanders.
  Lattice Signature with Efficient Protocols, Application to Anonymous Credentials.
  In the proceedings of CRYPTO 2023.

• Malika Izabachène, Lucas Prabel and Adeline Roux-Langlois.
  Identity-based encryption from lattices using approximate trapdoors.
  In the proceedings of ACISP 2023.

• Pierre-Alain Fouque, Adela Georgescu, Chen Qian, Adeline Roux-Langlois and Weiqiang Wen.
  A Generic Transform from Multi-Round Interactive Proof to NIZK.
  In the proceedings of PKC 2023.

• Katharina Boudgoust, Corentin Jeudy, Adeline Roux-Langlois and Weiqiang Wen.
  Entropic Hardness of Module-LWE from Module-NTRU.
  In the proceedings of Indocrypt 2022.

• Olivier Bernard, Andrea Lesavourey, Tuong-Huy Nguyen and Adeline Roux-Langlois.
  Log-S-unit lattices using Explicit Stickelberger Generators to solve Approx Ideal-SVP..
  In the proceedings of ASIACRYPT 2022.

• Katharina Boudgoust and Adeline Roux-Langlois.
  Overfull: Too Large Aggregate Signatures Based on Lattices.
  In CFAIL 2022.

• Pauline Bert, Gautier Eberhart, Lucas Prabel, Adeline Roux-Langlois and Mohamed Sabt.
  Implementation of Lattice Trapdoors on Modules and Applications.
  In the proceedings of PQCrypto 2021.

• Katharina Boudgoust, Corentin Jeudy, Adeline Roux-Langlois and Weiqiang Wen.
  On the Hardness of Module-LWE with Binary Secret.
  In the proceedings of CT-RSA 2021.

• Guillaume Kaim, Sébastien Canard, Adeline Roux-Langlois and Jacques Traoré.
  Post-Quantum Online Voting Scheme.
  In the proceedings of VOTING 2021 (workshop of Financial Cryptography 2021).

• Sébastien Canard, Adela Georgescu, Guillaume Kaim, Adeline Roux-Langlois and Jacques Traoré.
  Constant-size Lattice-Based Group Signature with Forward Security in the Standard Model.
  In the proceedings of ProvSec 2020.

• Olivier Bernard and Adeline Roux-Langlois.
  Twisted-PHS: Using the Product Formula to Solve Approx-SVP in Ideal Lattices.
  In the proceedings of ASIACRYPT 2020.

• Katharina Boudgoust, Corentin Jeudy, Adeline Roux-Langlois and Weiqiang Wen.
  Towards Classical Hardness of Module-LWE: The Linear Rank Case.
  In the proceedings of ASIACRYPT 2020.

• Shi Bai, Katharina Boudgoust, Dipayan Das, Adeline Roux-Langlois, Weiqiang Wen and Zhenfei Zhang.
  Middle-Product Learning with Rounding Problem and Its Applications.
  In the proceedings of ASIACRYPT 2019.

• Pauline Bert and Adeline Roux-Langlois.
  From Identification using Rejection Sampling to Signatures via the Fiat-Shamir Transform: Application to the BLISS Signature.
  In the proceedings of IWSEC 2018.

• Pauline Bert, Pierre-Alain Fouque, Adeline Roux-Langlois and Mohamed Sabt.
  Practical Implementation of Ring-SIS/LWE based Signature and IBE.
  In the proceedings of PQCrypto 2018.

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

• Martin R. Albrecht, Catalin Cocis, Fabien Laguillaumie and Adeline Langlois.
  Implementing Candidate Graded Encoding Schemes from Ideal Lattices.
  In the proceedings of ASIACRYPT 2015.

• Shi Bai, Adeline Langlois, Tancrède Lepoint, Damien Stehlé and Ron Steinfeld.
  Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance.
  In the proceedings of ASIACRYPT 2015 (Best paper award).

• Adeline Langlois, Damien Stehlé and Ron Steinfeld.
  GGHLite: More Efficient Multilinear Maps from Ideal Lattices.
  In the proceedings of Eurocrypt 2014.

• Adeline Langlois, San Ling, Khoa Nguyen and Huaxiong Wang.
  Lattice-Based Group Signatures Scheme with Verifier-local Revocation.
  In the proceedings of PKC 2014.

• Fabien Laguillaumie, Adeline Langlois, Benoît Libert and Damien Stehlé.
  Lattice-Based Group Signatures with Logarithmic Signature Size.
  In the proceedings of Asiacrypt 2013.

• Zvika Brakerski, Adeline Langlois, Chris Peikert, Oded Regev and Damien Stehlé.
  Classical Hardness of Learning with Errors.
  In the proceedings of STOC 2013.

Journal papers

• Katharina Boudgoust and Adeline Roux-Langlois.
  Overfull: Too Large Aggregate Signatures Based on Lattices.
  Accepted in The Computer Journal, 2023.

• Katharina Boudgoust, Corentin Jeudy, Adeline Roux-Langlois and Weiqiang Wen.
  On the Hardness of Module Learning With Errors with Short Distributions.
  In Journal of Cryptology, volume 36(1), 2023.

• San Ling, Khoa Nguyen, Adeline Roux-Langlois and Huaxiong Wang.
  A lattice-based group signatures scheme with verifier-local revocation.
  In Theoretical Computer Science, volume 730, 2018.

• Shi Bai, Tancrède Lepoint, Adeline Roux-Langlois, Amin Sakzad, Damien Stehlé and Ron Steinfeld.
  Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance.
  In Journal of Cryptology, Volume 31(2), 2018.

• Adeline Langlois and Damien Stehlé.
  Worst-case to average-case reductions for module lattices.
  In Designs, Codes and Cryptography, © Springer, 2014.

Chapters

• Fabien Laguillaumie, Adeline Langlois and Damien Stehlé.
  Chiffrement avancé à partir du problème Learning With Errors (in French),
  Chapter of "Informatique Mathématique, une photographie en 2014", Presses Universitaires de Perpignan.

• Pauline Bert, Pierre-Alain Fouque and Adeline Roux-Langlois.
  La cryptographie post-quantique,
  Chapter of "13 défis de la cybersécurité", sous la direction de Gildas Avoine, Marc-Olivier Killijian, CNRS EDITIONS 2020.

PhD thesis

• Lattice-Based Cryptography: Security Foundations and Constructions.
  PhD dissertation, ENS de Lyon, October 2014. Slides.
  

HDR

• On the hardness of the Learning With Errors problem and its variants.
  HDR defence, IRISA Rennes, June 22th, 2021. Slides.
  

Selected talks

• 24/06/2024: Tutorial on Introduction to (lattice-based) cryptography, Cyber in Normandy Summer school, Caen, France.
• 14/08/2023: Tutorial on Lattice-based cryptography, SAC 2023 summer school, University of New Brunswick, Canada.
• 02/06/2023: On the hardness of the Module Learning With Errors problem, Seminar in Cascade Team, Paris, France.
• 06/03/2023: Using structured variants in lattice-based cryptography. Invited lecture at JNCF, CIRM, Marseille, France.
• 13/06/2019: Signatures reposant sur les réseaux. Invited talk Journées nationales du GDR sécurité, Paris, France.
• 24/04/2018: Hardness and advantages of Module-SIS and Module-LWE. Invited talk at ICERM workshop Computational Challenges in the Theory of Lattices, Providence, USA
• 03/12/2015: Implementing Candidate Graded Encoding Schemes from Ideal Lattices, Asiacrypt 2015, Auckland, New Zealand.
• 19/03/2015: Implementing Candidate Graded Encoding Schemes from Ideal Lattices, Seminar in LIRMM, Montpellier, France.
• 04/03/2015: The GGH Multilinear Maps, Lattice meetings in Paris, France.
• 13/05/2014: GGHLite: More Efficient Multilinear Maps from Ideal Lattices, Eurocrypt 2014, Copenhagen, Denmark.
• 31/04/2014: Chiffrement avancé à partir du problème Learning with errors (in French), with Fabien Laguillaumie and Damien Stehlé, EJCIM, Caen, France.
• 27/03/2014: Lattice-Based Signature Scheme with Verifier Local Revocation, PKC 2014, Buenos Aires, Argentina.
• 04/12/2013: Lattice-Based Group Signatures with Logarithmic Signature Size, Asiacrypt 2013, Bangalore, India.
• 14/11/2013: Classical Hardness of Learning with Errors, Séminaire CCA, Paris, France.
• 03/06/2013: Classical Hardness of Learning with Errors, STOC 2013, Palo Alto, USA.

Source code

• GGHLite,
  from the article Implementing Candidate Graded Encoding Schemes from Ideal Lattices.

• IBE scheme,
  from the article Practical Implementation of Ring-SIS/LWE based Signature and IBE.

• Twisted-PHS,
  from the article Twisted-PHS: Using the Product Formula to Solve Approx-SVP in Ideal Lattices.

• Twisted-Stickelberger,
  from the article Log-S-unit lattices using Explicit Stickelberger Generators to solve Approx Ideal-SVP.

• Lattice trapdoors,
  from the article Implementation of Lattice Trapdoors on Modules and Applications.

• Lattice anonymous credential,
  from the articlePractical Post-Quantum Signatures for Privacy.