Table of contents

  • This session has been presented March 22, 2024.

Description

  • Speaker

    Thibauld Feneuil - CryptoExperts

Zero-knowledge proofs of knowledge are useful tools for designing signature schemes. Among the existing techniques, the MPC-in-Head (MPCitH) paradigm provides a generic framework to build quantum-resilient proofs using techniques from secure multiparty computation. This paradigm has recently been improved in a series of works which makes it an effective and versatile tool. In this talk, I will present the recent advances in post-quantum signatures relying on the MPC-in-the-Head. After a general introduction to MPCitH, I will provide an overview of the state of the art that led to the MPCitH-based candidates that have been submitted to the additional NIST call for post-quantum signatures. Then, I will present the Threshold-Computation-in-the-Head (TCitH) framework, based on joint works with Matthieu Rivain. This framework extends common MPC-in-the-Head techniques by using Shamir’s secret sharing (instead of additive sharing) to achieve significant improvements in terms of sizes and timings.

Next sessions

  • Predicting Module-Lattice Reduction

    • December 19, 2025 (13:45 - 14:45)

    • Batiment 22-23 salle 16 (en face de l'amphi Lebesgue)

    Speaker : Paola de Perthuis - CWI

    Is module-lattice reduction better than unstructured lattice reduction? This question was highlighted as `Q8' in the Kyber NIST standardization submission (Avanzi et al., 2021), as potentially affecting the concrete security of Kyber and other module-lattice-based schemes. Foundational works on module-lattice reduction (Lee, Pellet-Mary, Stehlé, and Wallet, ASIACRYPT 2019; Mukherjee and Stephens[…]

    • Cryptography

  • Séminaire C2 à INRIA Paris

    • January 16, 2026 (10:00 - 17:00)

    • INRIA Paris

    Emmanuel Thomé et Pierrick Gaudry Rachelle Heim Boissier Épiphane Nouetowa Dung Bui Plus d'infos sur https://seminaire-c2.inria.fr/ 

  • Attacking the Supersingular Isogeny Problem: From the Delfs–Galbraith algorithm to oriented graphs

    • January 23, 2026 (13:45 - 14:45)

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    Speaker : Arthur Herlédan Le Merdy - COSIC, KU Leuven

    The threat of quantum computers motivates the introduction of new hard problems for cryptography.One promising candidate is the Isogeny problem: given two elliptic curves, compute a “nice’’ map between them, called an isogeny.In this talk, we study classical attacks on this problem, specialised to supersingular elliptic curves, on which the security of current isogeny-based cryptography relies. In[…]

    • Cryptography

Show previous sessions
Page top