6.2. Example—an Optimal Dynamic Attack: Seek and Destroy

Assume that the goal of an attacker writing the code for a worm is to infect as many nodes as possible, in order to disrupt the functionality of the hosts as well as of the network. Consider the following stylized setting: The malware can use an infective node to find new susceptible nodes to spread to, while performing malicious activities, until either the battery of the host is completely drained or the presence of the malware is detected and removed from the host by the network administrator (the defender). Moreover, we assume that the malware can also kill an infective host and make it completely dysfunctional. This killing process can be performed by executing a specific code payload ...

Get Malware Diffusion Models for Modern Complex Networks now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.