Follow
Adeline Roux-Langlois
Adeline Roux-Langlois
Univ Rennes, CNRS, IRISA
Verified email at irisa.fr - Homepage
Title
Cited by
Cited by
Year
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
6572013
Worst-case to average-case reductions for module lattices
A Langlois, D Stehlé
Designs, Codes and Cryptography 75 (3), 565-599, 2015
3792015
GGHLite: More efficient multilinear maps from ideal lattices
A Langlois, D Stehlé, R Steinfeld
Annual International Conference on the Theory and Applications of …, 2014
1692014
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 (2), 610-640, 2018
1622018
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
1592014
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
1582013
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
372015
Practical implementation of ring-SIS/LWE based signature and IBE
P Bert, PA Fouque, A Roux-Langlois, M Sabt
International Conference on Post-Quantum Cryptography, 271-291, 2018
362018
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
232018
Hardness of decision (R) LWE for any modulus
A Langlois, D Stehlé
Cryptology ePrint Archive, 2012
202012
Twisted-PHS: Using the product formula to solve Approx-SVP in ideal lattices
O Bernard, A Roux-Langlois
International Conference on the Theory and Application of Cryptology and …, 2020
92020
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
72020
Somewhat/fully homomorphic encryption: Implementation progresses and challenges
G Bonnoron, C Fontaine, G Gogniat, V Herbert, V Lapôtre, V Migliore, ...
International Conference on Codes, Cryptology, and Information Security, 68-82, 2017
72017
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
62021
Lattice-based (partially) blind signature without restart
S Bouaziz-Ermann, S Canard, G Eberhart, G Kaim, A Roux-Langlois, ...
Cryptology ePrint Archive, 2020
62020
Middle-product learning with rounding problem and its applications
S Bai, K Boudgoust, D Das, A Roux-Langlois, W Wen, Z Zhang
International Conference on the Theory and Application of Cryptology and …, 2019
62019
Chiffrement avancé à partir du problème Learning with errors
F Laguillaumie, A Langlois, D Stehlé
Informatique Mathématique: une photographie en 2014, 2014
62014
Lattice-Based Cryptography-Security Foundations and Constructions
A Langlois
Theses, Ecole normale supérieure de lyon-ENS LYON, 2014
5*2014
Implementation of lattice trapdoors on modules and applications
P Bert, G Eberhart, L Prabel, A Roux-Langlois, M Sabt
International Conference on Post-Quantum Cryptography, 195-214, 2021
42021
Log-S-unit lattices using Explicit Stickelberger Generators to solve Approx Ideal-SVP
O Bernard, A Lesavourey, TH Nguyen, A Roux-Langlois
Cryptology ePrint Archive, 2021
42021
The system can't perform the operation now. Try again later.
Articles 1–20