Skip to main content

2019 | OriginalPaper | Buchkapitel

Differential Attack Graph-Based Approach for Assessing Change in the Network Attack Surface

verfasst von : Ghanshyam S. Bopche, Gopal N. Rai, B. Ramchandra Reddy, B. M. Mehtre

Erschienen in: Information Systems Security

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Assessing change in an attack surface of dynamic computer networks is a formidable challenge. Researchers have previously looked into the problem of measuring network risk and used an attack graph (AG) for network hardening. However, such AG-based approaches do not consider the likely variations in the attack surface. Further, even though it is possible to generate attack graphs for a realistic network efficiently, resulting graphs poses a severe challenge to human comprehension. To overcome such problems, in this paper, we present a differential attack graph-based change detection technique. We proposed a change distribution matrix-based technique to discern differences in the network attack surface. Our method not only detects the degree of change in the network attack surface but also finds the root causes in a time-efficient manner. We use a synthetic network to illustrate the approach and perform a set of simulations to evaluate the performance. Experimental results show that our technique is capable of assessing changes in the attack surface, and thus can be used in practice for network hardening.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Bhattacharya, P., Ghosh, S.K.: Analytical framework for measuring network security using exploit dependency graph. IET Inf. Secur. 6(4), 264–270 (2012)CrossRef Bhattacharya, P., Ghosh, S.K.: Analytical framework for measuring network security using exploit dependency graph. IET Inf. Secur. 6(4), 264–270 (2012)CrossRef
2.
Zurück zum Zitat Bondy, J.A., Murty, U.S.R., et al.: Graph Theory with Applications, vol. 290. Macmillan, London (1976)CrossRef Bondy, J.A., Murty, U.S.R., et al.: Graph Theory with Applications, vol. 290. Macmillan, London (1976)CrossRef
3.
Zurück zum Zitat Bopche, G.S., Mehtre, B.M.: Extending attack graph-based metrics for enterprise network security management. In: Nagar, A., Mohapatra, D.P., Chaki, N. (eds.) Proceedings of 3rd International Conference on Advanced Computing, Networking and Informatics. SIST, vol. 44, pp. 315–325. Springer, New Delhi (2016). https://doi.org/10.1007/978-81-322-2529-4_33CrossRef Bopche, G.S., Mehtre, B.M.: Extending attack graph-based metrics for enterprise network security management. In: Nagar, A., Mohapatra, D.P., Chaki, N. (eds.) Proceedings of 3rd International Conference on Advanced Computing, Networking and Informatics. SIST, vol. 44, pp. 315–325. Springer, New Delhi (2016). https://​doi.​org/​10.​1007/​978-81-322-2529-4_​33CrossRef
4.
Zurück zum Zitat Bopche, G.S., Mehtre, B.M.: Graph similarity metrics for assessing temporal changes in attack surface of dynamic networks. Comput. Secur. 64, 16–43 (2017)CrossRef Bopche, G.S., Mehtre, B.M.: Graph similarity metrics for assessing temporal changes in attack surface of dynamic networks. Comput. Secur. 64, 16–43 (2017)CrossRef
5.
Zurück zum Zitat Bunke, H., Shearer, K.: A graph distance metric based on the maximal common subgraph. Pattern Recogn. Lett. 19(3–4), 255–259 (1998)CrossRef Bunke, H., Shearer, K.: A graph distance metric based on the maximal common subgraph. Pattern Recogn. Lett. 19(3–4), 255–259 (1998)CrossRef
6.
Zurück zum Zitat Chung, F., Lu, L.: Connected components in random graphs with given expected degree sequences. Ann. Comb. 6(2), 125–145 (2002)MathSciNetCrossRef Chung, F., Lu, L.: Connected components in random graphs with given expected degree sequences. Ann. Comb. 6(2), 125–145 (2002)MathSciNetCrossRef
9.
Zurück zum Zitat Dai, F., Hu, Y., Zheng, K., Wu, B.: Exploring risk flow attack graph for security risk assessment. IET Inf. Secur. 9(6), 344–353 (2015)CrossRef Dai, F., Hu, Y., Zheng, K., Wu, B.: Exploring risk flow attack graph for security risk assessment. IET Inf. Secur. 9(6), 344–353 (2015)CrossRef
10.
Zurück zum Zitat GhasemiGol, M., Ghaemi-Bafghi, A., Takabi, H.: A comprehensive approach for network attack forecasting. Comput. Secur. 58, 83–105 (2016)CrossRef GhasemiGol, M., Ghaemi-Bafghi, A., Takabi, H.: A comprehensive approach for network attack forecasting. Comput. Secur. 58, 83–105 (2016)CrossRef
11.
Zurück zum Zitat Ghosh, N., Chokshi, I., Sarkar, M., Ghosh, S.K., Kaushik, A.K., Das, S.K.: NetSecuritas: an integrated attack graph-based security assessment tool for enterprise networks. In: Proceedings of the International Conference on Distributed Computing and Networking, p. 30. ACM (2015) Ghosh, N., Chokshi, I., Sarkar, M., Ghosh, S.K., Kaushik, A.K., Das, S.K.: NetSecuritas: an integrated attack graph-based security assessment tool for enterprise networks. In: Proceedings of the International Conference on Distributed Computing and Networking, p. 30. ACM (2015)
12.
Zurück zum Zitat Huang, Z.: Human-centric training and assessment for cyber situation awareness. Ph.D. thesis, University of Delaware (2015) Huang, Z.: Human-centric training and assessment for cyber situation awareness. Ph.D. thesis, University of Delaware (2015)
13.
Zurück zum Zitat Idika, N., Bhargava, B.: Extending attack graph-based security metrics and aggregating their application. IEEE Trans. Dependable Secure Comput. 9(1), 75–85 (2012)CrossRef Idika, N., Bhargava, B.: Extending attack graph-based security metrics and aggregating their application. IEEE Trans. Dependable Secure Comput. 9(1), 75–85 (2012)CrossRef
14.
Zurück zum Zitat Ingols, K., Chu, M., Lippmann, R., Webster, S., Boyer, S.: Modeling modern network attacks and countermeasures using attack graphs. In: 2009 Annual Computer Security Applications Conference, pp. 117–126. IEEE (2009) Ingols, K., Chu, M., Lippmann, R., Webster, S., Boyer, S.: Modeling modern network attacks and countermeasures using attack graphs. In: 2009 Annual Computer Security Applications Conference, pp. 117–126. IEEE (2009)
15.
Zurück zum Zitat Jajodia, S., Noel, S., Kalapa, P., Albanese, M., Williams, J.: Cauldron-mission-centric cyber situational awareness with defense in depth (2011) Jajodia, S., Noel, S., Kalapa, P., Albanese, M., Williams, J.: Cauldron-mission-centric cyber situational awareness with defense in depth (2011)
16.
Zurück zum Zitat Kaynar, K.: A taxonomy for attack graph generation and usage in network security. J. Inf. Secur. Appl. 29, 27–56 (2016) Kaynar, K.: A taxonomy for attack graph generation and usage in network security. J. Inf. Secur. Appl. 29, 27–56 (2016)
17.
Zurück zum Zitat Koutra, D., Vogelstein, J.T., Faloutsos, C.: DELTACON: a principled massive-graph similarity function. In: Proceedings of the 2013 SIAM International Conference on Data Mining, pp. 162–170. SIAM (2013) Koutra, D., Vogelstein, J.T., Faloutsos, C.: DELTACON: a principled massive-graph similarity function. In: Proceedings of the 2013 SIAM International Conference on Data Mining, pp. 162–170. SIAM (2013)
18.
Zurück zum Zitat Kundu, A., Ghosh, S.K.: A multi-objective search strategy to select optimal network hardening measures. Int. J. Decis. Support Syst. 1(1), 130–148 (2015)CrossRef Kundu, A., Ghosh, S.K.: A multi-objective search strategy to select optimal network hardening measures. Int. J. Decis. Support Syst. 1(1), 130–148 (2015)CrossRef
19.
Zurück zum Zitat Kvasnicka, V., Pospichal, J.: Fast evaluation of chemical distance by tabu search algorithm. J. Chem. Inf. Comput. Sci. 34(5), 1109–1112 (1994)CrossRef Kvasnicka, V., Pospichal, J.: Fast evaluation of chemical distance by tabu search algorithm. J. Chem. Inf. Comput. Sci. 34(5), 1109–1112 (1994)CrossRef
20.
Zurück zum Zitat Liao, Q., Striegel, A.: Intelligent network management using graph differential anomaly visualization. In: 2012 IEEE Network Operations and Management Symposium, pp. 1008–1014. IEEE (2012) Liao, Q., Striegel, A.: Intelligent network management using graph differential anomaly visualization. In: 2012 IEEE Network Operations and Management Symposium, pp. 1008–1014. IEEE (2012)
21.
Zurück zum Zitat Manadhata, P., Wing, J.: Measuring a system’s attack surface. Technical report CMU-CS-04-102, January 2004 Manadhata, P., Wing, J.: Measuring a system’s attack surface. Technical report CMU-CS-04-102, January 2004
22.
Zurück zum Zitat Manadhata, P., Wing, J.: An attack surface metric. IEEE Trans. Softw. Eng. 37(3), 371–386 (2011)CrossRef Manadhata, P., Wing, J.: An attack surface metric. IEEE Trans. Softw. Eng. 37(3), 371–386 (2011)CrossRef
23.
Zurück zum Zitat Messmer, B.: Efficient graph matching algorithms for preprocessed model graphs (1996) Messmer, B.: Efficient graph matching algorithms for preprocessed model graphs (1996)
24.
Zurück zum Zitat Messmer, B., Bunke, H.: A new algorithm for error-tolerant subgraph isomorphism detection. IEEE Trans. Pattern Anal. Mach. Intell. 20(5), 493–504 (1998)CrossRef Messmer, B., Bunke, H.: A new algorithm for error-tolerant subgraph isomorphism detection. IEEE Trans. Pattern Anal. Mach. Intell. 20(5), 493–504 (1998)CrossRef
25.
Zurück zum Zitat Ning, P., Xu, D.: Learning attack strategies from intrusion alerts. In: Proceedings of the 10th ACM Conference on Computer and Communications Security, pp. 200–209. ACM (2003) Ning, P., Xu, D.: Learning attack strategies from intrusion alerts. In: Proceedings of the 10th ACM Conference on Computer and Communications Security, pp. 200–209. ACM (2003)
26.
Zurück zum Zitat Noel, S., Jajodia, S.: Understanding complex network attack graphs through clustered adjacency matrices. In: 21st Annual Computer Security Applications Conference, ACSAC 2005, pp. 10-pp. IEEE (2005) Noel, S., Jajodia, S.: Understanding complex network attack graphs through clustered adjacency matrices. In: 21st Annual Computer Security Applications Conference, ACSAC 2005, pp. 10-pp. IEEE (2005)
27.
Zurück zum Zitat Noel, S., Jajodia, S.: Metrics suite for network attack graph analytics. In: CISR 2014, pp. 5–8 (2014) Noel, S., Jajodia, S.: Metrics suite for network attack graph analytics. In: CISR 2014, pp. 5–8 (2014)
29.
Zurück zum Zitat Noel, S., Jajodia, S., O’Berry, B., Jacobs, M.: Efficient minimum-cost network hardening via exploit dependency graphs. In: Proceedings of 19th Annual Computer Security Applications Conference, pp. 86–95. IEEE (2003) Noel, S., Jajodia, S., O’Berry, B., Jacobs, M.: Efficient minimum-cost network hardening via exploit dependency graphs. In: Proceedings of 19th Annual Computer Security Applications Conference, pp. 86–95. IEEE (2003)
30.
Zurück zum Zitat Noel, S., Wang, L., Singhal, A., Jajodia, S.: Measuring security risk of networks using attack graphs. IJNGC 1, 135–147 (2010) Noel, S., Wang, L., Singhal, A., Jajodia, S.: Measuring security risk of networks using attack graphs. IJNGC 1, 135–147 (2010)
31.
Zurück zum Zitat Ou, X., Boyer, W.F., McQueen, M.A.: A scalable approach to attack graph generation. In: Proceedings of the 13th ACM Conference on Computer and Communications Security, pp. 336–345. ACM (2006) Ou, X., Boyer, W.F., McQueen, M.A.: A scalable approach to attack graph generation. In: Proceedings of the 13th ACM Conference on Computer and Communications Security, pp. 336–345. ACM (2006)
32.
Zurück zum Zitat Ou, X., Govindavajhala, S., Appel, A.W.: MulVAL: a logic-based network security analyzer. In: USENIX Security Symposium, Baltimore, MD, vol. 8, pp. 113–128 (2005) Ou, X., Govindavajhala, S., Appel, A.W.: MulVAL: a logic-based network security analyzer. In: USENIX Security Symposium, Baltimore, MD, vol. 8, pp. 113–128 (2005)
33.
Zurück zum Zitat Pamula, J., Jajodia, S., Ammann, P., Swarup, V.: A weakest-adversary security metric for network configuration security analysis. In: Proceedings of the 2nd ACM workshop on Quality of Protection, pp. 31–38. ACM (2006) Pamula, J., Jajodia, S., Ammann, P., Swarup, V.: A weakest-adversary security metric for network configuration security analysis. In: Proceedings of the 2nd ACM workshop on Quality of Protection, pp. 31–38. ACM (2006)
34.
Zurück zum Zitat Poolsappasit, N., Dewri, R., Ray, I.: Dynamic security risk management using Bayesian attack graphs. IEEE Trans. Dependable Secure Comput. 9(1), 61–74 (2012)CrossRef Poolsappasit, N., Dewri, R., Ray, I.: Dynamic security risk management using Bayesian attack graphs. IEEE Trans. Dependable Secure Comput. 9(1), 61–74 (2012)CrossRef
35.
Zurück zum Zitat Raymond, J.W., Gardiner, E.J., Willett, P.: RASCAL: calculation of graph similarity using maximum common edge subgraphs. Comput. J. 45(6), 631–644 (2002)CrossRef Raymond, J.W., Gardiner, E.J., Willett, P.: RASCAL: calculation of graph similarity using maximum common edge subgraphs. Comput. J. 45(6), 631–644 (2002)CrossRef
36.
Zurück zum Zitat Showbridge, P., Kraetzl, M., Ray, D.: Detection of abnormal change in dynamic networks. In: Proceedings of Information, Decision and Control, IDC 1999, pp. 557–562 (1999) Showbridge, P., Kraetzl, M., Ray, D.: Detection of abnormal change in dynamic networks. In: Proceedings of Information, Decision and Control, IDC 1999, pp. 557–562 (1999)
37.
Zurück zum Zitat Tupper, M., Zincir-Heywood, A.N.: VEA-bility security metric: a network security analysis tool. In: 2008 Third International Conference on Availability, Reliability and Security, pp. 950–957. IEEE (2008) Tupper, M., Zincir-Heywood, A.N.: VEA-bility security metric: a network security analysis tool. In: 2008 Third International Conference on Availability, Reliability and Security, pp. 950–957. IEEE (2008)
38.
Zurück zum Zitat Wang, L., Jajodia, S., Singhal, A., Cheng, P., Noel, S.: k-zero day safety: a network security metric for measuring the risk of unknown vulnerabilities. IEEE Trans. Dependable Secure Comput. 11(1), 30–44 (2014)CrossRef Wang, L., Jajodia, S., Singhal, A., Cheng, P., Noel, S.: k-zero day safety: a network security metric for measuring the risk of unknown vulnerabilities. IEEE Trans. Dependable Secure Comput. 11(1), 30–44 (2014)CrossRef
39.
Zurück zum Zitat Wang, L., Noel, S., Jajodia, S.: Minimum-cost network hardening using attack graphs. Comput. Commun. 29(18), 3812–3824 (2006)CrossRef Wang, L., Noel, S., Jajodia, S.: Minimum-cost network hardening using attack graphs. Comput. Commun. 29(18), 3812–3824 (2006)CrossRef
Metadaten
Titel
Differential Attack Graph-Based Approach for Assessing Change in the Network Attack Surface
verfasst von
Ghanshyam S. Bopche
Gopal N. Rai
B. Ramchandra Reddy
B. M. Mehtre
Copyright-Jahr
2019
DOI
https://doi.org/10.1007/978-3-030-36945-3_18

Premium Partner