Adeline Roux-Langlois

According to our database1, Adeline Roux-Langlois authored at least 23 papers between 2013 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Compressed Linear Aggregate Signatures Based on Module Lattices.
IACR Cryptol. ePrint Arch., 2021

On the Hardness of Module-LWE with Binary Secret.
IACR Cryptol. ePrint Arch., 2021

Log-S-unit lattices using Explicit Stickelberger Generators to solve Approx Ideal-SVP.
IACR Cryptol. ePrint Arch., 2021

Implementation of Lattice Trapdoors on Modules and Applications.
Proceedings of the Post-Quantum Cryptography - 12th International Workshop, 2021

Post-quantum Online Voting Scheme.
Proceedings of the Financial Cryptography and Data Security. FC 2021 International Workshops, 2021

2020
Towards Classical Hardness of Module-LWE: The Linear Rank Case.
IACR Cryptol. ePrint Arch., 2020

Lattice-based (Partially) Blind Signature without Restart.
IACR Cryptol. ePrint Arch., 2020

Twisted-PHS: Using the Product Formula to Solve Approx-SVP in Ideal Lattices.
IACR Cryptol. ePrint Arch., 2020

Constant-Size Lattice-Based Group Signature with Forward Security in the Standard Model.
Proceedings of the Provable and Practical Security - 14th International Conference, ProvSec 2020, Singapore, November 29, 2020

2019
Middle-Product Learning with Rounding Problem and its Applications.
IACR Cryptol. ePrint Arch., 2019

2018
A lattice-based group signature scheme with verifier-local revocation.
Theor. Comput. Sci., 2018

Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather than the Statistical Distance.
J. Cryptol., 2018

Practical Implementation of Ring-SIS/LWE Based Signature and IBE.
Proceedings of the Post-Quantum Cryptography - 9th International Conference, 2018

From Identification Using Rejection Sampling to Signatures via the Fiat-Shamir Transform: Application to the BLISS Signature.
Proceedings of the Advances in Information and Computer Security, 2018

2017
Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges.
Proceedings of the Codes, Cryptology and Information Security, 2017

2015
Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance.
IACR Cryptol. ePrint Arch., 2015

Worst-case to average-case reductions for module lattices.
Des. Codes Cryptogr., 2015

Implementing Candidate Graded Encoding Schemes from Ideal Lattices.
Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

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

GGHLite: More Efficient Multilinear Maps from Ideal Lattices.
IACR Cryptol. ePrint Arch., 2014

Improved Parameters and an Implementation of Graded Encoding Schemes from Ideal Lattices.
IACR Cryptol. ePrint Arch., 2014

2013
Lattice-Based Group Signatures with Logarithmic Signature Size.
IACR Cryptol. ePrint Arch., 2013

Classical hardness of learning with errors.
Proceedings of the Symposium on Theory of Computing Conference, 2013


  Loading...