Jean Leneutre

Jean Leneutre


Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
19 June 2014 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
ZIZiad Ismail
Ziad Ismail
JLJean Leneutre
Jean Leneutre
DBDavid Bateman
David Bateman
Lin ChenLin Chen
Lin Chen
The widespread deployment of smart meters in the advanced metering infrastructure (AMI) raises privacy concerns. Analyzing the data collected from smart meters can expose habits and can be potentially used to predict consumers' behaviors. In this paper, we analyze the confidentiality of information in the AMI consisting of nodes with interdependent correlated security assets. On each node, the defender can choose one of several security modes available. We try to answer the following questions: 1) What is the expected behavior of a rational attacker?; 2) What is the optimal strategy of the defender?; and 3) Can we configure the security modes on each node to discourage the attacker from launching any attacks? In this paper, we formulate the problem as a noncooperative game and analyze the behavior of the attacker and the defender at the Nash equilibrium. The attacker chooses his targets in order to collect the maximum amount of data on consumers, and the defender chooses the encryption level of outbound data on each device in the AMI. Using our model, we derive the minimum defense resources required and the optimal strategy of the defender. Finally, we show how our framework can be applied in a real-world scenario via a case study.

16 December 2021 in Sensors
Verified
Journal Article
Open access
PDF file
SKSameh Khalfaoui
Sameh Khalfaoui
JLJean Leneutre
Jean Leneutre
AVArthur Villard
Arthur Villard
IGIvan Gazeau
Ivan Gazeau
JMJingxuan Ma
Jingxuan Ma
PUPascal Urien
Pascal Urien
The demand for Internet of Things services is increasing exponentially, and consequently a large number of devices are being deployed. To efficiently authenticate these objects, the use of physical unclonable functions (PUFs) has been introduced as a promising solution for the resource-constrained nature of these devices. The use of machine learning PUF models has been recently proposed to authenticate the IoT objects while reducing the storage space requirement for each device. Nonetheless, the use of a mathematically clonable PUFs requires careful design of the enrollment process. Furthermore, the secrecy of the machine learning models used for PUFs and the scenario of leakage of sensitive information to an adversary due to an insider threat within the organization have not been discussed. In this paper, we review the state-of-the-art model-based PUF enrollment protocols. We identity two architectures of enrollment protocols based on the participating entities and the building blocks that are relevant to the security of the authentication procedure. In addition, we discuss their respective weaknesses with respect to insider and outsider threats. Our work serves as a comprehensive overview of the ML PUF-based methods and provides design guidelines for future enrollment protocol designers.

30 January 2021 in Wireless Communications and Mobile Computing
Verified
Journal Article
Open access
PDF file
SKSameh Khalfaoui
Sameh Khalfaoui
JLJean Leneutre
Jean Leneutre
AVArthur Villard
Arthur Villard
JMJingxuan Ma
Jingxuan Ma
PUPascal Urien
Pascal Urien
Numerous secure device pairing (SDP) protocols have been proposed to establish a secure communication between unidentified IoT devices that have no preshared security parameters due to the scalability requirements imposed by the ubiquitous nature of the IoT devices. In order to provide the most user‐friendly IoT services, the usability assessment has become the main requirement. Thus, the complete security analysis has been replaced by a sketch of a proof to partially validate the robustness of the proposal. The few existing formal or computational security verifications on the SDP schemes have been conducted based on the assessment of a wide variety of uniquely defined security properties. Therefore, the security comparison between these protocols is not feasible and there is a lack of a unified security analysis framework to assess these pairing techniques. In this paper, we survey a selection of secure device pairing proposals that have been formally or computationally verified. We present a systematic description of the protocol assumptions, the adopted verification model, and an assessment of the verification results. In addition, we normalize the used taxonomy in order to enhance the understanding of these security validations. Furthermore, we refine the adversary capabilities on the out‐of‐band channel by redefining the replay capability and by introducing a new notion of delay that is dependent on the protocol structure that is more adequate for the ad hoc pairing context. Also, we propose a classification of a number of out‐of‐band channels based on their security properties and under our refined adversary model. Our work motivates the future SDP protocol designer to conduct a formal or a computational security assessment to allow the comparability between these pairing techniques. Furthermore, it provides a realistic abstraction of the adversary capabilities on the out‐of‐band channel which improves the modeling of their security characteristics in the protocol verification tools.

5 May 2007 in Computer Communications
Verified
Journal Article
Closed access
Lin ChenLin Chen
Lin Chen
JLJean Leneutre
Jean Leneutre

1 August 2007
Verified
Conference Paper
Closed access
Lin ChenLin Chen
Lin Chen
JLJean Leneutre
Jean Leneutre
We present a non-cooperative game-theoretical study of the power and rate control problem in IEEE 802.11 WLANs where network participants choose appropriate transmission power and data rate to achieve maximum throughput with minimum energy consumption. In such game-theoretical study, the central question is whether a Nash equilibrium (NE) exists, if so, whether the network operates efficiently at the NE. In this paper, we show the existence and uniqueness of the NE and the convergence to the NE under best response strategy. However, the unique NE is inefficient, i.e., neither social optimal nor Pareto optimal. Motivated by this fact, we propose both linear and non-linear pricing scheme to improve efficiency. We demonstrate that by wisely choosing the parameters, the game converges to an efficient NE. Finally, we examine the convergence to the NE under a practical rate update scheme: the subgradient rate update. Both analytical and numerical results show that the proposed rate control scheme can lead the network to the social optimal equilibrium.

1 January 2020
Verified
Conference Paper
Open access
ADAída Diop
Aída Diop
Maryline LaurentMaryline Laurent
Maryline Laurent
JLJean Leneutre
Jean Leneutre
JTJacques Traoré
Jacques Traoré