| Autor: |
Білозерський, В. В., Лебедєва, О. Ю., Волкова, Н. П., Назаров, В. О. |
| Zdroj: |
Informatics & Mathematical Methods in Simulation / Informatika ta Matematičnì Metodi v Modelûvannì; 2023, Vol. 13 Issue 3/4, p236-242, 7p |
| Abstrakt: |
The work developed a methodology for solving information protection problems. Cyber security is one of the most important problems of the modern world. The growing use of digital technologies in all areas of life makes cyberspace increasingly attractive to cybercriminals. Protection of information systems is one of the most important tasks of any security service of any organization and any enterprise. To counter this threat, it is necessary to develop effective information protection methods. The work considers such tools as an open standard for assessing the severity of computer system security vulnerabilities CVSS and a database of well-known information security vulnerabilities CVE. It makes sense to use these tools to create a list of effective modern attacks. In addition, it is still necessary to decide on the available tools for protecting the organization's computer systems. Cybersecurity relies on various mathematical tools, one of which is game theory. Game theory is one of the tools that can be used to improve cyber security. The work uses two-player matrix games. The players are an attacker who attacks the computer system of some organization and a representative of the organization responsible for ensuring information protection. Game theory allows you to present the task of computer system protection in a mathematical form, which allows you to use the established criteria for finding optimal protection strategies, following which the administrator is able to eliminate, or at least minimize, information damage caused by an attacker. Finding optimal pure strategies involves finding a saddle point. Not every matrix game has an optimal pure strategy. If the matrix game has a saddle point, then the game has a solution in pure strategies and the study of the game ends by finding this point and the corresponding pair of pure strategies of the players. Otherwise, mixed strategies are used. To search for mixed strategies, it is suggested to use the Brown-Robinson method. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
