Optimal Honeypot Allocation Using Core Attack Graph in Partially Observable Stochastic Games

This paper presents a scalable solution for zero-sum, one-sided, partially observable stochastic games (Z-POSGs) in the realm of cybersecurity. Existing heuristic search value iteration (HSVI) methods often face significant challenges with scalability in large and complex networks. To overcome this...

Descripció completa

Dades bibliogràfiques

Autors principals:	Achile Leonel Nguemkam, Ahmed Hemida Anwar, Vianney Kengne Tchendji, Deepak K. Tosh, Charles Kamhoua
Format:	Artigo
Idioma:	Inglês
Publicat:	IEEE 2024-01-01
Col·lecció:	IEEE Access
Matèries:	Partially observable stochastic games lateral movement dynamic honeypot allocation core attack graph
Accés en línia:	https://ieeexplore.ieee.org/document/10786011/
Etiquetes:	Afegir etiqueta Sense etiquetes, Sigues el primer a etiquetar aquest registre!