Filtrer par type de contenu

Sélectionnez un ou plusieurs filtres. Ce choix permettra de recharger la page pour afficher les résultats filtrés.

Supprimer tous les filtres

679 résultats

    • Séminaire

    • Cryptographie

    ECDSA White-Box Implementations, Feedback on CHES 2021 WhibOx Contest

    • 29 septembre 2023

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

    Orateur : Agathe Houzelot - Idemia

    Cryptographic algorithms are primarily designed to be secure in the black-box model, where an attacker can only observe their input/output behavior. However in practice, algorithms are rarely executed in a completely isolated environment and additional information is often leaked. In the context of mobile applications or connected objects, devices often lack secure storage to protect secret keys,[…]
    • Séminaire

    • Cryptographie

    Ind-cpa-d insecurity of approximate and exact homomorphic encryption schemes

    • 29 mars 2024

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

    Orateur : Elias Suvanto - Cryptolab

    Fully Homomorphic Encryption enables the evaluation of arbitrary circuits over encrypted data while maintaining the confidentiality of the underlying messages. It greatly enhances functionality but also comes with security challenges for some applications like Threshold FHE. While the standard IND-CPA security is sufficient against honest but curious adversaries, a stronger security notion called[…]
    • Séminaire

    • Cryptographie

    An extension of Overbeck’s attack with an application to cryptanalysis of Twisted Gabidulin-based schemes.

    • 06 octobre 2023

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

    Orateur : Ilaria Zappatore - XLIM

    In this talk, I will discuss the decoding of Gabidulin and related codes from a cryptographic point of view, pointing out that these codes can be decoded solely from the knowledge of a generator matrix. I will also present an extension of Gibson and Overbeck attacks on the generalized GPT encryption scheme (instantiated with the Gabidulin code) for different ranks of the distortion matrix. Finally[…]
    • Séminaire

    • Cryptographie

    Side channel analysis against AEAD lightweight cryptography

    • 24 mai 2024

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

    Orateur : Modou SARRY - IMT Atlantique

    Les dispositifs interconnectés tels que les réseaux de capteurs, la santé, les systèmes de contrôle distribués, l’internet des objets et les systèmes cyber-physiques sont de plus en plus répandus. Cette transition vers de petits appareils engendre de nouvelles préoccupations en matière de sécurité et de vie privée, car de nombreux algorithmes cryptographiques classiques ne répondent pas toujours[…]
    • Séminaire

    • Cryptographie

    Pseudorandom Correlation Generators from the Quasi-Abelian Decoding Problem

    • 19 janvier 2024

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

    Orateur : Clément Ducros - IRIF

    Secure multi-party computing often enhances efficiency by leveraging correlated randomness. Recently, Boyle et al. showcased the effectiveness of pseudorandom correlation generators (PCGs) in producing substantial correlated (pseudo)randomness, specifically for two-party random oblivious linear evaluations (OLEs). This process involves minimal interactions and subsequent local computations,[…]
    • Séminaire

    • Cryptographie

    Generic Attack on Duplex-Bases AEAD Modes using Random Function Statistics

    • 22 septembre 2023

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

    Orateur : Rachelle Heim Boissier - Inria

    Duplex-based authenticated encryption modes with a sufficiently large key length are proven to be secure up to the birthday bound 2^(c/2), where c is the capacity. However this bound is not known to be tight and the complexity of the best known generic attack, which is based on multicollisions, is much larger: it reaches 2^c/α where α represents a small security loss factor. There is thus an[…]