Predators: Good will mobile codes combat against computer viruses

Hiroshi Toyoizumi, Atsuhi Kara

Research output: Chapter in Book/Report/Conference proceedingConference contribution

34 Citations (Scopus)

Abstract

We present a mathematical analysis of a new approach to fight against computer viruses through the use of their predators. Predators are good will mobile codes which, like viruses, travel over computer networks, and replicate and multipy themselves. The only difference is that predators are specifically designed to eliminate the viruses. We model the interaction between predators and viruses by the Lotka-Volterra equations, which are widely used in mathematical biology. Using this model, we derive a method to constrain the number of predators to be as few as possible, while maintaining their power to eliminate viruses.

Original languageEnglish
Title of host publicationProceedings New Security Paradigms Workshop
EditorsC.F. Hempelmann, V. Raskin
Pages11-17
Number of pages7
Publication statusPublished - 2002
Externally publishedYes
EventProceedings New Security Paradigms Workshop 2002 - Virginia Beach, VA
Duration: 2002 Sep 232002 Sep 26

Other

OtherProceedings New Security Paradigms Workshop 2002
CityVirginia Beach, VA
Period02/9/2302/9/26

Fingerprint

Computer viruses
Computer networks

Keywords

  • Computer virus
  • Lotka-Volterra equation
  • Mathematical biology
  • Worms

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Toyoizumi, H., & Kara, A. (2002). Predators: Good will mobile codes combat against computer viruses. In C. F. Hempelmann, & V. Raskin (Eds.), Proceedings New Security Paradigms Workshop (pp. 11-17)

Predators : Good will mobile codes combat against computer viruses. / Toyoizumi, Hiroshi; Kara, Atsuhi.

Proceedings New Security Paradigms Workshop. ed. / C.F. Hempelmann; V. Raskin. 2002. p. 11-17.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Toyoizumi, H & Kara, A 2002, Predators: Good will mobile codes combat against computer viruses. in CF Hempelmann & V Raskin (eds), Proceedings New Security Paradigms Workshop. pp. 11-17, Proceedings New Security Paradigms Workshop 2002, Virginia Beach, VA, 02/9/23.
Toyoizumi H, Kara A. Predators: Good will mobile codes combat against computer viruses. In Hempelmann CF, Raskin V, editors, Proceedings New Security Paradigms Workshop. 2002. p. 11-17
Toyoizumi, Hiroshi ; Kara, Atsuhi. / Predators : Good will mobile codes combat against computer viruses. Proceedings New Security Paradigms Workshop. editor / C.F. Hempelmann ; V. Raskin. 2002. pp. 11-17
@inproceedings{bb19fb681b534cb4b22808190747b547,
title = "Predators: Good will mobile codes combat against computer viruses",
abstract = "We present a mathematical analysis of a new approach to fight against computer viruses through the use of their predators. Predators are good will mobile codes which, like viruses, travel over computer networks, and replicate and multipy themselves. The only difference is that predators are specifically designed to eliminate the viruses. We model the interaction between predators and viruses by the Lotka-Volterra equations, which are widely used in mathematical biology. Using this model, we derive a method to constrain the number of predators to be as few as possible, while maintaining their power to eliminate viruses.",
keywords = "Computer virus, Lotka-Volterra equation, Mathematical biology, Worms",
author = "Hiroshi Toyoizumi and Atsuhi Kara",
year = "2002",
language = "English",
pages = "11--17",
editor = "C.F. Hempelmann and V. Raskin",
booktitle = "Proceedings New Security Paradigms Workshop",

}

TY - GEN

T1 - Predators

T2 - Good will mobile codes combat against computer viruses

AU - Toyoizumi, Hiroshi

AU - Kara, Atsuhi

PY - 2002

Y1 - 2002

N2 - We present a mathematical analysis of a new approach to fight against computer viruses through the use of their predators. Predators are good will mobile codes which, like viruses, travel over computer networks, and replicate and multipy themselves. The only difference is that predators are specifically designed to eliminate the viruses. We model the interaction between predators and viruses by the Lotka-Volterra equations, which are widely used in mathematical biology. Using this model, we derive a method to constrain the number of predators to be as few as possible, while maintaining their power to eliminate viruses.

AB - We present a mathematical analysis of a new approach to fight against computer viruses through the use of their predators. Predators are good will mobile codes which, like viruses, travel over computer networks, and replicate and multipy themselves. The only difference is that predators are specifically designed to eliminate the viruses. We model the interaction between predators and viruses by the Lotka-Volterra equations, which are widely used in mathematical biology. Using this model, we derive a method to constrain the number of predators to be as few as possible, while maintaining their power to eliminate viruses.

KW - Computer virus

KW - Lotka-Volterra equation

KW - Mathematical biology

KW - Worms

UR - http://www.scopus.com/inward/record.url?scp=0242456135&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0242456135&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0242456135

SP - 11

EP - 17

BT - Proceedings New Security Paradigms Workshop

A2 - Hempelmann, C.F.

A2 - Raskin, V.

ER -