Exposé de Yevgeniy Dodis sur les avancées de la cryptographie.
I will survey selected recent advances in the field of Leakage-Resilient Cryptography. This booming area is concerned with the design of cryptographic primitives resistant to arbitrary side-channel attacks, where an attacker can repeatedly and adaptively learn information about the secret key, subject only to the constraint that the overall amount of such information is somehow "bounded", so that not the entire secret key is leaked.
I will start by surveying recent results in the so called Bounded Leakage Model, where the overall leakage is bounded by some parameter L, and the goal is to make L large relative to the length of the secret key. Then, I will move to the Bounded Retrieval Model, which ensures that the complexity of the scheme is independent of the leakage bound L (e.g., it does not increase when the leakage parameter L grows). Finally, I briefly mention the more advanced Continuous Leakage-Model, where the secret key is periodically refreshed (public key is fixed !), and the amount of leakage is only bounded in between successive refreshes, but is unbounded overall.
Catégories: Séminaire général du département d'informatique
Mot-clés : sécurité, Code, informatique, cryptographie, confidentialité, identification, clé
Voir aussi
|
|
Cursus :
Yevgeniy Dodis est professeur de cryptographie au département d'informatique de l'Université de New York.
Cliquer ICI pour fermerDernière mise à jour : 18/10/2012
Tous droits réservés
@ 2011 ENS