| dc.contributor.author | Ingols, Kyle W. | |
| dc.contributor.author | Chu, Matthew D. | |
| dc.contributor.author | Lippmann, Richard P. | |
| dc.contributor.author | Webster, Seth R. | |
| dc.contributor.author | Boyer, Stephen | |
| dc.date.accessioned | 2010-10-20T14:49:03Z | |
| dc.date.available | 2010-10-20T14:49:03Z | |
| dc.date.issued | 2010-02 | |
| dc.date.submitted | 2009-12 | |
| dc.identifier.isbn | 978-0-7695-3919-5 | |
| dc.identifier.issn | 1063-9527 | |
| dc.identifier.other | INSPEC Accession Number: 11072835 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/59422 | |
| dc.description.abstract | By accurately measuring risk for enterprise networks, attack graphs allow network defenders to understand the most critical threats and select the most effective countermeasures. This paper describes substantial enhancements to the NetSPA attack graph system required to model additional present-day threats (zero-day exploits and client-side attacks) and countermeasures (intrusion prevention systems, proxy firewalls, personal firewalls, and host-based vulnerability scans). Point-to-point reachability algorithms and structures were extensively redesigned to support "reverse" reachability computations and personal firewalls. Host-based vulnerability scans are imported and analyzed. Analysis of an operational network with 84 hosts demonstrates that client-side attacks pose a serious threat. Experiments on larger simulated networks demonstrated that NetSPA's previous excellent scaling is maintained. Less than two minutes are required to completely analyze a four-enclave simulated network with more than 40,000 hosts protected by personal firewalls. | en_US |
| dc.description.sponsorship | United States. Air Force (Contract FA8721-05-C-0002) | en_US |
| dc.language.iso | en_US | |
| dc.publisher | Institute of Electrical and Electronics Engineers | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1109/ACSAC.2009.21 | en_US |
| dc.rights | Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. | en_US |
| dc.source | IEEE | en_US |
| dc.subject | network reachability | en_US |
| dc.subject | network defense | en_US |
| dc.subject | attack tree | en_US |
| dc.subject | attack graph | en_US |
| dc.subject | SCAP | en_US |
| dc.title | Modeling modern network attacks and countermeasures using attack graphs | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | Ingols, K. et al. “Modeling Modern Network Attacks and Countermeasures Using Attack Graphs.” Computer Security Applications Conference, 2009. ACSAC '09. Annual. 2009. 117-126. ©2009 Institute of Electrical and Electronics Engineers. | en_US |
| dc.contributor.department | Lincoln Laboratory | en_US |
| dc.contributor.approver | Ingols, Kyle W. | |
| dc.contributor.mitauthor | Ingols, Kyle W. | |
| dc.contributor.mitauthor | Chu, Matthew D. | |
| dc.contributor.mitauthor | Lippmann, Richard P. | |
| dc.contributor.mitauthor | Webster, Seth R. | |
| dc.contributor.mitauthor | Boyer, Stephen | |
| dc.relation.journal | Annual Computer Security Applications Conference, 2009. ACSAC '09 | en_US |
| dc.eprint.version | Final published version | en_US |
| dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
| eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
| dspace.orderedauthors | Ingols, Kyle; Chu, Matthew; Lippmann, Richard; Webster, Seth; Boyer, Stephen | en |
| mit.license | PUBLISHER_POLICY | en_US |
| mit.metadata.status | Complete | |