Corentin Jeudy

Orcid: 0000-0003-2869-3833

According to our database1, Corentin Jeudy authored at least 15 papers between 2020 and 2026.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Tag-Friendly Lattice Sampler and Applications.
IACR Cryptol. ePrint Arch., 2026

Hardness of M-LWE with General Distributions and Applications to Leaky Variants.
Proceedings of the Public-Key Cryptography - PKC 2026, 2026

Lattice EPID with Efficient Revocation.
Proceedings of the Advances in Cryptology - EUROCRYPT 2026, 2026

2025
Improved Lattice Blind Signatures from Recycled Entropy.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

Worst-Case Lattice Sampler with Truncated Gadgets and Applications.
Proceedings of the Advances in Cryptology - ASIACRYPT 2025, 2025

2024
Design of advanced post-quantum signature schemes. (Conception d'algorithmes de signatures avancées post-quantiques).
PhD thesis, 2024

Phoenix: Hash-and-Sign with Aborts from Lattice Gadgets.
Proceedings of the Post-Quantum Cryptography - 15th International Workshop, 2024

Practical Post-Quantum Signatures for Privacy.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

2023
Revisiting Preimage Sampling for Lattices.
IACR Cryptol. ePrint Arch., 2023

Lattice Signature with Efficient Protocols, Application to Anonymous Credentials.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

2022
Lattice-Based Signature with Efficient Protocols, Revisited.
IACR Cryptol. ePrint Arch., 2022

On the Hardness of Module Learning With Errors with Short Distributions.
IACR Cryptol. ePrint Arch., 2022

Entropic Hardness of Module-LWE from Module-NTRU.
Proceedings of the Progress in Cryptology - INDOCRYPT 2022, 2022

2021
On the Hardness of Module-LWE with Binary Secret.
Proceedings of the Topics in Cryptology - CT-RSA 2021, 2021

2020
Towards Classical Hardness of Module-LWE: The Linear Rank Case.
Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020


  Loading...