全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

Scale, Complexity, and Cybersecurity Risk Management

DOI: 10.4236/jis.2024.154029, PP. 524-544

Keywords: Complexity, Cybersecurity, Scale, Scaling Relations, Stochastic, Linear, Non-Linear, Macroscopic, Organized Complexity, Disorganized Complexity

Full-Text   Cite this paper   Add to My Lib

Abstract:

Elementary information theory is used to model cybersecurity complexity, where the model assumes that security risk management is a binomial stochastic process. Complexity is shown to increase exponentially with the number of vulnerabilities in combination with security risk management entropy. However, vulnerabilities can be either local or non-local, where the former is confined to networked elements and the latter results from interactions between elements. Furthermore, interactions involve multiple methods of communication, where each method can contain vulnerabilities specific to that method. Importantly, the number of possible interactions scales quadratically with the number of elements in standard network topologies. Minimizing these interactions can significantly reduce the number of vulnerabilities and the accompanying complexity. Two network configurations that yield sub-quadratic and linear scaling relations are presented.

References

[1]  Young, C. (2022) Cybercomplexity, a Macroscopic View of Cybersecurity Risk. Springer Nature, 59-106.
[2]  Weaver, W. (1948) Science and Complexity. American Scientist, 36, 536-544.
[3]  Shannon, C. and Weaver, W. (1949) The Mathematical Theory of Communication. The University of Illinois Press.
[4]  National Vulnerability Database (NIST).
https://nvd.nist.gov/vuln-metrics/cvss
[5]  Wikipedia, Promise Theory.
https://en.wikipedia.org/wiki/Promise_theory

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133