Mining Regular Expression Rules based on q-grams

• 발행기관: 한국스마트미디어학회
• 저자명: Inbok Lee(이인복)
• 간행물 정보: 『스마트미디어저널』Vol8, No.3, 17~22쪽, 전체 6쪽
• 주제분류: 공학 > 컴퓨터학
• 파일형태: PDF
• 발행일자: 2019.09.30

영문 초록

Signature-based intrusion systems use intrusion detection rules for detecting intrusion. However, writing intrusion detection rules is difficult and requires considerable knowledge of various fields. Attackers may modify previous attempts to escape intrusion detection rules. In this paper, we deal with the problem of detecting modified attacks based on previous intrusion detection rules. We show a simple method of reporting approximate occurrences of at least one of the network intrusion detection rules, based on q-grams and the longest increasing subsequences. Experimental results showed that our approach could detect modified attacks, modeled with edit operations.

목차

Ⅰ. INTRODUCTION

Ⅱ. RELATED WORK

Ⅲ. PROPOSED METHOD

Ⅳ. EXPERIMENTAL RESULTS

Ⅴ. CONCLUSION

키워드

regular expression q-gram longest increasing subsequences intrusion detection system