• DocumentCode
    2435111
  • Title

    Attack graphs representations

  • Author

    Alhomidi, Mohammed A. ; Reed, Martin J.

  • Author_Institution
    Sch. of Comput. Sci. & Electron. Eng., Univ. of Essex, Colchester, UK
  • fYear
    2012
  • fDate
    12-13 Sept. 2012
  • Firstpage
    83
  • Lastpage
    88
  • 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.
  • Keywords
    graph theory; security of data; attack graph constructions; attack graph scalability; attack graphs representations; security attacks; security policy; Computational modeling; Computer science; Educational institutions; Polynomials; Scalability; Security; attack graph; attack state; exploits; security; vulnerability;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Science and Electronic Engineering Conference (CEEC), 2012 4th
  • Conference_Location
    Colchester
  • Print_ISBN
    978-1-4673-2665-0
  • Type

    conf

  • DOI
    10.1109/CEEC.2012.6375383
  • Filename
    6375383