Detecting network anomalies by probabilistic modeling of argument strings with markov chains

• US 9,253,201 B2
• Filed: 09/03/2014
• Issued: 02/02/2016
• Est. Priority Date: 05/27/2008
• Status: Active Grant

• Current Assignee: Trustees Of Columbia University In The City Of New York (Columbia University)
• Original Assignee: Trustees Of Columbia University In The City Of New York (Columbia University)
• Inventors: Song, Yingbo, Keromytis, Angelos D., Stolfo, Salvatore J.
• Primary Examiner(s): Patel, Haresh N
• Application Number:
  US14/476,142
• Publication Number:
  US 20140373150A1
• Time in Patent Office: 517 Days
• Field of Search: 726 23- 25, 713150-180, 713/187, 713/188
• US Class Current: 1/1
• CPC Class Codes: H04L 63/1416 Event detection, e.g. attack signature detection
• CPC Class Codes: H04L 63/1425 Traffic logging, e.g. anomaly detection
• CPC Class Codes: H04L 63/1466 Active attacks involving interception, injection, modification, spoofing of data unit addresses, e.g. hijacking, packet injection or TCP sequence number attacks
• CPC Class Codes: H04L 67/02 based on web technology, e.g. hypertext transfer protocol [HTTP]
• CPC Class Codes: H04L 69/16 Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]

Abstract

Systems, methods, and media for detecting network anomalies are provided. In some embodiments, a training dataset of communication protocol messages having argument strings is received. The content and structure associated with each of the argument strings is determined and a probabilistic model is trained using the determined content and structure of each of the argument strings. A communication protocol message having an argument string that is transmitted from a first processor to a second processor across a computer network is received. The received communication protocol message is compared to the probabilistic model and then it is determined whether the communication protocol message is anomalous.

Claims

1. A method for detecting network anomalies, the method comprising:

receiving, by a hardware processor, a communication protocol message having an argument string that is transmitted from a first processor to a second processor across a computer network;

applying a probabilistic model to the received communication protocol message to determine whether the communication protocol message is anomalous based on determining that at least one n-gram in the communication protocol message is anomalous,

wherein the probabilistic model uses at least one Markov chain specified by one or more parameters to determine a probability that the argument string is anomalous based on n-grams in the argument string, and

wherein the probabilistic model was trained based on content and structure of an argument string included in each of a plurality of communication protocol messages included in a training dataset; and

performing a predetermined action in response to determining that the communication protocol message is anomalous.

2. The method of claim 1, wherein the one or more parameters includes gram size, and wherein the probabilistic model was trained based on the gram size.

3. The method of claim 1, further comprising:

receiving a plurality of packets transmitted from the first processor to the second processor across the computer network;

assembling the plurality of packets to form the communication protocol message; and

extracting the argument string from the communication protocol message.

4. The method of claim 3, wherein assembling the plurality of packets to form the communication protocol message is performed by a third processor prior to the plurality of packets being received by the second processor.

5. The method of claim 4, wherein the assembled communication protocol message is substantially similar to a request directed to an application running on the second processor.

6. The method of claim 1, wherein the communication protocol message is a Hypertext Transfer Protocol (HTTP) request message.

7. The method of claim 1, wherein the content and the structure associated with each of the argument strings further comprises one or more variable names, a corresponding argument value for each of the variable names, and a layout with respect to each of the variable names.

8. The method of claim 1, wherein the at least one Markov chain comprises one or more Markov models of transition probabilities in n-grams of the communication protocol message.

9. The method of claim 1, wherein the predetermined action comprises issuing an alert.

10. The method of claim 1, wherein applying the probabilistic model further comprises calculating a normality score for the received communication protocol message using the probabilistic model.

11. A system for detecting network anomalies, the system comprising:

a processor that is configured to;

receive a communication protocol message having an argument string that is transmitted from a first processor to a second processor across a computer network;

apply a probabilistic model to the received communication protocol message to determine whether the communication protocol message is anomalous based on determining that at least one n-gram in the communication protocol message is anomalous,

wherein the probabilistic model uses at least one Markov chain specified by one or more parameters to determine a probability that the argument string is anomalous based on n-grams in the argument string, and

wherein the probabilistic model was trained based on content and structure of an argument string included in each of a plurality of communication protocol messages included in a training dataset; and

perform a predetermined action in response to determining that the communication protocol message is anomalous.

12. The system of claim 11, wherein the one or more parameters includes gram size, and wherein the probabilistic model was trained based on the gram size.

13. The system of claim 11, wherein the processor is further configured to:

receive a plurality of packets transmitted from the first processor to the second processor across the computer network;

assemble the plurality of packets to form the communication protocol message; and

extract the argument string from the communication protocol message.

14. The system of claim 13, wherein assembling the plurality of packets to form the communication protocol message is performed by the processor prior to the plurality of packets being received by the second processor.

15. The system of claim 14, wherein the assembled communication protocol message is substantially similar to a request directed to an application running on the second processor.

16. The system of claim 11, wherein the communication protocol message is a Hypertext Transfer Protocol (HTTP) request message.

17. The system of claim 11, wherein the content and the structure associated with each of the argument strings further comprises one or more variable names, a corresponding argument value for each of the variable names, and a layout with respect to each of the variable names.

18. The system of claim 11, wherein the at least one Markov chain comprises one or more Markov models of transition probabilities in n-grams of the communication protocol message.

19. The system of claim 11, wherein the predetermined action comprises issuing an alert.

20. The system of claim 11, wherein applying the probabilistic model further comprises calculating a normality score for the received communication protocol message using the probabilistic model.

21. A non-transitory computer-readable medium containing computer-executable instructions that, when executed by a processor, cause the processor to perform method for detecting network anomalies, the method comprising:

receiving a communication protocol message having an argument string that is transmitted from a first processor to a second processor across a computer network;

applying a probabilistic model to the received communication protocol message to determine whether the communication protocol message is anomalous based on determining that at least one n-gram in the communication protocol message is anomalous,

wherein the probabilistic model uses at least one Markov chain specified by one or more parameters to determine a probability that the argument string is anomalous based on n-grams in the argument string, and

wherein the probabilistic model was trained based on content and structure of an argument string included in each of a plurality of communication protocol messages included in a training dataset; and

performing a predetermined action in response to determining that the communication protocol message is anomalous.

22. The non-transitory computer-readable medium of claim 21, wherein the one or more parameters includes gram size, and wherein the probabilistic model was trained based on the gram size.

23. The non-transitory computer-readable medium of claim 21, wherein the method further comprises:

receiving a plurality of packets transmitted from the first processor to the second processor across the computer network;

assembling the plurality of packets to form the communication protocol message; and

extracting the argument string from the communication protocol message.

24. The non-transitory computer-readable medium of claim 23, wherein assembling the plurality of packets to form the communication protocol message is performed by a third processor prior to the plurality of packets being received by the second processor.

25. The non-transitory computer-readable medium of claim 24, wherein the assembled communication protocol message is substantially similar to a request directed to an application running on the second processor.

26. The non-transitory computer-readable medium of claim 21, wherein the communication protocol message is a Hypertext Transfer Protocol (HTTP) request message.

27. The non-transitory computer-readable medium of claim 21, wherein the content and the structure associated with each of the argument strings further comprises one or more variable names, a corresponding argument value for each of the variable names, and a layout with respect to each of the variable names.

28. The non-transitory computer-readable medium of claim 21, wherein the at least one Markov chain comprises one or more Markov models of transition probabilities in n-grams of the communication protocol message.

29. The non-transitory computer-readable medium of claim 21, wherein the predetermined action comprises issuing an alert.

30. The non-transitory computer-readable medium of claim 21, wherein applying the probabilistic model further comprises calculating a normality score for the received communication protocol message using the probabilistic model.