Graph similarity metrics for assessing temporal changes in attack surface of dynamic networks
详细信息 查看全文
- 作者：Ghanshyam S. Bopchea ; b ; ghanshyambopche.mca@gmail.com" class="auth_mail" title="E-mail the corresponding authorAuthor Vitae ; Babu M. MehtreaAuthor Vitae
- 关键词：Network security ; Network hardening ; Security metric ; Attack surface ; Change assessment ; Change awareness ; Attack graph ; Maximum common subgraph ; Graph similarity/distance measure ; Graph edit distance
- 刊名：Computers & Security
- 出版年：2017
- 出版时间：January 2017
- 年：2017
- 卷：64
- 期：Complete
- 页码：16-43
- 全文大小：3160 K
文摘
- •
Measuring temporal variation in network attack surface is a key problem in dynamic networks.
- •
We propose to use graph distance metrics based on the Maximum Common Subgraph (MCS) and Graph Edit Distance (GED).
- •
We show test results on a set of 3 different network models.
- •
We compare the MCS and GED based metrics performance with the previously proposed 9 attack graph based metrics.
- •
We present the in-depth analysis of the obtained results.