Journée du GREYC
GREYC Bâtiment F 6 Boulevard du Maréchal Juin, Bâtiment F , CaenSéminaire ALGO : Sergej Scheck (GREYC), Knowledge Compilation for Action Languages
Sciences 3- S3 351Abstract : Computational efficiency of a planner in automated planning depends among other things on the formal representation of actions. This motivates the study of the relative succinctness and complexity of queries for languages that can be used to represent actions. We are going to investigate variants of two most common representations, namely the boolean … Continue reading Séminaire ALGO : Sergej Scheck (GREYC), Knowledge Compilation for Action Languages
Journée DyNet (Dynamic Networks – graphe dynamiques)
LE GREYC accueille les journées DyNet (qui devrait se poursuivre par un projet RIN, si la région veut bien nous financer comme elle l'avait promis) le 6 octobre. Voici le programme : 9h30 : café d'accueil 10h00 : Paul Dorbec "Jeux dans les graphes" 10h30 : Éric Sanlaville "Comment étendre les problèmes d'optimisation classiques aux … Continue reading Journée DyNet (Dynamic Networks – graphe dynamiques)
Nouveaux postes au GREYC
La liste des postes d’enseignants-chercheurs au concours en 2021 sera connue courant Janvier 2021.
Pandémie: Retour à la normale
Le laboratoire reprend ses activités de recherche en présentiel suivant le plan de déconfinement mis en place par les tutelles.
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
Nampoina Andriamilanto – Authentification forte par prise d’empreinte de navigateurs
L'authentification web consiste à vérifier que le visiteur d'un site web est bien le détenteur d'un compte. Pour ce faire, plusieurs informations peuvent servir de preuve de détention, dont les empreintes de navigateur. Celles-ci sont des propriétés collectées à partir d'un navigateur permettant d'en constituer une empreinte potentiellement unique. Au travers de cette présentation, nous … Continue reading Nampoina Andriamilanto – Authentification forte par prise d’empreinte de navigateurs
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