Linda Briesemeister
Patrick Lincoln
ABSTRACT
In this paper, we study the defensibility of large scale-free networks against malicious rapidly self-propagating code such as worms and viruses. We develop a framework to investigate the profiles of such code as it infects a large network. Based on these profiles and large-scale network percolation studies, we investigate features of networks that render them more or less defensible against worms. However, we wish to preserve mission-relevant features of the network, such as basic connectivity and resilience to normal nonmalicious outages. We aim to develop methods to help design networks that preserve critical functionality and enable more effective defenses.
- David Moore, Colleen Shannon, Geoffrey M. Voelker, and Stefan Savage. Internet quarantine: Requirements for containing self-propagating code. In Proc. of INFOCOM, 2003.]]Google Scholar
- Réka Albert, Hawoong Jeong, and Albert-László Barabási. Error and attack tolerance in complex networks. Nature, 406:387--482, 2000.]]Google ScholarCross Ref
- Romualdo Pastor-Satorras and Alessandro Vespignani. Epidemics and Immunization in Scale-Free Networks, chapter Epidemics and immunization in scale-free networks. Wiley-VCH, Berlin, May 2002.]]Google Scholar
- Romualdo Pastor-Satorras and Alessandro Vespignani. Epidemic dynamics in finite size scale-free networks. Physcal Review E, 65, 2002. 035108.]]Google Scholar
- Romualdo Pastor-Satorras and Alessandro Vespignani. Epidemic spreading in scale-free networks. Physical Review Letters, 86:3200--3203, 2001.]]Google ScholarCross Ref
- Victor M. Eguíluz and Konstantin Klemm. Epidemic threshold in structured scale-free networks. Physical Review Letters, 89(10), September 2002. 108701.]]Google ScholarCross Ref
- Victor M. Eguíluz, Emilio Hernández-García, Oreste Piro, and Konstantin Klemm. Effective dimensions and percolation in hierarchically structured scale-free networks. submitted to Physical Review E, 2003.]]Google Scholar
- Zoltán Dezsó and Albert-László Barabási. Halting viruses in scale-free networks. Physical Review E, 65, 2002. 055103.]]Google Scholar
- Jasmin Leveille. Epidemic spreading in technological networks. Technical Report HPL-2002-287, HP Laboratories Bristol, October 2002.]]Google Scholar
- M. E. J. Newman, Stephanie Forrest, and Justin Balthrop. Email networks and the spread of computer viruses. Physical Review E, 66, 2002. 035101.]]Google Scholar
- A. Mackie, J. Roculan, R. Russel, and M.V. Velzen. Nimda worm analysis. Security Focus, Incident Analysis Report, Version 2, September 2002.]]Google Scholar
- C. C. Zou, D. Towsley, and W. Gong. Email virus propagation modeling and analysis. Technical Report TR-CSE-03-04, University of Massachusetts Amherst, Electrical and Computer Engineering Department, 2003.]]Google Scholar
- E. Spafford. An analysis of the internet worm. In Proceedings of the European Software Engineering Conference, volume LNCS 387, September 1989.]]Google Scholar
- Eeye Digital Security. ".ida code red' worm". Advisory AL20010717, July 2001.]]Google Scholar
- N. Weaver. Potential strategies for high speed active worms: A worst case analysis. Whitepaper, UC Berkeley, March 2002.]]Google Scholar
- S. Staniford, V. Paxon, and N. Weaver. How to 0wn the internet in your spare time. In Proceedings of the 11th USENIX Security Symposium, August 2002.]] Google ScholarDigital Library
- D. Moore, V. Paxson, S. Savage, C. Shannon, S. Staniford, and N. Weaver. Inside the slammer worm. IEEE Security and Privacy, 1(4):33--39, July 2003.]] Google ScholarDigital Library
- Mark E. J. Newman. Random graphs as models of networks. In S. Bornholdt and H. G. Schuster, editors, Handbook of Graphs and Networks. Wiley-VCH, Berlin, 2002. To appear.]]Google Scholar
- Albert-László Barabási and Réka Albert. Emergence of scaling in random networks. Science, 286:509--512, 1999.]]Google ScholarCross Ref
- Konstantin Klemm and Victor M. Eguíluz. Highly clustered scale-free networks. Physical Review E, 65, December 2002. 036123.]]Google ScholarCross Ref
- Rebecca N. Wright, Patrick D. Lincoln, and Jonathan K. Millen. Efficient fault-tolerant certificate revocation. In 2000 {ACM {CCS, Menlo Park, {CA, jun 2000. {SRI International.]] Google ScholarDigital Library
- R.Wright, P. Lincoln, and J. Millen. Depender graphs: A method of fault-tolerant certificate distribution. Journal of Computer Security, 9(4):323--338, 2001.]] Google ScholarDigital Library
- T. Toth and C. Krugel. Accurate buffer overflow detection via abstract payload execution. In Proceedings of the 5th International Symposium on Recent Advanced in Intrusion Detection, Zurich, Switzerland, October 2002.]]Google ScholarCross Ref
- P.A. Porras and A. Valdes. Live traffic analysis of tcp/ip gateways. In Proceedings of the 1998 ISOC Symposium on Network and Distributed Systems Security, San Diego, California, March 1998. ISOC Press.]]Google Scholar
- A. Valdes and K. Skinner. Adaptive, model-based monitoring for cyber attack detection. In Proceedings of the 3rd International Symposium on Recent Advanced in Intrusion Detection, Toulouse, France, October 2000.]] Google ScholarDigital Library
- R. Sekar, A. Gupta, J. Frulo, T. Shanbhad, A. Tiwari, Y. Yang, and S. Zhou. Specification-based anomaly detection: a new approach for detecting network intrusion. In Proceedings of the ACM Conference on Computer and Communications Security, Washington DC, November 2002.]] Google ScholarDigital Library
- D. Nojiri, J. Rowe, and K. Levitt. Cooperative response strategies for large scale attack mitigation. In Proceedings of the 2003 DARPA DISCEX Conferenece, Washington DC, April 2003.]]Google ScholarCross Ref
- Epidemic profiles and defense of scale-free networks
Recommendations
A Scale-Free Small-World Network from Durer Pentagons
IWCFTA '11: Proceedings of the 2011 Fourth International Workshop on Chaos-Fractals Theories and ApplicationsThe complex network is a focus among the research on the complex systems today. In this paper, we propose a deterministic network called Durer networks arising from the Durer pentagons. It is revealed that the tail of the degree distribution follows a ...
Research on Worms Spread and Control Strategy in Complex Networks
ICICIS '11: Proceedings of the 2011 International Conference on Internet Computing and Information ServicesComputer viruses and worms spreading in the network depends on the proliferation of network structure. Network structure will affect the virus and worms' infection rate and scope of computer. This paper take the worm as the targeted, against the network ...
Dynamic Topologies for Robust Scale-Free Networks
Bio-Inspired Computing and CommunicationIn recent years, the field of anonymity and traffic analysis have attracted much research interest. However, the analysis of subsequent dynamics of attack and defense, between an adversary using such topology information gleaned from traffic analysis to ...
Comments