BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//LORIA - ECPv6.16.2//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:LORIA
X-ORIGINAL-URL:https://www.loria.fr
X-WR-CALDESC:Évènements pour LORIA
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20200329T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20201025T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20210328T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20211031T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20220327T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20221030T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20210201T140000
DTEND;TZID=Europe/Paris:20210201T160000
DTSTAMP:20260523T213206
CREATED:20210118T085751Z
LAST-MODIFIED:20210118T085751Z
UID:11494-1612188000-1612195200@www.loria.fr
SUMMARY:PhD defense: Itsaka Rakotonirina
DESCRIPTION:Itsaka Rakotonirina\, PhD student in the Pesto Team\, will defend his thesis on Monday\, February 1st at 2pm. \n \nTitle: Symbolic verification of cryptographic protocols\, theory and practice \nThe defence will be english. You can also find his dissertation here. \nAbstract: \nThis thesis studies the analysis of cryptographic protocols. They are sequences of instructions permitting to interact with a recipient remotely while protecting the sensitive content of the communication from a potential malicious third party. Classical cases where the confidentiality and the integrity of the communication are critical are\, among others\, online payments and medical-service booking\, or electronic voting. \nWe study notions of security defined technically by observational equivalences (which includes among others confidentiality\, anonymity or non-traceability). We designed a program\, DeepSec\, which\, from the description of a protocol for a fixed number of participants\, verifies in a fully-automated way whether the protocol offers a security guarantee of this type. We demonstrate the ability of this tool to analyse complex attack scenarios through several examples\, optimisations\, and a detailed study of the complexity of the underlying problem. \nJury: \nDavid Basin (ETH Zurich) – reviewer\, president \nTamara Rezk (Inria Sophia Antipolis) – reviewer \nMyrto Arapinis (University of Edinburgh) \nVincent Cheval (Inria Nancy) – co-advisor \nThomas Jensen (Inria Rennes) \nSteve Kremer (Inria Nancy) – advisor \n\n\n\nCatuscia Palamidessi (Inria Saclay)
URL:https://www.loria.fr/event/phd-defense-itsaka-rakotonirina/
CATEGORIES:Soutenance
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20210204
DTEND;VALUE=DATE:20210205
DTSTAMP:20260523T213206
CREATED:20210127T090552Z
LAST-MODIFIED:20210127T090552Z
UID:11506-1612396800-1612483199@www.loria.fr
SUMMARY:CISPA-LORIA Virtual Workshop on Cybersecurity
DESCRIPTION:The CISPA – LORIA virtual workshop on cybersecurity will take place on Thursday\, February 4th. \n \n\n\n\nOrganization: Prof. Antoine Joux Program \n\n\n\n\n\n\n\n\n\n10:00am-10:15am: Get together in the gather.town common space (15 min) \n10:30am-10:50am: Benoît-Michel Cogliati (Researcher\, CISPA) and Virginie Lallemand (Researcher\, LORIA): Deterministic Authenticated Encryption GIAE from the Tweakable Pseudorandom Injection TableSpoon (20 min) \n10:50am-11:00am: Discussion (10 min) \n11:00am-11:20am: Bizhan Alipourpijani (PhD Student funded by DigiTrust\, LORIA): Online Attacks on Picture Owner Privacy (20 min) \n11:20am-11:30am: Discussion (10 min) \n11:30am-01:00pm: Lunch break (90 min) \n01:00pm-01:20pm: Robert Künnemann (Research group leader at CISPA): Accountability without bounds! (20 min) \n01:20pm-01:30pm: Discussion (10 min) \n01:30pm-01:35pm:  5-minute break \n01:35pm-01:55pm: Jannik Dreier (Associate Professor at Université de Lorraine\, member of the PESTO team at LORIA): Automatic Generation of Sources Lemmas in Tamarin: Towards Automatic Proofs of Security Protocols (20 min) \n01:55pm-02:05pm: Discussion (10 min) \n02:05pm-02:30pm: Final discussion (25 min) \n\n\n\n\nAbstracts\nSpeakers: Benoît-Michel Cogliati (Research group leader at CISPA) and Virginie Lallemand (CNRS \nresearcher in the CARAMBA team at LORIA) \nTitle: Deterministic Authenticated Encryption GIAE from the Tweakable Pseudorandom Injection TableSpoon \nAbstract: This paper explores the use of fixed-length Tweakable Pseudorandom Injections (TPRIs) in the context of deterministic authenticated encryption (DAE). First\, we propose an efficient generic construction that turns a secure tweakable block cipher (TBC) into an expanding secure TPRI with minimal security loss. Second\, we instantiate this generic structure and present TableSpoon\, a fixed- length TPRI based on Deoxys-BC\, the AES-based tweakable block cipher used in one of the winners of CAESAR. We design and analyze a new TPRI-based DAE scheme that bears similarities to the GCM-SIV mode of operation. Our new mode is highly efficient\, parallelizable\, and offers $(n+\min(n\,t))/2$ bits of security\, where n\,t denote respectively the input block size and the tweak size of the underlying TPRI. When implemented using TableSpoon\, we achieve speeds of 1.20 c/B during the encryption of 64kB messages on the Skylake microarchitecture\, which is significantly faster than earlier TBC-based DAE schemes that offer similar security guarantees. \n===================================================================== \nSpeaker: Bizhan Alipourpijani (PhD Student funded by DigiTrust\, LORIA) Title: Online Attacks on Picture Owner Privacy \nAbstract:\nFacebook is the dominant platform for users to interact\, share pictures\, and stay connected to their friends. Attribute inference attacks are emerging threats to user privacy in social media such as Facebook. We present an online attribute inference attack by leveraging Facebook picture metadata (i) alt-text generated by Facebook to describe picture contents\, and (ii) comments containing words\, emojis posted by other Facebook users. Specifically\, we study the correlation of the picture’s owner with Facebook generated alt-text and comments used by commenters when reacting to the picture. We concentrate on gender attribute\, which is highly relevant for targeted advertising or privacy breaking. We explore how to launch an online gender inference attack on any Facebook user by handling online newly discovered vocabulary using the retrofitting process\, for enriching a core vocabulary built during offline training. Our experiments show that even when the user hides most public data (e.g.\, friend list\, public attribute\, page\, group)\, an attacker can detect user gender with AUC (area under the ROC curve) from 87% to 92%\, depending on the picture metadata availability. Moreover\, we can detect with high accuracy sequences of words leading to gender disclosure\, and accordingly\, enable users to derive countermeasures and configure safely their privacy settings. \n===================================================================== \nSpeaker: Robert Künnemann (Research group leader at CISPA) Title: Accountability without bounds! \n\n\n\n\n\n\nAbstract: Accountability in protocol design allows us to examine\, justify and incentivize trust and provide a basis to act upon attacks that cannot be prevented a priori. We capture accountability as a protocol’s ability to identify the causes of any eventual violation of some security goal and translate it into trace properties that can be automatically verified. More recently\, we extended this verification mechanism with support for an unbounded set of participants. Finally\, we look at accountability in a setting where protocol parties are truly independent\, i.e.\, they can choose not to follow the protocol without giving control to some designated adversary. \n===================================================================== \nSpeaker: Jannik Dreier (Associate Professor at Université de Lorraine\, member of the PESTO team at LORIA) \nTitle: Automatic Generation of Sources Lemmas in Tamarin: Towards Automatic Proofs of Security Protocols \nAbstract: Tamarin is a popular tool dedicated to the formal analysis of security protocols. One major strength of the tool is that it offers an interactive mode\, allowing to go beyond what push-button tools can typically handle. Tamarin is\, for example\, able to verify complex protocols such as TLS\, 5G\, or RFID protocols. However\, one of its drawbacks is its lack of automation. For many simple protocols the user often needs to help Tamarin by writing specific lemmas\, called “sources lemmas”\, which requires some knowledge of the internal behavior of the tool. \nIn this paper\, we propose a technique to automatically generate sources lemmas in Tamarin. We prove formally that our lemmas indeed hold for arbitrary protocols that make use of cryptographic primitives that can be modelled with a subterm convergent equational theory (modulo associativity and commutativity). We have implemented our approach within Tamarin. Our experiments show that\, in most examples of the literature\, we are now able to generate suitable sources lemmas automatically\, in replacement of the hand-written lemmas. As a direct application\, many simple protocols can now be analyzed fully automatically\, while they previously required user interaction. \n\n\n\n 
URL:https://www.loria.fr/event/cispa-loria-virtual-workshop-on-cybersecurity/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20210210T084500
DTEND;TZID=Europe/Paris:20210210T120000
DTSTAMP:20260523T213206
CREATED:20210108T081921Z
LAST-MODIFIED:20210203T103307Z
UID:11472-1612946700-1612958400@www.loria.fr
SUMMARY:Point d'étape du projet LUE OLKi
DESCRIPTION:La communauté OLKi et plus largement les membres des laboratoires du consortium OLKi sont invités le mercredi 10 février matin au point d’étape du projet avec le Comité exécutif de Lorraine Université d’Excellence et des experts extérieurs invités. \n \nProgramme \n\n8h45 – 9h00 : Réglages techniques (15′) \n9h00 – 9h15 : Tour de table (15′) \n9h15 : Présentation des travaux des work packages (1h30) \n9h15 – 9h40 : WP1 Connaissance et ingénierie \n9h40 – 10h05 : WP2 Langage \n10h05 – 10h30 : WP3 Défis sociétaux \n10h30 – 10h45 : Focus sur la plateforme OLKi \n10h45 – 11h00 : Pause (15′) \n11h00 – 12h00 : Discussion entre le Comex LUE\, des experts invités et le comité opérationnel sur le projet et sa trajectoire \n12h00 – 13h00 : Forum autour des pitches avec présence des auteurs pour répondre aux questions\nInscriptions via ce lien
URL:https://www.loria.fr/event/point-detape-du-projet-lue-olki/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20210211T090000
DTEND;TZID=Europe/Paris:20210211T120000
DTSTAMP:20260523T213206
CREATED:20210211T150748Z
LAST-MODIFIED:20210211T150748Z
UID:11510-1613034000-1613044800@www.loria.fr
SUMMARY:PhD defense: Daniel El Ouraoui
DESCRIPTION:Daniel El Ouraoui\, doctorant dans l’équipe Mosel-Veridis\, soutiendra sa thèse intitulée « Méthodes pour le raisonnement d’ordre supérieur dans SMT »\, effectuée sous la direction de Jasmin Blanchette\, Pascal Fontaine et Stephan Merz\, le 11 février à 9h. \n \nRésumé :\n \nLa vérification formelle de programmes informatiques ou de systèmes dits\ncritiques tels que dans le transport\, l’énergie\, etc\, est essentielle pour\ngarantir le bon fonctionnement de ces systèmes. Les méthodes de vérification\nemployées s’appuient très fortement sur des procédés mathématiques et logiques\npermettant de raisonner de manière formelle sur le comportement de ces systèmes.\nCes procédés définissent généralement les comportements sous forme de grands\nensembles de contraintes logiques. L’approche par satisfaisabilité est une\nméthode largement utilisée pour vérifier ces contraintes et est un exemple de\ncas\, où les solveurs SMT (satisfaisabilité modulo théories) sont\nfortement sollicités \nGénéralement\, les solveurs SMT ne gèrent que la logique de premier ordre et ils \nne peuvent généralement pas effectuer de preuves par induction. C’est regrettable\, car la\nplupart des outils de vérification interactifs\, qui utilisent les solveurs SMT\,\nutilisent des langages d’ordre supérieur. \nL’objectif de cette thèse dans sa globalité est d’offrir des solutions pour\naméliorer les interactions entre solveur automatique et assistant de preuves. En\nparticulier nous répondons à deux problématiques importantes permettant\nd’améliorer les usages de solveurs SMT au sein des assistants de preuves. Notre\npremière contribution permet de réduire l’écart entre solveur et assistant de\npreuve en proposant une architecture adaptée pour la logique d’ordre supérieur.\nLa seconde contribution permet d’améliorer les capacités de raisonnement des\nsolveurs SMT pour les quantificateurs. Pour les deux approches développées nous\napportons un ensemble d’évaluation sur des problèmes extraits pour la grande\nmajorité de problèmes de formalisation. Les résultats obtenus lors de ces\névaluations sont encourageants et montrent que les techniques développées dans\ncette thèse peuvent apporter de bonnes améliorations pour les solveurs SMT. \nCe doctorat s’est effectué dans le cadre du projet ERC porté par Jasmin Blanchette\n(Matryoshka)\, un projet qui vise à concevoir des\nprouveurs automatiques utiles pour la vérification interactive\, et réduire\nl’écart entre les prouveurs interactifs et solveurs automatiques. L’un des\nobjectifs concrets du projet est d’étendre les capacités de raisonnement des\nsolveurs SMT vers l’ordre supérieur. \n\n\nMembres du jury :\n \nRapporteurs :\nMme Micaela MAYERO \, Maître de conférences\, IUT de Villetaneuse – Université Sorbonne Paris Nord – FRANCE\nM. Yakoub SALHI \, Professeur\, Université d’Artois – FRANCE\nExaminateurs :\nM. David DÉHARBE\, Professeur\, CLEARSY Aix-en-Provence – FRANCE\n\nMme Catherine DUBOIS\, Professeur\, Ecole Nationale Supérieure d’Informatique pour l’Industrie et l’Entreprise – FRANCE\nMme Chantal KELLER\, Maître de conférences\, LRI\, Université Paris-Saclay – FRANCE\n\n\nEncadrants :\nM. Jasmin BLANCHETTE\, Professeur associé\, Université libre d’Amsterdam – PAYS-BAS\nM. Pascal FONTAINE\, Professeur\, Université de Liège – BELGIQUE\nM. Stephan MERZ\, DR2\, Inria Nancy – Grand Est – FRANCE
URL:https://www.loria.fr/event/phd-defense-daniel-el-ouraoui/
CATEGORIES:Soutenance
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20210212T140000
DTEND;TZID=Europe/Paris:20210212T153000
DTSTAMP:20260523T213206
CREATED:20210211T151125Z
LAST-MODIFIED:20210211T151125Z
UID:11512-1613138400-1613143800@www.loria.fr
SUMMARY:D3 Seminar: Thomas Lambert (Inria Rennes)
DESCRIPTION:Next D3 seminar will take place on February 3rd at 2pm online.\nThomas Lambert\, postdoctoral researcher at Inria Rennes\, will give a presentation entitled ‘Performance Analysis and Optimality Results for Data-Locality Aware Tasks Scheduling with Replicated Inputs »\n\n \n« Replication of data files\, as automatically performed by Distributed File Systems such as HDFS\, is known to have a crucial impact on data locality in addition to system fault tolerance. Indeed\, intuitively\, having more replicas of the same input file gives more opportunities for this task to be processed locally\, i.e.without any input file transfer. Given the practical importance of this problem\, a vast literature has been proposed to schedule tasks\, based on a random placement of replicated input files. Our goal in this study is to evaluate the performance of the default greedy placement algorithm\, both in terms of makespan minimization (minimize the completion time of the last task when non-local processing is forbidden) and communication minimization (minimize the number of non-local tasks when no idle time on resources is allowed). In the case of homogenous tasks\, we are able to prove\, using models based on « balls into bins » and « power of two choices » problems\, that the well known good behavior of classical strategies can be theoretically grounded. Going further\, we even establish that it is possible\, using semi-matchings theory\, to find the optimal solution in very small time. We also use known graph-orientation results to prove that this optimal solution is indeed near-perfect with strong probability. »
URL:https://www.loria.fr/event/d3-seminar-thomas-lambert-inria-rennes/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20210218T130000
DTEND;TZID=Europe/Paris:20210218T174500
DTSTAMP:20260523T213206
CREATED:20210121T173939Z
LAST-MODIFIED:20210121T173939Z
UID:11504-1613653200-1613670300@www.loria.fr
SUMMARY:Journée Fédération Charles Hermite : IA et énergie
DESCRIPTION:Le prochaine journée scientifique de la Fédération Charles Hermite (CRAN\, IECL\, LORIA) aura lieu le 18 février de 13h30 à 17h45 en ligne. \nOrganisée par Vincent Chevrier (équipe Simbiot du Loria) et Antoine Lejay (IECL)\, elle a pour thématique « Intelligence artificielle et énergie ». \n \n\n\n\nNotre société vit actuellement une transition énergétique qui pose de nombreux défis en termes de gestion de la production\, du transport\, du stockage et de la consommation de l’énergie. \nCes défis concernent la société dans sa globalité et leur étude demande une réflexion systémique. Ils posent de nombreuses questions qui dépassent largement le cadre du domaine de l’énergie touchant notamment à celui de l’intelligence artificielle. \nCe séminaire a pour objectif de présenter quelques travaux à l’intersection de l’intelligence artificielle et de l’énergie\, et plus particulièrement deux facettes de l’intelligence artificielle qui sont les systèmes multi-agents et l’apprentissage. \nCe séminaire est organisé dans le cadre institutionnel de la fédération Charles Hermite. \nORGANISATION PRATIQUE \nCe séminaire a lieu en distanciel sous TEAMS. \n– PROGRAMME PRÉVISIONNEL – \n13h30 : Introduction (Antoine Lejay\, Vincent Chevrier) \nSession 1 (14h – 15h30) \n1. Autoconsommation collective de l’énergie et simulation multi-agent de l’activité humaine \nPrésentateur : Nicolas Sabouret (Laboratoire Interdisciplinaire des Sciences du Numérique-LISN\, Université Paris-Saclay) \nContributeurs : \n\nJérémy Albouys-Perrois (LISN et Université de La Rochelle)\nMathieu Schumann (EDF R&D)\nChristian Inard (Laboratoire des Sciences de l’Ingénieur pour l’Environnement (LaSIE)\,\nUniversité de La Rochelle)\nYvon Haradji\nRésumé :\nNos travaux se situent dans le cadre du projet SMACH fruit d’une collaboration de plus de 10 ans entre EDF R&D et le CNRS autour de la simulation multi-agent de l’activité en relation avec la consommation énergétique. Nous présenterons nos derniers travaux qui portent sur la modélisation de l’AutoConsommation Collective (ACC) au sein du secteur résidentiel. L’originalité de notre approche multi-agent et multi-niveau est sa capacité de simuler l’autoconsommation collective dans des configurations contractuelles variées\, en plaçant au centre de la démarche les processus de décision des foyers et de leurs occupants\, et en prenant en compte la diversité de l’activité humaine et le comportement thermique des bâtiments comme base de la consommation d’énergie. L’articulation de ces composantes est absente des travaux actuels dans ce domaine\, alors même que plusieurs études ont montré leur importance. Nous présenterons notre modélisation des échanges contractuels de l’énergie au sein de groupements de foyers partageant une organisation des échanges. Nous illustrerons les possibilités de notre modèle à travers l’étude de quelques cas d’étude métiers pour différentes configurations d’ACC.\n\n\n\n\n\n\n\n\n\n\n2. Maitriser l’énergie pour la durabilité de la matière communicante : application au projet McBIM \nPrésentateurs : William Derigent et Michael David (CRAN – Université de Lorraine) \nRésumé :\nEn 2009\, le CRAN a débuté l’étude du concept de « matières communicantes »\, qui sont des matériaux capables de traiter\, d’échanger de l’information et de stocker des données dans leur structure interne. L’objectif du projet ANR McBIM\, porté par le CRAN\, est de concevoir un béton intelligent\, instrumenté dès sa fabrication avec des capteurs communicants sans fil\, et connecté à son environnement et aux services du BIM (Building Information Modelling) tout au long de son cycle de vie. Construire ce béton impose de pouvoir lever les obstacles scientifiques sous-jacents liés à la problématique de préservation d’énergie qui sont a) la conception de communications sans-fil robustes\, peu impactées par l’environnement béton\, et surtout sobres énergétiquement b) la définition de techniques de récupération d’énergie radiofréquence pour étendre la durée de vie des capteurs enfouis\, c) la définition de nouvelles stratégies de gestion du réseau de nœuds communicants\, permettant de contrôler les flux de collecte et l’homogénéité de la dispersion énergétique. C’est ce dernier point (c) qui sera plus particulièrement développé dans cet exposé\, celui qui permet de lier l’ensemble des techniques en s’appuyant sur la modélisation sous forme de système multi-agents et sur la notion de jumeau numérique du réseau. \n15h30 Pause \nSession 2 (15h35 – 17h05) \n\n\n\n\n\nLearning Energy Efficient Processor Speeds in Real Time Systems\n\n\n\nPrésentateurs : Bruno Gaujal (Inria Grenoble – Rhône-Alpes\, LIG – Laboratoire d’Informatique de Grenoble\, UGA – Université Grenoble Alpes) \nContributeurs : Alain Girault et Stéphan Plassart (Inria Grenoble – Rhône-Alpes\, LIG – Laboratoire d’Informatique de Grenoble\, UGA – Université Grenoble Alpes) \n\n\n\n\nRésumé :\nWe present an algorithm that learns the parameters of a Markov Decision Process (MDP)\, that is then used to compute an efficient speed policy for a single core processor to execute real time jobs while minimizing its energy consumption. The learning mechanism is based on the measurement of real time jobs whose features (release time\, size and deadlines) are unknown at the begining of the learning period. Once the learning phase is completed\, the speed that the processor should use in all possible configurations of the jobs is computed and will be used in the exploitation phase to minimize the energy consumption while completing all jobs before their deadlines. \nReported experiments show that the energy consumption of the learned speed policy is very close to the case where job features are known in advance\, using both simulation of generic jobs and real traces from the automobile industry. \n2. Machine Learning Interactif pour les opérateurs du réseau électrique français : application à l’explication des contraintes de transits (titre provisoire) \nPrésentateurs : Laure Crochepierre (LORIA-Inria Univerѕité de Lorraine\, RTE) et Lydia Boudjeloud-Assala (LORIA-CentraleSupélec Metz) \n17h05 Pause \n17h10-17h45 Table Ronde
URL:https://www.loria.fr/event/journee-federation-charles-hermite-ia-et-energie/
CATEGORIES:Séminaire
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20210222T160000
DTEND;TZID=Europe/Paris:20210222T173000
DTSTAMP:20260523T213206
CREATED:20210218T085445Z
LAST-MODIFIED:20210218T085445Z
UID:11544-1614009600-1614015000@www.loria.fr
SUMMARY:PhD defense: Sylvain Cecchetto
DESCRIPTION:Sylvain Cecchetto (Carbone) will defend his PhD on Monday\, February 22nd at 4pm. \nHis thesis is entitled « Data flow analysis to build control flow graph of obfuscated codes »\, his presentation will be held in French.\n\n \nAbstract:\nThe increase in cyber attacks around the world makes malicious code analysis a priority research area. This software uses various protection methods\, also known as obfuscations\, to bypass antivirus software and slow down the analysis process. In this context\, this thesis provides a solution to build the Control Float Graph (CFG) of obfuscated binary code. We developed the BOA platform (Basic blOck Analysis) which performs a static analysis of a protected binary code. For this\, we have defined a semantics based on the BINSEC tool to which we have added continuations. These allow on one hand to control the self-modifications\, and on the other hand to simulate the operating system to handle system calls and interruptions. The static analysis is done by symbolically executing the binary code and calculating the values of the system states using SMT solvers. Thus\, we perform a data flow analysis to build the CFG by calculating the transfer addresses. Finally\, loop handling is performed by transforming a CFG into a pushdown automaton. BOA is able to compute dynamic jump addresses\, to detect opaque predicates\, to compute return addresses on a stack even if they have been falsified\, to manage interrupt handler falsifications\, to rebuild import tables on the fly\, and finally\, to manage self-modifications. We validated the BOA correction using the Tigress code obfuscator. Then\, we tested BOA on 35 known packers and showed that in 30 cases\, BOA was able to completely or partially rebuild the initially protected binary. Finally\, we detected the opaque predicates protecting XTunnel\, a malware used during the 2016 U.S. elections\, and we partially unpacked a sample of the Emotet Trojan\, which on 14/10/2020 was detected by only 7 antivirus programs out of the 63 offered by VirusTotal This work contributes to the development of tools for static analysis of malicious code. In contrast to dynamic methods\, this solution allows an analysis without executing the binary\, which offers a double advantage : on the one hand\, a static approach is easier to deploy\, and on the other hand\, since the malicious code is not executed\, it cannot warn its author.Keywords: Malware\, Obfuscation\, Data flow\, Symbolic execution\, Control flow graph.Jury members:Referes:Valérie Viet Triem Tong – CentraleSupélec Rennes José Fernandez – Polytechnique MontréalExaminers:Nadia Tawbi – Université LavalSarah Zennou – AirbusStephan Merz – Université de LorraineGuest: \nSébastien Bardin – CEA LIST\nColas Le Guernic – Verimag\nSupervisors: \nJean-Yves Marion – Université de Lorraine\nGuillaume Bonfante – Université de Lorraine
URL:https://www.loria.fr/event/phd-defense-sylvain-cecchetto/
LOCATION:Teams
CATEGORIES:Soutenance
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20210226T090000
DTEND;TZID=Europe/Paris:20210226T103000
DTSTAMP:20260523T213206
CREATED:20210225T112147Z
LAST-MODIFIED:20210225T122432Z
UID:11617-1614330000-1614335400@www.loria.fr
SUMMARY:PhD defense : Pierre-Edouard Osche
DESCRIPTION:Pierre-Edouard Osche (Kiwi) will defend his thesis on Friday\, 26th February at 9 am. \nHis thesis is entitled “Sequence-based recommendations in a multidimensional space » and supervised by Anne Boyer and Sylvain Castagnos. \nAbstract:\nRecommender systems are a fundamental research topic at the intersection of several major disciplines such as machine learning\, human-computer interaction and cognitive sciences. They also constitute an ambitious application framework for the community of researchers in Artificial Intelligence by their great complexity and the numerous constraints they generate. \nThe purpose of these systems is to improve the interaction between the general audience and the systems of search and access to information. It has become difficult to identify the most relevant items in the context of big data. The goal is thus to assist users in their explorations (whether in a virtual or physical environment)\, but also to propose items that may interest them but that they would not consult spontaneously. \nCurrent systems have largely proven their added value and are based on various machine learning techniques (numerical or symbolic\, supervised or not\, etc.) [Castagnos\, 2008]. Nevertheless\, they still suffer from limitations when making recommendations of sequences (recommending items in a specific order may depend on requirements\, progressiveness\, context\, time constraints\, etc.). Some models\, such as the DANCE model [Castagnos\, 2015]\, integrate this temporal dimension by following in real time the evolution in diversity of resources consulted by users to better understand the exploration context. In [Bonnin\, 2010]\, the author also proposes a temporal model capable of detecting frequent consultation patterns in a history of consultations\, in order to provide a priori resource recommendations related to the same context. Nevertheless\, while temporal and spatial modeling have been made possible [Zheng\, 2015]\, state-of-the-art models that focus on sequence recommendations or on the overall quality of the sequence are still too rare. \nIn the framework of this thesis\, we will focus on defining a new formalism and a methodological framework allowing : (1) the definition of human factors leading to decision making and user satisfaction; (2) the construction of a generic and multi-criteria model (physical or temporal constraints\, diversity\, progressiveness\, etc.)\, integrating these human factors in order to recommend relevant resources in a coherent sequence; (3) a holistic evaluation of user satisfaction with its recommendation path. The evaluation of recommendations\, all domains included\, is currently done recommendation by recommendation with each evaluation metric taken independently (accuracy\, diversity\, novelty\, coverage\, …). Thus\, we expect a more comprehensive evaluation framework\, measuring the progressiveness and the completeness of the path. \nSuch a multi-criteria recommendation model has many application frameworks. As an example\, it can be used in the context of online music listening with the recommendation of adaptive playlists (recommendation of music sequences to change the atmosphere in a place such as a bar\, to raise or lower the emotion felt by the audience progressively\, or to adapt to the complementary/similar/different expectations of a group). It can also be useful to adapt the recommendation path to the learner’s progress and the teacher’s pedagogical scenario in an e-education context. Let us also mention the tourism field where this model could integrate the spatial and temporal constraints of a physical environment (cities\, museums\, etc.). \nKeywords: Recommender systems\, Multi-agent systems\, User modeling. \nCommittee: \nRewievers:\n– Mme Sylvie Calabretto\, Professeur\, INSA de Lyon\, France\n– M. Laurent Vercouter\, Professeur\, INSA de Rouen\, France \nExaminer:\n– M. Laurent Vigneron\, Professeur\, Université de Lorraine\, France \nSupervisor:\n– M. Sylvain Castagnos\, Maître de conférences\, Université de Lorraine\, France
URL:https://www.loria.fr/event/phd-defense-pierre-edouard-osche/
LOCATION:online
CATEGORIES:Soutenance
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20210226T140000
DTEND;TZID=Europe/Paris:20210226T153000
DTSTAMP:20260523T213206
CREATED:20210219T145011Z
LAST-MODIFIED:20210219T145022Z
UID:11605-1614348000-1614353400@www.loria.fr
SUMMARY:PhD defense : Anastasia Shimorina (Synalp)
DESCRIPTION:Anastasia Shimorina (Synalp) will defend her thesis on Friday\, 26th February at 2pm. \nHer thesis is entitled « Natural Language Generation: from Data Creation to Evaluation via Modelling » and supervised by Claire Gardent and Yannick Parmentier. \nAbstract:\nNatural language generation is a process of generating a natural language text from some input. This input can be texts\, documents\, images\, tables\, knowledge graphs\, databases\, dialogue acts\, meaning representations\, etc. Recent methods in natural language generation\, mostly based on neural modelling\, have yielded significant improvements in the field. Despite this recent success\, numerous issues with generation prevail\, such as faithfulness to the source\, developing multilingual models\, few-shot generation. This thesis explores several facets of natural language generation from creating training datasets and developing models to evaluating proposed methods and model outputs. \nIn this thesis\, we address the issue of multilinguality and propose possible strategies to semi-automatically translate corpora for data-to-text generation. We show that named entities constitute a major stumbling block in translation exemplified by the English-Russian translation pair. We proceed to handle rare entities in data-to-text modelling exploring two mechanisms: copying and delexicalisation. We demonstrate that rare entities strongly impact performance and that the impact of these two mechanisms greatly varies depending on how datasets are constructed. Getting back to multilinguality\, we also develop a modular approach for shallow surface realisation in several languages. Our approach splits the surface realisation task into three submodules: word ordering\, morphological inflection and contraction generation. We show\, via delexicalisation\, that the word ordering component mainly depends on syntactic information. Along with the modelling\, we also propose a framework for error analysis\, focused on word order\, for the shallow surface realisation task. The framework enables to provide linguistic insights into model performance on the sentence level and identify patterns where models underperform. Finally\, we also touch upon the subject of evaluation design while assessing automatic and human metrics\, highlighting the difference between the sentence-level and system-level type of evaluation. \nKeywords: natural language generation\, data-to-text generation\, surface realisation\, evaluation\, error analysis \nCommittee: \nReviewers:\n– Emiel Krahmer\, Full Professor\, Tilburg University\, the Netherlands\n– Kees van Deemter\, Full Professor\, Utrecht University\, the Netherlands \nExaminer:\n– Dimitra Gkatzia\, Associate Professor\, Edinburgh Napier University\, UK \nSupervisors:\n– Claire Gardent\, Directrice de recherche\, CNRS\, LORIA\, France\n– Yannick Parmentier\, Maı̂tre de conférences\, Université de Lorraine\, France
URL:https://www.loria.fr/event/phd-defense-anastasia-shimorina/
LOCATION:online
CATEGORIES:Soutenance
END:VEVENT
END:VCALENDAR