default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaxime Bombar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2023
[b1]Maxime Bombar:
Codes Structurés pour la Cryptographie: des Fondations Théoriques de la Sécurité aux Applications. (Structured Codes for Cryptography: from Source of Hardness to Applications). École Polytechnique, Palaiseau, France, 2023
Conference and Workshop Papers
- 2023
- [c4]Maxime Bombar
, Alain Couvreur, Thomas Debris-Alazard:
Pseudorandomness of Decoding, Revisited: Adapting OHCP to Code-Based Cryptography. ASIACRYPT (7) 2023: 253-283 - [c3]Maxime Bombar, Geoffroy Couteau, Alain Couvreur, Clément Ducros:
Correlated Pseudorandomness from the Hardness of Quasi-Abelian Decoding. CRYPTO (4) 2023: 567-601 - 2022
- [c2]Maxime Bombar, Alain Couvreur, Thomas Debris-Alazard:
On Codes and Learning with Errors over Function Fields. CRYPTO (2) 2022: 513-540 - 2021
- [c1]Maxime Bombar, Alain Couvreur:
Decoding Supercodes of Gabidulin Codes and Applications to Cryptanalysis. PQCrypto 2021: 3-22
Informal and Other Publications
- 2024
- [i10]Maxime Bombar, Dung Bui, Geoffroy Couteau, Alain Couvreur, Clément Ducros, Sacha Servan-Schreiber:
FOLEAGE: 픽4OLE-Based Multi-Party Computation for Boolean Circuits. IACR Cryptol. ePrint Arch. 2024: 429 (2024) - 2023
- [i9]Maxime Bombar, Geoffroy Couteau, Alain Couvreur, Clément Ducros:
Correlated Pseudorandomness from the Hardness of Quasi-Abelian Decoding. CoRR abs/2306.03488 (2023) - [i8]Maxime Bombar, Geoffroy Couteau, Alain Couvreur, Clément Ducros:
Correlated Pseudorandomness from the Hardness of Quasi-Abelian Decoding. IACR Cryptol. ePrint Arch. 2023: 845 (2023) - 2022
- [i7]Maxime Bombar, Alain Couvreur, Thomas Debris-Alazard:
On Codes and Learning With Errors over Function Fields. CoRR abs/2202.13990 (2022) - [i6]Maxime Bombar, Alain Couvreur, Thomas Debris-Alazard:
ON CODES AND LEARNING WITH ERRORS OVER FUNCTION FIELDS. IACR Cryptol. ePrint Arch. 2022: 269 (2022) - [i5]Maxime Bombar, Alain Couvreur, Thomas Debris-Alazard:
On The Pseudorandomness of the Decoding Problem via the Oracle Comparison Problem. IACR Cryptol. ePrint Arch. 2022: 1751 (2022) - 2021
- [i4]Maxime Bombar, Alain Couvreur:
Decoding supercodes of Gabidulin codes and applications to cryptanalysis. CoRR abs/2103.02700 (2021) - [i3]Maxime Bombar, Alain Couvreur:
Right-hand side decoding of Gabidulin code and applications. CoRR abs/2112.07322 (2021) - [i2]Maxime Bombar, Alain Couvreur:
Decoding supercodes of Gabidulin codes and applications to cryptanalysis. IACR Cryptol. ePrint Arch. 2021: 348 (2021) - 2018
- [i1]Maxime Bombar, Alexander Fish:
Delocalisation of one-dimensional marginals of product measures and the capacity of LTI discrete channels. CoRR abs/1809.00459 (2018)
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 2024-10-07 22:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
