Fabrice Mouhartem

Home

Translations: fr
Mon 02 October 2023

Presentation

I am working as an R&D Engineer at XWiki SAS on the Cryptpad project. My research interests lie in the design of provable advanced cryptographic protocols from classical and post-quantum assumptions.

I was previously working at PQShield SAS in Paris after a post-doctorate researcher position at ENS de Lyon on the Prometheus project. Before that, I was a faculty member at IIT Madras under the young international faculty program in the cryptography group to work with Shweta Agrawal from June 2019 to June 2020.
Even before that, I was a visiting researcher at Microsoft Research India in Bangalore.
Prior to this, I was post-doctorate researcher in the LIP team at É.N.S. de Lyon working in the H2020 project Prometheus until December 2018. Before all of these, I was a PhD candidate until October 2018 in the LIP (Laboratoire de l’Informatique du Parallélisme) in Lyon supervised by Benoit Libert on privacy-preserving cryptography from pairings and lattices.

My resume is available either in English or in French.

Contact

If you want to contact me for any reason, it is possible by mail through the following address

mail address: fabrice • mouhartem xwiki • com

My gpg public key is available here, fingerprint: B39B 6BC1 F7A7 A269 3840 B176 11E0 E80E 1243 41EA.
For personal communications, please contact me via sed 's/#/fabrice/;s/#/mouhartem/' <<<'#.#@ens-lyon.org' with this pgp key with fingerprint 8C29 D9C8 1460 0979 5165 D5D6 2C50 33B2 28CF E4E7.

Research

Last publications follow. More details are available [here].

• Benoit Libert, San Ling, Fabrice Mouhartem, Khoa Nguyen and Huaxiong Wang. Adaptive Oblivious Transfer with Access Control from Lattice Assumptions (full version). In Theoretical Computer Science, Elsevier. 2021. [hal]
• Benoît Libert, Marc Joye, Moti Yung, Fabrice Mouhartem. Fully Distributed Non-Interactive Adaptively-Secure Threshold Signature Scheme with Short Shares: Efficiency Considerations and Implementation. At NIST Threshold Cryptography Workshop 2019. [Supporting Implementation] [Slides]
• Benoit Libert, San Ling, Fabrice Mouhartem, Khoa Nguyen et Huaxiong Wang. Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption (full version) In Theoretical Computer Science, Elsevier. ePrint 2016/879. February 2019.
• Benoit Libert, San Ling, Fabrice Mouhartem, Khoa Nguyen and Huaxiong Wang. Adaptive Oblivious Transfer with Access Control from Lattice Assumptions. In Asiacrypt’17. [full version | hal]
• Benoit Libert, San Ling, Fabrice Mouhartem, Khoa Nguyen and Huaxiong Wang. Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions. In Asiacrypt’16. ePrint report 2016/101. 2016.
• Benoit Libert, San Ling, Fabrice Mouhartem, Khoa Nguyen and Huaxiong Wang. Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption. In Asiacrypt’16. ePrint report 2016/879. 2016.

Teaching

More details are available [here].

• 2021 — 2022:
  • Master CyberSec − Advanced Cryptography. I’ll teach a part of the course with Pierre Karpman and Emmanuel Peyre.
  • EPITA Lyon – Theory of Regular Languages. I gave tutorials and practicals of automaton theory at EPITA Lyon with Denis Kuperberg and Amina Doumane.
• 2019 — 2020:
  • CS6190: Recent developments in computer science. Instructor of the course, it is about presenting topics about privacy-preserving cryptography.
• 2017 — 2018:
  • Bachelor − Tutorial of Architecture, Système et Réseaux 1. Tutorials are joinlty given with Alice Pellet--Mary. The course is given by Florent de Dinechin.
  • Bachelor − LIFProjet at University Lyon 1.
• 2016 — 2017:
  • Bachelor – Tutorials of Architecture, Système et Réseaux 2. This course mainly deals with operating systems and networks. Tutorials are jointly given with Valentin Lorentz and Loïc Pottier. The course is given by Michael Rao.
  • Master 1 – Tutorials of Cryptology. The course is jointly given by Damien Stehlé and Benoît Libert.
  • Master 1 – Tutorials of Computational Complexity, the main course is taught by Omar Fawzi
• 2015 — 2016:
  • Bachelor – Tutorials of Programming Theory, the main course is given by Philippe Audebaud and the tutorial is given with Anupam Das and Antoine Plet
  • Master 1 – Tutorials of Computational Complexity, the main course is taught by Omar Fawzi