Abstract
Security of networks has become an increasingly important issue in the highly connected world. Security depends on attacks. Typical attacks include both cascading failure of virus spreading and of information propagation and physical attacks of removal of nodes or edges. Numerous experiments have shown that none of the existing models construct secure networks, and that the universal properties of power law and small world phenomenon of networks seem unavoidable obstacles for security of networks against attacks. Here, we propose a new strategy of attacks, the attack of rules of evolution of networks. By using the strategy, we proposed a new model of networks which generates provably secure networks. It was shown both analytically and numerically that the best strategy is to attack on the rules of the evolution of networks, that the second best strategy is the attack by cascading failure models, that the third best strategy is the physical attack of removal of nodes or edges, and that the least desirable strategy is the physical attack of deleting structures of the networks. The results characterize and classify the strategies for network security, providing a foundation for a security theory of networks. Equally important, our results demonstrate that security can be achieved provably by structures of networks, that there is a tradeoff between the roles of structures and of thresholds in security engineering, and that power law and small world property are never obstacles of security of networks. Our model explores a number of new principles of networks, including some topological principles, probabilistic principles, and combinatorial principles. The new principles build the foundation for new strategies for enhancing security of networks, and for new protocols of communications and security of the Internet and computer networks etc. We anticipate that our theory can be used in analyzing security of real systems in economy, society and technology.
Similar content being viewed by others
References
Barabási A. Scale-free networks: a decade and beyond. Science, 2009, 325: 412–413
Erdös P, Rényi A. On random graphs. Publ Math, 1959, 6: 290–297
Erdös P, Rényi A. On the evolution of random graphsrandom graphs. Magyar Tud Akad Mat, 1960, 5: 17–61
Barabási A, Albert R. Emergence of scaling in random networks. Science, 1999, 286: 509–512
Albert R, Jeong H, Barabási A. Error and attack tolerance of complex networks. Nature, 2000, 406: 378–381
Andersen R M, May R M. Infectious Diseases of Humans: Dynamics and Control. New York: Oxford University Press, 1991
Kempe D, Kleinberg J, Tardos É. Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2003. 137–146
Kempe D, Kleinberg J, Tardos É. Influential nodes in a diffusion model for social networks. In: Proceedings of the 32nd International Conference on Automata, Languages and Programming, 2005. 1127–1138
Morris S. Contagion. Rev Econ Stud, 2000, 67: 57–78
Schweitzer F, Fagiolo G, Sornette D, et al. Economic networks: the new challenge. Science, 2009, 325: 422–425
Cohen R, Reez K, Ben-Avraham D, et al. Breakdown of the internet intentional attack. Phys Rev Lett, 2001, 87: 219801
Motter A E. Cascade control and defense in complex networks. Phys Rev Lett, 2004, 93: 098701
Watta D J. A simple model of global cascades on random networks. In: Proceedings of the National Academy of Sciences, 2002. 5766–5771
Pastor-Satorras R, Vespignani A. Epidemic spreading in scale-free networks. Phys Rev Lett, 2001, 86: 3200–3203
Valente A X, Sarkar A, Stone H A. Two-peak and three-peak optimal complex networks. Phys Rev Lett, 2004, 92: 118702
Tanizawa T, Paul R, Cohen G, et al. Optimization of network robustness to waves of targeted and random attacks. Phys Rev E, 2005, 71: 047101
Cohen R, Havlin S, Avraham D. Efficient immunization strategies for computer networks and populations. Phys Rev Lett, 2003, 91: 247901
Schneider C M, Moreire A A, Andrade J J S, et al. Mitigation of malicious attacks on networks. In: Proceedings of the National Academy of Sciences, 2011. 3838–3841
Simsek O, Jensen D. Navigating networks by using homophily and degree. In: Proceedings of the National Academy of Sciences, 2008. 12758–12762
Sun Tzu. The Art of War. Minneapolis: Filiquarian Publishing, 2007
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Li, A., Li, X., Pan, Y. et al. Strategies for network security. Sci. China Inf. Sci. 58, 1–14 (2015). https://doi.org/10.1007/s11432-014-5182-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11432-014-5182-9