@InProceedings{spark16-11,
  author =   {Guy Shani and Joerg Hoffmann and Dorin Shmaryahu and Marcel Steinmetz},
  title =    {Constructing Plan Trees for Simulated Penetration Testing},
  abstract = {Penetration Testing (pentesting), where networks are automatically attacked to identify and fix their vulnerabilities, has recently received attention from the AI community. Smart algorithms that can identify robust and efficient attack plans can imitate human hackers better than simple protocols. Current classical planning methods for pentesting model poorly the real world, where the attacker has only partial information concerning the network. On the other hand POMDP-based approaches provide a strong model, but fail to scale up to reasonable model sizes. 
In this paper we offer a more realistic model of the problem, allowing for partial observability and non-deterministic action effects, by modeling pentesting as a partially observable contingent problem. We suggest several optimization criteria, including worst case, best case, and fault tolerance. We experiment with benchmark networks, showing contingent planning to produce plan trees, scaling up to large networks.},
  keywords = {Pentesting, Planning, Contingent Planning}
}

{"_id":"iJHozroSAyWZffnkh","bibbaseid":"shani-hoffmann-shmaryahu-steinmetz-constructingplantreesforsimulatedpenetrationtesting","downloads":0,"creationDate":"2016-04-07T22:01:23.471Z","title":"Constructing Plan Trees for Simulated Penetration Testing","author_short":["Shani, G.","Hoffmann, J.","Shmaryahu, D.","Steinmetz, M."],"year":null,"bibtype":"inproceedings","biburl":"icaps16.icaps-conference.org/spark16.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Guy"],"propositions":[],"lastnames":["Shani"],"suffixes":[]},{"firstnames":["Joerg"],"propositions":[],"lastnames":["Hoffmann"],"suffixes":[]},{"firstnames":["Dorin"],"propositions":[],"lastnames":["Shmaryahu"],"suffixes":[]},{"firstnames":["Marcel"],"propositions":[],"lastnames":["Steinmetz"],"suffixes":[]}],"title":"Constructing Plan Trees for Simulated Penetration Testing","abstract":"Penetration Testing (pentesting), where networks are automatically attacked to identify and fix their vulnerabilities, has recently received attention from the AI community. Smart algorithms that can identify robust and efficient attack plans can imitate human hackers better than simple protocols. Current classical planning methods for pentesting model poorly the real world, where the attacker has only partial information concerning the network. On the other hand POMDP-based approaches provide a strong model, but fail to scale up to reasonable model sizes. In this paper we offer a more realistic model of the problem, allowing for partial observability and non-deterministic action effects, by modeling pentesting as a partially observable contingent problem. We suggest several optimization criteria, including worst case, best case, and fault tolerance. We experiment with benchmark networks, showing contingent planning to produce plan trees, scaling up to large networks.","keywords":"Pentesting, Planning, Contingent Planning","bibtex":"@InProceedings{spark16-11,\r\n author = {Guy Shani and Joerg Hoffmann and Dorin Shmaryahu and Marcel Steinmetz},\r\n title = {Constructing Plan Trees for Simulated Penetration Testing},\r\n abstract = {Penetration Testing (pentesting), where networks are automatically attacked to identify and fix their vulnerabilities, has recently received attention from the AI community. Smart algorithms that can identify robust and efficient attack plans can imitate human hackers better than simple protocols. Current classical planning methods for pentesting model poorly the real world, where the attacker has only partial information concerning the network. On the other hand POMDP-based approaches provide a strong model, but fail to scale up to reasonable model sizes. \r\nIn this paper we offer a more realistic model of the problem, allowing for partial observability and non-deterministic action effects, by modeling pentesting as a partially observable contingent problem. We suggest several optimization criteria, including worst case, best case, and fault tolerance. We experiment with benchmark networks, showing contingent planning to produce plan trees, scaling up to large networks.},\r\n keywords = {Pentesting, Planning, Contingent Planning}\r\n}\r\n\r\n","author_short":["Shani, G.","Hoffmann, J.","Shmaryahu, D.","Steinmetz, M."],"key":"spark16-11","id":"spark16-11","bibbaseid":"shani-hoffmann-shmaryahu-steinmetz-constructingplantreesforsimulatedpenetrationtesting","role":"author","urls":{},"keyword":["Pentesting","Planning","Contingent Planning"],"metadata":{"authorlinks":{}},"downloads":0,"html":""},"search_terms":["constructing","plan","trees","simulated","penetration","testing","shani","hoffmann","shmaryahu","steinmetz"],"keywords":["pentesting","planning","contingent planning"],"authorIDs":[],"dataSources":["jaTZy22GuvTvLRhXH","jQBA6tLb2aZ6MhQEz"]}