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.
719 résultats
-
-
Séminaire
-
Cryptographie
Ind-cpa-d insecurity of approximate and exact homomorphic encryption schemes
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
Generic Attack on Duplex-Bases AEAD Modes using Random Function Statistics
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[…] -
-
-
Séminaire
-
Cryptographie
An extension of Overbeck’s attack with an application to cryptanalysis of Twisted Gabidulin-based schemes.
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
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
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,[…] -
-
-
Groupe de travail
Modélisation statistique et sécurité des générateurs d'aléa pour la cryptographie
Orateur : David Lubicz - DGA, IRMAR
Dans cet exposé on essaie d'expliquer ce que l'on entend pas méthodes statistiques et on donne des exemples concrets d'application dans la cybersécurité.-
Cryptography
-