Jerome Francois

Jerome Francois

Auto-generated profile, based on publicly available information

Jerome Francois

University of Luxembourg, Luxembourg, Luxembourg

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2016
Verified
Conference Paper
Open access
WSWazen M. Shbair
Wazen M. Shbair
TCThibault Cholez
Thibault Cholez
JFJerome Francois
Jerome Francois
ICIsabelle Chrisment
Isabelle Chrisment
The development of TLS-based encrypted traffic comes with new challenges related to the management and security analysis of encrypted traffic. There is an essential need for new methods to investigate, with a proper level of identification, the increasing number of HTTPS traffic that may hold security breaches. In fact, although many approaches detect the type of an application (Web, P2P, SSH, etc.) running in secure tunnels, and others identify a couple of specific encrypted web pages through website fingerprinting, this paper proposes a robust technique to precisely identify the services run within HTTPS connections, i.e. to name the services, without relying on specific header fields that can be easily altered. We have defined dedicated features for HTTPS traffic that are used as input for a multi-level identification framework based on machine learning algorithms. Our evaluation based on real traffic shows that we can identify encrypted web services with a high accuracy.

26 January 2021 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
ALAbir Laraba
Abir Laraba
JFJerome Francois
Jerome Francois
SCShihabur Rahman Chowdhury
Shihabur Rahman Chowdhury
ICIsabelle Chrisment
Isabelle Chrisment
RBRaouf Boutaba
Raouf Boutaba
This article proposes a new approach for detecting and mitigating the impact of misbehaving TCP end-hosts, specifically the Optimistic ACK attack, and Explicit Congestion Notification (ECN) abuse. In contrast to the state-of-the-art, we show that it is possible to mitigate such misbehavior leveraging emerging programmable data planes while not requiring any end-host or protocol modifications. A key challenge in doing so is to implement expressive, complex and stateful functions in the data plane within its restricted programming model. In this regard, we propose a security monitoring function that uses Extended Finite State Machine (EFSM) abstraction for monitoring stateful protocols in the data plane. We also design a mechanism for mapping a protocol's EFSM to programmable data plane primitives. Our evaluation results demonstrate that our approach can fully or partially restore the throughput loss caused by misbehaving end-hosts that manipulate TCP congestion control through misinformation.

1 April 2012
Verified
Conference Paper
Open access
SMSamuel Marchal
Samuel Marchal
JFJérôme François
Jérôme François
CWCynthia Wagner
Cynthia Wagner
RSRadu State
Radu State
ADAlexandre Dulaunoy
Alexandre Dulaunoy
OFOlivier Festor
Olivier Festor
We present a monitoring approach and the supporting software architecture for passive DNS traffic. Monitoring DNS traffic can reveal essential network and system level activity profiles. Worm infected and botnet participating hosts can be identified and malicious backdoor communications can be detected. Any passive DNS monitoring solution needs to address several challenges that range from architectural approaches for dealing with large volumes of data up to specific Data Mining approaches for this purpose. We describe a framework that leverages state of the art distributed processing facilities with clustering techniques in order to detect anomalies in both online and offline DNS traffic. This framework entitled DNSSM is implemented and operational on several networks. We validate the framework against two large trace sets.

16 November 2020 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
AHAdrien Hemmer
Adrien Hemmer
MAMohamed Abderrahim
Mohamed Abderrahim
RBRemi Badonnel
Remi Badonnel
JFJerome Francois
Jerome Francois
ICIsabelle Chrisment
Isabelle Chrisment

15 June 2022 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
MZMehdi Zakroum
Mehdi Zakroum
JFJerome Francois
Jerome Francois
ICIsabelle Chrisment
Isabelle Chrisment
MGMounir Ghogho
Mounir Ghogho
Network reconnaissance is the first step preceding a cyber-attack. Hence, monitoring the probing activities is imperative to help security practitioners enhancing their awareness about Internets large-scale events or peculiar events targeting their network. In this paper, we present a framework for an improved and efficient monitoring of the probing activities targeting network telescopes. Particularly, we model the probing rates which are a good indicator for measuring the cyber-security risk targeting network services. The approach consists of first inferring groups of network ports sharing similar probing characteristics through a new affinity metric capturing both temporal and semantic similarities between ports. Then, sequences of probing rates targeting similar ports are used as inputs to stacked Long Short-Term Memory (LSTM) neural networks to predict probing rates 1 hour and 1 day in advance. Finally, we describe two monitoring indicators that use the prediction models to infer anomalous probing traffic and to raise early threat warnings. We show that LSTM networks can accurately predict probing rates, outperforming the nonstationary autoregressive model, and we demonstrate that the monitoring indicators are efficient in assessing the cyber-security risk related to vulnerability disclosure.

1 November 2016
Verified
Conference Paper
Open access
GSGiulia De Santis
Giulia De Santis
ALAbdelkader Lahmadi
Abdelkader Lahmadi
JFJerome Francois
Jerome Francois
OFOlivier Festor
Olivier Festor
We propose a methodology based on Hidden Markov Models (HMMs) to model scanning activities monitored by a darknet. The HMMs of scanning activities are built on the basis of the number of scanned IP addresses within a time window and fitted using mixtures of Poisson distributions. Our methodology is applied on real data traces collected from a darknet and generated by two large scale scanners, ZMap and Shodan. We demonstrated that the built models are able to characterize their scanning activities.