Non-harmful insertion of data mimicking computer network attacks

Abstract

Non-harmful data mimicking computer network attacks may be inserted in a computer network. Anomalous real network connections may be generated between a plurality of computing systems in the network. Data mimicking an attack may also be generated. The generated data may be transmitted between the plurality of computing systems using the real network connections and measured to determine whether an attack is detected.

Claims

1. A computer-implemented method, comprising: determining based on historical data, by a computing system, which anomalous real network connections to generate between a plurality of computing systems in a network to create the anomalous real network connections based on stochastic models, the anomalous real network connections forming a k-path between the plurality of computing systems comprising a plurality of directed edges, each directed edge comprising associated data; generating, by the plurality of computing systems, the determined anomalous real network connections between the plurality of computing systems in the network and data mimicking an attack; and transmitting, by the plurality of computing systems, the generated data mimicking the attack between the plurality of computing systems using the determined anomalous real network connections forming respective k-paths, wherein the k-path is a subgraph of size k that has diameter k, and k is at least two.

2. The computer-implemented method of claim 1, wherein the generated data comprises Domain Name Server (DNS) traffic that is transmitted in a path comprising computing systems that have never communicated before.

3. The computer-implemented method of claim 1, wherein the data mimicking the attack is designed to mimic one or more specific types of attacks based on known types of real attacks.

4. The computer-implemented method of claim 1, further comprising: building stochastic models, by the computing system, for each directed edge in k-paths of a plurality of the anomalous network connections; and comparing historical parameters with current parameters in a time window, by the computing system, to determine a level of anomalousness of the k-paths of the plurality of the anomalous network connections.

5. The computer-implemented method of claim 4, wherein the historical data comprises historical connection patterns between the plurality of computing systems.

6. The computer-implemented method of claim 1, further comprising: collecting, by the computing system, the generated data mimicking the attack; analyzing, by the computing system, the collected data; determining, by the computing system, whether an attack has occurred based on the collected data; and verifying, by the computing system, that the attack was correctly detected.

7. The computer-implemented method of claim 6, further comprising: providing output of results, by the computing system, indicating effectiveness of the verification.

8. A computer program embodied on a non-transitory computer-readable medium, the computer program configured to cause at least one processor to: determine, based on historical data, which network connections to generate that form a k-path between a plurality of computing systems to create an anomaly by applying stochastic models for each edge in the k-path; generate the determined network connections in the k-path and data mimicking an attack to create the anomaly; and transmit the generated data mimicking the attack between the plurality of computing systems using the determined anomalous real network connections forming the k-path, wherein the k-path is a subgraph of size k that has diameter k, and k is at least two.

9. The computer program of claim 8, the program further configured to cause the at least one processor to: verify that a data collection mechanism for the network actually measured data pertaining to the generated connections; and provide output of results indicating a degree of success or failure of the verification.

10. The computer program of claim 8, wherein the network anomaly is designed to mimic one or more specific types of attacks based on known types of real attacks.

11. The computer program of claim 8, wherein the generated data comprises Domain Name Server (DNS) traffic that is transmitted in a path comprising computing systems that have never communicated before.

12. The computer program of claim 8, the program further configured to cause the at least one processor to: build stochastic models for each directed edge in the k-paths of a plurality of the determined network connections; and compare historical parameters with current parameters in a time window to determine a level of anomalousness of the k-paths of the plurality of the determined network connections.

13. The computer program of claim 8, wherein the historical data comprises historical connection patterns between the plurality of computing systems.

14. A computer-implemented method, comprising: inserting, by a plurality of computing systems, traffic in a k-path in a network comprising computing systems that do not normally communicate, the traffic deviating from stochastic models for each edge of the k-path; detecting the inserted k-path as anomalous, by a computing system, based on analysis of the inserted traffic; verifying, by the computing system, that an attack was correctly detected based on the detected inserted k-path; and providing output of results, by the computing system, indicating a degree of success or failure of the verification, wherein the k-path comprises a plurality of directed edges, each directed edge comprising associated data, the k-path is a subgraph of size k that has diameter k, and k is at least two.

15. The computer-implemented method of claim 14, wherein the inserted traffic is designed to mimic one or more specific types of attacks based on known types of real attacks.

16. The computer-implemented method of claim 14, further comprising: building stochastic models, by the computing system, for each directed edge in the k-path; and comparing historical parameters with current parameters in a time window, by the computing system, to determine a level of anomalousness of the k-path.

17. The computer-implemented method of claim 14, further comprising: determining based on historical data, by the computing system, which traffic to insert between the computing systems to create an anomaly, wherein the historical data comprises historical connection patterns between the plurality of computing systems.

18. A computer program embodied on a non-transitory computer-readable medium, the computer program configured to cause at least one processor to: determine, based on historical data, which network connections to generate that form a k-path between a plurality of computing systems to create an anomaly by applying stochastic models for each edge in the k-path; generate the determined network connections in the k-path to create the anomaly; verify that a data collection mechanism for the network actually measured data pertaining to the generated connections; and provide output of results indicating a degree of success or failure of the verification, wherein the k-path is a subgraph of size k that has diameter k, and k is at least two.

19. The computer program of claim 18, wherein the network anomaly is designed to mimic one or more specific types of attacks based on known types of real attacks.

20. The computer program of claim 18, wherein the generated data comprises Domain Name Server (DNS) traffic that is transmitted in a path comprising computing systems that have never communicated before.

21. The computer program of claim 18, the program further configured to cause the at least one processor to: build stochastic models for each directed edge in the k-paths of a plurality of the determined network connections; and compare historical parameters with current parameters in a time window to determine a level of anomalousness of the k-paths of the plurality of the determined network connections.

22. The computer program of claim 18, wherein the historical data comprises historical connection patterns between the plurality of computing systems.

23. A computer program embodied on a non-transitory computer-readable medium, the computer program configured to cause at least one processor to: determine, based on historical data, which network connections to generate that form a k-path between a plurality of computing systems to create an anomaly by applying stochastic models for each edge in the k-path; build stochastic models for each directed edge in the k-paths of a plurality of the determined network connections; compare historical parameters with current parameters in a time window to determine a level of anomalousness of the k-paths of the plurality of the determined network connections; and generate the determined network connections in the k-path to create the anomaly, wherein the k-path is a subgraph of size k that has diameter k, and k is at least two.

24. The computer program of claim 23, the program further configured to cause the at least one processor to: verify that a data collection mechanism for the network actually measured data pertaining to the generated connections; and provide output of results indicating a degree of success or failure of the verification.

25. The computer program of claim 23, wherein the network anomaly is designed to mimic one or more specific types of attacks based on known types of real attacks.

26. The computer program of claim 23, wherein the generated data comprises Domain Name Server (DNS) traffic that is transmitted in a path comprising computing systems that have never communicated before.

27. The computer program of claim 23, wherein the historical data comprises historical connection patterns between the plurality of computing systems.

28. A computer-implemented method, comprising: inserting, by a plurality of computing systems, traffic in a k-path in a network comprising computing systems that do not normally communicate, the traffic deviating from stochastic models for each edge of the k-path; building stochastic models, by the computing system, for each directed edge in the k-path; and comparing historical parameters with current parameters in a time window, by the computing system, to determine a level of anomalousness of the k-path; and detecting the inserted k-path as anomalous, by a computing system, based on analysis of the inserted traffic, wherein the k-path comprises a plurality of directed edges, each directed edge comprising associated data, the k-path is a subgraph of size k that has diameter k, and k is at least two.

29. The computer-implemented method of claim 28, further comprising: verifying, by the computing system, that an attack was correctly detected based on the detected inserted k-path; and providing output of results, by the computing system, indicating a degree of success or failure of the verification.

30. The computer-implemented method of claim 28, wherein the inserted traffic is designed to mimic one or more specific types of attacks based on known types of real attacks.

31. The computer-implemented method of claim 28, further comprising: determining based on historical data, by the computing system, which traffic to insert between the computing systems to create an anomaly, wherein the historical data comprises historical connection patterns between the plurality of computing systems.

32. A computer-implemented method, comprising: determining based on historical data, by the computing system, which traffic to insert between the computing systems to create an anomaly; inserting, by a plurality of computing systems, traffic in a k-path in a network comprising computing systems that do not normally communicate, the traffic deviating from stochastic models for each edge of the k-path; detecting the inserted k-path as anomalous, by a computing system, based on analysis of the inserted traffic, wherein the k-path comprises a plurality of directed edges, each directed edge comprising associated data, the k-path is a subgraph of size k that has diameter k, k is at least two, and the historical data comprises historical connection patterns between the plurality of computing systems.

33. The computer-implemented method of claim 32, further comprising: verifying, by the computing system, that an attack was correctly detected based on the detected inserted k-path; and providing output of results, by the computing system, indicating a degree of success or failure of the verification.

34. The computer-implemented method of claim 32, wherein the inserted traffic is designed to mimic one or more specific types of attacks based on known types of real attacks.

35. The computer-implemented method of claim 32, further comprising: building stochastic models, by the computing system, for each directed edge in the k-path; and comparing historical parameters with current parameters in a time window, by the computing system, to determine a level of anomalousness of the k-path.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

(1) For a proper understanding of the invention, reference should be made to the accompanying figures. These figures depict only some embodiments of the invention and are not limiting of the scope of the invention. Regarding the figures:

(2) FIG. 1 illustrates an inserted path as a series of hops, according to an embodiment of the present invention.

(3) FIG. 2 illustrates an outstar inserted into a network, according to an embodiment of the present invention.

(4) FIG. 3 illustrates a caterpillar inserted into a network, according to an embodiment of the present invention.

(5) FIG. 4 is a flowchart of a method for generating non-harmful data mimicking a network attack and detecting the attack, according to an embodiment of the present invention.

(6) FIG. 5 is a flowchart of another method for generating non-harmful data mimicking a network attack and detecting the attack, according to an embodiment of the present invention.

(7) FIG. 6 is a flowchart of yet another method for generating non-harmful data mimicking a network attack and detecting the attack, according to an embodiment of the present invention.

(8) FIG. 7 is a block diagram of a computing system for detecting group attacks on a network, according to an embodiment of the present invention.

DETAILED DESCRIPTION OF THE EMBODIMENTS

(9) Some embodiments of the present invention automatically create network data from within a deployed network for the purposes of validation and data collection. The type of data that is created may mimic that of an attacker acting maliciously on the network. Additionally, some embodiments may provide the opportunity to validate anomaly detection methods on the data.

(10) In real anomaly detection implementations, it was recognized that users were not using the PathScan anomaly detection tool correctly on their data. Users were not measuring their network data well, even though they thought they were. In addition, since real attacks are very rare, it is beneficial to be able to convince customers that anomalies can be detected. By creating non-harmful data that mimics attacks, both goals can be accomplished. In other words, users can be trained to use anomaly detection tools correctly, and customers can be shown that anomalies can be detected.

(11) In order to introduce data that realistically mimics an attack into a network data stream, a couple of validations should be made with respect to the generation code. First, it should be validated that the network operator is collecting data of sufficient quality to be used for anomaly detection. To this end, the validation code should check that the data inserted by the data generation code is indeed measured by the network collection mechanism. While this may sound trivial, it is the case that even at large, well-funded networks, this validation may not currently be performed, and some embodiments having such features present a significant advance in the art of network data collection. Second, it should be validated that the applied approach detects the type of attack introduced by the code.

(12) Some embodiments of the present invention use real network data in generating the mimicked attacks. However, the data in some embodiments is not attack data from real events, which are rare and cannot be controlled. Rather, the data is obtained by generating real network connections in an anomalous way between computers controlled by network security personnel who monitor the network. What may constitute an anomalous way is described in more detail, for example, in priority U.S. Provisional Patent Application Ser. No. 61/614,148.

(13) The underlying mechanism by which the data is generated can vary, but it is generally important for the insertion process to be non-harmful to the network. One example is generating Domain Name Server (DNS) traffic using nslookup in a path consisting of machines that have never communicated before. nslookups are benign queries that resolve an Internet Protocol (IP) address from a given host name.

(14) An inserted path may mimic the behavior of a malicious actor in the network, traversing from one host to the next in a sequence of hops. This is illustrated, for example, in path 100 of FIG. 1, where the fictitious malicious actor traverses across four hosts from left to right. Another example would be the insertion of an anomalous outstar, a shape which is created by a malicious actor using a central machine to examine and/or compromise its direct neighbors in the network. This is depicted, for example, in outstar 200 of FIG. 2. The gray host is compromised by the malicious actor, and the white hosts are direct neighbors that the gray host seeks to examine and/or compromise. Again, it is emphasized that the nslookup approach merely mimics the behavior of a malicious actor, without causing any hosts to actually be compromised.

(15) A third example is that of a caterpillar, a shape which is created when a malicious actor creates a combination of outstars while traversing through a path. This is shown, for example, in caterpillar 300 of FIG. 3. The gray hosts and the edges between them are part of the core path. The white nodes and edges are part of outstars for respective gray nodes. nslookup is a network administration tool for querying DNS to obtain domain name or IP address mapping, or for any other specific DNS record. However, this is only a single example. One of ordinary skill in the art will understand based on the present disclosure that other non-harmful data generation mechanisms may be used, and the shape of the attack in the network may be configurable.

(16) FIG. 4 is a flowchart 400 of a method for generating non-harmful data mimicking a network attack and detecting the attack, according to an embodiment of the present invention. In some embodiments, the method may be performed, for example, by computing systems such as computing system 700 of FIG. 7. The method begins with generating real network connections in an anomalous way between a plurality of computers in a network at 410. Next, data mimicking an attack is generated and sent between the plurality of computers using the real network connections at 420. For example, the generated data may be DNS traffic using nslookup in a path consisting of computers that have never communicated before. The generated data is then transmitted between the plurality of computers using the real network connections at 430.

(17) A computer collects the generated data mimicking the attack at 440, and the collected data is analyzed at 450. The computer then determines whether an attack has occurred based on the collected data at 460. At 470, the computer verifies that the attack was correctly detected.

(18) In some embodiments, software creating data mimicking attacks may require accounts on multiple networked computers. The software may also require data pertaining to historical connection patterns between the networked computers so that anomalous behavior may be effectively detected. An embodiment with this functionality is discussed with respect to FIG. 5 below.

(19) FIG. 5 is a flowchart 500 of a method for generating non-harmful data mimicking a network attack and detecting the attack, according to an embodiment of the present invention. In some embodiments, the method may be performed, for example, by computing systems such as computing system 700 of FIG. 7. The method begins with determining, based on historical data, which network connections to generate between a plurality of computing systems to create an anomaly at 510. The network connections to insert the anomaly are then generated at 520. Next, a computing system configured to monitor for anomalies verifies that the data collection mechanism for the network actually measured the data pertaining to the connections at 530. Data collection mechanisms may include, but are not limited to, collection of DNS data, collection of NetFlow data, other centralized logging mechanisms, and host-based collection, such as via a Unified Host Collection Agent (UHCA). Output results are then provided at 540 indicating success or failure of each of the previous steps.

(20) FIG. 6 flowchart 600 of a method for generating non-harmful data mimicking a network attack and detecting the attack, according to an embodiment of the present invention. In some embodiments, the method may be performed, for example, by computing systems such as computing system 700 of FIG. 7. The method begins with inserting traffic in a path in a network including computing systems that do not normally communicate at 610. The inserted path is then detected as anomalous at 620.

(21) FIG. 7 is a block diagram of a computing system 700 for inserting non-harmful data mimicking an attack into a network, according to an embodiment of the present invention. Computing system 700 includes a bus 705 or other communication mechanism for communicating information, and processor(s) 710 coupled to bus 705 for processing information. Processor(s) 710 may be any type of general or specific purpose processor, including a central processing unit (CPU) or application specific integrated circuit (ASIC). Processor(s) 710 may also have multiple processing cores, and at least some of the cores may be configured to perform specific functions. Computing system 700 further includes a memory 715 for storing information and instructions to be executed by processor(s) 710. Memory 715 can be comprised of any combination of random access memory (RAM), read only memory (ROM), flash memory, cache, static storage such as a magnetic or optical disk, or any other types of non-transitory computer-readable media or combinations thereof. Additionally, computing system 700 includes a communication device 720, such as a transceiver, to wirelessly provide access to a communications network.

(22) Non-transitory computer-readable media may be any available media that can be accessed by processor(s) 710 and may include both volatile and non-volatile media, removable and non-removable media, and communication media. Communication media may include computer-readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media.

(23) Processor(s) 710 are further coupled via bus 705 to a display 725, such as a Liquid Crystal Display (LCD), for displaying information to a user. A keyboard 730 and a cursor control device 735, such as a computer mouse, are further coupled to bus 705 to enable a user to interface with computing system 700. However, in certain embodiments such as those for mobile computing implementations, a physical keyboard and mouse may not be present, and the user may interact with the device solely through display 725 and/or a touchpad (not shown). Any type and combination of input devices may be used as a matter of design choice.

(24) In one embodiment, memory 715 stores software modules that provide functionality when executed by processor(s) 710. The modules include an operating system 740 for computing system 700. The modules further include a data insertion module 745 that is configured to insert non-harmful data mimicking an attack using one or more embodiments of the present invention. Computing system 700 may include one or more additional functional modules 750 that include additional functionality.

(25) One skilled in the art will appreciate that a system could be embodied as a personal computer, a server, a console, a personal digital assistant (PDA), a cell phone, a tablet computing device, or any other suitable computing device, or combination of devices. Presenting the above-described functions as being performed by a system is not intended to limit the scope of the present invention in any way, but is intended to provide one example of many embodiments of the present invention. Indeed, methods, systems and apparatuses disclosed herein may be implemented in localized and distributed forms consistent with computing technology, including cloud computing systems.

(26) It should be noted that some of the system features described in this specification have been presented as modules, in order to more particularly emphasize their implementation independence. For example, a module may be implemented as a hardware circuit comprising custom very large scale integration (VLSI) circuits or gate arrays, off-the-shelf semiconductors such as logic chips, transistors, or other discrete components. A module may also be implemented in programmable hardware devices such as field programmable gate arrays, programmable array logic, programmable logic devices, graphics processing units, or the like.

(27) A module may also be at least partially implemented in software for execution by various types of processors. An identified unit of executable code may, for instance, comprise one or more physical or logical blocks of computer instructions that may, for instance, be organized as an object, procedure, or function. Nevertheless, the executables of an identified module need not be physically located together, but may comprise disparate instructions stored in different locations which, when joined logically together, comprise the module and achieve the stated purpose for the module. Further, modules may be stored on a computer-readable medium, which may be, for instance, a hard disk drive, flash device, RAM, tape, or any other such medium used to store data.

(28) Indeed, a module of executable code could be a single instruction, or many instructions, and may even be distributed over several different code segments, among different programs, and across several memory devices. Similarly, operational data may be identified and illustrated herein within modules, and may be embodied in any suitable form and organized within any suitable type of data structure. The operational data may be collected as a single data set, or may be distributed over different locations including over different storage devices, and may exist, at least partially, merely as electronic signals on a system or network.

(29) The method steps performed in FIGS. 4-6 may be performed by a computer program, encoding instructions for the nonlinear adaptive processor to perform at least the methods described in FIGS. 4-6, in accordance with embodiments of the present invention. The computer program may be embodied on a non-transitory computer-readable medium. The computer-readable medium may be, but is not limited to, a hard disk drive, a flash device, a random access memory, a tape, or any other such medium used to store data. The computer program may include encoded instructions for controlling the nonlinear adaptive processor to implement the methods described in FIGS. 4-6, which may also be stored on the computer-readable medium.

(30) The computer program can be implemented in hardware, software, or a hybrid implementation. The computer program can be composed of modules that are in operative communication with one another, and which are designed to pass information or instructions to display. The computer program can be configured to operate on a general purpose computer, or an ASIC.

(31) It will be readily understood that the components of various embodiments of the present invention, as generally described and illustrated in the figures herein, may be arranged and designed in a wide variety of different configurations. Thus, the detailed description of the embodiments of the systems, apparatuses, methods, and computer programs of the present invention, as represented in the attached figures, is not intended to limit the scope of the invention as claimed, but is merely representative of selected embodiments of the invention.

(32) The features, structures, or characteristics of the invention described throughout this specification may be combined in any suitable manner in one or more embodiments. For example, reference throughout this specification to certain embodiments, some embodiments, or similar language means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the present invention. Thus, appearances of the phrases in certain embodiments, in some embodiment, in other embodiments, or similar language throughout this specification do not necessarily all refer to the same group of embodiments and the described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.

(33) It should be noted that reference throughout this specification to features, advantages, or similar language does not imply that all of the features and advantages that may be realized with the present invention should be or are in any single embodiment of the invention. Rather, language referring to the features and advantages is understood to mean that a specific feature, advantage, or characteristic described in connection with an embodiment is included in at least one embodiment of the present invention. Thus, discussion of the features and advantages, and similar language, throughout this specification may, but do not necessarily, refer to the same embodiment.

(34) Furthermore, the described features, advantages, and characteristics of the invention may be combined in any suitable manner in one or more embodiments. One skilled in the relevant art will recognize that the invention can be practiced without one or more of the specific features or advantages of a particular embodiment. In other instances, additional features and advantages may be recognized in certain embodiments that may not be present in all embodiments of the invention.

(35) One having ordinary skill in the art will readily understand that the invention as discussed above may be practiced with steps in a different order, and/or with hardware elements in configurations which are different than those which are disclosed. Therefore, although the invention has been described based upon these preferred embodiments, it would be apparent to those of skill in the art that certain modifications, variations, and alternative constructions would be apparent, while remaining within the spirit and scope of the invention. In order to determine the metes and bounds of the invention, therefore, reference should be made to the appended claims.