Automated signature generation approach for polymorphic worm based on color coding

6Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A fast and accurate generation of worm signatures is essential in efficiently defending worm propagation. Most of the recent signature generation approaches do not generate accurate signatures for polymorphic worms in environments with noise. In this paper, a CCSF (color coding signature finding) algorithm is presented to solve the problem of a polymorphic worm signature generation with noise by using color coding. In the CCSF algorithm, n sequences are divided into m group, and signatures for every group sequence are generated by color coding. After filtering all signatures, an accurate worm signature is generated. CCSF's range of polymorphic worms is evaluated. When comparing CCSF with other existing approaches, CCSF shows a distinct advantages in generating accurate signatures for polymorphic worms in the presence of noise. Signatures generated do not contain fragments and can be used conveniently to detect polymorphic worms in IDS (intrusion detection system). © by Institute of Software, the Chinese Academy of Sciences.

Cite

CITATION STYLE

APA

Wang, J., Wang, J. X., & Chen, J. E. (2010). Automated signature generation approach for polymorphic worm based on color coding. Ruan Jian Xue Bao/Journal of Software, 21(10), 2599–2609. https://doi.org/10.3724/SP.J.1001.2010.03653

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free