{"id":"https://openalex.org/W2092510604","doi":"https://doi.org/10.1109/trustcom.2013.51","title":"Scalable Attack Representation Model Using Logic Reduction Techniques","display_name":"Scalable Attack Representation Model Using Logic Reduction Techniques","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W2092510604","doi":"https://doi.org/10.1109/trustcom.2013.51","mag":"2092510604"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/trustcom.2013.51","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5011163136","display_name":"Jin B. Hong","orcid":"https://orcid.org/0000-0003-1359-3813"},"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":"Jin Bum Hong","raw_affiliation_strings":["[Comput. Sci. & Software Eng. Dept., Univ. of Canterbury, Christchurch, New Zealand]"],"affiliations":[{"raw_affiliation_string":"[Comput. Sci. & Software Eng. Dept., Univ. of Canterbury, Christchurch, New Zealand]","institution_ids":["https://openalex.org/I185492890"]}]},{"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":["[Comput. Sci. & Software Eng. Dept., Univ. of Canterbury, Christchurch, New Zealand]"],"affiliations":[{"raw_affiliation_string":"[Comput. Sci. & Software Eng. Dept., Univ. of Canterbury, Christchurch, New Zealand]","institution_ids":["https://openalex.org/I185492890"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109861849","display_name":"Tadao Takaoka","orcid":null},"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":"Tadao Takaoka","raw_affiliation_strings":["[Comput. Sci. & Software Eng. Dept., Univ. of Canterbury, Christchurch, New Zealand]"],"affiliations":[{"raw_affiliation_string":"[Comput. Sci. & Software Eng. Dept., Univ. of Canterbury, Christchurch, New Zealand]","institution_ids":["https://openalex.org/I185492890"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.164,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":27,"citation_normalized_percentile":{"value":0.955182,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":92,"max":93},"biblio":{"volume":"3935","issue":null,"first_page":"404","last_page":"411"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10734","display_name":"Information and Cyber Security","score":0.9996,"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.9996,"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.9975,"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/T11241","display_name":"Advanced Malware Detection Techniques","score":0.9842,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.48132622}],"concepts":[{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7603667},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.752965},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.62651765},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.614206},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5475321},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.5444348},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.49916553},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4839902},{"id":"https://openalex.org/C21593369","wikidata":"https://www.wikidata.org/wiki/Q1032176","display_name":"Countermeasure","level":2,"score":0.48132622},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43241563},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.4254558},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.42531547},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38401502},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.33835375},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.33249325},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1647141},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.16002104},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13349253},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.12613386},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/trustcom.2013.51","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.57,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":18,"referenced_works":["https://openalex.org/W1965332127","https://openalex.org/W1966902774","https://openalex.org/W2049973206","https://openalex.org/W2084044852","https://openalex.org/W2100033648","https://openalex.org/W2110908300","https://openalex.org/W2121805588","https://openalex.org/W2130475833","https://openalex.org/W2130631685","https://openalex.org/W2146024157","https://openalex.org/W2146906033","https://openalex.org/W2150890217","https://openalex.org/W2165836036","https://openalex.org/W2171797753","https://openalex.org/W2538354227","https://openalex.org/W4285719527","https://openalex.org/W49590930","https://openalex.org/W58080111"],"related_works":["https://openalex.org/W961142965","https://openalex.org/W622044715","https://openalex.org/W2392664412","https://openalex.org/W2378994067","https://openalex.org/W2378749186","https://openalex.org/W2366397149","https://openalex.org/W2364088131","https://openalex.org/W2362741838","https://openalex.org/W2350213425","https://openalex.org/W2347979151"],"abstract_inverted_index":{"Automated":[0],"construction":[1,173,192,207],"methods":[2,69],"of":[3,29,157,179,213],"attack":[4,10,36,82,135],"graphs":[5],"(AGs)":[6],"and":[7,39,54,91,109,137,147,174,198,209],"their":[8,40],"improved":[9,41],"representation":[11],"models":[12],"(ARMs)":[13],"have":[14],"been":[15],"proposed,":[16],"but":[17,150],"the":[18,27,93,96,139,171,177,180,191,195,206,210],"AG":[19,88,94],"has":[20],"a":[21,61,74,104,113,160],"state":[22],"space":[23],"explosion":[24],"when":[25],"analysing":[26],"security":[28],"very":[30],"large":[31],"sized":[32],"networked":[33],"systems.":[34],"Instead,":[35],"trees":[37],"(ATs)":[38],"ARMs":[42],"can":[43,85],"be":[44],"used":[45],"(e.g.,":[46,145],"Defense":[47],"Trees,":[48,50,53],"Protection":[49],"Attack":[51,55],"Response":[52],"Countermeasure":[56],"Trees),":[57],"because":[58],"they":[59],"are":[60,66,216],"non-state-space":[62],"model.":[63],"However,":[64,100],"there":[65],"no":[67],"known":[68],"to":[70,119,131,169,175],"construct":[71,120],"ATs":[72,121,172,215],"in":[73],"scalable":[75],"manner":[76],"automatically":[77],"while":[78],"maintaining":[79],"all":[80,133],"possible":[81,134],"scenarios.":[83],"We":[84,163],"use":[86],"an":[87,107,154],"generation":[89],"tools,":[90],"transform":[92],"into":[95],"AT":[97,140],"using":[98,142],"min-cuts.":[99],"this":[101,151],"method":[102,152,197],"requires":[103],"transformation":[105],"(i.e.,":[106],"overhead),":[108],"computing":[110],"min-cuts":[111],"is":[112,118,130,185],"NP-hard":[114],"problem.":[115,162],"Another":[116],"way":[117],"directly":[122],"with":[123],"given":[124],"network":[125],"information.":[126],"A":[127],"naive":[128,196],"approach":[129],"compute":[132],"paths":[136],"populate":[138],"branches":[141],"logic":[143,166,200],"gates":[144],"AND":[146],"OR":[148],"gates),":[149],"generates":[153],"exponential":[155],"number":[156],"nodes,":[158],"causing":[159],"scalability":[161],"propose":[164],"two":[165,199],"reduction":[167,201],"techniques":[168],"automate":[170],"reduce":[176],"size":[178],"AT.":[181],"The":[182,187,203],"computational":[183],"complexity":[184],"calculated.":[186],"simulation":[188],"result":[189],"shows":[190],"time":[193,208],"for":[194],"techniques.":[202],"trade-off":[204],"between":[205],"memory":[211],"usage":[212],"simplified":[214],"also":[217],"shown.":[218]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2092510604","counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3}],"updated_date":"2024-12-10T21:41:02.802909","created_date":"2016-06-24"}