Mohamed Maouche – Recent Approaches of Speaker Anonymization Techniques
An increasing number of smart devices embed speech-commands. The usage of speech offers simplicity, accessibility and it also opens new human-computer interactions. However, the gathering and exploitation of this type of data raise many privacy threats as speech data is sensitive in nature. Personal information about the speaker can be inferred (e.g., gender, emotion...). In … Continue reading Mohamed Maouche – Recent Approaches of Speaker Anonymization Techniques
Mélissa Rossi – Assessing residual security of lattice-based cryptography
This talk will present a framework for cryptanalysis of lattice-based schemes, when side information —in the form of «hints»— about the secret is available. This presentation outlines a joint work with Dana Dachman-Soled, Léo Ducas and Huijing Gong that was presented in CRYPTO 2020 (EPrint on IACR). This framework generalizes the primal lattice reduction attack, … Continue reading Mélissa Rossi – Assessing residual security of lattice-based cryptography
Isabella Panaccione – The Power Error Locating Pairs algorithm
In this talk we present an overview of some decoding algorithms for Reed-Solomon codes, together with a ``power'' extension of the Error Correcting Pairs algorithm. It is known that several algorithms have been designed in order to decode Reed-Solomon codes. In particular Welch-Berlekamp algorithm and the Error Correcting Pairs algorithm are two classical algorithms which … Continue reading Isabella Panaccione – The Power Error Locating Pairs algorithm
Matthieu Lequesne – Recovering short secret keys of RLCE in polynomial time
The security of most modern public key encryption algorithms (such as RSA) relies on arithmetic problems. Today, the hardness of these problems is threatened by the potential emergence of large quantum computers. For this reason, cryptographers try to come up with new cryptographic schemes relying on families of problems which remain hard to solve even … Continue reading Matthieu Lequesne – Recovering short secret keys of RLCE in polynomial time
Weiqiang Wen – On algorithms for solving Euclidean lattice problems in cryptography
In this talk, we will try to review the state-of-the-art of the algorithms for solving the Euclidean lattice problems underlying cryptography. In more details, this talk contains two parts. In the first part, we will focus on the lattice problems such as approximate Shortest Vector Problem (approx-SVP) and the lattice reduction algorithms as the best … Continue reading Weiqiang Wen – On algorithms for solving Euclidean lattice problems in cryptography
Raphael Bost – A Quick Intro to Searchable Encryption : Theory & Practice – Constructions & Attacks
En distancielIntroduction rapide aux Algorithmes de recherche sur bases de données chiffrées : théorie et pratique - constructions et attaques.
Virginie Lallemand – Attaques Boomerang et chiffrements de type Feistel
En distancielCet exposé se concentre sur une technique de cryptanalyse appelée l'attaque boomerang, introduite en 1999 par David Wagner et récemment affinée dans plusieurs publications.
Miruna Rosca – Private Set Intersection from Homomorphic Encryption: A Python Implementation
En distancielPrivate Set Intersection (PSI) is an interactive protocol between a client and a server. The client holds a set of items X and the server holds a set of items Y. By the end of the protocol, the client learns the intersection of X and Y and nothing else about the server's set, while the … Continue reading Miruna Rosca – Private Set Intersection from Homomorphic Encryption: A Python Implementation
Boly Seck – Cryptographie basée sur les codes et attaque template sur ”Classic McEliece”
Sciences 3- S3 351Les protocoles de sécurité modernes dans la plupart de nos systèmes reposent principalement sur trois fonctions de base de la cryptographie asymétrique : le chiffrement à clé publique, la signature numérique et l’échange de clés. Aujourd’hui, nous ne faisons que de l’échange de clés (TLS 1.3) avec le protocole de Diffie-Hellman sur les courbes elliptiques … Continue reading Boly Seck – Cryptographie basée sur les codes et attaque template sur ”Classic McEliece”