Cyber security based on mean field game model of the defender: Attacker strategies
Author(s) -
Miao Li,
Shuai Li
Publication year - 2017
Publication title -
international journal of distributed sensor networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.324
H-Index - 53
eISSN - 1550-1477
pISSN - 1550-1329
DOI - 10.1177/1550147717737908
Subject(s) - computer science , consistency (knowledge bases) , field (mathematics) , process (computing) , point (geometry) , transmission (telecommunications) , sequential game , stability (learning theory) , binary number , computer security , game theory , artificial intelligence , mathematical economics , machine learning , telecommunications , mathematics , geometry , pure mathematics , arithmetic , operating system
The transmission process of information among computers of network is considered as the procedure of interactive behaviors. In this article, we present a mean field game model for the binary interactive behaviors between the malicious attackers and the defenders. We first discuss the evolution of the states of the malicious attackers and the defenders using the susceptiable-infective-Removal epidemic model in which we take into account the stochastic process of the propagation of the infected computers and the attack intensity. Then, we formulate the mean field game consistency stability problem generated by a Hamilton–Jacobi–Bellman equation of the individual player and the fixed-point problem. Finally, we derive the optimal individual strategy with an appropriate assumption that the response time of the defense system is faster than the infection rate.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom