Abstract
Misuse-based Intrusion Detection Systems (IDS) have difficulties in detecting new attacks originating from the old ones, since they usually use exact search algorithms to detect attack patterns. To solve this problem, we can use approximate search. However, approximate search algorithms generate too many false positives. In this paper, we introduce constraints on the types of edit operations in the approximate search. Our algorithm applies an extension of the concept of Row-Wise Bit-Parallelism (RBP), which makes it highly efficient. The time complexity of the algorithm is at worst the same as that of the unconstrained approximate search algorithm based on the same RBP concept; otherwise, in most cases it is better than the unconstrained RBP. Experimental results show that our constrained approximate search algorithm produces a smaller number of false positives compared to the unconstrained RBP search algorithm, without reducing accuracy of search.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
