


default search action
Katharina Boudgoust
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2026
[i18]Katharina Boudgoust, Oleksandra Lapiha, Rafaël del Pino, Thomas Prest:
IND-CCA Lattice Threshold KEM under 30 KiB. IACR Cryptol. ePrint Arch. 2026: 21 (2026)
[i17]Katharina Boudgoust, Laurent Imbert, Loïc Masure, Laz Panard:
Naor-Yung Transform for IND-CCA Probing Security with Lattice Instantiations. IACR Cryptol. ePrint Arch. 2026: 459 (2026)- 2025
[c10]Katharina Boudgoust, Hannah Keller:
Module Learning with Errors with Truncated Matrices. PQCrypto (1) 2025: 255-277
[i16]Katharina Boudgoust, Hannah Keller:
Module Learning with Errors with Truncated Matrices. IACR Cryptol. ePrint Arch. 2025: 120 (2025)
[i15]Katharina Boudgoust, Anamaria Costache:
Improved Rényi Arguments for Lattice-Based Threshold Encryption. IACR Cryptol. ePrint Arch. 2025: 735 (2025)
[i14]Katharina Boudgoust, Oleksandra Lapiha:
Leftover Hash Lemma(s) Over Cyclotomic Rings. IACR Cryptol. ePrint Arch. 2025: 1080 (2025)
[i13]Katharina Boudgoust, Corentin Jeudy, Erkan Tairi, Weiqiang Wen:
Hardness of M-LWE with General Distributions and Applications to Leaky Variants. IACR Cryptol. ePrint Arch. 2025: 1472 (2025)- 2024
[j3]Katharina Boudgoust
, Adeline Roux-Langlois:
Overfull: Too Large Aggregate Signatures Based on Lattices. Comput. J. 67(2): 719-727 (2024)
[c9]Marius A. Aardal, Diego F. Aranha
, Katharina Boudgoust
, Sebastian Kolby, Akira Takahashi:
Aggregating Falcon Signatures with LaBRADOR. CRYPTO (1) 2024: 71-106
[c8]Katharina Boudgoust
, Mark Simkin
:
The Power of NAPs: - Compressing OR-Proofs via Collision-Resistant Hashing. TCC (1) 2024: 35-66
[i12]Marius A. Aardal, Diego F. Aranha, Katharina Boudgoust, Sebastian Kolby, Akira Takahashi:
Aggregating Falcon Signatures with LaBRADOR. IACR Cryptol. ePrint Arch. 2024: 311 (2024)
[i11]Katharina Boudgoust, Mark Simkin:
The Power of NAPs: Compressing OR-Proofs via Collision-Resistant Hashing. IACR Cryptol. ePrint Arch. 2024: 1482 (2024)- 2023
[j2]Katharina Boudgoust
, Corentin Jeudy
, Adeline Roux-Langlois, Weiqiang Wen
:
On the Hardness of Module Learning with Errors with Short Distributions. J. Cryptol. 36(1): 1 (2023)
[c7]Katharina Boudgoust
, Peter Scholl
:
Simple Threshold (Fully Homomorphic) Encryption from LWE with Polynomial Modulus. ASIACRYPT (1) 2023: 371-404
[c6]Katharina Boudgoust
, Akira Takahashi:
Sequential Half-Aggregation of Lattice-Based Signatures. ESORICS (1) 2023: 270-289
[i10]Katharina Boudgoust, Peter Scholl:
Simple Threshold (Fully Homomorphic) Encryption From LWE With Polynomial Modulus. IACR Cryptol. ePrint Arch. 2023: 16 (2023)
[i9]Katharina Boudgoust, Akira Takahashi:
Sequential Half-Aggregation of Lattice-Based Signatures. IACR Cryptol. ePrint Arch. 2023: 159 (2023)- 2022
[j1]Katharina Boudgoust
, Amin Sakzad, Ron Steinfeld:
Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems. Des. Codes Cryptogr. 90(8): 1899-1936 (2022)
[c5]Katharina Boudgoust
, Erell Gachon
, Alice Pellet-Mary:
Some Easy Instances of Ideal-SVP and Implications on the Partial Vandermonde Knapsack Problem. CRYPTO (2) 2022: 480-509
[c4]Katharina Boudgoust
, Corentin Jeudy
, Adeline Roux-Langlois, Weiqiang Wen
:
Entropic Hardness of Module-LWE from Module-NTRU. INDOCRYPT 2022: 78-99
[i8]Katharina Boudgoust, Corentin Jeudy, Adeline Roux-Langlois, Weiqiang Wen:
Entropic Hardness of Module-LWE from Module-NTRU. IACR Cryptol. ePrint Arch. 2022: 245 (2022)
[i7]Katharina Boudgoust, Corentin Jeudy, Adeline Roux-Langlois, Weiqiang Wen:
On the Hardness of Module Learning With Errors with Short Distributions. IACR Cryptol. ePrint Arch. 2022: 472 (2022)
[i6]Katharina Boudgoust, Amin Sakzad, Ron Steinfeld:
Vandermonde meets Regev: Public Key Encryption Schemes Based on Partial Vandermonde Problems. IACR Cryptol. ePrint Arch. 2022: 679 (2022)
[i5]Katharina Boudgoust, Erell Gachon, Alice Pellet-Mary:
Some Easy Instances of Ideal-SVP and Implications on the Partial Vandermonde Knapsack Problem. IACR Cryptol. ePrint Arch. 2022: 709 (2022)- 2021
[b1]Katharina Boudgoust:
Theoretical hardness of algebraically structured learning with errors. (Difficulté théorique des variantes algébriques du problème learning with errors). University of Rennes 1, France, 2021
[c3]Katharina Boudgoust
, Corentin Jeudy
, Adeline Roux-Langlois
, Weiqiang Wen
:
On the Hardness of Module-LWE with Binary Secret. CT-RSA 2021: 503-526
[i4]Katharina Boudgoust, Adeline Roux-Langlois:
Compressed Linear Aggregate Signatures Based on Module Lattices. IACR Cryptol. ePrint Arch. 2021: 263 (2021)
[i3]Katharina Boudgoust, Corentin Jeudy, Adeline Roux-Langlois, Weiqiang Wen:
On the Hardness of Module-LWE with Binary Secret. IACR Cryptol. ePrint Arch. 2021: 265 (2021)- 2020
[c2]Katharina Boudgoust
, Corentin Jeudy
, Adeline Roux-Langlois
, Weiqiang Wen:
Towards Classical Hardness of Module-LWE: The Linear Rank Case. ASIACRYPT (2) 2020: 289-317
[i2]Katharina Boudgoust, Corentin Jeudy, Adeline Roux-Langlois, Weiqiang Wen:
Towards Classical Hardness of Module-LWE: The Linear Rank Case. IACR Cryptol. ePrint Arch. 2020: 1020 (2020)
2010 – 2019
- 2019
[c1]Shi Bai, Katharina Boudgoust
, Dipayan Das, Adeline Roux-Langlois
, Weiqiang Wen
, Zhenfei Zhang:
Middle-Product Learning with Rounding Problem and Its Applications. ASIACRYPT (1) 2019: 55-81
[i1]Shi Bai, Katharina Boudgoust, Dipayan Das, Adeline Roux-Langlois, Weiqiang Wen, Zhenfei Zhang:
Middle-Product Learning with Rounding Problem and its Applications. IACR Cryptol. ePrint Arch. 2019: 1001 (2019)
Coauthor Index

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from
,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from
and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-03-23 00:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID







