{"title":"攻击图表示","authors":"M. Alhomidi, M. Reed","doi":"10.1109/CEEC.2012.6375383","DOIUrl":null,"url":null,"abstract":"Attack graphs have been widely used to represent and analyze security attacks. More specifically, they show all ways of how an attacker violets a security policy. Most attack graphs are constructed from nodes (vertices) and edges (arcs). Since there are so many research papers, each has a different representation of attack graphs. This paper discuses attack graph representations in terms of its nodes and edges interpretations. Other factors are addressed such the attack graph constructions and scalability.","PeriodicalId":142286,"journal":{"name":"2012 4th Computer Science and Electronic Engineering Conference (CEEC)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Attack graphs representations\",\"authors\":\"M. Alhomidi, M. Reed\",\"doi\":\"10.1109/CEEC.2012.6375383\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Attack graphs have been widely used to represent and analyze security attacks. More specifically, they show all ways of how an attacker violets a security policy. Most attack graphs are constructed from nodes (vertices) and edges (arcs). Since there are so many research papers, each has a different representation of attack graphs. This paper discuses attack graph representations in terms of its nodes and edges interpretations. Other factors are addressed such the attack graph constructions and scalability.\",\"PeriodicalId\":142286,\"journal\":{\"name\":\"2012 4th Computer Science and Electronic Engineering Conference (CEEC)\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-12-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 4th Computer Science and Electronic Engineering Conference (CEEC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEEC.2012.6375383\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 4th Computer Science and Electronic Engineering Conference (CEEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEEC.2012.6375383","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Attack graphs have been widely used to represent and analyze security attacks. More specifically, they show all ways of how an attacker violets a security policy. Most attack graphs are constructed from nodes (vertices) and edges (arcs). Since there are so many research papers, each has a different representation of attack graphs. This paper discuses attack graph representations in terms of its nodes and edges interpretations. Other factors are addressed such the attack graph constructions and scalability.