Predators: good will mobile codes combat against computer viruses

Authors:
Hiroshi Toyoizumi;Atsuhi Kara
Affiliations:
Performance Evaluation Lab., U. of Aizu, Aizu-wakamatsu, Fukushima, Japan;CITEC, U. of Aizu, Aizu-wakamatsu, Fukushima, Japan
Venue:
Proceedings of the 2002 workshop on New security paradigms
Year:
2002

Citing 2
Cited 6

The IMP model of computer virus management

Computers and Security
Computers and epidemiology

IEEE Spectrum

A hybrid quarantine defense

Proceedings of the 2004 ACM workshop on Rapid malcode
Internet instability and disturbance: goal or menace?

NSPW '05 Proceedings of the 2005 workshop on New security paradigms
Automated peer-to-peer security-update propagation network

ICCOMP'07 Proceedings of the 11th WSEAS International Conference on Computers
"Good" worms and human rights

ACM SIGCAS Computers and Society
Robust reactions to potential day-zero worms through cooperation and validation

ISC'06 Proceedings of the 9th international conference on Information Security
Modeling and analysis of worm and killer-worm propagation using the divide-and-conquer strategy

ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

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.