메뉴 건너뛰기




Volumn 28, Issue 8, 2009, Pages 827-842

Using a bioinformatics approach to generate accurate exploit-based signatures for polymorphic worms

Author keywords

Distance restriction; Exploit based signature generation; One byte invariant; Polymorphic worms; Sequence alignment; Simplified regular expression

Indexed keywords

FORMAL DEFINITION; MULTIPLE SEQUENCE ALIGNMENTS; NOISE ELIMINATION; NOISE-TOLERANT; NP-HARD; POLYMORPHIC WORMS; REAL-WORLD; REGULAR EXPRESSIONS; REMOVE NOISE; SEQUENCE ALIGNMENTS; SIGNATURE GENERATION; SUBSTRING;

EID: 71849087786     PISSN: 01674048     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cose.2009.06.003     Document Type: Article
Times cited : (37)

References (34)
  • 5
    • 85084163246 scopus 로고    scopus 로고
    • Autograph: Toward automated, distributed worm signature detection
    • Kim HA, Karp B. Autograph: toward automated, distributed worm signature detection. In: USENIX security symposium; 2004. pp. 271-86.
    • (2004) USENIX security symposium , pp. 271-286
    • Kim, H.A.1    Karp, B.2
  • 8
    • 0001116877 scopus 로고
    • Binary codes capable of correcting deletions, insertions, and reversals
    • Levenshtein V.I. Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady 10 8 (1966) 707-710
    • (1966) Soviet Physics Doklady , vol.10 , Issue.8 , pp. 707-710
    • Levenshtein, V.I.1
  • 11
    • 33745800070 scopus 로고    scopus 로고
    • Fast and automated generation of attack signatures: A basis for building self-protecting servers
    • Liang Z, Sekar R. Fast and automated generation of attack signatures: a basis for building self-protecting servers. In: The 12th ACM conference on Computer and communications security; 2005a. pp. 213-22.
    • (2005) The 12th ACM conference on Computer and communications security , pp. 213-222
    • Liang, Z.1    Sekar, R.2
  • 12
    • 33846294027 scopus 로고    scopus 로고
    • Automatic generation of buffer overflow attack signatures: An approach based on program behavior models
    • Liang Z, Sekar R. Automatic generation of buffer overflow attack signatures: an approach based on program behavior models. In: The 21st annual computer security applications conference; 2005b. pp. 215-24.
    • (2005) The 21st annual computer security applications conference , pp. 215-224
    • Liang, Z.1    Sekar, R.2
  • 14
    • 0014757386 scopus 로고
    • A general method applicable to the search for similarities in the amino acid sequence of two proteins
    • Needleman S.B., and Wunsch C.D. A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology 48 (1970) 443-453
    • (1970) Journal of Molecular Biology , vol.48 , pp. 443-453
    • Needleman, S.B.1    Wunsch, C.D.2
  • 15
    • 79953672829 scopus 로고    scopus 로고
    • Dynamic taint analysis for automatic detection, analysis, and signature generation of exploits on commodity software
    • Newsome J, Song D. Dynamic taint analysis for automatic detection, analysis, and signature generation of exploits on commodity software. In: The 12th annual network and distributed system security symposium; 2005.
    • (2005) The 12th annual network and distributed system security symposium
    • Newsome, J.1    Song, D.2
  • 18
    • 0036208872 scopus 로고    scopus 로고
    • Recent progress in multiple sequence alignment: a survey
    • Notredame C. Recent progress in multiple sequence alignment: a survey. Pharmacogenomics 3 (2002) 131-144
    • (2002) Pharmacogenomics , vol.3 , pp. 131-144
    • Notredame, C.1
  • 19
    • 0034623005 scopus 로고    scopus 로고
    • T-coffee: a novel method for fast and accurate multiple sequence alignment
    • Notredame C., Higgins D.G., and Heringa J. T-coffee: a novel method for fast and accurate multiple sequence alignment. Journal of Molecular Biology 302 1 (2000) 205-217
    • (2000) Journal of Molecular Biology , vol.302 , Issue.1 , pp. 205-217
    • Notredame, C.1    Higgins, D.G.2    Heringa, J.3
  • 21
    • 0023375195 scopus 로고
    • The neighbor-joining method: a new method for reconstructing phylogenetic trees
    • Saitou N., and Nei M. The neighbor-joining method: a new method for reconstructing phylogenetic trees. Molecular Biology and Evolution 4 4 (1987) 406-425
    • (1987) Molecular Biology and Evolution , vol.4 , Issue.4 , pp. 406-425
    • Saitou, N.1    Nei, M.2
  • 23
    • 85180409373 scopus 로고    scopus 로고
    • Dira: Automatic detection, identification and repair of control-hijacking attacks
    • Smirnov A, Chiueh, Tzi-cker. Dira: automatic detection, identification and repair of control-hijacking attacks. In: Proceedings of NDSS; 2005.
    • (2005) Proceedings of NDSS
    • Smirnov, A.1    Chiueh2    cker, T.3
  • 27
    • 71849093127 scopus 로고    scopus 로고
    • Team MD. Metasploit project; 2007.
    • Team MD. Metasploit project; 2007.
  • 28
    • 0027968068 scopus 로고
    • Clustal w: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice
    • Thompson J.D., Higgins D.G., and Gibson T.J. Clustal w: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucleic Acids Research 22 22 (1994) 4673-4680
    • (1994) Nucleic Acids Research , vol.22 , Issue.22 , pp. 4673-4680
    • Thompson, J.D.1    Higgins, D.G.2    Gibson, T.J.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.