The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Practical Attack Graph Generation for Network Defense
Abstract
Attack graphs are a valuable tool to network defenders, illustrating paths an attacker can use to gain access to a targeted network. Defenders can then focus their efforts on patching the vulnerabilities and configuration errors that allow the attackers the greatest amount of access. We have created a new type of attack graph, the multiple-prerequisite graph, that scales nearly linearly as the size of a typical network increases. We have built a prototype system using this graph type. The prototype uses readily available source data to automatically compute network reachability, classify vulnerabilities, build the graph, and recommend actions to improve network security. We have tested the prototype on an operational network with over 250 hosts, where it helped to discover a previously unknown configuration error. It has processed complex simulated networks with over 50,000 hosts in under four minutes
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Graph-Based Algorithms for Boolean Function Manipulation
Bryant (1986) · IEEE Transactions on Computers · doi:10.1109/tc.1986.1676819 · Cited by 8,891
Scalable, graph-based network vulnerability analysis
Ammann, P., Wijesekera, D., & Kaushik, S. (2002) · Proceedings of the 9th ACM conference on Computer and communications security · doi:10.1145/586110.586140 · Cited by 697
Alert correlation in a cooperative intrusion detection framework
Cuppens, F., & Miege, A. (2005) · Proceedings 2002 IEEE Symposium on Security and Privacy · doi:10.1109/secpri.2002.1004372 · Cited by 696
MulVAL: a logic-based network security analyzer
Ou, X., Govindavajhala, S., & Appel, A. W. (2005) · Cited by 587
Using model checking to analyze network vulnerabilities
Ritchey, R. W., & Ammann, P. (2002) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/secpri.2000.848453 · Cited by 444
FIREMAN: a toolkit for firewall modeling and analysis
Yuan, L., Chen, H., Mai, J., Chuah, C.-N., Su, Z., & Mohapatra, P. (2006) · 2006 IEEE Symposium on Security and Privacy (S&P'06) · doi:10.1109/sp.2006.16 · Cited by 398
A quantitative study of firewall configuration errors
Wool, A. (2004) · Computer · doi:10.1109/mc.2004.2 · Cited by 395
A requires/provides model for computer attacks
Templeton, S. J., & Levitt, K. (2001) · Proceedings of the 2000 workshop on New security paradigms · doi:10.1145/366173.366187 · Cited by 373
Computer-attack graph generation tool
Swiler, L. P., Phillips, C., Ellis, D., & Chakerian, S. (2002) · Proceedings DARPA Information Survivability Conference and Exposition II. DISCEX'01 · doi:10.1109/discex.2001.932182 · Cited by 324
Scalable, graph-based network vulnerability analysis
Ammann, P., Wijesekera, D., & Kaushik, S. (2002) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/586139.586140 · Cited by 269
Cited by
Alshamrani, A., Myneni, S., Chowdhary, A., & Huang, D. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2891891 · Cited by 656
DAG-based attack and defense modeling: Don’t miss the forest for the attack trees
Kordy, B., Piètre-Cambacédès, L., & Schweitzer, P. (2014) · Computer Science Review · doi:10.1016/j.cosrev.2014.07.001 · Cited by 321
A Survey of Moving Target Defenses for Network Security
Sengupta, S., Chowdhary, A., Sabur, A., Alshamrani, A., Huang, D., & Kambhampati, S. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2982955 · Cited by 269
Model-based Security Metrics Using ADversary VIew Security Evaluation (ADVISE)
LeMay, E., Ford, M. D., Keefe, K., Sanders, W. H., & Muehrcke, C. (2011) · 2011 Eighth International Conference on Quantitative Evaluation of SysTems · doi:10.1109/qest.2011.34 · Cited by 128
Metadata
- Authors
- Ingols, K., Lippmann, R., & Piwowarski, K.
- Venue
- 2006 22nd Annual Computer Security Applications Conference (ACSAC'06)
- Publisher
- IEEE
- Published
- 2006-12
- Pages
- 121-130
- ISSN
- 1063-9527 (ISSN-L)
- OpenAlex
- W2100033648
- Cited by
- 379
- References
- 18
- FWCI
- 14.11
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.