Katharina Boudgoust

Orcid: 0000-0002-3971-9368

According to our database1, Katharina Boudgoust authored at least 13 papers between 2019 and 2024.

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

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

Aggregating Falcon Signatures with LaBRADOR.
IACR Cryptol. ePrint Arch., 2024

2023
On the Hardness of Module Learning with Errors with Short Distributions.
J. Cryptol., 2023

Sequential Half-Aggregation of Lattice-Based Signatures.
IACR Cryptol. ePrint Arch., 2023

Simple Threshold (Fully Homomorphic) Encryption From LWE With Polynomial Modulus.
IACR Cryptol. ePrint Arch., 2023

2022
Entropic Hardness of Module-LWE from Module-NTRU.
IACR Cryptol. ePrint Arch., 2022

Some Easy Instances of Ideal-SVP and Implications on the Partial Vandermonde Knapsack Problem.
IACR Cryptol. ePrint Arch., 2022

Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems.
Des. Codes Cryptogr., 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.
IACR Cryptol. ePrint Arch., 2021

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

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


  Loading...