Fabrice Mouhartem

Research

Translations: fr
Wed 22 February 2023

Publications

Journal Papers

• Benoit Libert, San Ling, Fabrice Mouhartem, Khoa Nguyen et Huaxiong Wang. Adaptive Oblivious Transfer with Access Control from Lattice Assumptions (full version). In Theoretical Computer Science, Elsevier. To appear in 2021. [hal]
• 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. 8 February 2019.

Conference Papers

• 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.
• Benoît Libert, Fabrice Mouhartem and Khoa Nguyen. A Lattice-Based Group Signature Scheme with Message-Dependent Opening. In ACNS’16. 2016. [full version | hal]
• Benoît Libert, Fabrice Mouhartem, Thomas Peters and Moti Yung. Practical “Signatures with Efficient Protocols” from Simple Assumptions. In AsiaCCS’16. 2016. [full version | hal]

Workshops

• 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. [paper] [supporting implementation] [Slides]

Talks

Conferences and Seminars

• Conferences:
  • 04/12/2017, Asiacrypt:Adaptive Oblivious Transfer with Access Control from Lattice Assumptions. [Slides]
  • 06/12/2016, Asiacrypt: Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions. [Slides]
  • 20/06/2016, Applied Cryptography and Network Security; A Lattice-Based Group Signature Scheme with Message-Dependent Opening. [Slides]
  • 02/06/2016, AsiaCCS; Practical “Signatures with Efficient Protocols” from Simple Assumptions. [Slides]
• Seminars:
  • CAS³C³ Seminar, Université Grenoble Alpes, 14/10/2019, Lattice-Based Group Signatures in the Standard Model.
  • IIT Madras Department Seminar: 03/08/2018, Privacy-preserving cryptography.
  • Crypto and complexity seminar at Microsoft Research Bangalore: 27/07/2018, Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption
  • Caen’s Seminar:
    • 15/11/2017: Talk about AC-OT from LWE. [Slides]
    • 30/11/2016: Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions. [Slides]
  • Oxford Crypto Seminar: 08/11/2017, talk about AC-OT from Lattice Assumptions. [Slides]
  • Rennes’ Seminar:
    • 16/06/2017: Adaptive Oblivious Transfer with Access Control for NC1 from LWE. [Slides]
    • 28/09/2018, Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption.
  • Aric Seminar:
    • 16/06/2016: Crypto’s fair: Lattice-Based Group Encryption.
    • 24/09/2015: Lattice-based group signatures for dynamic groups.
• Lattice and Crypto Meetings:
  • 06/04/2017: Adaptive Oblivious Transfer from LWE.
  • 01/10/2015: Lattice-based group signatures for dynamic groups.
• GDR-IM’s Meetings:
  • 11/10/2018, GT-C2’s days; Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption. [Slides]
  • 25/04/2017, GT-C2’s days; Adaptive Oblivious Transfer with Access Control for Branching Programs. [Slides]
  • 30/06/2016, GT-Arith’s days (RAIM); Signature de Groupes et Réseaux Euclidiens (in French). [Slides]
  • 06/10/2015, GT-C2’s days; Signature de groupe dynamique à base de réseaux euclidiens (in French). [Slides]

PhD Thesis

• “Privacy-Preserving cryptography from pairing and lattices”. [More information]

Popularisation (In French)

• 07/12/2018: Introductory talk to research at Lycée Albert Einstein in Bagnols-sur-Cèze. Pliage et mathématiques: quelques résultats étonnants. [Slides (fr)]
• Al-Kindi Contest laureates’ day.
  • 15/06/2016: A glance at modern cryptograhy: e-voting
  • 30/05/2018: Zero-Knowledge proofs. [Slides (fr)]
• 22/03/2018: Congrès de Lyon MATh.en.JEANS — Opening conference for middle-school students: Pliage et Mathématiques : quelques résultats étonnants. [Présentation]
• 14/10/2017: Fête de la science − Paper + Folding + Math = Origami.
• 28/05/2017: Rencontres de Mai about the NP-Completeness of Origami.
• 22/10/2016: Journées Nationales de l’APMEP about the NP-Completeness of Origami. [Slides (fr)]
• 15/10/2016: Fête de la science :
  • Workshop about mathematical origamis
  • 20 min. popularisation talk about zero-knowledge proofs [Slides (fr)]
• Recreational Mathematics Seminar
  • 19/11/2014: Zero-Knowledge Proofs [Présentation (fr)]
    • Marie Lhuissier made a colorful presentation of this talk for CNRS’ Image des Maths webpage (in French).
  • 16/03/2016: Origamis.
• 10/10/2015: “Fête de la Science”, workshop about mathematical origamis

Program committees

• IWSEC 2019

Software

• A threshold signature scheme from pairings implemented in C++ using the RELIC library. Available at https://gitlab.inria.fr/fmouhart/threshold-signature.
• A group signature scheme from pairings implemented in C using the RELIC library. Available at https://gitlab.inria.fr/fmouhart/sigmasig-c.

Internships

• Master 2: Lattice-based group signature scheme for dynamic groups, with Benoît Libert, at the LIP. [Report] [Slides]
• Master 1: On the discrete logarithm problem in small characteristic, with Fréderik Vercauteren in KU Leuven. [Report] [Slides]
• Bachelor: Improving GPU energy efficiency using data locality, with Caroline Collange at INRIA Rennes. [Report (fr)] [Slides]