Classical hardness of learning with errors Z Brakerski, A Langlois, C Peikert, O Regev, D Stehlé
Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013
891 2013 Worst-case to average-case reductions for module lattices A Langlois, D Stehlé
Designs, Codes and Cryptography 75 (3), 565-599, 2015
756 2015 Improved security proofs in lattice-based cryptography: Using the Rényi divergence rather than the statistical distance S Bai, T Lepoint, A Roux-Langlois, A Sakzad, D Stehlé, R Steinfeld
Journal of Cryptology 31, 610-640, 2018
233 2018 GGHLite: More efficient multilinear maps from ideal lattices A Langlois, D Stehlé, R Steinfeld
Annual international conference on the theory and applications of …, 2014
223 2014 Lattice-based group signature scheme with verifier-local revocation A Langlois, S Ling, K Nguyen, H Wang
International workshop on public key cryptography, 345-361, 2014
192 2014 Lattice-based group signatures with logarithmic signature size F Laguillaumie, A Langlois, B Libert, D Stehlé
International conference on the theory and application of cryptology and …, 2013
192 2013 Practical implementation of ring-SIS/LWE based signature and IBE P Bert, PA Fouque, A Roux-Langlois, M Sabt
Post-Quantum Cryptography: 9th International Conference, PQCrypto 2018, Fort …, 2018
71 2018 Implementing candidate graded encoding schemes from ideal lattices MR Albrecht, C Cocis, F Laguillaumie, A Langlois
International Conference on the Theory and Application of Cryptology and …, 2015
46 2015 On the hardness of module learning with errors with short distributions K Boudgoust, C Jeudy, A Roux-Langlois, W Wen
Journal of Cryptology 36 (1), 1, 2023
37 2023 Implementation of lattice trapdoors on modules and applications P Bert, G Eberhart, L Prabel, A Roux-Langlois, M Sabt
Post-Quantum Cryptography: 12th International Workshop, PQCrypto 2021 …, 2021
37 2021 A lattice-based group signature scheme with verifier-local revocation S Ling, K Nguyen, A Roux-Langlois, H Wang
Theoretical Computer Science 730, 1-20, 2018
34 2018 Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices O Bernard, A Roux-Langlois
Advances in Cryptology–ASIACRYPT 2020: 26th International Conference on the …, 2020
33 2020 Towards classical hardness of module-LWE: the linear rank case K Boudgoust, C Jeudy, A Roux-Langlois, W Wen
International Conference on the Theory and Application of Cryptology and …, 2020
30 2020 Lattice signature with efficient protocols, application to anonymous credentials C Jeudy, A Roux-Langlois, O Sanders
Annual International Cryptology Conference, 351-383, 2023
25 * 2023 Hardness of decision (R) LWE for any modulus A Langlois, D Stehlé
Cryptology ePrint Archive, 2012
23 2012 Overfull: Too large aggregate signatures based on lattices K Boudgoust, A Roux-Langlois
The Computer Journal 67 (2), 719-727, 2024
22 * 2024 On the hardness of module-LWE with binary secret K Boudgoust, C Jeudy, A Roux-Langlois, W Wen
Cryptographers’ Track at the RSA Conference, 503-526, 2021
21 2021 Lattice-based (partially) blind signature without restart S Bouaziz-Ermann, S Canard, G Eberhart, G Kaim, A Roux-Langlois, ...
Cryptology ePrint Archive, 2020
19 2020 Log- -unit Lattices Using Explicit Stickelberger Generators to Solve Approx Ideal-SVP O Bernard, A Lesavourey, TH Nguyen, A Roux-Langlois
International Conference on the Theory and Application of Cryptology and …, 2022
18 2022 Constant-size lattice-based group signature with forward security in the standard model S Canard, A Georgescu, G Kaim, A Roux-Langlois, J Traoré
Provable and Practical Security: 14th International Conference, ProvSec 2020 …, 2020
18 2020