Charlie Jacomme

PostDoc at CISPA

Biography

Interests

Protocol Security
Privacy
Formal Methods
Composition Frameworks

Education

PhD in Computer Science, 2020
ENS Paris-Saclay

Awards

PhD thesis Award of the GdR sécurité
PhD thesis Accessit of the Gilles Kahn award

Program committees

News

NoLimitSecu Podcast

I have been invited by the (french) podcast NoLimitSecu , dedicated to cybersecurity. The episode can be found here. They have lots of interesting stuff (in french), check it out!

NoLimitSecu Podcast

Videos

I’ve starting making some vulgarization videos. There’s a one-minute teaser preview for the Squirrel Prover, as well as a thirteen minutes video outlining its main concepts and ideas. And in French, my thesis in 137 seconds!

Videos

Squirrel Prover

One of my main projects is out in the wild. Learn more on the website now!

Squirrel Prover

Experience

Postdoc

CISPA

Nov 2020 – Present Saarbrucken

Postdoc in the team of Cas Cremers.

PhD student

LSV, ENS Paris-Saclay

Sep 2017 – Sep 2020

PhD under the supervision of Hubert Comon and Steve Kremer.

Recent Publications

Vincent Cheval, Cas Cremers, Alexander Dax, Lucca Hirschi, Charlie Jacomme, Steve Kremer (2023). Hash Gone Bad: Automated discovery of protocol attacks that exploit hash function weaknesses. USENIX Security Symposium (USENIX Security), 2023 - To appear.

Cas Cremers, Charlie Jacome, Philip Lukert (2023). Subterm-based proof techniques for improving the automation and scope of security protocol analysis. Proceedings of the 36th IEEE Computer Security Foundations Symposium (CSF'23) - To appear.

Cas Cremers, Caroline Fontaine, Charlie Jacomme (2022). A Logic and an Interactive Prover for the Computational Post-Quantum Security of Protocols. Proceedings of the 43nd IEEE Symposium on Security and Privacy (S&P'22).

Vincent Cheval, Charlie Jacomme, Steve Kremer, Robert Künnemann (2022). SAPIC+: protocol verifiers of the world, unite!. USENIX Security Symposium (USENIX Security), 2022.

Gilles Barthe, Charlie Jacomme, Steve Kremer (2021). Universal Equivalence and Majority of Probabilistic Programs over Finite Fields. ACM Trans. Comput. Logic.

See all publications

Recent & Upcoming Talks

A formal composition framework

A composition framework suitable for the Bana-Comon logic.

Jan 29, 2020 At CISPA and TU Wien

Decisions problems about propabilistic programs over finite fields, decidability and complexity.

Sep 26, 2019 LICS'20, Annual PhD students day of the formal methods department of LORIA

Symbolic methods in computational cryptography proofs

Jun 18, 2019 CSF'19, Journée GT MFS 2019 and Pesto working group

Gröbner Basis and deducibility

Oct 26, 2018 EJCIM 2018 spring school

Symbolic methods applied to the automation of computational proofs - Building simulators

Aug 12, 2018 FOSAD 18 summer school and Annual PhD students day of the formal methods department of LORIA