• Title/Summary/Keyword: Instrusion Detection

Search Result 4, Processing Time 0.017 seconds

A Genetic Algorithm-Based Intrusion Detection System

  • Lee, Han H.;Lee, Duk;Kim, Hee S.;Park, Jong U.
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2000.04a
    • /
    • pp.343-346
    • /
    • 2000
  • In this paper, a novel approach to intruder detection is introduced. The approach, based on the genetic algorithms, improved detection rate of the host systems which has traditionally relied on known intruder patterns and host addresses. Rather than making judgments on whether the access is instrusion or not, the systems can continuously monitor systems with categorized security level. With the categorization, when the intruder attempts repeatedly to access the systems, the security level is incrementally escalated. In the simulation of a simple intrusion, it was shown that the current approach improves robustness of the security systems by enhancing detection and flexibility. The evolutionary approach to intruder detection enhances adaptability of the system.

  • PDF

Design and Implementation of the Intrusion Detection Data Web-based Management System on Heterogeneous Environments (이기종간 침입탐지 정보에 대한 웹기반 관리 시스템 설계)

  • Kim, Eun-Soo;Kim, Seok-Hun;Song, Jung-Gil
    • Convergence Security Journal
    • /
    • v.5 no.2
    • /
    • pp.65-74
    • /
    • 2005
  • The hacking accident is increasing repidly according to development of latest computer network and the method becomes various. But, to correspond to hacking, it is lot of difficulties to cope gear and security element between product because most radiant mercuries apply technology between individual digenomic species and It is real condition that great setup, equipment, manpower disturbance are enlarged to apply this. Designed and embody Site-Based executive system that can integrate security element about IDS information between digenomic species to solve these problem and correspond efficiently from hacking.

  • PDF

The Design and Implementation of Network Intrusion Detection System Hardware on FPGA (FPGA 기반 네트워크 침입탐지 시스템 하드웨어 설계 및 구현)

  • Kim, Taek-Hun;Yun, Sang-Kyun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.4
    • /
    • pp.11-18
    • /
    • 2012
  • Deep packet inspection which perform pattern matching to search for malicious patterns in the packet is most computationally intensive task. Hardware-based pattern matching is required for real-time packet inspection in high-speed network. In this paper, we have designed and implemented network intrusion detection hardware as a Microblaze-based SoC using Virtex-6 FPGA, which capture the network input packet, perform hardware-based pattern matching for patterns in the Snort rule, and provide the matching result to the software. We verify the operation of the implemented system using traffic generator and real network traffic. The implemented hardware can be used in network intrusion detection system operated in wire-speed.

X-tree Diff: An Efficient Change Detection Algorithm for Tree-structured Data (X-tree Diff: 트리 기반 데이터를 위한 효율적인 변화 탐지 알고리즘)

  • Lee, Suk-Kyoon;Kim, Dong-Ah
    • The KIPS Transactions:PartC
    • /
    • v.10C no.6
    • /
    • pp.683-694
    • /
    • 2003
  • We present X-tree Diff, a change detection algorithm for tree-structured data. Our work is motivated by need to monitor massive volume of web documents and detect suspicious changes, called defacement attack on web sites. From this context, our algorithm should be very efficient in speed and use of memory space. X-tree Diff uses a special ordered labeled tree, X-tree, to represent XML/HTML documents. X-tree nodes have a special field, tMD, which stores a 128-bit hash value representing the structure and data of subtrees, so match identical subtrees form the old and new versions. During this process, X-tree Diff uses the Rule of Delaying Ambiguous Matchings, implying that it perform exact matching where a node in the old version has one-to one corrspondence with the corresponding node in the new, by delaying all the others. It drastically reduces the possibility of wrong matchings. X-tree Diff propagates such exact matchings upwards in Step 2, and obtain more matchings downwsards from roots in Step 3. In step 4, nodes to ve inserted or deleted are decided, We aldo show thst X-tree Diff runs on O(n), woere n is the number of noses in X-trees, in worst case as well as in average case, This result is even better than that of BULD Diff algorithm, which is O(n log(n)) in worst case, We experimented X-tree Diff on reat data, which are about 11,000 home pages from about 20 wev sites, instead of synthetic documets manipulated for experimented for ex[erimentation. Currently, X-treeDiff algorithm is being used in a commeercial hacking detection system, called the WIDS(Web-Document Intrusion Detection System), which is to find changes occured in registered websites, and report suspicious changes to users.