About me

Since September 2023, I am a PhD student in cryptography at LIX & Inria Saclay in the GRACE team under the supervision of Daniel Augot. My research focuses on code-based SNARKs. I study the whole range of these protocols, from arithmetization to proximity testing.

Interest

I am interested in applications of SNARKs beyond blockchain, and particularly on proof of training of AI, for AI regulation. I want to create practical solutions to enable creating regulation on AI without having to forbid them, for instance being able to prove that the training was done with legally obtained data, or in some sense that there are no political biais in recommandation algorithms.

Research

Preprints

• Codes on any Cayley Graph have an Interactive Oracle Proof of Proximity - with Louise Lallemand
  https://hal.science/hal-05058347 - Submitted.
• Bivariate proximity test-based Asynchronous Verifiable Secret Sharing - with Lola-Baie Mallordy, Daniel Augot and Olivier Blazy
  https://hal.science/hal-04986307 - Accepted to Africacrypt 2025.
• Interactive Oracle Proofs of Proximity to Codes on Graphs - with Tanguy Medevielle and Élina Roussel
  https://arxiv.org/abs/2501.14337 - Accepted to ISIT 2025.

Publications

• Quantum Merlin-Arthur proof systems for synthesizing quantum states - with François Le Gall, Yupan Liu and Masayuki Miyamoto
  Quantum, 2025. https://quantum-journal.org/papers/q-2025-04-03-1688/
• Quantum State Synthesis: Relation with Decision Complexity Classes and Impossibility of Synthesis Error Reduction - with François Le Gall
  Rinton Press, Quantum Information & Computation, 2024. https://www.rintonpress.com/journals/doi/QIC24.9-10-3.html

Presentations

• Flowering graphs - Jean-Pierre seminar (16/06/2025) - LAGA seminar (10/04/2025) - Journées C2 (04/04/2025) - CCSW (07/03/2025) - Barracuda (09/01/2025)

Future work

• Efficient encoding in flowering-friendly codes - with Tanguy Medevielle
• Multivariate polynomial commitment scheme - with Daniel Augot

Intern student supervision

I have been in charge of supervising a few students to help me in my research.

• Louise Lallemand, M2 student. February - May 2025
  Attempt to arithmetize to codes on flowering-friendly graphs, and generalization of the flowering IOPP for codes on graphs.
• Élina Roussel, M1 student. March - August 2024
  Studying codes with constant rate, minimal distance and locality, and creating an IOPP for codes on graphs.
• Tamara Topalov, L2 student. February - June 2024 (PRL project, one afternoon per week)
  Compiling programs into arithmetic circuits à la PlonK.

Teaching

I have been teaching assistant for nearly two years in the following courses.

• Introduction to C++ - 14 weeks
  Bachelor second year students
• Introduction to programming in Java - 5 weeks (out of 10)
  First year Polytechnique engineering students

Former research internships

Before starting my PhD, I was student in the computer science department of ENS Paris-Saclay. I did some research internships as part of that curriculum.

• Graduate School of Mathematics, Nagoya University. October 2022 - June 2023
  Quantum state synthesis complexity classes.
  Supervised by François Le Gall.
• GRACE, Inria Saclay. March - August 2022
  Short PCP-like simultaneous verification using interleaved Reed-Solomon codes. Internship report
  Supervised by Daniel Augot.
• LALALab, Università degli studi di Milano. February - July 2021
  Non-self-embedding grammars in weak descriptional complexity.
  Supervised by Giovanni Pighizzini.
• CRIStAL, Université Lille 1. June - July 2020
  Résolution de problèmes de morpion par apprentissage par renforcement.
  Supervised by Philippe Preux.