Penetration Testing == POMDP Solving? - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Penetration Testing == POMDP Solving?

Olivier Buffet
Joerg Hoffmann
  • Function : Author
  • PersonId : 864556

Abstract

Penetration Testing is a methodology for assessing network security, by generating and executing possible attacks. Doing so automatically allows for regular and systematic testing without a prohibitive amount of human labor. A key question then is how to generate the attacks. This is naturally formulated as a planning problem. Previous work used classical planning and hence ignores all the incomplete knowledge that characterizes hacking. More recent work makes strong independence assumptions for the sake of scaling, and lacks a clear formal concept of what the attack planning problem actually is. Herein, we model that problem in terms of partially observable Markov decision processes (POMDP). This grounds penetration testing in a well-researched formalism, highlighting important aspects of this problem's nature. POMDPs allow to model information gathering as an integral part of the problem, thus providing for the first time a means to intelligently mix scanning actions with actual exploits.
Fichier principal
Vignette du fichier
secart11.pdf (179.83 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00607403 , version 1 (17-11-2011)

Identifiers

  • HAL Id : inria-00607403 , version 1

Cite

Carlos Sarraute, Olivier Buffet, Joerg Hoffmann. Penetration Testing == POMDP Solving?. Workshop on Intelligent Security (Security and Artificial Intelligence) - SecArt-11, Jul 2011, Barcelona, Spain. ⟨inria-00607403⟩
368 View
97 Download

Share

Gmail Facebook X LinkedIn More