Middle-Product Learning with Rounding Problem and its Applications. - Shi Bai 001; Katharina Boudgoust; Dipayan Das 001; Adeline Roux-Langlois; Weiqiang Wen; Zhenfei Zhang (IACR Cryptol. ePrint Arch., 2019)

Towards Classical Hardness of Module-LWE: The Linear Rank Case. - Katharina Boudgoust; Corentin Jeudy; Adeline Roux-Langlois; Weiqiang Wen (IACR Cryptol. ePrint Arch., 2020)

On the Hardness of Module-LWE with Binary Secret. - Katharina Boudgoust; Corentin Jeudy; Adeline Roux-Langlois; Weiqiang Wen (IACR Cryptol. ePrint Arch., 2021)

Compressed Linear Aggregate Signatures Based on Module Lattices. - Katharina Boudgoust; Adeline Roux-Langlois (IACR Cryptol. ePrint Arch., 2021)

Theoretical hardness of algebraically structured learning with errors. (Difficulté théorique des variantes algébriques du problème learning with errors). - Katharina Boudgoust (2021)

Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems. - Katharina Boudgoust; Amin Sakzad; Ron Steinfeld (Des. Codes Cryptogr., 2022)

Some Easy Instances of Ideal-SVP and Implications on the Partial Vandermonde Knapsack Problem. - Katharina Boudgoust; Erell Gachon; Alice Pellet-Mary (IACR Cryptol. ePrint Arch., 2022)

Entropic Hardness of Module-LWE from Module-NTRU. - Katharina Boudgoust; Corentin Jeudy; Adeline Roux-Langlois; Weiqiang Wen (IACR Cryptol. ePrint Arch., 2022)

Simple Threshold (Fully Homomorphic) Encryption From LWE With Polynomial Modulus. - Katharina Boudgoust; Peter Scholl (IACR Cryptol. ePrint Arch., 2023)

Sequential Half-Aggregation of Lattice-Based Signatures. - Katharina Boudgoust; Akira Takahashi 002 (IACR Cryptol. ePrint Arch., 2023)

On the Hardness of Module Learning with Errors with Short Distributions. - Katharina Boudgoust; Corentin Jeudy; Adeline Roux-Langlois; Weiqiang Wen (J. Cryptol., 2023)

Aggregating Falcon Signatures with LaBRADOR. - Marius A. Aardal; Diego F. Aranha; Katharina Boudgoust; Sebastian Kolby; Akira Takahashi 002 (IACR Cryptol. ePrint Arch., 2024)

The Power of NAPs: Compressing OR-Proofs via Collision-Resistant Hashing. - Katharina Boudgoust; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2024)

Overfull: Too Large Aggregate Signatures Based on Lattices. - Katharina Boudgoust; Adeline Roux-Langlois (Comput. J., 2024)

Improved Rényi Arguments for Lattice-Based Threshold Encryption. - Katharina Boudgoust; Anamaria Costache (IACR Cryptol. ePrint Arch., 2025)

Hardness of M-LWE with General Distributions and Applications to Leaky Variants. - Katharina Boudgoust; Corentin Jeudy; Erkan Tairi; Weiqiang Wen (IACR Cryptol. ePrint Arch., 2025)

Module Learning with Errors with Truncated Matrices. - Katharina Boudgoust; Hannah Keller (IACR Cryptol. ePrint Arch., 2025)

Leftover Hash Lemma(s) Over Cyclotomic Rings. - Katharina Boudgoust; Oleksandra Lapiha (IACR Cryptol. ePrint Arch., 2025)