Faster log analysis and integration of security incidents using knuth-bendix completion

  • Authors:
  • Ruo Ando;Shinsuke Miwa

  • Affiliations:
  • National Institute of Information and Communication Technology, Koganei, Tokyo, Japan;National Institute of Information and Communication Technology, Koganei, Tokyo, Japan

  • Venue:
  • ICONIP'11 Proceedings of the 18th international conference on Neural Information Processing - Volume Part II
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

With the rapid popularization of cloud computing, mobile devices and high speed Internet, recent security incidents have become more complicated which imposes a great burden on network administrators. In this paper we propose an integration and simplification method of log strings obtained by many kinds of computer devices: memory, socket and file. Besides, we apply reasoning strategy for term rewriting called as Knuth-Bendix completion algorithm for ensuring termination and confluent. Knuth Bendix completion includes some inference rules such as lrpo (the lexicographic recursive path ordering) and dynamic demodulation. As a result, we can achieve the reduction of generated clauses which result in faster integration of log strings. In experiment, we present the effectiveness of proposed method by showing the result of exploitation of vulnerability and malware's behavior log.