About me

I am a first-year PhD student at Centre Inria d’Université Côte d’Azur, under the supervision of Benjamin Grégoire. Previously, I was a student at ENS Paris-Saclay for four years, including two in the Parisian Master of Research in Computer Science (MPRI) curriculum.

I am interested in (provable) computer security, verification of cryptographic protocols and specifically how these notions behave under considerations of side-channel attacks. I am also more generally interested in (functional) programming languages, proof assistants, relational logics, probabilistic programming languages, etc.

Since last year, I am agrégé d’informatique, and I am willing to focus my career on teaching, after my PhD. Other hobbies I enjoy include (but are not restricted to) cycling, photography, cinema, reading, badminton, and also practical aspects of computer science and talking about free software. Maybe talking a bit too much about NixOS. Sorry about that.

Previous experiences

Undergraduate internship (2022)

I spent 7 weeks at Sophia Antipolis under the supervision of Benjamin Grégoire. We designed a type system for the Jasmin language able to detect Spectre v1 vulnerabilities. [1]

First-year graduate internship (2023)

I spent 6 months at IMDEA Software Institute under the supervision of Dario Fiore. We worked on a possible extension of a Zero-Knowledge protocol for batch set membership proofs (original paper: [2]).

Second-year graduate internship (2025)

I spent 4 months and a half with Benjamin at Inria Sophia Antipolis. We worked on extending a formal proof (in EasyCrypt) of the security of ML-DSA [3] to a setup with leakage (in the Constant-Time model).

This work is still ongoing and constitutes part of my work (for now) as a PhD.

[1]
B. A. Shivakumar et al., “Typing high-speed cryptography against spectre v1,” in 2023 IEEE symposium on security and privacy (SP), 2023, pp. 1094–1111. doi: 10.1109/SP46215.2023.10179418.
[2]
M. Campanelli, D. Fiore, S. Han, J. Kim, D. Kolonelos, and H. Oh, “Succinct zero-knowledge batch proofs for set accumulators,” in Proceedings of the 2022 ACM SIGSAC conference on computer and communications security, in CCS ’22. New York, NY, USA: Association for Computing Machinery, 2022, pp. 455–469. doi: 10.1145/3548606.3560677.
[3]
M. Barbosa et al., “Fixing and mechanizing the security proof of fiat-shamir with aborts and dilithium,” in Advances in cryptology – CRYPTO 2023, Springer Nature Switzerland, 2023, pp. 358–389. doi: 10.1007/978-3-031-38554-4_12.