Advertisement

Quantitative Attack Tree Analysis: Stochastic Bounds and Numerical Analysis

  • Nihal Pekergin
  • Sovanna Tan
  • Jean-Michel Fourneau
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9987)

Abstract

This paper presents an efficient numerical analysis of the time dependence of the attacker’s success in an attack tree. The leaves of the attack tree associated with the basic attack steps are annotated with finite discrete probability distributions. By a bottom-up approach, the output distributions of the gates, and finally the output distribution at the root of the attack tree is computed. The algorithmic complexities of the gate functions depend on the number of bins of the input distributions. Since the number of bins may increase rapidly due to the successive applications of the gate function, we aim to control the sizes of the input distributions. By using the stochastic ordering and the stochastic monotonicity, we analyze the underlying attack tree by constructing the reduced-size upper and lower distributions. Thus at the root of the attack tree, we compute the bounding distributions of the time when the system would be compromised. The main advantage of this approach is the possibility to have a tradeoff between the accuracy of the bounds and the algorithmic complexity. For a given time t, we can compute the bounds on the probability for the attacker’s success at time t. The time-dependent behavior of attacks is important to have insights on the security of the system and to develop effective countermeasures.

Keywords

Attack tree Discrete probability distribution Stochastic bounds 

References

  1. 1.
    Aït-Salaht, F., Castel-Taleb, H., Fourneau, J.-M., Pekergin, N.: Stochastic bounds and histograms for network performance analysis. In: Balsamo, M.S., Knottenbelt, W.J., Marin, A. (eds.) EPEW 2013. LNCS, vol. 8168, pp. 13–27. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  2. 2.
    Arnold, F., Hermanns, H., Pulungan, R., Stoelinga, M.: Time-dependent analysis of attacks. In: Abadi, M., Kremer, S. (eds.) POST 2014 (ETAPS 2014). LNCS, vol. 8414, pp. 285–305. Springer, Heidelberg (2014)CrossRefGoogle Scholar
  3. 3.
    Fourneau, J.M., Pekergin, N.: A numerical analysis of dynamic fault trees based on stochastic bounds. In: Campos, J., Haverkort, B.R. (eds.) QEST 2015. LNCS, vol. 9259, pp. 176–191. Springer, Heidelberg (2015)CrossRefGoogle Scholar
  4. 4.
    Jhawar, R., Kordy, B., Mauw, S., Radomirović, S., Trujillo-Rasua, R.: Attack trees with sequential conjunction. In: Federrath, H., Gollmann, D., Chakravarthy, S.R. (eds.) SEC 2015. IFIP AICT, vol. 455, pp. 339–353. Springer, Heidelberg (2015). doi: 10.1007/978-3-319-18467-8_23 CrossRefGoogle Scholar
  5. 5.
    Kordy, B., Piètre-Cambacédès, L., Schweitzer, P.: DAG-based attack and defense modeling: don’t miss the forest for the attack trees. Comput. Sci. Rev. 13–14, 1–38 (2014)CrossRefzbMATHGoogle Scholar
  6. 6.
    Muller, A., Stoyan, D.: Comparison Methods for Stochastic Models and Risks. Wiley, New York (2002)zbMATHGoogle Scholar
  7. 7.
    Nielsen, J.R.: Evaluating information assurance control effectiveness on an air force supervisory control and data. Master’s thesis, Air Force Institute of Technology (2011)Google Scholar
  8. 8.
    Piètre-Cambacédès, L., Bouissou, M.: Attack and defense modeling with BDMP. In: Kotenko, I., Skormin, V. (eds.) MMM-ACNS 2010. LNCS, vol. 6258, pp. 86–101. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  9. 9.
    Piètre-Cambacédès, L., Bouissou, M.: Cross-fertilization between safety and security engineering. Rel. Eng. Sys. Safety 110, 110–126 (2013)CrossRefGoogle Scholar
  10. 10.
    Schneier, B.: Attack trees: modeling security threats. Dr. Dobbs J. Softw. Tools 24(12), 21–29 (1999)Google Scholar
  11. 11.
    Siwar Kriaa, L.P., Bouissou, M.: Modeling the stuxnet attack with BDMP: towards more formal risk assessments. In: 2012 7th International Conference on Risks and Security of Internet and Systems (CRiSIS), Cork, Ireland, 10–12 October 2012, pp. 1–8. IEEE (2012)Google Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  • Nihal Pekergin
    • 1
  • Sovanna Tan
    • 1
  • Jean-Michel Fourneau
    • 2
  1. 1.LACL, Université Paris-Est CréteilCréteilFrance
  2. 2.DAVID, Université de Versailles-St-QuentinVersaillesFrance

Personalised recommendations