13,105 research outputs found
Graph-theoretic Approach To Modeling Propagation And Control Of Network Worms
In today\u27s network-dependent society, cyber attacks with network worms have become the predominant threat to confidentiality, integrity, and availability of network computing resources. Despite ongoing research efforts, there is still no comprehensive network-security solution aimed at controling large-scale worm propagation. The aim of this work is fivefold: (1) Developing an accurate combinatorial model of worm propagation that can facilitate the analysis of worm control strategies, (2) Building an accurate epidemiological model for the propagation of a worm employing local strategies, (3) Devising distributed architecture and algorithms for detection of worm scanning activities, (4) Designing effective control strategies against the worm, and (5) Simulation of the developed models and strategies on large, scale-free graphs representing real-world communication networks. The proposed pair-approximation model uses the information about the network structure--order, size, degree distribution, and transitivity. The empirical study of propagation on large scale-free graphs is in agreement with the theoretical analysis of the proposed pair-approximation model. We, then, describe a natural generalization of the classical cops-and-robbers game--a combinatorial model of worm propagation and control. With the help of this game on graphs, we show that the problem of containing the worm is NP-hard. Six novel near-optimal control strategies are devised: combination of static and dynamic immunization, reactive dynamic and invariant dynamic immunization, soft quarantining, predictive traffic-blocking, and contact-tracing. The analysis of the predictive dynamic traffic-blocking, employing only local information, shows that the worm can be contained so that 40\% of the network nodes are not affected. Finally, we develop the Detection via Distributed Blackholes architecture and algorithm which reflect the propagation strategy used by the worm and the salient properties of the network. Our distributed detection algorithm can detect the worm scanning activity when only 1.5% of the network has been affected by the propagation. The proposed models and algorithms are analyzed with an individual-based simulation of worm propagation on realistic scale-free topologies
Worm Epidemics in Wireless Adhoc Networks
A dramatic increase in the number of computing devices with wireless
communication capability has resulted in the emergence of a new class of
computer worms which specifically target such devices. The most striking
feature of these worms is that they do not require Internet connectivity for
their propagation but can spread directly from device to device using a
short-range radio communication technology, such as WiFi or Bluetooth. In this
paper, we develop a new model for epidemic spreading of these worms and
investigate their spreading in wireless ad hoc networks via extensive Monte
Carlo simulations. Our studies show that the threshold behaviour and dynamics
of worm epidemics in these networks are greatly affected by a combination of
spatial and temporal correlations which characterize these networks, and are
significantly different from the previously studied epidemics in the Internet
Centralized prevention of denial of service attacks
The world has come to depend on the Internet at an increasing rate for communication, e-commerce, and many other essential services. As such, the Internet has become an integral part of the workings of society at large. This has lead to an increased vulnerability to remotely controlled disruption of vital commercial and government operations---with obvious implications. This disruption can be caused by an attack on one or more specific networks which will deny service to legitimate users or an attack on the Internet itself by creating large amounts of spurious traffic (which will deny services to many or all networks). Individual organizations can take steps to protect themselves but this does not solve the problem of an Internet wide attack. This thesis focuses on an analysis of the different types of Denial of Service attacks and suggests an approach to prevent both categories by centralized detection and limitation of excessive packet flows
Memristive excitable cellular automata
The memristor is a device whose resistance changes depending on the polarity
and magnitude of a voltage applied to the device's terminals. We design a
minimalistic model of a regular network of memristors using
structurally-dynamic cellular automata. Each cell gets info about states of its
closest neighbours via incoming links. A link can be one 'conductive' or
'non-conductive' states. States of every link are updated depending on states
of cells the link connects. Every cell of a memristive automaton takes three
states: resting, excited (analog of positive polarity) and refractory (analog
of negative polarity). A cell updates its state depending on states of its
closest neighbours which are connected to the cell via 'conductive' links. We
study behaviour of memristive automata in response to point-wise and spatially
extended perturbations, structure of localised excitations coupled with
topological defects, interfacial mobile excitations and growth of information
pathways.Comment: Accepted to Int J Bifurcation and Chaos (2011
DoWitcher: Effective Worm Detection and Containment in the Internet Core
Enterprise networks are increasingly offloading the responsibility for worm detection and containment to the carrier networks. However, current approaches to the zero-day worm detection problem such as those based on content similarity of packet payloads are not scalable to the carrier link speeds (OC-48 and up-wards). In this paper, we introduce a new system, namely DoWitcher, which in contrast to previous approaches is scalable as well as able to detect the stealthiest worms that employ low-propagation rates or polymorphisms to evade detection. DoWitcher uses an incremental approach toward worm detection: First, it examines the layer-4 traffic features to discern the presence of a worm anomaly; Next, it determines a flow-filter mask that can be applied to isolate the suspect worm flows and; Finally, it enables full-packet capture of only those flows that match the mask, which are then processed by a longest common subsequence algorithm to extract the worm content signature. Via a proof-of-concept implementation on a commercially available network analyzer processing raw packets from an OC-48 link, we demonstrate the capability of DoWitcher to detect low-rate worms and extract signatures for even the polymorphic worm
- âŠ