Name
Abstract | ||
|---|---|---|
In penetration testing (pentesting), network administrators attack their own network to identify and fix vulnerabilities. Planning-based simulated pentesting can achieve much higher testing coverage than manual pentesting. A key challenge is for the attack planning to imitate human hackers as faithfully as possible. POMDP models have been proposed to this end, yet they are computationally very hard, and it is unclear how to acquire the models in practice. At the other extreme, classical planning models are scalable and simple to obtain, yet completely ignore the incomplete knowledge characteristic of hacking. We propose contingent planning as a new middle ground, feasible in both computation burden and model acquisition effort while allowing for a representation of incomplete knowledge. We design the model, show how to adapt available solvers, and show how to acquire the model from real network scans in practice. We experiment on real networks and show that our approach scales to practical input sizes. |
Year | Venue | Field |
|---|---|---|
2018 | Proceedings of the International Conference on Automated Planning and Scheduling | Penetration (firestop),Mathematical optimization,Simulation,Computer science |
DocType | ISSN | Citations |
Conference | 2334-0835 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dorin Shmaryahu | 1 | 0 | 1.01 |
| Guy Shani | 2 | 791 | 58.14 |
| Jörg Hoffmann | 3 | 2702 | 189.88 |
| Marcel Steinmetz | 4 | 14 | 8.63 |