Abstract
Original language | English |
---|---|
Title of host publication | Security and Privacy Protection in Information Processing Systems. SEC 2013. |
Editors | Lech J. Janczewski, Henry B. Wolfe, Sujeet Shenoi |
Place of Publication | Berlin |
Publisher | Springer |
Pages | 330-343 |
Volume | 405 |
ISBN (Electronic) | 9783642392184 |
ISBN (Print) | 9783642392177 |
DOIs | |
Publication status | Published - 2013 |
Externally published | Yes |
Event | Conference on Risk Management Reloaded 2013 - Garching, Germany Duration: 9 Sep 2013 → 13 Sep 2013 |
Publication series
Name | IFIP Advances in Information and Communication Technology |
---|---|
Publisher | Springer |
Volume | 405 |
Conference
Conference | Conference on Risk Management Reloaded 2013 |
---|---|
Country | Germany |
City | Garching |
Period | 9/09/13 → 13/09/13 |
Fingerprint
Cite this
}
Performance Analysis of Scalable Attack Representation Models. / Hong, Jin Bum; Kim, Dong Seong.
Security and Privacy Protection in Information Processing Systems. SEC 2013. . ed. / Lech J. Janczewski; Henry B. Wolfe; Sujeet Shenoi. Vol. 405 Berlin : Springer, 2013. p. 330-343 (IFIP Advances in Information and Communication Technology ; Vol. 405).Research output: Chapter in Book/Conference paper › Conference paper
TY - GEN
T1 - Performance Analysis of Scalable Attack Representation Models
AU - Hong, Jin Bum
AU - Kim, Dong Seong
PY - 2013
Y1 - 2013
N2 - Attack graphs (AGs) have been widely used for security analysis. The construction of the graph-based attack models including the AG have been studied, but the security evaluation considering the full attack paths cannot be computed using existing attack models due to the scalability problem. To solve this, we propose to use hierarchical attack representation models (HARMs). First, we formulate key questions that need to be answered to compare the scalability of existing attack models. We show the scalability of the HARMs via simulations, by taking into account practical attack scenario based on various network topologies.
AB - Attack graphs (AGs) have been widely used for security analysis. The construction of the graph-based attack models including the AG have been studied, but the security evaluation considering the full attack paths cannot be computed using existing attack models due to the scalability problem. To solve this, we propose to use hierarchical attack representation models (HARMs). First, we formulate key questions that need to be answered to compare the scalability of existing attack models. We show the scalability of the HARMs via simulations, by taking into account practical attack scenario based on various network topologies.
KW - Attack Graph
KW - Attack Tree
KW - Complexity Analysis
KW - Security Model
KW - Scalability
U2 - 10.1007/978-3-642-39218-4_25
DO - 10.1007/978-3-642-39218-4_25
M3 - Conference paper
SN - 9783642392177
VL - 405
T3 - IFIP Advances in Information and Communication Technology
SP - 330
EP - 343
BT - Security and Privacy Protection in Information Processing Systems. SEC 2013.
A2 - Janczewski, Lech J.
A2 - Wolfe, Henry B.
A2 - Shenoi, Sujeet
PB - Springer
CY - Berlin
ER -