I am currently a visiting researcher at Microsoft Research India in Bangalore.
I’ll start as a visiting faculty at IIT Madras under the young international faculty program in the cryptography group to work with Shweta Agrawal.
I was formerly a post-doctorate researcher in the LIP team at É.N.S. de Lyon working in the H2020 project Prometheus until December 2018. Before that, 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.
If you want to contact me for any reason, it is possible by mail through the address
sed 's/#/fabrice/;s/#/mouhartem/' <<<'#.#@ens-lyon.org', my gpg public key is available here, fingerprint:
8C29 D9C8 1460 0979 5165 D5D6 2C50 33B2 28CF E4E7.
Microsoft Research India Lavelle Road, 9 560001 Bangalore, Karnataka India
+91 80 6658 6000
Places where I was, am or will be:
Last publications follow. More details are available [here].
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.
More details are available [here].