{"id":"https://openalex.org/W2165836036","doi":"https://doi.org/10.1109/dsn.2012.6263940","title":"Scalable optimal countermeasure selection using implicit enumeration on attack countermeasure trees","display_name":"Scalable optimal countermeasure selection using implicit enumeration on attack countermeasure trees","publication_year":2012,"publication_date":"2012-06-01","ids":{"openalex":"https://openalex.org/W2165836036","doi":"https://doi.org/10.1109/dsn.2012.6263940","mag":"2165836036"},"language":"en","primary_location":{"id":"doi:10.1109/dsn.2012.6263940","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dsn.2012.6263940","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2012)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041855606","display_name":"A.B. Roy","orcid":"https://orcid.org/0000-0002-7306-9274"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Arpan Roy","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Duke University, Durham, NC, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Duke University, Durham, NC, USA","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019789320","display_name":"Dong Seong Kim","orcid":"https://orcid.org/0000-0003-2605-187X"},"institutions":[{"id":"https://openalex.org/I185492890","display_name":"University of Canterbury","ror":"https://ror.org/03y7q9t39","country_code":"NZ","type":"education","lineage":["https://openalex.org/I185492890"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"Dong Seong Kim","raw_affiliation_strings":["Department of Computer Science and Software Engineering, University of Canterbury, Christchurch, New Zealand"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Software Engineering, University of Canterbury, Christchurch, New Zealand","institution_ids":["https://openalex.org/I185492890"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036851432","display_name":"Kishor S. Trivedi","orcid":"https://orcid.org/0000-0001-7396-6330"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kishor S. Trivedi","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Duke University, Durham, NC, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Duke University, Durham, NC, USA","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":24.9874,"has_fulltext":false,"cited_by_count":87,"citation_normalized_percentile":{"value":0.99424675,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10734","display_name":"Information and Cyber Security","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10734","display_name":"Information and Cyber Security","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10400","display_name":"Network Security and Intrusion Detection","score":0.9940000176429749,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12423","display_name":"Software Reliability and Analysis Research","score":0.9843000173568726,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/countermeasure","display_name":"Countermeasure","score":0.9062278270721436},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6711471080780029},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6369359493255615},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.5182640552520752},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5036777853965759},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49633389711380005},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.4573293626308441},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45347434282302856},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.43147075176239014},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4306979477405548},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.425681471824646},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4135396182537079},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1771213710308075},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.140383780002594},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.12503176927566528},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.11602044105529785}],"concepts":[{"id":"https://openalex.org/C21593369","wikidata":"https://www.wikidata.org/wiki/Q1032176","display_name":"Countermeasure","level":2,"score":0.9062278270721436},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6711471080780029},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6369359493255615},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.5182640552520752},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5036777853965759},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49633389711380005},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.4573293626308441},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45347434282302856},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43147075176239014},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4306979477405548},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.425681471824646},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4135396182537079},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1771213710308075},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.140383780002594},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.12503176927566528},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.11602044105529785},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/dsn.2012.6263940","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dsn.2012.6263940","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2012)","raw_type":"proceedings-article"},{"id":"pmh:oai:espace.library.uq.edu.au:UQ:820f318","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306402388","display_name":"Queensland's institutional digital repository (The University of Queensland)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I165143802","host_organization_name":"The University of Queensland","host_organization_lineage":["https://openalex.org/I165143802"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Paper"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.699999988079071,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W1504280683","https://openalex.org/W1510654465","https://openalex.org/W1547446473","https://openalex.org/W1590752147","https://openalex.org/W1599101218","https://openalex.org/W1976009916","https://openalex.org/W1990874150","https://openalex.org/W2006733177","https://openalex.org/W2018094844","https://openalex.org/W2025896865","https://openalex.org/W2044221435","https://openalex.org/W2049973206","https://openalex.org/W2054127354","https://openalex.org/W2083270195","https://openalex.org/W2084044852","https://openalex.org/W2091673436","https://openalex.org/W2097209984","https://openalex.org/W2110908300","https://openalex.org/W2110968986","https://openalex.org/W2113780533","https://openalex.org/W2121141821","https://openalex.org/W2121805588","https://openalex.org/W2128501923","https://openalex.org/W2140140369","https://openalex.org/W2141087303","https://openalex.org/W2159443917","https://openalex.org/W2160372331","https://openalex.org/W2166646839","https://openalex.org/W2751335644","https://openalex.org/W3145128584","https://openalex.org/W3193616789","https://openalex.org/W4210727445","https://openalex.org/W4249173680","https://openalex.org/W6630497885","https://openalex.org/W6632633753","https://openalex.org/W6635235395","https://openalex.org/W6673789732","https://openalex.org/W6674875911","https://openalex.org/W6680847395","https://openalex.org/W6682933086","https://openalex.org/W6800432828"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2935909890","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W108845024"],"abstract_inverted_index":{"Constraints":[0],"such":[1,154],"as":[2,60,73,127,129,155],"limited":[3],"security":[4,9,23,45,161],"investment":[5,162],"cost":[6,163],"precludes":[7],"a":[8,18,40,100,112,173],"decision":[10],"maker":[11],"from":[12,171],"implementing":[13,172],"all":[14],"possible":[15],"countermeasures":[16,88,130],"in":[17,47,164,177,202],"system.":[19],"Existing":[20],"analytical":[21],"model-based":[22,37],"optimization":[24,186],"strategies":[25],"do":[26],"not":[27,82],"prevail":[28],"for":[29,84,215],"the":[30,48,54,63,85,92,132,157,165,169,178,203,209],"following":[31],"reasons:":[32],"(i)":[33],"none":[34],"of":[35,50,62,87,134,159,205],"these":[36],"methods":[38,57,71],"offer":[39],"way":[41],"to":[42,53,65,147,197,208],"find":[43,198],"optimal":[44,199],"solution":[46,200],"absence":[49,204],"probability":[51,206],"assignments":[52,207],"model,":[55],"(ii)":[56],"scale":[58],"badly":[59],"size":[61],"system":[64],"model":[66,94,102],"increases":[67],"and":[68,136,142,144,167,218],"(iii)":[69],"some":[70],"suffer":[72],"they":[74],"use":[75,111,140],"attack":[76,96,117],"trees":[77],"(AT)":[78],"whose":[79,121],"structure":[80,122],"does":[81],"allow":[83],"inclusion":[86],"while":[89],"others":[90],"translate":[91],"non-state-space":[93],"(e.g.,":[95],"response":[97],"tree)":[98],"into":[99,124,188],"state-space":[101,105],"hence":[103],"causing":[104],"explosion.":[106],"In":[107],"this":[108],"paper,":[109],"we":[110,219],"novel":[113],"AT":[114],"paradigm":[115],"called":[116],"countermeasure":[118,175],"tree":[119],"(ACT)":[120],"takes":[123],"account":[125],"attacks":[126],"well":[128,214],"(in":[131],"form":[133],"detection":[135],"mitigation":[137],"events).":[138],"We":[139,183],"greedy":[141],"branch":[143],"bound":[145],"techniques":[146],"study":[148],"several":[149],"objective":[150],"functions":[151],"with":[152,223],"goals":[153],"minimizing":[156],"number":[158],"countermeasures,":[160],"ACT":[166,179],"maximizing":[168],"benefit":[170],"certain":[174],"set":[176],"under":[180],"different":[181],"constraints.":[182],"cast":[184],"each":[185],"problem":[187,192],"an":[189],"integer":[190],"programming":[191],"which":[193],"also":[194],"allows":[195],"us":[196],"even":[201],"model.":[210],"Our":[211],"method":[212],"scales":[213],"large":[216],"ACTs":[217],"compare":[220],"its":[221],"efficiency":[222],"other":[224],"approaches.":[225]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":13},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":14},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}