Katharina Boudgoust

Orcid: 0000-0002-3971-9368

According to our database1, Katharina Boudgoust authored at least 18 papers between 2019 and 2025.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Leftover Hash Lemma(s) Over Cyclotomic Rings.
IACR Cryptol. ePrint Arch., 2025

Hardness of M-LWE with General Distributions and Applications to Leaky Variants.
IACR Cryptol. ePrint Arch., 2025

Improved Rényi Arguments for Lattice-Based Threshold Encryption.
IACR Cryptol. ePrint Arch., 2025

Module Learning with Errors with Truncated Matrices.
Proceedings of the Post-Quantum Cryptography - 16th International Workshop, 2025

2024
Overfull: Too Large Aggregate Signatures Based on Lattices.
Comput. J., February, 2024

The Power of NAPs: - Compressing OR-Proofs via Collision-Resistant Hashing.
Proceedings of the Theory of Cryptography - 22nd International Conference, 2024

Aggregating Falcon Signatures with LaBRADOR.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

2023
Sequential Half-Aggregation of Lattice-Based Signatures.
Proceedings of the Computer Security - ESORICS 2023, 2023

Simple Threshold (Fully Homomorphic) Encryption from LWE with Polynomial Modulus.
Proceedings of the Advances in Cryptology - ASIACRYPT 2023, 2023

2022
Vandermonde meets Regev: Public Key Encryption Schemes Based on Partial Vandermonde Problems.
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

Some Easy Instances of Ideal-SVP and Implications on the Partial Vandermonde Knapsack Problem.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

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

Compressed Linear Aggregate Signatures Based on Module Lattices.
IACR Cryptol. ePrint Arch., 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

2019
Middle-Product Learning with Rounding Problem and Its Applications.
Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019


  Loading...