Table of contents

  • This session has been presented November 08, 2019.

Description

  • Speaker

    Nicolas Aragon - Université de Limoges, exceptionnellement salle Jersey à l'ISTIC

In the past few years, the interest for rank metric based cryptography has drastically increased, especially since the beginning of the NIST Post-Quantum Cryptography standardization process : five rank metric based proposals were submitted to the first round. This talk will present the different approaches and tradeoffs for building Key Encapsulation Mechanisms and Public Key Encryption schemes based on the rank metric, as well as the recent works on digital signature schemes.<br/> lien: http://desktop.visio.renater.fr/scopia?ID=725941***7609&autojoin

Next sessions

  • Comprendre le générateur sac-à-dos (et améliorer les attaques contre lui) / Understanding the Knapsack generator (and improving the attacks against it)

    • May 16, 2025 (13:45 - 14:45)

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

    Speaker : Florette Martinez - Université Picardie Jules Verne

    Résumé : Le générateur sac-à-dos, présenté en 1985 est un générateur pseudo aléatoire annoncé sécurisé qui combine un générateur pseudo aléatoire non sécurisé et un problème dur. Une erreur de design repérée en 2011 permet à W. Meier et S. Knellwolf de retrouver une partie du secret mais les explications théoriques et heuristiques sont partielles. Dans cet exposé, je vais présenter une nouvelle[…]
  • Oblivious Transfer from Zero-Knowledge Proofs (or how to achieve round-optimal quantum Oblivious Transfer without structure)

    • June 06, 2025 (13:45 - 14:45)

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

    Speaker : Léo Colisson - Université Grenoble Alpes

    We provide a generic construction to turn any classical Zero-Knowledge (ZK) protocol into a composable oblivious transfer (OT) protocol (the protocol itself involving quantum interactions), mostly lifting the round-complexity properties and security guarantees (plain-model/statistical security/unstructured functions…) of the ZK protocol to the resulting OT protocol. Such a construction is unlikely[…]
    • Cryptography

Show previous sessions