Skip to main content

Part of the book series: Springer Optimization and Its Applications ((SOIA,volume 91))

Abstract

After studying the stochastic process of cyber-attacks against a cyber system, we investigate the set of intermediate times between successive cyber-attacks. Then, we give basic definitions and properties on the expected number of cyber-attacks in a closed time interval and present renewal theorems, as well as a description of exact and asymptotic probability distributions for the main occurrence moments of cyber-attacks. Further, we outline stationary renewal processes of cyber-attacks. The paper concludes with asymptotic properties for the counting function of cyber-attacks.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. S. A. Camtepe and B. Yene, Modeling and detection of complex attacks. In Proceedings of the Third International Conference on Security and Privacy in Communications Networks and the Workshops, 2007, IEEE Conference Publications, Nice, France, pp.234–243.

    Google Scholar 

  2. N. Cuppens-Boulahia, F. Cuppens, F. Autrel and H. Debar, An ontology-based approach to react to network attacks. Int. J. of Information and Computer Security, 3, 3(2009), 280–305.

    Google Scholar 

  3. G.C. Dalton, R.F. Mills, J.M. Colombi and R.A. Raines, Analyzing attack trees using generalized stochastic Petri nets. In IEEE Information Assurance Workshop, 116–123.

    Google Scholar 

  4. K. Ingols, M. Chu, R. Lippmann, S. Webster and S. Boyer, Modeling modern network attacks and countermeasures using attack graphs. In Proceedings Computer Security Applications Conference, (ACSAC), 117–126.

    Google Scholar 

  5. R. Hewett and P. Kijsanayothin, Host-centric model checking for network vulnerability analysis. In Computer Security Applications Conference, 225–234.

    Google Scholar 

  6. P. Maggi, D. Pozza and R. Sisto, Vulnerability modeling for the analysis of network attacks. In Dependability of Computer Systems, 15–22.

    Google Scholar 

  7. X. Ou, W. F. Boyer and M. A. McQueen, A scalable approach to attack graph generation. In ACM Conference on Computer and Communications Security, 336–345.

    Google Scholar 

  8. R. E. Sawilla and X. Ou, Identifying critical attack assets in dependency attack graphs. In the European Symposium on Research in Computer Security (ESORICS), 18–34.

    Google Scholar 

  9. D. Stirzaker, Stochastic Process and Models, Oxford University Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nicholas J. Daras .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Daras, N.J. (2014). Stochastic Analysis of Cyber-Attacks. In: Daras, N. (eds) Applications of Mathematics and Informatics in Science and Engineering. Springer Optimization and Its Applications, vol 91. Springer, Cham. https://doi.org/10.1007/978-3-319-04720-1_7

Download citation

Publish with us

Policies and ethics