Skip To Main Content
Maxime Bombar on Muck Rack

Maxime Bombar

Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work. Claim your profile

Get in touch with Maxime

Contact Maxime, search articles and posts on X, monitor coverage, and track replies from one place.

Learn more about Muck Rack

Actions

Share this page

Is this you?

As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile

Articles

FOLEAGE: $\mathbb{F}_4$OLE-Based Multi-Party Computation for Boolean Circuits

|
By Sacha Servan-Schreiber, Maxime Bombar, Dung T. Bui, Geoffroy Couteau, Alain Couvreur
| eprint.iacr.org
Paper 2024/429 , Centrum Wiskunde & Informatica , IRIF, Université Paris Cité , CNRS, IRIF, Université Paris Cité , French Institute for Research in Computer Science and Automation, Computer Science Laboratory of the École Polytechnique, Institut Polytechnique de Paris , IRIF, Université Paris Cité , Massachusetts Institute of Technology Secure Multi-party Computation (MPC) allows two or more parties to compute any public function over their privately-held inputs, without revealing any...
Open in Who Shared Issue with article?

Codes Structurés pour la Cryptographie : des Fondations Théoriques de Sécurité aux Applications

|
By Maxime Bombar
| hal.science
Thèse Année : 2023 Codes Structurés pour la Cryptographie : des Fondations Théoriques de Sécurité aux Applications Structured Codes for Cryptography : from Source of Hardness to Applications Mots clés Post-Quantum cryptography Structured codes Cryptanalysis and reductions Pseudorandom correlation generators Carlitz modules Cryptographie post-Quantique Codes structurés Cryptanalyse et réductions Générateur d'aléas corrélé Modules de Carlitz Domaines Cryptographie et sécurité [cs.CR] Théorie de...
Open in Who Shared Issue with article?

On Codes and Learning With Errors over Function Fields

|
By Maxime Bombar, Alain Couvreur, Thomas Debris-Alazard, INRIA Saclay
| eprint.iacr.org
Paper 2022/269 , Institut Polytechnique de Paris, Inria Saclay - Île-de-France Research Centre , Inria Saclay - Île-de-France Research Centre, Institut Polytechnique de Paris , Inria Saclay - Île-de-France Research Centre, Institut Polytechnique de Paris It is a long standing open problem to find search to decision reductions for structured versions of the decoding problem of linear codes.
Open in Who Shared Issue with article?
See all 5 articles