# Patent

## Title
MDL compress system and method for signature inference and masquerade intrusion detection

## Abstract

An intrusion masquerade detection system and method that includes a grammar inference engine. A grammar-based Minimum Description Length (MDL) compression algorithm is used to determine a masquerade based on a distance from a threshold in a model of an estimated algorithmic minimum sufficient statistic.

## Background
This application is directed to an invention(s) that was made as a result of activities undertaken within the scope of a Joint Research Agreement made between Lockheed Martin Corporation and the General Electric Company.
Embodiments of the present invention relate generally to methods and systems for intrusion detection and, more specifically, to methods and systems for intrusion detection using minimum description length inferred grammars associated with data sets in an information system.
Malicious information system users seek to exploit the simplest means of gaining unauthorized access to an information system such as, for example, a network, while minimizing their risk of detection. Because hacking or gaining unauthorized access through system defenses is generally more detection-prone than acting in a legitimate manner, attackers often prefer to operate inside such barriers rather than breaking through them. For example, by masquerading as a legitimate user, an attacker can avoid having to forcefully penetrate the target system. Also, using another user's account can mislead system administrators, thereby providing an attacker a layer of protection against exposure.
Thus, detecting a masquerade is an important capability for defending an information system against intrusion. Detecting a masquerade may primarily depend on stochastic analysis in which the likelihood of any particular event being a masquerade is determined by comparing a users' current activity to a pre-established profile. Unfortunately, user activity can vary considerably, even during one session, and is likely to evolve over time. Evolution can be addressed by periodic recalibration. Variance over the short term, however, can be problematic for reliable detection. User activity metrics can have such wide distributions that legitimate and masquerade activity may have significant overlap. In such situations, there may be no threshold that will provide error-free masquerade detection; at best, a threshold can be set to minimize cost/risk to the protected system.
According to various embodiments, then, a grammar-inference algorithm can be used to model legitimate activity, with the resulting grammar then being used to detect masquerades. In particular, various embodiments can comprise a system and method that use and apply a minimum description length (MDL) compression algorithm to detect masquerades.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is an intrusion detection system according to various embodiments;
FIG. 2 illustrates a Kolmogorov structure function in accordance with various embodiments;
FIG. 3 illustrates costs associated with a compression method according to various embodiments as applied to an example set of input data associated with a user;
FIG. 4 is a flow chart of a masquerade detection method that uses MDL compression according to various embodiments;
FIG. 5 shows an exemplary output masquerade indication 500 according to at least one embodiment;
FIG. 6 is a chart illustrating a distribution of a compression metric according to conventional detection methods;
FIG. 7 is a chart illustrating a distribution of a compression metric according to at least one embodiment using the MDL compression algorithm; and
FIG. 8 is a flow chart of an intrusion masquerade detection method according to various embodiments.



DETAILED DESCRIPTION
Embodiments relate generally to an intrusion detection system and method. In particular, embodiments can provide an intrusion detection system and method for detecting masquerade intrusion attacks using a grammar inference engine configured to execute a grammar inference algorithm that uses Minimum Description Length principles from the theory of Kolmogorov Complexity and Algorithmic Information Theory to infer a grammar. In various embodiments, the grammar inference algorithm can find patterns and motifs useful for compressing unknown data sets. In at least one embodiment, a grammar-based Minimum Description Length (MDL) compression algorithm can be used to determine a masquerade attack.
Limiting factors for intrusion detection systems include the associated error rate, in particular the false alarm rate, the demand for computational resources, and the execution time required. Although a single undetected intrusion can cause significant cost, false alarms require constant manual screening, thus generating a continual drain on personnel resources. Also, the occurrence of many false alarms reduces manual screening effectiveness, further aggravating the problem. Thus, embodiments can include compression-based masquerade intrusion detection systems and methods having an acceptable false alarm rate and relatively low computational intensity to allow for execution in linear time, with respect to conventional approaches to intrusion detection. In particular, embodiments can comprise a grammar based compressor or compression algorithm that uses a grammar based coding technique that compresses through inferring an algorithmic minimum sufficient statistic in a stochastic gradient manner, and that applies grammars such that detection can be determined in linear time.
With respect to FIG. 1, there is shown an intrusion masquerade detection system 100 according to various embodiments. As shown in FIG. 1, the intrusion masquerade detection system 100 can comprise a grammar inference engine 101 configured for intrusion masquerade detection and including a pre-processor 151 coupled to a grammar applicator (pattern matcher) 152, a classifier 153 coupled to the grammar applicator 152, and to a grammar generator or compressor 154. According to various embodiments, the pre-processor 151 can be configured to receive input data 156, which can be an input data stream, and be configured to output filtered data to the grammar applicator 152. The grammar applicator 152 can be configured to apply grammars produced using a compression algorithm to the filtered or processed input data received from the pre-processor 151. The grammar generator 154 can be coupled to the classifier 153 and configured to generate grammars using the compression algorithm. In various embodiments, the grammar applicator 152 and grammar generator 154 can perform the same compression algorithm. Furthermore, in various embodiments, the grammar applicator 154 can calculate compression data by applying a grammar-based compression algorithm to a portion of the input data 156 associated with a particular user, as described herein.
In various embodiments, the classifier 153 can be coupled to the grammar applicator 152, the grammar generator 154, and to a post-processor 155. The classifier 153 can compare grammars generated or identified by the grammar applicator 152 and compare the calculated compression data with one or more pre-defined models of grammar-based compression data associated with the user. In particular, the classifier 153 can be configured to determine a likelihood of fit between each portion of the input data 156 and the models based on a threshold comparison provided by the grammar applicator 152. In this regard, the classifier 153 can receive threshold values from the grammar applicator 152 and decision criteria from the post-processor 155. Furthermore, the classifier 153 can send a grammar generation request to the grammar generator 154 and, optionally, can send dynamically generated grammars to the grammar applicator 152. In addition, the post-processor 155 may assign each of the sequential portions of the input data stream 156 to one of the models. The post-processor 155 can also be configured to output a recommendation as to whether the input data 156 has been classified as a masquerade intrusion or attack, thus detecting an attack on the network, or if normal behavior is determined, e.g., a healthy session. Further, the post-processor 155 can also output an indication of the assigned model. In various embodiments, the classifier 155 in evaluating a particular input data stream can also take into consideration relevant information from one or more other input data streams.
According to various embodiments, the grammar inference engine 101 can further include a grammar database 157 operatively coupled to the grammar applicator 152 and the grammar generator 154. The grammar database 157 can include compression models such as, for example, health signature models and fault signature models formed using compressed data sets from application of a compression algorithm. The health signature models can include models associated with known healthy or normal session activity or behavior, and the fault signature models can include models associated with known attacks, including masquerades, or other malicious or unauthorized activities. In various embodiments, the grammar applicator 152 can be configured to apply one or more of the compression models to the processed or filtered input data received from the pre-processor 151.
The grammar inference engine 101 can also include an input database 158 operatively coupled to the output of the pre-processor 151 and the input of the grammar applicator 152. In various embodiments, the input database 158 can store input data that is processed or filtered by the pre-processor 151. The grammar applicator 152 can then retrieve or obtain the filtered input data from the input database 158 independently of the data rate of the input data stream 156.
The pre-processor 151 can also be configured to apply a sliding window protocol to the input data/stream that segments or divides the input data stream into discrete or separate portions of sequential information. Input data streams of various lengths can be supported such as, for example, input data streams of at least 1 KB in length. In various embodiments, the pre-processor 151 can filter the input data stream 156 by removing from consideration input data known to not be useful for harboring or supporting network attacks such as, for example, but not limited to, timestamp data.
In various embodiments, the input data stream can be received from an information system. For example, the information system can be a communication network such as, for example, an intranet or the Internet. In such embodiments, the input data stream can comprise packetized digital information such as, for example, digital information provided in accordance with the Transport Control Protocol/Internet Protocol (TCP/IP), the HyperText Transport Protocol (HTTP), the Simple Mail Transport Protocol (SMTP), or the Uniform Datagram Protocol (UDP). However, the intrusion masquerade detection system 100 can be used for intrusion masquerade detection by intercepting or monitoring an information path between any two or more nodes of any communication system or, further, between any two or more nodes of a network or a distributed computing system, according to any protocol which could be used for masquerade activity. In such embodiments, the input data stream 156 can be a sequential data stream. The information path can be an information path that is inside a firewall, and therefore associated with one or more trusted users of the information system.
In various embodiments, the grammar inference engine 101 can use a compression algorithm for classification of input data. For example, according to various embodiments, the grammar applicator 152 and grammar generator 154 can be configured to perform a Minimum Description Length (MDL) Compression (MDLC) algorithm to generate grammars. As used herein, the term “grammars” refers to a set of rules and relationships that are associated with particular data sequences. Furthermore, the term “model” or “compression model” as used herein refers to a set of one or more grammars with a probability distribution being associated with each grammar. For example, the grammar applicator 152 can take the MDLC-identified grammars and apply them to an unclassified input stream, and then calculate the unknown data's distance from the known data classes, as represented by their models. The distance values can then be passed on to the classifier 153.
Accordingly, in various embodiments, the grammar inference engine 101 can be configured to execute a grammar inference algorithm that is based on Minimum Description Length (MDL) principles and the theory of Kolmogorov Complexity and Algorithmic Information Theory to infer a grammar, finding patterns and motifs that aid most in compressing unknown data sets. In particular, the grammar inference engine can use such an algorithm to infer grammars and then apply those grammars to identify masquerades or other difficult to detect intrusion attacks. In addition, in various embodiments, the grammar inference engine 101 can be configured to detect anomalous, hostile, or other attack events in linear time. Further information regarding MDL principles is provided in Grunwald, P. D., “The minimum description length principle,” 2007, Cambridge, Mass., MIT Press. 703, and Adriaans, P. and P. Vitanyi, “The Power and Perils of MDL,” in IAIT 2007, Nice, France, both of which are hereby incorporated by reference.
For example, in various embodiments, the grammar inference engine 101 can include a grammar based compressor or be configured to perform a compression algorithm that uses a grammar based coding technique that compresses through inferring an algorithmic minimum sufficient statistic in a stochastic gradient manner, referred to herein as MDL compression. An example of such an algorithm is described in Evans, S. C., Markham, T. S., Torres, A., Kourtidis, A. and Conklin, D., “An Improved Minimum Description Length Learning Algorithm for Nucleotide Sequence Analysis,” Proceedings of IEEE 40th Asilomar Conference on Signals, Systems and Computers, Pacific Grove, Calif., November 2006, which is hereby incorporated by reference.
According to various embodiments, the grammar inference engine 101 can provide grammar inference using the MDL compression algorithm in accordance with Minimum Description Length (MDL) principles that provide the capability for optimizing data analysis without over fitting. Further description of MDL principles is available from, for example, Benedetto, Caglioli and Loreto, “Language Trees and Zipping”, Physical Review Letters, 88, 2002, and Grünwald, et al., “Advances in Minimum Description Length: Theory and Applications,” MIT Press, 2005, which is hereby incorporated by reference. MDL is related to Kolmogorov Complexity, a measure of descriptive complexity contained in an object, which refers to the minimum length of a program such that a universal computer can generate a specific sequence. Further information regarding Kolmogorov Complexity can be found in, for example, Cover, T. M. and Thomas, J. A., “Elements of Information Theory,” Wiley, NY, 1991, and Li, M. and Vitányi, P., “An Introduction to Kolmogorov Complexity and Its Applications,” Springer, N.Y. 1997, which are hereby incorporated by reference. For example, Kolmogorov Complexity can be described as follows, where j represents a universal computer, p represents a program, and x represents a string:




  
    
      
        
          
            K
            φ
          
          ⁡
          
            (
            x
            )
          
        
        =
        
          {
          
            
              min
              
                
                  φ
                  ⁡
                  
                    (
                    p
                    )
                  
                
                =
                x
              
            
            ⁢
            
              l
              ⁡
              
                (
                p
                )
              
            
          
          }
        
      
    
    
      
        Eq
        .
        
          
        
        ⁢
        1
      
    
  




The conditional Kolmogorov Complexity K(y|x) of a stringy given string x as input can be described as:




  
    
      
        
          
            
              K
              φ
            
            ⁡
            
              (
              
                y
                |
                x
              
              )
            
          
          =
          
            {
            
              
                
                  
                    
                      min
                      
                        
                          φ
                          ⁡
                          
                            (
                            
                              p
                              ,
                              x
                            
                            )
                          
                        
                        =
                        y
                      
                    
                    ⁢
                    
                      l
                      ⁡
                      
                        (
                        p
                        )
                      
                    
                  
                
              
              
                
                  
                    ∞
                    ,
                    
                      
                        if
                        ⁢
                        
                          
                        
                        ⁢
                        there
                        ⁢
                        
                          
                        
                        ⁢
                        is
                        ⁢
                        
                          
                        
                        ⁢
                        no
                        ⁢
                        
                          
                        
                        ⁢
                        p
                        ⁢
                        
                          
                        
                        ⁢
                        such
                        ⁢
                        
                          
                        
                        ⁢
                        that
                        ⁢
                        
                          
                        
                        ⁢
                        
                          φ
                          ⁡
                          
                            (
                            
                              p
                              ,
                              x
                            
                            )
                          
                        
                      
                      =
                      y
                    
                  
                
              
            
            }
          
        
        ,
      
    
    
      
        Eq
        .
        
          
        
        ⁢
        2
      
    
  




where l(p) represents program length to and j is a particular universal computer. Thus, knowledge or input of a string x may reduce the complexity or program size necessary to produce a new stringy. An MDL decomposition of a binary string x considering finite set models is given by:




  
    
      
        
          
            
              K
              φ
            
            ⁡
            
              (
              x
              )
            
          
          ⁢
          
            =
            +
          
          ⁢
          
            {
            
              
                K
                ⁡
                
                  (
                  S
                  )
                
              
              +
              
                
                  log
                  2
                
                ⁢
                
                  
                  S
                  
                
              
            
            }
          
        
        ,
      
    
    
      
        Eq
        .
        
          
        
        ⁢
        3
      
    
  




where Kφ(x) is the Kolmogorov Complexity for string x on universal computer φ and S represents a finite set of which x is a typical or equally likely element. The minimum possible sum of descriptive cost for set S (the model cost encompassing all regularity in the string) and the log of the sets cardinality (the required cost to enumerate the equally likely set elements) can correspond to an MDL two part description for string x. By considering the model cost, as well as the data costs of a string, MDL theory can provide a formal methodology for introducing priors or assumptions into model inference. Furthermore, the size of the model (for example, the number of bits allocated to defining the members of set S) can be related to the Kolmogorov Structure Function, h (see Li, M. and Vitányi, P., “An Introduction to Kolmogorov Complexity and Its Applications,” Springer, N.Y. 1997), where h defines the smallest set, S, that can be described in at most k bits and contains a given string x of length n:




  
    
      
        
          
            ħ
            k
          
          ⁡
          
            (
            
              
                x
                n
              
              |
              n
            
            )
          
        
        =
        
          
            min
            
              
                
                  pi
                  ⁡
                  
                    (
                    p
                    )
                  
                
                <
                k
              
              ,
              
                
                  U
                  ⁡
                  
                    (
                    
                      p
                      ,
                      n
                    
                    )
                  
                
                =
                S
              
            
          
          ⁢
          
            {
            
              
                log
                2
              
              ⁢
              
                
                S
                
              
            
            }
          
        
      
    
    
      
        Eq
        .
        
          
        
        ⁢
        4
      
    
  




Further details regarding MDL decomposition can also be found in Gacs, P., Tromp, J. T., and Vitanyi, P. “Algorithmic Statistics”, IEEE Transactions on Information Theory, Vol 47, No. 6, September 2001, pp. 2443-2463, and Cover, T. M. and Thomas, J. A., “Elements of Information Theory,” Wiley, NY, 1991, which are hereby incorporated by reference.
The function of Eq. 4 above can be used to provide a minimum sufficient statistic for use with MDL. Further details are available, for example, in Cover, T. M. and Thomas, J. A., “Elements of Information Theory,” Wiley, NY, 1991. In particular, FIG. 2 illustrates a Kolmogorov structure function in accordance with various embodiments. Referring to FIG. 2, it is shown that the cardinality of the set containing string x of length n can start out as equal to n when k=0 bits are used to describe set S, for example, to restrict its size. As k increases, the cardinality of the set containing string x can be reduced until a critical value k* is reached which is referred to as the Kolmogorov Minimum Sufficient Statistic, or Algorithmic Minimum Sufficient Statistic. In various embodiments, increasing k beyond k* will continue to make possible a two-part code of size Kφ(x), eventually resulting in a description of a set containing the single element x. Thus, as model size (k) increases, the size of the smallest typical set (n) that includes string x decreases. The increase in the descriptive cost of the model or set, however, while reducing the cardinality of the set to which x belongs, does not decrease the overall descriptive cost.
While various algorithms have been proposed (see, for example, Evans, S. C., Saulnier. G. J. and Bush, S. F., “A New Universal Two Part Code for Estimation of String Kolmogorov Complexity and Algorithmic Minimum Sufficient Statistic,” DIMACS Workshop on Complexity and Inference, 2003. the MDL compression method according to various embodiments can provide deep recursion characteristics having advantageous speed and memory use characteristics. For example, without limitation, embodiments can gather phrase statistics in a single pass and perform subsequent selection of multiple codebook phrases with minimal computation. Further details regarding MDL compression are available in, for example, Evans, S. C., Kourtidis, A., Markham, T. S, Miller, J., Conklin, D. and Torres, A. “MicroRNA Target Detection and Analysis for Genes Related to Breast Cancer Using DLcompress,” EURASIP Journal on Bioinformatics and Systems Biology, Special Issue on Information Theoretic Methods for Bioinformatics, September 2007, which is hereby incorporated by reference. For example, according to various embodiments, the MDL compression method can automatically terminate when remaining grammar candidates no longer contribute (for example, the total cost in terms of bytes stops decreasing with each successive iteration), which provides the capability to identify strings of significant sequences for MDL while bounding the amount of computational resources required. This characteristic can be important for masquerade detection because different users may have very similar grammars, making them difficult to differentiate. In this regard, FIG. 3 illustrates a total cost 301 (and its component costs) in terms of bytes versus iterations of the MDL compression algorithm applied to an example set of input data associated with a user. Referring to FIG. 3, the example set of input data shown therein is taken from Schonlau, M., DuMouchel, W., Ju, W., Karr, A., Theus, M., Vardi, Y. (2001), “Computer Intrusion: Detecting Masquerades,” Statistical Science, 2001; 16(1):58-74, which is hereby incorporated by reference. As shown in FIG. 3, the total cost 301 can include a grammar cost 302 and a compression model cost 303. In various embodiments, the grammar cost 302 can be a cost in the size of the grammar expressions used to model the data set in bits, for example. Furthermore, the compression model cost 303 can be a cost of the size of the model comprising the compression model for a user data set in bits, for example.
Thus, as discussed above, the MDL compression method according to various embodiments can form an estimate of the algorithmic minimum sufficient statistic and use this estimate to calculate the similarity (or its inverse, distance) between two data populations. This ability naturally flows from the Kolmogorov Complexity of a Stringy given string x:




  
    
      
        
          
            K
            φ
          
          ⁡
          
            (
            
              y
              |
              x
            
            )
          
        
        =
        
          {
          
            
              
                
                  
                    min
                    
                      
                        φ
                        ⁡
                        
                          (
                          
                            p
                            ,
                            x
                          
                          )
                        
                      
                      =
                      y
                    
                  
                  ⁢
                  
                    l
                    ⁡
                    
                      (
                      p
                      )
                    
                  
                
              
            
            
              
                
                  ∞
                  ,
                  
                    
                      if
                      ⁢
                      
                        
                      
                      ⁢
                      there
                      ⁢
                      
                        
                      
                      ⁢
                      is
                      ⁢
                      
                        
                      
                      ⁢
                      no
                      ⁢
                      
                        
                      
                      ⁢
                      p
                      ⁢
                      
                        
                      
                      ⁢
                      such
                      ⁢
                      
                        
                      
                      ⁢
                      that
                      ⁢
                      
                        
                      
                      ⁢
                      
                        φ
                        ⁡
                        
                          (
                          
                            p
                            ,
                            x
                          
                          )
                        
                      
                    
                    =
                    y
                  
                
              
            
          
          }
        
      
    
    
      
        Eq
        .
        
          
        
        ⁢
        5
      
    
  




In particular, according to various embodiments, the MDL compression method can include a grammar inference process configured for detecting masquerades. For example, with respect to FIG. 4, there is shown a flow chart of a masquerade detection method 400 that uses MDL compression. As shown in FIG. 4, the masquerade detection method 400 can commence at S401 to receive user data. The user data can be monitored from a source of live user data such as a network, or the user data can be stored and retrieved using a memory device or database. In at least one embodiment, the user data can be segmented into strings for further processing. User data can also include training data for use in building grammar-based models for comparison to live data. If training or building of user grammars is to be performed, the method can proceed to S403. If training or building of user grammars is not to be performed, then the method 400 can proceed to S405 to begin testing of input data.
At S403, the method 400 can proceed to build user grammars by, for example, applying the MDL compression algorithm to the user data. One or more grammars can be built for each user. In various embodiments, the MDL compression process can summarize key characteristics of the data (for example, the “big ideas” of the data), which are used to form a model by placing the characteristics into a model (e.g., grammar) portion of a two-part code. The code can be interpreted as an estimate of the Kolmogorov Minimum Sufficient Statistic, an Algorithmic Statistic, as discussed above, which summarizes the user data. In various embodiments, the method 400 can build this estimate one phrase at a time in a steepest descent approach. Furthermore, the MDL compression algorithm can be applied to the user data until model costs increase and data costs decrease, as shown in FIG. 3, until no further reduction in total cost can be achieved, at which time the algorithm can terminate. According to various embodiments, this step S403 can be performed at discrete or dedicated training times. Furthermore, for training data input, building the user grammars at S403 can also include producing a set of MDL compression grammar rules based on the training data. For example, Table 1 below shows a set of MDL compression grammar rules produced from exemplary Schonlau training data.









TABLE 1






Grammar Rule
Frequency


















S1 →<>net scape
186



S2 → S1 S1/n
86



S4 →/ncat/nmail/nesh
7



S5 → S2 S1/n
12



S6 →/nlaunchef
20



S7 → S6/nsh
30



S8 → S6 S6 S7
18









As can be seen from Table 1, the MDL compression grammar rules can build on each other to produce long rules from smaller elements. The frequency entries in Table 1 can be useful in generating probability distributions for the grammars for use in a model.
In various embodiments, the step S403 is optional. That is, the method 400 can perform masquerade detection without training or using pre-built grammars.
Referring again to FIG. 4, at S405, the method 400 can proceed to conduct real-time processing to detect masquerades for real user data if test blocks exist. If no test blocks (for example, grammar-based models) exist, then the method can return to S401 to commence processing and build user grammars at S403. If test blocks exist, then the method can proceed to S407 to select a window of input data, which may include one or more target command blocks, for testing. In at least one embodiment, selection of the user data to be tested can be received from an operator via a human-machine interface.
The method can then proceed to S409 to test a target command block associated with the user data. According to various embodiments, testing a target command block at S409 can include, in a real time process, searching a string y of input data for MDL compression phrases from a user model x and substituting with Huffman code for the phrase; sorting the grammar so that longest phrases are applied first to an unclassified string y; and, attributing a cost for phrases that are not found in the model by quantifying the cost of explicitly representing the particular symbols. For example, given two target blocks, y and y′, the “fit” of both blocks with user x's model can be determined by using x's model to create non-dictionary segments for y and y′. Since the model is common to both y and y′, it can be ignored. The degree of target blocks match, then, is indicated by the length of the blocks non-dictionary segment relative to the length of the uncompressed block. In various embodiments, this can be measured using an inverse compression ratio (ICR):




  
    
      
        ICR
        =
        
          
            
            
              block_non
              -
              dictionary_segment
            
            
          
          
            
            orginal_block
            
          
        
      
    
    
      
        Eq
        .
        
          
        
        ⁢
        6
      
    
  




After computing the ICR, the compression ratio (or inverse compression ratio) for y is compared with preestablished upper and lower thresholds for user x. If the computed ICR falls within the upper and lower thresholds, a normal block of data is determined and the method can proceed to S411 to update the user grammar model with the newly-determined normal block, and to return to S405 for further processing. In various embodiments, step S411 is optional. If the computed ICR falls outside of either the upper or lower threshold, an abnormal block of data is determined and the method can proceed to S413 for masquerading mediation and for outputting of a masquerade indication at S415. In various embodiments, masquerading mediation can include taking or causing actions to negate or limit the damage or exposure associated with a masquerade such as, for example, disabling a communication port associated with a masquerading user. According to various embodiments, the output masquerade indication can be an alarm output provided to a user via a display, illumination of a Light Emitting Diode (LED), hardcopy printout, transmission of an alarm or alerting message to a communications device, computing device, or telecommunications terminal, or other audible or visual alarms.
According to various embodiments, the steps S405 through S415 can be repeated as required for continued masquerade detection. Furthermore, step S403 can be repeated to build additional user grammars.
For example, FIG. 5 shows an exemplary output masquerade indication 500 according to at least one embodiment. Referring to FIG. 5, the region 501 between the vertical dotted lines illustrates a masquerade. It is noted that in this example, the user's normal traffic 502 is seen to have a highly variable ICR. However, even with this degree of normal traffic variability, the masquerade region 501 is noticeably different by being clearly out-of-band with respect to the normal traffic 502, and thus the masquerade is easily detected. This is advantageous because ambiguous partitioning can cause classification errors. For example, with respect to FIG. 6, there is shown a distribution of a compression metric in accordance with a conventional method such as, for example, Schonlau's method. Referring to FIG. 6, it can be seen that the normal threshold distribution 601 and the masquerade threshold 602 can overlap in an overlap area 603 for such conventional methods. The overlap 603 can cause the same metric values to be mapped to more than one partition, resulting in ambiguity in the masquerade detection. In contrast, FIG. 7 shows a distribution of a compression metric according to at least one embodiment using the MDL compression algorithm. Referring to FIG. 7, it can be seen that the normal threshold distribution 701 and the masquerade threshold 702 have much reduced overlap in an overlap area 703 in comparison with the overlap 603 for conventional methods shown in FIG. 7, resulting in much reduced ambiguity in the masquerade detection. That is, the overlap 603 between legitimate and masquerade activity is much wider for the conventional method shown in FIG. 6, than for embodiments of the present invention as shown, for example, in FIG. 7. Furthermore, in various embodiments, the overlap 703 can be an artifact caused by the binning ranges selected or other quantization error and not due to the MDL compression algorithm or method.
In various embodiments, the intrusion masquerade detection method can include applying a receiver operating characteristic (ROC) analytical protocol to evaluate the masquerade detection results. The ROC may be well-suited for this purpose in that it is insensitive to data set variations, and so can facilitate comparisons in situations such as applying a conventional method, such as, for example, Schonlau's data set, where the ratio of malicious to normal activity varies considerably, and the MDL compression algorithm described herein.
According to various embodiments, organization of the MDL compression grammar for application to foreign strings (for example, strings other than the superset from which the training data was extracted) can affect masquerade detection results. Tables 2 and 3 below list three example grammar generation algorithms and two example grammar organizations which can be used in various embodiments.







TABLE 2





Grammar Phrase Detection Algorithms.
















Total cost (TC)
Each phrase is selected for its



maximum compression of the



target string.


Symbol compression ratio (SCR)
Each phrase is selected for it



maximum reduction of the data



portion of the compressed string


Maximum length (LM)
Phrases are selected based on



their length, regardless of relative



impact on string compression.
















TABLE 3





Grammar Organization Algorithms.
















Discovery order
Grammars are applied in the order



discovered.


Decreasing order of phrase length
Grammars are organized such that


(ML)
the longest phrases are applied



first. Ties remain in discovery



order.









Once a compression model has been built as described above with respect to FIG. 4, the intrusion masquerade detection method according to various embodiments can be consequently re-applied to input data sets in linear time with a small constant, which is advantageous compared to conventional compression methods that are compute-intensive and thus require a relatively long time to apply. Therefore, embodiments can perform intrusion masquerade detection in real-time.
It will be appreciated that the modules, processes, systems, and sections described above can be implemented in hardware, software, or both. For example, the grammar inference engine 101 can be implemented, for example, using a processor configured to execute a sequence of programmed instructions. The processor can be for example, but not limited to, a personal computer or workstation or other such computing system that includes a processor, microprocessor, microcontroller device, or is comprised of control logic including integrated circuits such as, for example, an Application Specific Integrated Circuit (ASIC). The instructions can be compiled from source code instructions provided in accordance with a programming language such as C++. The instructions can also comprise code and data objects provided in accordance with, for example, the Visual BasicTM language, or another object-oriented programming language. The sequence of programmed instructions and data associated therewith can be stored in a computer-readable medium such as a computer memory or storage device which may be any suitable memory apparatus, such as, but not limited to ROM, PROM, EEPROM, RAM, flash memory, disk drive and the like.
Furthermore, the modules, processes systems, and sections can be implemented as a single processor or as a distributed processor. Further, it should be appreciated that the steps mentioned above may be performed on a single or distributed processor. Also, the processes, modules, and sub-modules described in the various figures of and for the embodiments above may be distributed across multiple computers or systems or may be co-located in a single processor or system. Exemplary structural embodiment alternatives suitable for implementing the modules, sections, systems, means, or processes described herein are provided below.
The modules, processors or systems described above can be implemented as a programmed general purpose computer, an electronic device programmed with microcode, a hard-wired analog logic circuit, software stored on a computer-readable medium or signal, an optical computing device, a networked system of electronic and/or optical devices, a special purpose computing device, an integrated circuit device, a semiconductor chip, and a software module or object stored on a computer-readable medium or signal, for example.
Embodiments of the method and system (or their sub-components or modules), may be implemented on a general-purpose computer, a special-purpose computer, a programmed microprocessor or microcontroller and peripheral integrated circuit element, an ASIC or other integrated circuit, a digital signal processor, a hardwired electronic or logic circuit such as a discrete element circuit, a programmed logic circuit such as a PLD, PLA, FPGA, PAL, or the like. In general, any process capable of implementing the functions or steps described herein can be used to implement embodiments of the method, system, or a computer program product (software program).
Furthermore, embodiments of the disclosed method, system, and computer program product may be readily implemented, fully or partially, in software using, for example, object or object-oriented software development environments that provide portable source code that can be used on a variety of computer platforms. Alternatively, embodiments of the disclosed method, system, and computer program product can be implemented partially or fully in hardware using, for example, standard logic circuits or a VLSI design. Other hardware or software can be used to implement embodiments depending on the speed and/or efficiency requirements of the systems, the particular function, and/or particular software or hardware system, microprocessor, or microcomputer being utilized. Embodiments of the method, system, and computer program product can be implemented in hardware and/or software using any known or later developed systems or structures, devices and/or software by those of ordinary skill in the applicable art from the function description provided herein and with a general basic knowledge of the mechanical and/or computer programming arts.
Moreover, embodiments of the disclosed method, system, and computer program product can be implemented in software executed on a programmed general purpose computer, a special purpose computer, a microprocessor, or the like.
In various embodiments, the grammar database 157 and the input database 158 can be implemented using any commercial database or database management system such as, for example, Oracle Database 11g available from Oracle Corporation of Redwood Shores, Calif.
With regard to FIG. 8, there is shown an intrusion masquerade detection method 800 according to various embodiments. Referring to FIG. 8, an intrusion masquerade detection method 800 can commence at S801. If training or building of user grammars is to be performed, control can proceed to S803. If training or building of user grammars is not to be performed, then the method 800 can proceed to S809 to begin performing masquerade detection. At S803, the method 800 can include applying a compression algorithm to user data to build user grammars. The compression algorithm can be, for example, the MDL compression algorithm as described herein. The method can then proceed to S805 to form at least one model using characteristics of the user grammars. The characteristics can include an estimated algorithmic minimum sufficient statistic. The method can then proceed to S807 at which the model can be stored using a database. The method can then proceed to S809 to calculate the estimated algorithmic minimum sufficient statistic by applying the compression algorithm to at least one target block. The method can then proceed to S811 to determine a distance between the at least one target block and the model. The method can then proceed to S813 to determine an intrusion masquerade based on the distance. The method can then proceed to S815 output an indication of an intrusion masquerade, following which the method can end at S817.
According to various embodiments, the steps S809 through S815 can be repeated as required for continued masquerade detection. Furthermore, steps S803 through S807 can be repeated to build additional user grammars. However, in various embodiments, the step steps S803 through S807 can be optional. That is, the method 800 can perform masquerade detection without training or using pre-built grammars.
It is, therefore, apparent that there is provided, in accordance with the various embodiments disclosed herein, an intrusion masquerade detection system and method that includes a grammar inference engine. A grammar-based Minimum Description Length (MDL) compression algorithm is used to determine a masquerade based on a comparison of compression results to one or more thresholds.
While the invention has been described in conjunction with a number of embodiments, it is evident that many alternatives, modifications and variations would be or are apparent to those of ordinary skill in the applicable arts. Accordingly, Applicants intend to embrace all such alternatives, modifications, equivalents and variations that are within the spirit and scope of the appended claims.

## Claims

1. An intrusion masquerade detection method, comprising:
applying a compression algorithm to one or more sets of user input content data to build a set of user grammars;
forming at least one model for the set of user grammars using characteristics of the set of user grammars, the characteristics including a first estimated algorithmic minimum sufficient statistic for the set of user grammars;
storing the at least one model for the set of user grammars in a database;
calculating a second estimated algorithmic minimum sufficient statistic for at least one target block of other input content data by applying the compression algorithm to the at least one target block of the other input content data;
determining a distance between the at least one target block of the other input content data and the at least model for the set of user grammars by comparing the first estimated algorithmic minimum sufficient statistic and the second estimated algorithmic minimum sufficient statistic;
determining an intrusion masquerade based on the determined distance; and
outputting an indication of the determined intrusion masquerade.

2. The intrusion masquerade detection method of claim 1, the at least one model for the set of user grammars comprising a healthy session model and a masquerade model.

3. The intrusion masquerade detection method of claim 1, the determining an intrusion masquerade including:
calculating an inverse compression ratio over a time period for the at least one target block of the other input content data;
comparing the calculated inverse compression ratio for the at least one target block of the other input content data to at least one inverse compression ratio associated with a compressed data set of the at least one model for the set of user grammars; and
determining an intrusion masquerade event based on a difference between the calculated inverse compression ratio for the at least one target block of the other input content data and the at least one inverse compression ratio associated with the compressed data set of the at least one model for the set of user grammars exceeding a threshold.

4. The intrusion masquerade detection method of claim 1, the compression algorithm being an algorithm that estimates Kolmogorov complexity.

5. The intrusion masquerade detection method of claim 4, the compression algorithm being a grammar-based compression algorithm that forms compressive grammar based on Minimum Description Length (MDL) principles.

6. The intrusion masquerade detection method of claim 1, the compression algorithm being applied to the at least one target block of the other input content data in linear time.

7. The intrusion masquerade detection method of claim 1, a separate set of user grammars being associated with each individual user.

8. The intrusion masquerade detection method of claim 1, the calculating the second estimated algorithmic minimum sufficient statistic for the at least one target block of other input content data, the determining the distance between the at least one target block of the other input content data and the at least one model for the set of user grammars, the determining the intrusion masquerade based on the distance, and the outputting the indication of the determined intrusion masquerade, being performed in real-time.

9. The intrusion masquerade detection method of claim 1, the calculating the second estimated algorithmic minimum sufficient statistic by applying the compression algorithm to at least one target block of the other input content data, further comprising:
searching, in real-time, a string of the other input content data for MDL compression phrases from the at least one model for the set of user grammars;
substituting with Huffman code for found phrases;
sorting the set of user grammars so that longest phrases are applied first to an unclassified string of the other input content data and
attributing a cost for phrases that are not found in the at least one model for the set of user grammars by quantifying a cost of explicitly representing symbols associated with the phrases.

10. A machine-implemented grammar inference engine for intrusion masquerade detection, comprising:
a pre-processing device that receives one or more sets of user input content data and outputs filtered data;
a grammar generating device that is coupled to the pre-processing device and that is configured (1) to generate a set of user grammars by applying a compression algorithm to the filtered data and (2) to form at least one model for the set of user grammars using characteristics of the set of user grammars the characteristics including a first estimated algorithmic minimum sufficient statistic for the set of user grammars; and
a grammar applying device that is coupled to a classifier that compares the first algorithmic minimum sufficient statistic for the set of user grammars generated by the grammar generating device to a second estimated algorithmic sufficient statistic for at least one target block of other input content data, calculated using the compression algorithm, and that determines a distance between the at least one target block of the other input content data and the at least model for the set of user grammars,
the classifier being coupled to the grammar applying device and to a post-processor, the classifier receiving (1) distance values representing determined distances from the grammar applying device and (2) decision criteria from the post-processor, the classifier being configured to calculate a likelihood of fit between the at least one target block of the other input content data and the at least one model for the set of user grammars based on the comparison provided by the grammar applying device as an indication of an intrusion masquerade.

11. The machine-implemented grammar inference engine of claim 10, further comprising a grammar database coupled to the grammar applying device and to the grammar generating device that stores the at least one model for the set of user grammars.

12. The machine-implemented grammar inference engine of claim 10, the compression algorithm being an algorithm that estimates Kolmogorov complexity.

13. The machine-implemented grammar inference engine of claim 12, the compression algorithm being a grammar-based compression algorithm which forms compressive grammar based on MDL principles.

14. The machine-implemented grammar inference engine of claim 10, the pre-processing device applying a sliding window protocol to segment portions of the one or more sets of input content data.

15. The machine-implemented grammar inference engine of claim 10, the grammar applying device and the grammar generating device executing the compression algorithm in linear time.

16. A non-transitory computer-readable medium upon which is embodied a sequence of programmable instructions which, when executed by a processor, cause the processor to perform an intrusion masquerade detection method comprising:
applying a compression algorithm to one or more sets of user input content data to build a set of user grammars;
forming at least one model for the set of user grammars using characteristics of the set of user grammars, the characteristics including a first estimated algorithmic minimum sufficient statistic for the set of user grammars;
storing the at least one model for the set of user grammars in a database;
calculating a second estimated algorithmic minimum sufficient statistic for at least one target block of other input content data by applying the compression algorithm to the at least one target block of the other input content data;
determining a distance between the at least one target block of the other input content data and the at least model for the set of user grammars by comparing the first estimated algorithmic minimum sufficient statistic and the second estimated algorithmic minimum sufficient statistic;
determining an intrusion masquerade based on the determined distance; and
outputting an indication of the determined intrusion masquerade.

17. The non-transitory computer-readable medium of claim 16, the calculating the second estimated algorithmic minimum sufficient statistic for the at least one target block of the other input content data, the determining the distance between the at least one target block of the other input content data and the at least one model for the set of user grammars, the determining the intrusion masquerade based on the distance, and the outputting the indication of the intrusion masquerade, are performed in real-time.

18. The non-transitory computer-readable medium of claim 16, the calculating the second estimated algorithmic minimum sufficient statistic by applying the compression algorithm to at least one target block of the other input content data, further comprising:
searching, in real-time, a string of the other input content data for MDL compression phrases from the at least one model for the set of user grammars;
substituting with Huffman code for found phrases;
sorting the set of user grammars so that longest phrases are applied first to an unclassified string of the other input content data and
attributing a cost for phrases that are not found in the at least one model for the set of user grammars by quantifying a cost of explicitly representing symbols associated with the phrases.