US 9,838,411 B1Grant
Subscriber based protection system
Issue Date:2017-12-05
•21 Claims
•12 Drawing Sheets
Abstract
A system features one or more network devices communicatively coupled to a management system. Configured to receive a portion of the network traffic, a first network device features one or more virtual machines that, based on a subscribed protection level, (i) perform network activities in response to a processing of the received portion of the analyzed network traffic, (ii) monitor behaviors of the one or more virtual machines during processing of the portion of the analyzed network traffic, (iii) determine whether the behaviors are anomalous, and (iv) generate an identifier for the portion of the analyzed network traffic associated with monitored behaviors being anomalous. The management system controls a setting of the protection level for the first network device to alter a frequency of receipt of identifiers associated with analyzed network traffic from a second network device of the one or more network devices different from the first network device.
Metadata
Assignee
- FireEye, Inc.
Inventor
- Ashar Aziz
Application Information
Application Number:US 15/369,714
Filing Date:2016-12-05
Priority Date:2004-04-01
Art Unit:2431
Classifications
IPC:
H04L29/06G06F9/455G06F11/00G06F12/14G06F12/16G08B23/00
Patent Drawings (12 sheets)
Description
Cross-Reference to Related Applications
[0001] This application is a continuation of U.S. application Ser. No. 15/090,563, filed Apr. 4, 2016, now U.S. Pat. No. 9,516,057, which is a continuation of application U.S. application Ser. No. 13/970,248, filed Aug. 19, 2013, now U.S. Pat. No. 9,306,960, which is a continuation of U.S. application Ser. No. 13/651,331, filed Oct. 12, 2012, now U.S. Pat. No. 8,516,593, which is a continuation-in-part of Ser. No. 13/423,057, filed Mar. 16, 2012, now U.S. Pat. No. 8,291,499, which is a continuation of U.S. application Ser. No. 11/409,355, filed Apr. 20, 2006, now U.S. Pat. No. 8,171,553, which is a continuation-in-part of U.S. application Ser. No. 11/152,286, filed Jun. 13, 2005, now U.S. Pat. No. 8,006,305, which claims the priority benefit of U.S. Provisional Application No. 60/579,910, filed Jun. 14, 2004. U.S. application Ser. No. 11/409,355, filed Apr. 20, 2006, now U.S. Pat. No. 8,171,553, which is a continuation-in-part of Ser. No. 11/096,287, now U.S. Pat. No. 8,528,086, which claim priority benefit of 60/559,198 filed Apr. 1, 2004. U.S. application Ser. No. 11/409,355, filed Apr. 20, 2006, now U.S. Pat. No. 8,171,553, which is a continuation-in-part of Ser. No. 11/151,812, filed Jun. 13, 2005, now U.S. Pat. No. 8,549,638, which claims benefit of 60/579,953, filed Jun. 14, 2004. Each of the above-identified applications are incorporated by referenced herein.
Background
[0002] Field of the Invention
[0003] The present invention relates generally to computer networks, and more particularly to preventing the spread of malware.
[0004] Background Art
[0005] Detecting and distinguishing computer worms from ordinary communications traffic within a computer network is a challenging problem. Moreover, modern computer worms operate at an ever increasing level of sophistication and complexity. Consequently, it has become increasingly difficult to detect computer worms.
[0006] A computer worm can propagate through a computer network by using active propagation techniques. One such active propagation technique is to select target systems to infect by scanning network address space (i.e., a scan-directed computer worm). Another active propagation technique is to use topological information from an infected system to actively propagate the computer worm in the system (i.e., a topologically directed computer worm). Still another active propagation technique is to select target systems to infect based on some combination of previously generated lists of target systems (e.g., a hit-list directed computer worm).
[0007] In addition to the active propagation techniques, a computer worm may propagate through a computer network by using passive propagation techniques. One passive propagation technique is for the worm to attach itself to a normal network communication not initiated by the computer worm itself (i.e., a stealthy or passive contagion computer worm). The computer worm then propagates through the computer network in the context of normal communication patterns not directed by the computer worm.
[0008] It is anticipated that next-generation computer worms will have multiple transport vectors, use multiple target selection techniques, have no previously known signatures, and will target previously unknown vulnerabilities. It is also anticipated that next generation computer worms will use a combination of active and passive propagation techniques and may emit chaff traffic (i.e., spurious traffic generated by the computer worm) to cloak the communication traffic that carries the actual exploit sequences of the computer worms. This chaff traffic will be emitted in order to confuse computer worm detection systems and to potentially trigger a broad denial-of-service by an automated response system.
[0009] Approaches for detecting computer worms in a computer system include misuse detection and anomaly detection. In misuse detection, known attack patterns of computer worms are used to detect the presence of the computer worm. Misuse detection works reliably for known attack patterns but is not particularly useful for detecting novel attacks. In contrast to misuse detection, anomaly detection has the ability to detect novel attacks. In anomaly detection, a baseline of normal behavior in a computer network is created so that deviations from this behavior can be flagged as anomalous. The difficulty inherent in this approach is that universal definitions of normal behavior are difficult to obtain. Given this limitation, anomaly detection approaches strive to minimize false positive rates of computer worm detection.
[0010] In one suggested computer worm containment system, detection devices are deployed in a computer network to monitor outbound network traffic and detect active scan directed computer worms within the computer network. To achieve effective containment of these active computer worms, as measured by the total infection rate over the entire population of systems, the detection devices are widely deployed in the computer network in an attempt to detect computer worm traffic close to a source of the computer worm traffic. Once detected, these computer worms are contained by using an address blacklisting technique. This computer worm containment system, however, does not have a mechanism for repair and recovery of infected computer networks.
[0011] In another suggested computer worm containment system, the protocols (e.g., network protocols) of network packets are checked for standards compliance under an assumption that a computer worm will violate the protocol standards (e.g., exploit the protocol standards) in order to successfully infect a computer network. While this approach may be successful in some circumstances, this approach is limited in other circumstances. Firstly, it is possible for a network packet to be fully compatible with published protocol standard specifications and still trigger a buffer overflow type of software error due to the presence of a software bug. Secondly, not all protocols of interest can be checked for standards compliance because proprietary or undocumented protocols may be used in a computer network. Moreover, evolutions of existing protocols and the introduction of new protocols may lead to high false positive rates of computer worm detection when “good” behavior cannot be properly and completely distinguished from “bad” behavior. Encrypted communications channels further complicate protocol checking because protocol compliance cannot be easily validated at the network level for encrypted traffic.
[0012] In another approach to computer worm containment, “honey farms” have been proposed. A honey farm includes “honeypots” that are sensitive to probe attempts in a computer network. One problem with this approach is that probe attempts do not necessarily indicate the presence of a computer worm because there may be legitimate reasons for probing a computer network. For example, a computer network can be legitimately probed by scanning an Internet Protocol (IP) address range to identify poorly configured or rogue devices in the computer network. Another problem with this approach is that a conventional honey farm does not detect passive computer worms and does not extract signatures or transport vectors in the face of chaff emitting computer worms.
[0013] Another approach to computer worm containment assumes that computer worm probes are identifiable at a given worm sensor in a computer network because the computer worm probes will target well known vulnerabilities and thus have well known signatures which can be detected using a signature-based intrusion detection system. Although this approach may work for well known computer worms that periodically recur, such as the CodeRed computer worm, this approach does not work for novel computer worm attacks exploiting a zero-day vulnerability (e.g., a vulnerability that is not widely known).
[0014] One suggested computer worm containment system attempts to detect computer worms by observing communication patterns between computer systems in a computer network. In this system, connection histories between computer systems are analyzed to discover patterns that may represent a propagation trail of the computer worm. In addition to false positive related problems, the computer worm containment system does not distinguish between the actual transport vector of a computer worm and a transport vector including a spuriously emitted chaff trail. As a result, simply examining malicious traffic to determine the transport vector can lead to a broad denial of service (DOS) attack on the computer network. Further, the computer worm containment system does not determine a signature of the computer worm that can be used to implement content filtering of the computer worm. In addition, the computer worm containment system does not have the ability to detect stealthy passive computer worms, which by their very nature cause no anomalous communication patterns.
[0015] In light of the above, there exists a need for an effective system and method of containing computer worms.
Summary of the Invention
[0016] An exemplary unauthorized activity capture system, according to some embodiments of the invention, comprises a tap configured to copy network data from a communication network, and a controller coupled to the tap. The controller is coupled to the tap and is configured to receive the copy of the network data from the tap, analyze the copy of the network data with a heuristic to flag the network data as suspicious, and simulate the transmission of the network data to a destination device.
[0017] In some embodiments, the heuristic can be configured to detect unknown source devices. Further, the heuristic can also be configured to detect the network data sent to a dark internet protocol address. The controller may further comprise a policy engine configured to flag network data as suspicious based on comparing the network data to policies.
[0018] An unauthorized activity capture system can comprise a tap configured to copy network data from a communication network and a controller. The controller can be configured to receive the copy of the network data from the tap, analyze the copy of the network data with a heuristic, retrieve a virtual machine, configure a replayer to replicate the network data to the virtual machine, and identify unauthorized activity by analyzing a response from the virtual machine to the network data.
[0019] An unauthorized activity capture method can comprise copying network data from a communication network, analyzing the copied network data with a heuristic to flag the network data as suspicious, and orchestrating transmission of the network data to a destination device to identify unauthorized activity. Orchestrating transmission of the network data can comprise retrieving a virtual machine configured to receive the network data, configuring a replayer to transmit the network data to the virtual machine, and simulating the transmission of the network data to the virtual machine.
[0020] A computer readable medium can comprise computer readable code configured to direct a processor to copy network data from a communication network, analyze the copied network data with a heuristic to flag the network data as suspicious, and orchestrate transmission of the network data to a destination device to identify unauthorized activity. Orchestrating transmission of the network data comprises directing a processor to retrieve a virtual machine configured to receive the network data, configuring a replayer to transmit the network data to the virtual machine, and simulating the transmission of the network data to the virtual machine.
Brief Description of the Drawings
[0021] FIG. 1 depicts a computing environment in which a worm sensor can be implemented, in accordance with one embodiment of the present invention.
[0022] FIG. 2 depicts a controller of a computer worm sensor, in accordance with one embodiment of the present invention.
[0023] FIG. 3 depicts a computer worm detection system, in accordance with one embodiment of the present invention.
[0024] FIG. 4 depicts a flow chart for a method of detecting computer worms, in accordance with one embodiment of the present invention.
[0025] FIG. 5 depicts a computer worm containment system, in accordance with one embodiment of the present invention.
[0026] FIG. 6 depicts a computer worm defense system, in accordance with one embodiment of the present invention.
[0027] FIG. 7 depicts an unauthorized activity detection system, in accordance with one embodiment of the present invention.
[0028] FIG. 8 depicts an analysis environment, in accordance with one embodiment of the present invention.
[0029] FIG. 9 depicts a flow chart for a method of detecting unauthorized activity, in accordance with one embodiment of the present invention.
[0030] FIG. 10 depicts a flow chart for a method for orchestrating a response to network data, in accordance with one embodiment of the present invention.
[0031] FIG. 11 depicts a computing environment in which a worm sensor may be implemented, in accordance with another embodiment of the present invention.
Detailed Description
[0032] An unauthorized activity containment system in accordance with one embodiment of the present invention detects suspicious computer activity, models the suspicious activity to identify unauthorized activity, and blocks the unauthorized activity. The unauthorized activity containment system can flag suspicious activity and then model the effects of the suspicious activity to identify malware and/or unauthorized activity associated with a computer user. The threshold for detecting the suspicious activity may be set low whereby a single command may be flagged as suspicious. In other embodiments, the threshold may be higher to flag suspicious activity of a combination of commands or repetitive commands.
[0033] Unauthorized activity can include any unauthorized and/or illegal computer activity. Unauthorized activity can also include activity associated with malware or illegitimate computer use. Malware is software created and distributed for malicious purposes and can take the form of viruses, worms, or trojan horses, for example. A virus is an intrusive program that infects a computer file by inserting a copy of itself in the file. The copy is usually executed when the file is loaded into memory, allowing the virus to infect still other files. A worm is a program that propagates itself across computers, usually by creating copies of itself in each computer's memory. A worm might duplicate itself in one computer so often that it causes the computer to crash. A trojan horse is a destructive program disguised as a game, utility, or application. When run, a trojan horse can harm the computer system while appearing to do something useful.
[0034] Illegitimate computer use can comprise intentional or unintentional unauthorized access to data. A hacker may intentionally seek to damage a computer system. A hacker, or computer cracker, is an individual who seeks unauthorized access to data. One example of a common attack is a denial-of-service attack where the hacker configures one or more computers to constantly request access to a target computer. The target computer may become overwhelmed by the requests and either crash or become too busy to conduct normal operations. While some hackers seek to intentionally damage computer systems, other computer users may seek to gain rights or privileges of a computer system in order to copy data or access other computers on a network. Such computer use can unintentionally damage computer systems or corrupt data.
[0035] Detection of worms can be accomplished through the use of a computer worm detection system that employs a decoy computer network having orchestrated network activities. The computer worm detection system is configured to permit computer worms to infect the decoy computer network. Alternately, rather than infect the decoy network, communications that are characteristic of a computer worm can be filtered from communication traffic and replayed in the decoy network. Detection is then based on the monitored behavior of the decoy computer network. Once a computer worm has been detected, an identifier of the computer worm is determined and provided to a computer worm blocking system that is configured to protect one or more computer systems of a real computer network. In some embodiments, the computer worm detection system can generate a recovery script to disable the computer worm and repair damage caused to the one or more computer systems, and in some instances, the computer worm blocking system initiates the repair and recovery of the infected systems.
[0036] FIG. 1 depicts an exemplary computing environment 100 in which a computer worm sensor 105 is implemented, in accordance with one embodiment of the present invention. In various embodiments, the computer worm sensor 105 functions as a computer worm detection system, as is described more fully herein. The computer worm sensor 105 includes a controller 115, a computer network 110 (e.g., a hidden or decoy network), and a gateway 125 (e.g., a wormhole system). The computer network 110 includes one or more computing systems 120 (e.g., hidden systems) in communication with each other. The controller 115 and the gateway 125 are in communication with the computer network 110 and the computing systems 120. Additionally, the gateway 125 is in communication with a communication network 130 (e.g., a production network). The communication network 130 can be a public computer network such as the Internet, or a private computer network, such as a wireless telecommunication network.
[0037] Optionally, the computer worm sensor 105 may be in communication with (as illustrated in FIG. 1 ) or include (not illustrated in FIG. 1 ) one or more traffic analysis devices 135 in communication with the communication network 130. A traffic analysis device 135 analyzes network traffic in the communication network 130 to identify network communications characteristic of a computer worm. The traffic analysis device 135 can then selectively duplicate the identified network communications and provide the duplicated network communications to the controller 115. The controller 115 replays the duplicated network communications in the computer network 110 to determine whether the network communications include a computer worm.
[0038] The computing systems 120 are computing devices typically found in a computer network. For example, the computing systems 120 can include computing clients or servers. As a further example, the computing systems 120 can include gateways and subnets in the computer network 110. Each of the computing systems 120 and the gateway 125 can have different hardware or software profiles.
[0039] The gateway 125 allows computer worms to pass from the communication network 130 to the computer network 110. The computer worm sensor 105 can include multiple gateways 125 in communication with multiple communication networks 130. These communication networks 130 may also be in communication with each other. For example, the communication network 130 can be part of the Internet or in communication with the Internet. In one embodiment, each of the gateways 125 can be in communication with multiple communication networks 130.
[0040] The controller 115 controls the operation of the computing systems 120 and the gateway 125 to orchestrate network activities in the computer worm sensor 105. In one embodiment, the orchestrated network activities are a predetermined sequence of network activities in the computer network 110, which represents an orchestrated behavior of the computer network 110. In this embodiment, the controller 115 monitors the computer network 110 to determine a monitored behavior of the computer network 110 in response to the orchestrated network activities. The controller 115 then compares the monitored behavior of the computer network 110 with a predetermined orchestrated behavior to identify an anomalous behavior.
[0041] Anomalous behavior may include a communication anomaly, like an unexpected network communication, or an execution anomaly, for example, an unexpected execution of computer program code. If the controller 115 identifies an anomalous behavior, the computer network 110 is deemed to be infected with a computer worm. In this way, the controller 115 can detect the presence of a computer worm in the computer network 110 based on an anomalous behavior of the computer worm in the computer network 110. The controller 115 then creates an identifier (i.e., a “definition” of the anomalous behavior), which can be used for detecting the computer worm in another computer network, such as the communication network 130.
[0042] The identifier determined by the controller 115 for a computer worm in the computer network 110 can be a signature that characterizes the anomalous behavior of the computer worm. The signature can then be used to detect the computer worm in another computer network. In one embodiment, the signature indicates a sequence of ports in the computer network 110 along with data used to exploit each of the ports. For instance, the signature can be a set of tuples {(p1, c1), (p2, c2), . . . }, where pn represents a Transfer Control Protocol (TCP) or a User Datagram Protocol (UDP) port number, and cn is signature data contained in a TCP or UDP packet used to exploit a port associated with the port number. For example, the signature data can be 16-32 bytes of data in a data portion of a data packet.
[0043] The controller 115 can determine a signature of a computer worm based on a uniform resource locator (URL), and can generate the signature by using a URL filtering device, which represents a specific case of content filtering. For example, the controller 115 can identify a uniform resource locator (URL) in data packets of Hyper Text Transfer Protocol (HTTP) traffic and can extract a signature from the URL. Further, the controller 115 can create a regular expression for the URL and include the regular expression in the signature such that each tuple of the signature includes a destination port and the regular expression. In this way, a URL filtering device can use the signature to filter out network traffic associated with the URL. The controller 115, in some embodiments, can also filter data packet traffic for a sequence of tokens and dynamically produce a signature having a regular expression that includes the token sequence.
[0044] Alternatively, the identifier may be a vector (e.g., a propagation vector, an attack vector, or a payload vector) that characterizes an anomalous behavior of the computer worm in the computer network 110. For example, the vector can be a propagation vector (i.e., a transport vector) that characterizes a sequence of paths traveled by the computer worm in the computer network 110. The propagation vector may include a set {p1, p2, p3, . . . }, where pn represents a port number (e.g., a TCP or UDP port number) in the computer network 110 and identifies a transport protocol (e.g., TCP or UDP) used by the computer worm to access the port. Further, the identifier may be a multi-vector that characterizes multiple propagation vectors for the computer worm. In this way, the vector can characterize a computer worm that uses a variety of techniques to propagate in the computer network 110. These techniques may include dynamic assignment of probe addresses to the computing systems 120, network address translation (NAT) of probe addresses to the computing systems 120, obtaining topological service information from the computer network 110, or propagating through multiple gateways 125 of the computer worm sensor 105.
[0045] The controller 115 can be configured to orchestrate network activities (e.g., network communications or computing services) in the computer network 110 based on one or more orchestration patterns. In one embodiment, the controller 115 generates a series of network communications based on an orchestration pattern to exercise one or more computing services (e.g., Telnet, FTP, or SMTP) in the computer network 110. In this embodiment, the orchestration pattern produces an orchestrated behavior (e.g., an expected behavior) of the computer network 110 in the absence of computer worm infection. The controller 115 then monitors network activities in the computer network 110 (e.g., the network communications and computing services accessed by the network communications) to determine a monitored behavior of the computer network 110, and compares the monitored behavior with the orchestrated behavior. If the monitored behavior does not match the orchestrated behavior, the computer network 110 is deemed to be infected with a computer worm. The controller 115 then identifies an anomalous behavior in the monitored behavior (e.g., a network activity in the monitored behavior that does not match the orchestration pattern) and determines an identifier for the computer worm based on the anomalous behavior. In other embodiments, the controller 115 is configured to detect unexpected network activities in the computer network 110.
[0046] In another embodiment, an orchestrated pattern is associated with a type of network communication. In this embodiment, the gateway 125 identifies the type of a network communication received by the gateway 125 from the communication network 130 before propagating the network communication to the computer network 110. The controller 115 then selects an orchestration pattern based on the type of network communication identified by the gateway 125 and orchestrates network activities in the computer network 110 based on the selected orchestration pattern. In the computer network 110, the network communication accesses one or more computing systems 120 via one or more ports to access one or more computing services (e.g., network services) provided by the computing systems 120.
[0047] For example, the network communication may access an FTP server on one of the computing systems 120 via a well-known or registered FTP port number using an appropriate network protocol (e.g., TCP or UDP). In this example, the orchestration pattern includes the identity of the computing system 120, the FTP port number, and the appropriate network protocol for the FTP server. If the monitored behavior of the computer network 110 does not match the orchestrated behavior expected from the orchestration pattern, the network communication is deemed to be infected with a computer worm. The controller 115 then determines an identifier for the computer worm based on the monitored behavior, as is described in more detail herein.
[0048] The controller 115 orchestrates network activities in the computer network 110 such that the detection of anomalous behavior in the computer network 110 is simple and highly reliable. All behavior (e.g., network activities) of the computer network 110 that is not part of an orchestrated behavior represents an anomalous behavior. In alternative embodiments, the monitored behavior of the computer network 110 that is not part of the orchestrated behavior is analyzed to determine whether any of the monitored behavior is an anomalous behavior.
[0049] In another embodiment, the controller 115 periodically orchestrates network activities in the computer network 110 to access various computing services (e.g., web servers or file servers) in the communication network 130. In this way, a computer worm that has infected one of these computing services may propagate from the communication network 130 to the computer network 110 via the orchestrated network activities. The controller 115 then orchestrates network activities to access the same computing services in the computer network 110 and monitors a behavior of the computer network 110 in response to the orchestrated network activities. If the computer worm has infected the computer network 110, the controller 115 detects the computer worm based on an anomalous behavior of the computer worm in the monitored behavior, as is described more fully herein.
[0050] In one embodiment, a single orchestration pattern exercises all available computing services in the computer network 110. In other embodiments, each orchestration pattern exercises selected computing services in the computer network 110, or the orchestration patterns for the computer network 110 are dynamic (e.g., vary over time). For example, a user of the computer worm sensor 105 may add, delete, or modify the orchestration patterns to change the orchestrated behavior of the computer network 110.
[0051] In one embodiment, the controller 115 orchestrates network activities in the computer network 110 to prevent a computer worm in the communication network 130 from recognizing the computer network 110 as a decoy. For example, a computer worm may identify and avoid inactive computer networks, as such networks may be decoy computer networks deployed for detecting the computer worm (e.g., the computer network 110). In this embodiment, therefore, the controller 115 orchestrates network activities in the computer network 110 to prevent the computer worm from avoiding the computer network 110.
[0052] In another embodiment, the controller 115 analyzes both the packet header and the data portion of data packets in network communications in the computer network 110 to detect anomalous behavior in the computer network 110. For example, the controller 115 can compare the packet header and the data portion of the data packets with those of data packets propagated pursuant to an orchestration pattern to determine whether the network communications data packets constitute anomalous behavior in the computer network 110. Because the network communication propagated pursuant to the orchestration pattern is an orchestrated behavior of the computer network 110, the controller 115 avoids false positive detection of anomalous behavior in the computer network 110, which can occur in anomaly detection systems operating on unconstrained computer networks. In this way, the controller 115 reliably detects computer worms in the computer network 110 based on the anomalous behavior.
[0053] To further illustrate what is meant by reliable detection of anomalous behavior, for example, an orchestration pattern can be used that is expected to cause emission of a sequence of data packets (a, b, c, d) in the computer network 110. The controller 115 orchestrates network activities in the computer network 110 based on the orchestration pattern and monitors the behavior (e.g., measures the network traffic) of the computer network 110. If the monitored behavior of the computer network 110 includes a sequence of data packets (a, b, c, d, e, f), then the extra data packets (e, f) represent an anomalous behavior (e.g., anomalous traffic). This anomalous behavior may be caused by an active computer worm propagating inside the computer network 110.
[0054] As another example, if an orchestration pattern is expected to cause emission of a sequence of data packets (a, b, c, d) in the computer network 110, but the monitored behavior includes a sequence of data packets (a, b′, c′, d), the modified data packets (b′, c′) represent an anomalous behavior in the computer network 110. This anomalous behavior may be caused by a passive computer worm propagating inside the computer network 110.
[0055] In various further embodiments, the controller 115 generates a recovery script for the computer worm, as is described more fully herein. The controller 115 can then execute the recovery script to disable (e.g., destroy) the computer worm in the computer worm sensor 105 (e.g., remove the computer worm from the computing systems 120 and the gateway 125). Moreover, the controller 115 can output the recovery script for use in disabling the computer worm in other infected computer networks and systems.
[0056] In another embodiment, the controller 115 identifies the source of a computer worm based on a network communication containing the computer worm. For example, the controller 115 may identify an infected host (e.g., a computing system) in the communication network 130 that generated the network communication containing the computer worm. In this example, the controller 115 transmits the recovery script via the gateway 125 to the host in the communication network 130. In turn, the host executes the recovery script to disable the computer worm in the host. In various further embodiments, the recovery script is also capable of repairing damage to the host caused by the computer worm.
[0057] The computer worm sensor 105 can export the recovery script, in some embodiments, to a bootable compact disc (CD) or floppy disk that can be loaded into infected hosts to repair the infected hosts. For example, the recovery script can include an operating system for the infected host and repair scripts that are invoked as part of the booting process of the operating system to repair an infected host. Alternatively, the computer worm sensor 105 may provide the recovery script to an infected computer network (e.g., the communication network 130) so that the computer network 110 can direct infected hosts in the communication network 130 to reboot and load the operating system in the recovery script.
[0058] In another embodiment, the computer worm sensor 105 uses a per-host detection and recovery mechanism to recover hosts (e.g., computing systems) in a computer network (e.g., the communication network 130). The computer worm sensor 105 generates a recovery script including a detection process for detecting the computer worm and a recovery process for disabling the computer worm and repairing damage caused by the computer worm. The computer worm sensor 105 provides the recovery script to hosts in a computer network and each host executes the detection process. If the host detects the computer worm, the host then executes the recovery process. In this way, a computer worm that performs random corruptive acts on the different hosts (e.g., computing systems) in the computer network can be disabled in the computer network and damage to the computer network caused by the computer worm can be repaired.
[0059] The computer worm sensor 105 can be a single integrated system, such as a network device or a network appliance, which is deployed in the communication network 130 (e.g., a commercial or military computer network). Alternatively, the computer worm sensor 105 may include integrated software for controlling operation of the computer worm sensor 105, such that per-host software (e.g., individual software for each computing system 120 and gateway 125) is not required.
[0060] The computer worm sensor 105 can also be a hardware module, such as a combinational logic circuit, a sequential logic circuit, a programmable logic device, or a computing device, among others. Alternatively, the computer worm sensor 105 may include one or more software modules containing computer program code, such as a computer program, a software routine, binary code, or firmware, among others. The software code can be contained in a permanent memory storage device such as a compact disc read-only memory (CD-ROM), a hard disk, or other memory storage device. In various embodiments, the computer worm sensor 105 includes both hardware and software modules.
[0061] In some embodiments, the computer worm sensor 105 is substantially transparent to the communication network 130 and does not substantially affect the performance or availability of the communication network 130. In another embodiment, the software in the computer worm sensor 105 may be hidden such that a computer worm cannot detect the computer worm sensor 105 by checking for the existence of files (e.g., software programs) in the computer worm sensor 105 or by performing a simple signature check of the files. In one example, the software configuration of the computer worm sensor 105 is hidden by employing one or more well-known polymorphic techniques used by viruses to evade signature-based detection.
[0062] In another embodiment, the gateway 125 facilitates propagation of computer worms from the communication network 130 to the computer network 110, with the controller 115 orchestrating network activities in the computer network 110 to actively propagate the computer worms from the communication network 130 to the computer network 110. For example, the controller 115 can originate one or more network communications between the computer network 110 and the communication network 130. In this way, a passive computer worm in the communication network 130 can attach to one of the network communications and propagate along with the network communication from the communication network 130 to the computer network 110. Once the computer worm is in the computer network 110, the controller 115 can detect the computer worm based on an anomalous behavior of the computer worm, as is described in more fully herein.
[0063] In another embodiment, the gateway 125 selectively prevents normal network traffic (e.g., network traffic not generated by a computer worm) from propagating from the communication network 130 to the computer network 110 to prevent various anomalies or perturbations in the computer network 110. In this way, the orchestrated behavior of the computer network 110 can be simplified to increase the reliability of the computer worm sensor 105.
[0064] For example, the gateway 125 can prevent Internet Protocol (IP) data packets from being routed from the communication network 130 to the computer network 110. Alternatively, the gateway 125 can prevent broadcast and multicast network communications from being transmitted from the communication network 130 to the computer network 110, prevent communications generated by remote shell applications (e.g., Telnet) in the communication network 130 from propagating to the computer network 110, or exclude various application level gateways including proxy services that are typically present in a computer network for application programs in the computer network. Such application programs can include a Web browser, an FTP server and a mail server, and the proxy services can include the Hypertext Markup Language (HTML), the File Transfer Protocol (FTP), or the Simple Mail Transfer Protocol (SMTP).
[0065] In another embodiment, the computing systems 120 and the gateway 125 are virtual computing systems. For example, the computing systems 120 may be implemented as virtual systems using machine virtualization technologies such as VMware™ sold by VMware, Inc. In another example, the VM can be based on instrumental virtual CPU technology (e.g., Bochs, Qemu, and Valgrind.) In another embodiment, the virtual systems include VM software profiles and the controller 115 automatically updates the VM software profiles to be representative of the communication network 130. The gateway 125 and the computer network 110 may also be implemented as a combination of virtual and real systems.
[0066] In another embodiment, the computer network 110 is a virtual computer network. The computer network 110 includes network device drivers (e.g., special purpose network device drivers) that do not access a physical network, but instead use software message passing between the different virtual computing systems 120 in the computer network 110. The network device drivers may log data packets of network communications in the computer network 110, which represent the monitored behavior of the computer network 110.
[0067] In various embodiments, the computer worm sensor 105 establishes a software environment of the computer network 110 (e.g., computer programs in the computing systems 120) to reflect a software environment of a selected computer network (e.g., the communication network 130). For example, the computer worm sensor 105 can select a software environment of a computer network typically attacked by computer worms (e.g., a software environment of a commercial communication network) and can configure the computer network 110 to reflect that software environment. In a further embodiment, the computer worm sensor 105 updates the software environment of the computer network 110 to reflect changes in the software environment of the selected computer network. In this way, the computer worm sensor 105 can effectively detect a computer worm that targets a recently deployed software program or software profile in the software environment (e.g., a widely deployed software profile).
[0068] The computer worm sensor 105 can also monitor the software environment of the selected computer network and automatically update the software environment of the computer network 110 to reflect the software environment of the selected computer network. For example, the computer worm sensor 105 can modify the software environment of the computer network 110 in response to receiving an update for a software program (e.g., a widely used software program) in the software environment of the selected computer network.
[0069] In another embodiment, the computer worm sensor 105 has a probe mechanism to automatically check the version, the release number, and the patch-level of major operating systems and application software components installed in the communication network 130. Additionally, the computer worm sensor 105 has access to a central repository of up-to-date versions of the system and application software components. In this embodiment, the computer worm sensor 105 detects a widely used software component (e.g., software program) operating in the communication network 130, downloads the software component from the central repository, and automatically deploys the software component in the computer network 110 (e.g., installs the software component in the computing systems 120). The computer worm sensor 105 may coordinate with other computer worm sensors 105 to deploy the software component in the computer networks 110 of the computer worm sensors 105. In this way, the software environment of each computer worm sensor 105 is modified to contain the software component.
[0070] In another embodiment, the computer worm sensors 105 are automatically updated from a central computing system (e.g., a computing server) by using a push model. In this embodiment, the central computing system obtains updated software components and sends the updated software components to the computer worm sensors 105. Moreover, the software environments of the computer worm sensors 105 can represent widely deployed software that computer worms are likely to target. Examples of available commercial technologies that can aid in the automated update of software and software patches in a networked environment include N1 products sold by SUN Microsystems, Inc.™ and Adaptive Infrastructure products sold by the Hewlett Packard Company™. In some embodiments, the computer worm sensors 105 are automatically updated by connecting to an independent software vendor (ISV) supplied update mechanism (e.g., the Microsoft Windows™ update service).
[0071] The computer worm sensor 105, in some embodiments, can maintain an original image of the computer network 110 (e.g., a copy of the original file system for each computing system 120) in a virtual machine that is isolated from both of the computer network 110 and the communication network 130 (e.g., not connected to the computer network 110 or the communication network 130). The computer worm sensor 105 obtains a current image of an infected computing system 120 (e.g., a copy of the current file system of the computing system 120) and compares the current image with the original image of the computer network 110 to identify any discrepancies between these images, which represent an anomalous behavior of a computer worm in the infected computing system 120.
[0072] The computer worm sensor 105 generates a recovery script based on the discrepancies between the current image and the original image of the computing system 120. The recovery script can be used to disable the computer worm in the infected computing system 120 and repair damage to the infected computing system 120 caused by the computer worm. For example, the recovery script may include computer program code for identifying infected software programs or memory locations based on the discrepancies, and for removing the discrepancies from the infected software programs or memory locations. The infected computing system 120 can then execute the recovery script to disable (e.g., destroy) the computer worm and repair any damage to the infected computing system 120 caused by the computer worm.
[0073] The recovery script may include computer program code for replacing the current file system of the computing system 120 with the original file system of the computing system 120 in the original image of the computer network 110. Alternatively, the recovery script may include computer program code for replacing infected files with the corresponding original files of the computing system 120 in the original image of the computer network 110. In still another embodiment, the computer worm sensor 105 includes a file integrity checking mechanism (e.g., a tripwire) for identifying infected files in the current file system of the computing system 120. The recovery script can also include computer program code for identifying and restoring files modified by a computer worm to reactivate the computer worm during reboot of the computing system 120 (e.g., reactivate the computer worm after the computer worm is disabled).
[0074] In one embodiment, the computer worm sensor 105 occupies a predetermined address space (e.g., an unused address space) in the communication network 130. The communication network 130 redirects those network communications directed to the predetermined address space to the computer worm sensor 105. For example, the communication network 130 can redirect network communications to the computer worm sensor 105 by using various IP layer redirection techniques. In this way, an active computer worm using a random IP address scanning technique (e.g., a scan directed computer worm) can randomly select an address in the predetermined address space and can infect the computer worm sensor 105 based on the selected address (e.g., transmitting a network communication containing the computer worm to the selected address).
[0075] An active computer worm can select an address in the predetermined address space based on a previously generated list of target addresses (e.g., a hit-list directed computer worm) and can infect a computing system 120 located at the selected address. Alternatively, an active computer worm can identify a target computing system 120 located at the selected address in the predetermined address space based on a previously generated list of target systems, and then infect the target computing system 120 based on the selected address.
[0076] In various embodiments, the computer worm sensor 105 identifies data packets directed to the predetermined address space and redirects the data packets to the computer worm sensor 105 by performing network address translation (NAT) on the data packets. For example, the computer network 110 may perform dynamic NAT on the data packets based on one or more NAT tables to redirect data packets to one or more computing systems 120 in the computer network 110. In the case of a hit-list directed computer worm having a hit-list that does not have a network address of a computing system 120 in the computer network 110, the computer network 110 can perform NAT to redirect the hit-list directed computer worm to one of the computing systems 120. Further, if the computer worm sensor 105 initiates a network communication that is not defined by the orchestrated behavior of the computer network 110, the computer network 110 can dynamically redirect the data packets of the network communication to a computing system 120 in the computer network 110.
[0077] In another embodiment, the computer worm sensor 105 operates in conjunction with dynamic host configuration protocol (DHCP) servers in the communication network 130 to occupy an address space in the communication network 130. In this embodiment, the computer worm sensor 105 communicates with each DHCP server to determine which IP addresses are unassigned to a particular subnet associated with the DHCP server in the communication network 130. The computer worm sensor 105 then dynamically responds to network communications directed to those unassigned IP addresses. For example, the computer worm sensor 105 can dynamically generate an address resolution protocol (ARP) response to an ARP request.
[0078] In another embodiment, a traffic analysis device 135 analyzes communication traffic in the communication network 130 to identify a sequence of network communications characteristic of a computer worm. The traffic analysis device 135 may use one or more well-known worm traffic analysis techniques to identify a sequence of network communications in the communication network 130 characteristic of a computer worm. For example, the traffic analysis device 135 may identify a repeating pattern of network communications based on the destination ports of data packets in the communication network 130. The traffic analysis device 135 duplicates one or more network communications in the sequence of network communications and provides the duplicated network communications to the controller 115, which emulates the duplicated network communications in the computer network 110.
[0079] The traffic analysis device 135 may identify a sequence of network communications in the communication network 130 characteristic of a computer worm by using heuristic analysis techniques (i.e., heuristics) known to those skilled in the art. For example, the traffic analysis device 135 may detect a number of IP address scans, or a number of network communications to an invalid IP address, occurring within a predetermined period. The traffic analysis device 135 determines whether the sequence of network communications is characteristic of a computer worm by comparing the number of IP address scans or the number of network communications in the sequence to a heuristics threshold (e.g., one thousand IP address scans per second).
[0080] The traffic analysis device 135 may lower typical heuristics thresholds of these heuristic techniques to increase the rate of computer worm detection, which can also increase the rate of false positive computer worm detection by the traffic analysis device 135. Because the computer worm sensor 105 emulates the duplicated network communications in the computer network 110 to determine whether the network communications include an anomalous behavior of a computer worm, the computer worm sensor 105 may increase the rate of computer worm detection without increasing the rate of false positive worm detection.
[0081] In another embodiment, the traffic analysis device 135 filters network communications characteristic of a computer worm in the communication network 130 before providing duplicate network communications to the controller 115. For example, a host A in the communication network 130 can send a network communication including an unusual data byte sequence (e.g., worm code) to a TCP/UDP port of a host B in the communication network 130. In turn, the host B can send a network communication including a similar unusual data byte sequence to the same TCP/UDP port of a host C in the communication network 130. In this example, the network communications from host A to host B and from host B to host C represent a repeating pattern of network communication. The unusual data byte sequences may be identical data byte sequences or highly correlated data byte sequences. The traffic analysis device 135 filters the repeating pattern of network communications by using a correlation threshold to determine whether to duplicate the network communication and provide the duplicated network communication to the controller 115.
[0082] The traffic analysis device 135 may analyze communication traffic in the communication network 130 for a predetermined period. For example, the predetermined period can be a number of seconds, minutes, hours, or days. In this way, the traffic analysis device 135 can detect slow propagating computer worms as well as fast propagating computer worms in the communication network 130.
[0083] The computer worm sensor 105 may contain a computer worm (e.g., a scanning computer worm) within the computer network 110 by performing dynamic NAT on an unexpected network communication originating in the computer network 110 (e.g., an unexpected communication generated by a computing system 120). For example, the computer worm sensor 105 can perform dynamic NAT on data packets of an IP address range scan originating in the computer network 110 to redirect the data packets to a computing system 120 in the computer network 110. In this way, the network communication is contained in the computer network 110.
[0084] In another embodiment, the computer worm sensor 105 is topologically knit into the communication network 130 to facilitate detection of a topologically directed computer worm. The controller 115 may use various network services in the communication network 130 to topologically knit the computer worm sensor 105 into the communication network 130. For example, the controller 115 may generate a gratuitous ARP response including the IP address of a computing system 120 to the communication network 130 such that a host in the communication network 130 stores the IP address in an ARP cache. In this way, the controller 115 plants the IP address of the computing system 120 into the communication network 130 to topologically knit the computing system 120 into the communication network 130.
[0085] The ARP response generated by the computer worm sensor 105 may include a media access control (MAC) address and a corresponding IP address for one or more of the computing systems 120. A host (e.g., a computing system) in the communication network 130 can then store the MAC and IP addresses in one or more local ARP caches. A topologically directed computer worm can then access the MAC and IP addresses in the ARP caches and can target the computing systems 120 based on the MAC or IP addresses.
[0086] In various embodiments, the computer worm sensor 105 can accelerate network activities in the computer network 110. In this way, the computer worm sensor 105 can reduce the time for detecting a time-delayed computer worm (e.g., the CodeRed-II computer worm) in the computer network 110. Further, accelerating the network activities in the computer network 110 may allow the computer worm sensor 105 to detect the time-delayed computer worm before the time-delayed computer worm causes damage in the communication network 130. The computer worm sensor 105 can then generate a recovery script for the computer worm and provide the recovery script to the communication network 130 for disabling the computer worm in the communication network 130.
[0087] The computing system 120 in the computer network can accelerate network activities by intercepting time-sensitive system calls (e.g., “time-of-day” or “sleep” system calls) generated by a software program executing in the computing system 120 or responses to such systems calls, and then modifying the systems calls or responses to accelerate execution of the software program. For example, the computing system 120 can modify a parameter of a “sleep” system call to reduce the execution time of this system call or modify the time or date in a response to a “time-of-day” system call to a future time or date. Alternatively, the computing system 120 can identify a time consuming program loop (e.g., a long, central processing unit intensive while loop) executing in the computing system 120 and can increase the priority of the software program containing the program loop to accelerate execution of the program loop.
[0088] In various embodiments, the computer worm sensor 105 includes one or more computer programs for identifying execution anomalies in the computing systems 120 (e.g., anomalous behavior in the computer network 110) and distinguishing a propagation vector of a computer worm from spurious traffic (e.g. chaff traffic) generated by the computer worm. In one embodiment, the computing systems 120 execute the computing programs to identify execution anomalies occurring in the computer network 110. The computer worm sensor 105 correlates these execution anomalies with the monitored behavior of the computer worm to distinguish computing processes (e.g., network services) that the computer worm exploits for propagation purposes from computing processes that only receive benign network traffic from the computer worm. The computer worm sensor 105 then determines a propagation vector of the computer worm based on the computing processes that the computer worm propagates for exploitative purposes. In a further embodiment, each computing system 120 executes a function of one of the computer programs as an intrusion detection system (IDS) by generating a computer worm intrusion indicator in response to detecting an execution anomaly.
[0089] In one embodiment, the computer worm sensor 105 tracks system call sequences to identify an execution anomaly in the computing system 120. For example, the computer worm sensor 105 can use finite state automata techniques to identify an execution anomaly. Additionally, the computer worm sensor 105 may identify an execution anomaly based on call-stack information for system calls executed in a computing system 120. For example, a call-stack execution anomaly may occur when a computer worm executes system calls from the stack or the heap of the computing system 120. The computer worm system 105 may also identify an execution anomaly based on virtual path identifiers in the call-stack information.
[0090] The computer worm sensor 105 may monitor transport level ports of a computing system 120. For example, the computer worm sensor 105 can monitor systems calls (e.g., “bind” or “recvfrom” system calls) associated with one or more transport level ports of a computing process in the computing system 120 to identify an execution anomaly. If the computer worm sensor 105 identifies an execution anomaly for one of the transport level ports, the computer worm sensor 105 includes the transport level port in the identifier (e.g., a signature or a vector) of the computer worm, as is described more fully herein.
[0091] In another embodiment, the computer worm sensor 105 analyzes binary code (e.g., object code) of a computing process in the computing system 120 to identify an execution anomaly. The computer worm sensor 105 may also analyze the call stack and the execution stack of the computing system 120 to identify the execution anomaly. For example, the computer worm sensor 105 may perform a static analysis on the binary code of the computing process to identify possible call stacks and virtual path identifiers for the computing process. The computer worm sensor 105 then compares an actual call stack with the identified call stacks to identify a call stack execution anomaly in the computing system 120. In this way, the computer worm sensor 105 can reduce the number of false positive computer worm detections and false negative computer worm detections. Moreover, if the computer worm sensor 105 can identify all possible call-stacks and virtual path identifiers for the computing process, the computer worm sensor 105 can have a zero false positive rate of computer worm detection.
[0092] In another embodiment, the computer worm sensor 105 identifies one or more anomalous program counters in the call stack. For example, an anomalous program counter can be the program counter of a system call generated by worm code of a computer worm. The computer worm sensor 105 tracks the anomalous program counters and determines an identifier for detecting the computer worm based on the anomalous program counters. Additionally, the computer worm sensor 105 can determine whether a memory location (e.g., a memory address or a memory page) referenced by the program counter is a writable memory location. The computer worm sensor 105 then determines whether the computer worm has exploited the memory location. For example, a computer worm can store worm code into a memory location by exploiting a vulnerability of the computing system 120 (e.g., a buffer overflow mechanism).
[0093] The computer worm sensor 105 may take a snapshot of data in the memory around the memory location referenced by the anomalous program counter. The computer worm sensor 105 then searches the snapshot for data in recent data packets received by the computing process (e.g., computing thread) associated with the anomalous program counter. The computer worm sensor 105 searches the snapshot by using a searching algorithm to compare data in the recent data packets with a sliding window of data (e.g., 16 bytes of data) in the snapshot. If the computer worm sensor 105 finds a match between the data in a recent data packet and the data in the sliding window, the matching data is deemed to be a signature candidate for the computer worm.
[0094] In another embodiment, the computing system 120 tracks the integrity of computing code in a computing system 120 to identify an execution anomaly in the computing system 120. The computing system 120 associates an integrity value with data stored in the computing system 120 to identify the source of the data. If the data is from a known source (e.g., a computing program) in the computing system 120, the integrity value is set to one, otherwise the integrity value is set to zero. For example, data received by the computing system 120 in a network communication is associated with an integrity value of zero. The computing system 120 stores the integrity value along with the data in the computing system 120, and monitors a program counter in the computing system 120 to identify an execution anomaly based on the integrity value. A program counter having an integrity value of zero indicates that data from a network communication is stored in the program counter, which represents an execution anomaly in the computing system 120.
[0095] The computing system 120 may use the signature extraction algorithm to identify a decryption routine in the worm code of a polymorphic worm, such that the decryption routine is deemed to be a signature candidate of the computer worm. Additionally, the computer worm sensor 105 may compare signature candidates identified by the computing systems 120 in the computer worm sensor 105 to determine an identifier for detecting the computer worm. For example, the computer worm sensor 105 can identify common code portions in the signature candidates to determine an identifier for detecting the computer worm. In this way, the computer worm sensor 105 can determine an identifier of a polymorphic worm containing a mutating decryption routine (e.g., polymorphic code).
[0096] In another embodiment, the computer worm sensor 105 monitors network traffic in the computer network 110 and compares the monitored network traffic with typical network traffic patterns occurring in a computer network to identify anomalous network traffic in the computer network 110. The computer worm sensor 105 determines signature candidates based on data packets of the anomalous network traffic (e.g., extracts signature candidates from the data packets) and determines identifiers for detecting computer worms based on the signature candidates.
[0097] In another embodiment, the computer worm sensor 105 evaluates characteristics of a signature candidate to determine the quality of the signature candidate, which indicates an expected level of false positive computer worm detection in a computer network (e.g., the communication network 130). For example, a signature candidate having a high quality is not contained in data packets of typical network traffic occurring in the computer network. Characteristics of a signature candidate include a minimum length of the signature candidate (e.g., 16 bytes of data) and an unusual data byte sequence. In one embodiment, the computer worm sensor 105 performs statistical analysis on the signature candidate to determine whether the signature candidate includes an unusual byte sequence. For example, computer worm sensor 105 can determine a correlation between the signature candidate and data contained in typical network traffic. In this example, a low correlation (e.g., zero correlation) indicates a high quality signature candidate.
[0098] In another embodiment, the computer worm sensor 105 identifies execution anomalies by detecting unexpected computing processes in the computer network 110 (i.e., computing processes that are not part of the orchestrated behavior of the computer network 110). The operating systems in the computing systems 120 may be configured to detect computing processes that are not in a predetermined collection of computing processes. In another embodiment, a computing system 120 is configured as a network server that permits a host in the communication network 130 to remotely execute commands on the computing system 120. For example, the original Morris computer worm exploited a debug mode of sendmail that allowed remote command execution in a mail server.
[0099] In some cases, the intrusion detection system of the computer worm sensor 105 detects an active computer worm based on anomalous network traffic in the computer network 110, but the computer worm sensor 105 does not detect an execution anomaly caused by a computing process in the computer network 110. In these cases, the computer worm sensor 105 determines whether the computer worm has multiple possible transport vectors based on the ports being accessed by the anomalous network traffic in the computer network 110. If the computer network 110 includes a small number of ports (e.g., one or two), the computer worm sensor 105 can use these ports to determine a vector for the computer worm. Conversely, if the computer network 110 includes many ports (e.g., three or more ports), the computer worm sensor 105 partitions the computing services in the computer network 110 at appropriate control points to determine those ports exploited by the computer worm.
[0100] The computer worm sensor 105 may randomly block ports of the computing systems 120 to suppress traffic to these blocked ports. Consequently, a computer worm having a transport vector that requires one or more of the blocked ports will not be able to infect a computing system 120 in which those ports are blocked. The computer worm sensor 105 then correlates the anomalous behavior of the computer worm across the computing systems 120 to determine which ports the computer worm has used for diversionary purposes (e.g., emitting chaff) and which ports the computer worm has used for exploitive purposes. The computer worm sensor 105 then determines a transport vector of the computer worm based on the ports that the computer worm has used for exploitive purposes.
[0101] FIG. 11 depicts another exemplary computer environment 1100 in which a computer worm sensor 1105 is implemented, in accordance with one embodiment of the present invention. The worm sensor 1105 includes one or more wormhole systems 1125 (e.g., wormhole 1, 2 or 3), a hidden network 1110 (e.g., hidden computer network), and one or more hidden systems 1120 (e.g., hidden systems 1, 2, 3 or n). The wormhole systems 1125 and hidden systems 1120 communicate via the hidden network 1110. In various embodiments, the hidden network 1110 includes the hidden systems 1120. Additionally, the wormhole systems 1125 communicate with a production network 1130.
[0102] The wormhole system 1125, via self-infection, acts as a computer worm gateway from the production network 1130 to the hidden network 1110. The hidden network 1110 represents an alternate world where normal behavior of network communications may be known by virtue of orchestration. The wormhole system 1125 transports the computer worm from a production network 1130 (e.g., the real world) where the computer worm is not easily identifiable, to the hidden network 1110 (e.g., the alternate world) where the computer worm's behavior is readily identifiable. In one embodiment, the wormhole system 1125 is removed in both space and time from the production network 1130.
[0103] In one embodiment, a goal of the worm sensor 1105 is to get a computer worm traveling in the production network 1130 to infect one of the wormhole systems 1125. Once a wormhole system 1125 has been infected, an intent is to get the computer worm to travel (e.g., propagate) inside the hidden network 1110. The hidden network 1110 may be instrumented to observe the computer worm's behavior and to track the computer worm's path. The hidden systems 1120 also serve to reveal a transport vector (e.g., transport propagation vector) of a multi-vector computer worm. An active computer worm may traverse (e.g., propagate) the hidden network 1110 using a variety of techniques, including dynamic assignment or network address translation (NAT) of probe addresses to the hidden systems 1120 coupled to the hidden network 1110, obtaining topological service information from the hidden network 1110, and entering other wormhole systems 1125 in the worm sensor 1110. In one embodiment, orchestration patterns initiated by an orchestration engine in the worm sensor 1105 serve to propagate a passive computer worm from a production network 1130 to the hidden network 1110 and within the hidden network 1110.
[0104] In one embodiment, the wormhole systems 1125 prevent normal network activity from causing any perturbations or anomalies in the hidden systems 1120 or hidden network 1110. For example, the wormhole system 1125 does not allow Internet Protocol (IP) level routing, does not have remote shell capabilities (e.g., Telnet), does not run application level gateways, does not pass directed broadcasts into the hidden network 1110, and does not pass multicast traffic into the hidden network 1110. A computer worm that infects a wormhole system 1125 can, however, cause anomalies in the hidden network 1110.
[0105] The orchestration pattern on the hidden network 1110 and between certain wormhole systems 1125 and production networks 1130 (e.g., production systems) can vary over time. In one embodiment, the orchestration pattern exercises all available services in the hidden network 1110. In another embodiment, the purpose of orchestration is to allow a passive computer worm to propagate to the hidden network 1110 and within the hidden network 1110 because a passive computer worm can only propagate on traffic initiated by others (e.g., other network communications). In still another embodiment, the purpose of orchestration is to prevent the computer worm from detecting that the computer worm is on a decoy network. For example, a computer worm may detect an inactive computer network, which may indicate that the computer network has no real purpose and is intended to be used as a computer worm decoy (e.g., a decoy network).
[0106] In one embodiment, orchestration is also intended to make anomaly detection in the hidden network simple and highly reliable. In this embodiment, all behavior (e.g., network communications) that is not part of a predetermined orchestration pattern on the hidden network represents an anomaly.
[0107] In one embodiment, both packet header and data contents of network packets are inspected for matching purposes during orchestration. This avoids false positive issues that are typical for anomaly detection systems that operate on unconstrained production networks 1130. To illustrate what is meant by reliable network anomaly detection, assume, for example, a network orchestration pattern that is expected to cause emission of a sequence of network packets (a, b, c, d) on the hidden network 1110. If the measured traffic is (a, b, c, d, e, f) on a particular orchestrated run, then (e, f) represent anomalous traffic in the hidden network. Such might be the case for an active computer worm propagating inside the hidden network 1110 once a wormhole system 1125 has been infected. As another example, assume that the measured traffic is (a, b′, c′, d), in which (b′, c′) represents anomalous traffic. Such might be the case for a passive computer worm propagating inside the hidden network 1110.
[0108] FIG. 2 depicts an exemplary embodiment of the controller 115. The controller 115 includes an extraction unit 200, an orchestration engine 205, a database 210, and a software configuration unit 215. The extraction unit 200, the orchestration engine 205, the database 210, and the software configuration unit 215 are in communication with each other and with the computer network 110 (FIG. 1 ). Optionally, the controller 115 includes a protocol sequence replayer 220 in communication with the computer network 110 and the traffic analysis device 135 (FIG. 1 ).
[0109] In various embodiments, the orchestration engine 205 controls the state and operation of the computer worm sensor 105 (FIG. 1 ). In one embodiment, the orchestration engine 205 configures the computing systems 120 (FIG. 1 ) and the gateway 125 (FIG. 1 ) to operate in a predetermined manner in response to network activities occurring in the computer network 110, and generates network activities in the computer network 110 and the communication network 130 (FIG. 1 ). In this way, the orchestration engine 205 orchestrates network activities in the computer network 110. For example, the orchestration engine 205 may orchestrate network activities in the computer network 110 by generating an orchestration sequence (e.g., a predetermined sequence of network activities) among various computing systems 120 in the computer network 110, including network traffic that typically occurs in the communication network 130.
[0110] In one embodiment, the orchestration engine 205 sends orchestration requests (e.g., orchestration patterns) to various orchestration agents (e.g., computing processes) in the computing systems 120. The orchestration agent of a computing system 120 performs a periodic sweep of computing services (e.g., network services) in the computing system 120 that are potential targets of a computer worm attack. The computing services in the computing system 120 may include typical network services (e.g., web service, FTP service, mail service, instant messaging, or Kazaa) that are also in the communication network 130.
[0111] The orchestration engine 205 may generate a wide variety of orchestration sequences to exercise a variety of computing services in the computer network 110, or may select orchestration patterns to avoid loading the computer network 110 with orchestrated network traffic. Additionally, the orchestration engine 205 may select the orchestration patterns to vary the orchestration sequences. In this way, a computer worm is prevented from scanning the computer network 110 to predict the behavior of the computer network 110.
[0112] In various embodiments, the software configuration unit 215 dynamically creates or destroys virtual machines (VMs) or VM software profiles in the computer network 110, and may initialize or update the software state of the VMs or VM software profiles. In this way, the software configuration unit 215 configures the computer network 110 such that the controller 115 can orchestrate network activities in the computer network 110 based on one or more orchestration patterns. It is to be appreciated that the software configuration unit 215 is optional in various embodiments of the computer worm sensor 105.
[0113] In various embodiments, the extraction unit 200 determines an identifier for detecting the computer worm. In these embodiments, the extraction unit 200 can extract a signature or a vector of the computer worm based on network activities (e.g., an anomalous behavior) occurring in the computer network 110, for example from data (e.g., data packets) in a network communication.
[0114] The database 210 stores data for the computer worm sensor 105, which may include a configuration state of the computer worm sensor 105. For example, the configuration state may include orchestration patterns or “golden” software images of computer programs (i.e., original software images uncorrupted by a computer worm exploit). The data stored in the database 210 may also include identifiers or recovery scripts for computer worms, or identifiers for the sources of computer worms in the communication network 130. The identifier for the source of each computer worm may be associated with the identifier and the recovery script of the computer worm.
[0115] The protocol sequence replayer 220 receives a network communication from the traffic analysis device 135 (FIG. 1 ) representing a network communication in the communication network 130 and replays (i.e., duplicates) the network communication in the computer network 110. The protocol sequence replayer 220 may receive the network communication from the traffic analysis device 135 via a private encrypted network (e.g., a virtual private network) within the communication network 130 or via another communication network. The controller 115 monitors the behavior of the computer network 110 in response to the network communication to determine a monitored behavior of the computer network 110 and determine whether the monitored behavior includes an anomalous behavior, as is described more fully herein.
[0116] In one embodiment, the protocol sequence replayer 220 includes a queue 225 for storing network communications. The queue 225 receives a network communication from the traffic analysis device 135 and temporarily stores the network communication until the protocol sequence replayer 220 is available to replay the network communication. In another embodiment, the protocol sequence replayer 220 is a computing system 120 in the computer network 110. For example, the protocol sequence replayer 220 may be a computer server including computer program code for replaying network communications in the computer network 110.
[0117] In another embodiment, the protocol sequence replayer 220 is in communication with a port (e.g., connected to a network port) of a network device in the communication network 130 and receives duplicated network communications occurring in the communication network 130 from the port. For example, the port can be a Switched Port Analyzer (SPAN) port of a network switch or a network router in the communication network 130, which duplicates network traffic in the communication network 130. In this way, various types of active and passive computer worms (e.g., hit-list directed, topologically-directed, server-directed, and scan-directed computer worms) may propagate from the communication network 130 to the computer network 110 via the duplicated network traffic.
[0118] The protocol sequence replayer 220 replays the data packets in the computer network 110 by sending the data packets to a computing system 120 having the same class (e.g., Linux or Windows platform) as the original target system of the data packets. In various embodiments, the protocol sequence replayer 220 synchronizes any return network traffic generated by the computing system 120 in response to the data packets. The protocol sequence replayer 220 may suppress (e.g., discard) the return network traffic such that the return network traffic is not transmitted to a host in the communication network 130. In one embodiment, the protocol sequence replayer 220 replays the data packets by sending the data packets to the computing system 120 via a TCP connection or UDP session. In this embodiment, the protocol sequence replayer 220 synchronizes return network traffic by terminating the TCP connection or UDP session.
[0119] The protocol sequence replayer 220 may modify destination IP addresses of data packets in the network communication to one or more IP addresses of the computing systems 120 and replay (i.e., generate) the modified data packets in the computer network 110. The controller 115 monitors the behavior of the computer network 110 in response to the modified data packets, and may detect an anomalous behavior in the monitored behavior, as is described more fully herein. If the controller 115 identifies an anomalous behavior, the computer network 110 is deemed to be infected with a computer worm and the controller 115 determines an identifier for the computer worm, as is described more fully herein.
[0120] The protocol sequence replayer 220 may analyze data packets in a sequence of network communications in the communication network 130 to identify a session identifier. The session identifier identifies a communication session for the sequence of network communications and can distinguish the network communications in the sequence from other network communications in the communication network 130. For example, each communication session in the communication network 130 can have a unique session identifier. The protocol sequence replayer 220 may identify the session identifier based on the communication protocol of the network communications in the sequence. For instance, the session identifier may be in a field of a data packet header as specified by the communication protocol. Alternatively, the protocol sequence replayer 220 may infer the session identifier from repeating network communications in the sequence. For example, the session identifier is typically one of the first fields in an application level communication between a client and a server (e.g., computing system 120) and is repeatedly used in subsequent communications between the client and the server.
[0121] The protocol sequence replayer 220 may modify the session identifier in the data packets of the sequence of network communications. The protocol sequence replayer 220 generates an initial network communication in the computer network 110 based on a selected network communication in the sequence, and the computer network 110 (e.g., a computing system 120) generates a response including a session identifier. The protocol sequence replayer 220 then substitutes the session identifier in the remaining data packets of the network communication with the session identifier of the response. In a further embodiment, the protocol sequence replayer 220 dynamically modifies session variables in the data packets, as is appropriate, to emulate the sequence of network communications in the computer network 110.
[0122] The protocol sequence replayer 220 may determine the software or hardware profile of a host (e.g., a computing system) in the communication network 130 to which the data packets of the network communication are directed. The protocol sequence replayer 220 then selects a computing system 120 in the computer network 110 that has the same software or hardware profile of the host and performs dynamic NAT on the data packets to redirect the data packets to the selected computing system 120. Alternatively, the protocol sequence replayer 220 randomly selects a computing system 120 and performs dynamic NAT on the data packets to redirect the data packets to the randomly selected computing system 120.
[0123] In one embodiment, the traffic analysis device 135 can identify a request (i.e., a network communication) from a web browser to a web server in the communication network 130, and a response (i.e., a network communication) from the web server to the web browser. In this case, the response may include a passive computer worm. The traffic analysis device 135 may inspect web traffic on a selected network link in the communication network 130 to identify the request and response. For example, the traffic analysis device 135 may select the network link or identify the request based on a policy. The protocol sequence replayer 220 orchestrates the request in the computer network 110 such that a web browser in a computing system 120 initiates a substantially similar request. In response to this request, the protocol sequence replayer 220 generates a response to the web browser in the computing system 120, which is substantially similar to the response generated by the browser in the communication network 130. The controller 115 then monitors the behavior of the web browser in the computing system 120 and may identify an anomalous behavior in the monitored behavior. If the controller 115 identifies an anomalous behavior, the computer network 110 is deemed to be infected with a passive computer worm.
[0124] In another embodiment, e.g., a shadow mode, the wormhole system 1125 in FIG. 11 is connected to a port (e.g., network port) where traffic on a computer network can be observed, duplicated, and sent to the wormhole system. This may typically be done on security policy automation network (SPAN) ports of switches or routers. These SPAN ports are used for network traffic monitoring purposes. In this embodiment, a wormhole system 1125 itself need not be visible on the computer network or have any other observables on the production network 1130. This kind of wormhole system 1125 may be an intended target of hit-list directed, topologically-directed, server-directed, scan-directed, and potentially other kinds of active computer worms as well as passive contagion computer worms.
[0125] There are several embodiments in which computer worm traffic going to systems on the production network 1130 can be used to trigger an infection of the wormhole system 1125 by using the monitored traffic. One embodiment may utilize a transport level redirection or synchronization. In this embodiment, the monitored packets are redirected via NAT towards a wormhole system 1125 that is the same class of machine as the target of the original packets (e.g., Linux or Windows). In case the software profile of the target of the production network system 1140 is not accurately known, then a shadow connection can be simultaneously attempted on multiple wormhole system 1125 targets representing commonly used platforms on the production network 1130 by making multiple copies of the monitored traffic. The return traffic from the wormhole system 1125 is simply suppressed, since only one party can be communicating with the remote node. This works for connections that are not dependent on the state of the systems. If the transport level synchronizer observes that the TCP connection or UDP session cannot be maintained, the transport level synchronizer disconnects the wormhole system 1125 TCP connection operating as a shadow of the original.
[0126] A computer worm exploit can depend upon software and widely used configurations of that software without depending upon the local data of the system or service being attacked. If the computer worm exploit sequence does not depend on the local data of the system or service being attacked (e.g., in order to evade this kind of a defense), then a computer worm exploit that can infect the system or service on a production network 1130 can also infect the wormhole system 1125 that may be shadowing the connection to the system or service.
[0127] For example, in the case of a file transfer protocol (FTP) server, the local data includes files on the FTP server. If the computer worm exploits a filename handling buffer overflow vulnerability in that FTP server, then an exploit sequence that simply connects to the FTP server and sends the exploit filename string can also infect the shadow of the FTP connection on the wormhole system 1125.
[0128] As another example, if the computer worm first gets a listing of files on the FTP server, retrieves some of the files (e.g., performs a get operation on some of the files), and then sends the exploit filename sequence, a transport level shadow synchronizer may not be able to keep the shadow wormhole system 1125 synchronized. This embodiment is an example of evasive computer worm behavior in which the computer worm may be attempting to circumvent a transport level shadow wormhole system synchronizer. Such an evasive computer worm can still be coerced into infecting a shadow wormhole system 1125 that uses an application level proxy (e.g., an application level proxy sitting on top of the monitored traffic on the SPAN port) for shadowing and synchronization purposes. For example, an FTP level proxy can intercept commands at the FTP level, send the FTP commands (e.g., list and get commands) to the shadow wormhole system, and discard the responses. Once the exploit sequence is sent to the shadow wormhole system 1125, the application level proxy will have succeeded in infecting the wormhole system 1125. Similar proxy synchronizers can be created for other network servers.
[0129] Various embodiment provide a useful mechanism to intercept a wide variety of computer worm infection strategies. The shadow wormhole system 1125 may serve to increase the probability of early detection of a computer worm, without requiring software or worm sensors 1105 on a per-host basis.
[0130] FIG. 3 depicts an exemplary computer worm detection system 300. The computer worm detection system 300 includes multiple computer worm sensors 105 and a sensor manager 305. Each of the computer worm sensors 105 is in communication with the sensor manager 305 and the communication network 130. The sensor manager 305 coordinates communications or operations between the computer worm sensors 105.
[0131] In one embodiment, each computer worm sensor 105 randomly blocks one or more ports of the computing systems 120. Accordingly, some of the computer worm sensors 105 may detect an anomalous behavior of a computer worm, as described more fully herein. The computer worm sensors 105 that detect an anomalous behavior communicate the anomalous behavior (e.g., a signature candidate) to the sensor manager 305. In turn, the sensor manager 305 correlates the anomalous behaviors and determines an identifier (e.g., a transport vector) for detecting the computer worm.
[0132] In some cases, a human intruder (e.g., a computer hacker) may attempt to exploit vulnerabilities that a computer worm would exploit in a computer worm sensor 105. The sensor manager 305 may distinguish an anomalous behavior of a human intruder from an anomalous behavior of a computer worm by tracking the number of computing systems 120 in the computer worm sensors 105 that detect a computer worm within a given period. If the number of computing systems 120 detecting a computer worm within the given period exceeds a predetermined threshold, the sensor manager 305 determines that a computer worm caused the anomalous behavior. Conversely, if the number of computing systems 120 detecting a computer worm within the given period is equal to or less than the predetermined threshold, the sensor manager 305 determines that a human intruder caused the anomalous behavior. In this way, false positive detections of the computer worm may be decreased.
[0133] In one embodiment, each computer worm sensor 105 maintains a list of infected hosts (e.g., computing systems infected by a computer worm) in the communication network 130 and communicates the list to the sensor manager 305. In this way, computer worm detection system 300 maintains a list of infected hosts detected by the computer worm sensors 105.
[0134] FIG. 4 depicts a flow chart for an exemplary method of detecting computer worms, in accordance with one embodiment of the present invention. In step 400, the computer worm sensor 105 (FIG. 1 ) orchestrates a sequence of network activities in the computer network 110 (FIG. 1 ). For example, the orchestration engine 205 (FIG. 2 ) of the computer worm sensor 105 can orchestrate the sequence of network activity in the computer network 110 based on one or more orchestration patterns, as is described more fully herein.
[0135] In step 405, the controller 115 (FIG. 1 ) of the computer worm sensor 105 monitors the behavior of the computer network 110 in response to the predetermined sequence of network activity. For example, the orchestration engine 205 (FIG. 2 ) of the computer worm sensor 105 can monitor the behavior of the computer network 110. The monitored behavior of the computer network 110 may include one or more network activities in addition to the predetermined sequence of network activities or network activities that differ from the predetermined sequence of network activities.
[0136] In step 410, the computer worm sensor 105 identifies an anomalous behavior in the monitored behavior to detect a computer worm. In one embodiment, the controller 115 identifies the anomalous behavior by comparing the predetermined sequence of network activities with network activities in the monitored behavior. For example, the orchestration engine 205 of the controller 115 can identify the anomalous behavior by comparing network activities in the monitored behavior with one or more orchestrated behaviors defining the predetermined sequence of network activities. The computer worm sensor 105 evaluates the anomalous behavior to determine whether the anomalous behavior is caused by a computer worm, as is described more fully herein.
[0137] In step 415, the computer worm sensor 105 determines an identifier for detecting the computer worm based on the anomalous behavior. The identifier may include a signature or a vector of the computer worm, or both. For example, the vector can be a transport vector, an attack vector, or a payload vector. In one embodiment, the extraction unit 200 of the computer worm sensor 105 determines the signature of the computer worm based on one or more signature candidates, as is described more fully herein. It is to be appreciated that step 415 is optional in accordance with various embodiments of the computer worm sensor 105.
[0138] In step 420, the computer worm sensor 105 generates a recovery script for the computer worm. An infected host (e.g., an infected computing system or network) can then execute the recovery script to disable (e.g., destroy) the computer worm in the infected host or repair damage to the host caused by the computer worm. The computer worm sensor 105 may also identify a host in the communication network 130 that is the source of the computer worm and provides the recovery script to the host such that the host can disable the computer worm and repair damage to the host caused by the computer worm.
[0139] In one embodiment, the controller 115 determines a current image of the file system in the computer system 120, and compares the current image with an original image of the file system in the computer system 120 to identify any discrepancies between the current image and the original image. The controller 115 then generates the recovery script based on these discrepancies. The recovery script includes computer program code for identifying infected software programs or memory locations based on the discrepancies, and removing the discrepancies from infected software programs or memory locations.
[0140] FIG. 5 depicts an exemplary embodiment of a computer worm containment system 500 comprising a computer worm sensor 105 in communication with a computer worm blocking system, shown here as a single blocking device 510, over a communication network 130. The blocking device 510 is configured to protect one or more computer system 520. Although the blocking device 510 is shown in FIG. 5 as integrated within the computer system 520, the blocking device 510 can also be implemented as a network appliance between the computer system 520 and the communication network 130. It will be appreciated that the blocking device 510 can also be in communication with more than one computer worm sensor 105 across the communication network 130. Further, although the communication network 130 is illustrated as being distinct from the computer system 520, the computer system 520 can also be a component of the communication network 130.
[0141] Additionally, the computer worm containment system 500 can comprise multiple blocking devices 510 in communication with one or more computer worm blocking managers (not shown) across the communication network 130 in analogous fashion to the computer worm detection system 300 of FIG. 3 . The computer worm blocking managers coordinate communications and operations between the blocking devices 510. In general, computer worm sensors 105 and blocking devices 510 may be collocated, or they may be implemented on separate devices, depending on the network environment. In one embodiment, communications between the computer worm sensors 105, the sensor manager 305, the blocking devices 510, and the computer worm blocking managers are cryptographically authenticated.
[0142] In one embodiment, the blocking device 510 loads a computer worm signature into a content filter operating at the network level to block the computer worm from entering the computer system 520 from the communication network 130. In another embodiment, the blocking device 510 blocks a computer worm transportation vector in the computer system 520 by using transport level action control lists (ACLs) in the computer system 520.
[0143] More specifically, the blocking device 510 can function as a network interface between the communication network 130 and the corresponding computer system 520. For example, a blocking device 510 can be an inline signature based Intrusion Detection and Protection (IDP) system, as would be recognized by one skilled in the art. As another example, the blocking device 510 can be a firewall, network switch, or network router that includes content filtering or ACL management capabilities.
[0144] An effective computer worm quarantine may require a proper network architecture to ensure that blocking measures are effective in containing the computer worm. For example, if there are content filtering devices or transport level ACL devices protecting a set of subnets on the computer system 520, then there should not be another path from the computer system 520 on that subnet that does not pass through the filtering device.
[0145] Assuming that the communication network 130 is correctly partitioned, the function of the blocking device 510 is to receive a computer worm identifier, such as a signature list or transport vector, from the computer worm sensor 105 and configure the appropriate filtering devices. These filtering devices can be commercially available switches, routers, or firewalls obtainable from any of a number of network equipment vendors, or host-based solutions that provide similar functionality. In some embodiments, ACLs are used to perform universal blocking of those transport ports for the computer system 520 under protection. For example, traffic originating from a given source IP and intended for a given destination IP with the destination port matching a transport port in the transport vector can be blocked.
[0146] Another class of filtering is content based filtering, in which the filtering devices inspect the contents of the data past the TCP or UDP header of a data packet to check for particular data sequences. Examples of content filtering devices are routers in the class of the Cisco™ routers that use Network Based Application Recognition (NBAR) to classify and apply a policy to packets (e.g., reduce the priority of the packets or discard the packets). These types of filtering devices can be useful to implement content filtering at appropriate network points.
[0147] In one embodiment, host-based software is deployed on an enterprise scale to perform content filtering in the context of host-based software. In this embodiment, ACL specifications (e.g., vendor independent ACL specifications) and content filtering formats (e.g., eXtensible Markup Language or XML format) are communicated to the blocking devices 510, which in turn dynamically configure transport ACLs or content filters for network equipment and host software of different vendors.
[0148] FIG. 6 depicts a computer worm defense system of the present invention that comprises a plurality of separate computer worm containment systems 500 coupled to a management system 600. Each of the plurality of computer worm containment systems 500 includes a computer worm sensor 105 in communication over a communication network 130 with a computer worm blocking system, again represented by a single blocking device 510 configured to protect a computer system 520. The management system 600 communicates with both the computer worm sensors 105 and the blocking systems of the various computer worm containment systems 500.
[0149] Each computer worm containment system 500 is associated with a subscriber having a subscriber account that is maintained and managed by the management system 600. The management system 600 provides various computer worm defense services that allow the subscribers to obtain different levels of protection from computer worms, computer viruses, and other malicious code, based on levels of payment, for example.
[0150] The management system 600 interacts with the computer worm sensors 105 of the various computer worm containment systems 500 in several ways. For example, the management system 600 can activate and deactivate computer worm sensors 105 based on payment or the lack thereof by the associated subscriber. The management system 600 also obtains identifiers of computer worms and repair scripts from the various computer worm sensors 105 and distributes these identifiers to other computer worm containment systems 500. The management system 600 can also distribute system updates as needed to controllers 115 (not shown) of the computer worm sensors 105. It will be appreciated that the computer worm defense system of the invention benefits from having a distributed set of computer worm sensors 105 in a widely distributed set of environments, compared to a centralized detection system, because computer worms are more likely to be detected sooner by the distributed set of computer worm sensors 105. Accordingly, in some embodiments it is advantageous to not deactivate a computer worm sensor 105 upon non-payment by a subscriber.
[0151] The management system 600 also interacts with the computer worm blocking systems of the various computer worm containment systems. Primarily, the management system 600 distributes computer worm identifiers found by computer worm sensors 105 of other computer worm containment systems 500 to the remaining computer worm blocking systems. In some embodiments the distribution is performed automatically as soon as the identifiers become known to the management system 600. However, in other embodiments, perhaps based on lower subscription rates paid by subscribers, newly found computer worm identifiers are distributed on a periodic basis such as daily or weekly. Similarly, the distribution of repair scripts to the various computer worm containment systems can also be controlled by the management system 600. In some embodiments, identifiers and/or repair scripts are distributed to subscribers by CD-ROM or similar media rather than automatically over a network such as the Internet.
[0152] In one embodiment, payment for the computer worm defense service is based on a periodic (e.g., monthly or annual) subscription fee. Such a fee can be based on the size of the enterprise being protected by the subscriber's computer worm containment system 500, where the size can be measured, for example, by the number of computer systems 520 therein. In another embodiment, a subscriber pays a fee for each computer worm identifier that is distributed to a computer worm containment system associated with the subscriber. In still another embodiment, payment for the computer worm defense service is based on a combination of a periodic subscription fee and a fee for each computer worm identifier received from the computer worm defense service. In yet another embodiment, subscribers receive a credit for each computer worm identifier that originates from a computer worm sensor 105 of their computer worm containment system 500.
[0153] FIG. 7 depicts an unauthorized activity detection system 700, in accordance with one embodiment of the present invention. The unauthorized activity detection system 700 comprises a source device 705, a destination device 710, and a tap 715, each coupled to a communication network 720. The tap 715 is further coupled to a controller 725.
[0154] The source device 705 and the destination device 710 are digital devices. Some examples of digital devices include computers, servers, laptops, personal digital assistants, and cellular telephones. The source device 705 is configured to transmit network data over the communication network 720 to the destination device 710. The destination device 710 is configured to receive the network data from the source device 705.
[0155] The tap 715 is a digital data tap configured to monitor network data and provide a copy of the network data to the controller 725. Network data comprises signals and data that are transmitted over the communication network 720 including data flows from the source device 705 to the destination device 710. In one example, the tap 715 intercepts and copies the network data without an appreciable decline in performance of the source device 705, the destination device 710, or the communication network 720. The tap 715 can copy any portion of the network data. For example, the tap 715 can receive and copy any number of data packets from the network data.
[0156] In some embodiments, the network data can be organized into one or more data flows and provided to the controller 725. In various embodiments, the tap 715 can sample the network data based on a sampling scheme. Data flows can then be reconstructed based on the network data samples.
[0157] The tap 715 can also capture metadata from the network data. The metadata can be associated with the source device 705 and the destination device 710. The metadata can identify the source device 705 and/or the destination device 710. In some embodiments, the source device 705 transmits metadata which is captured by the tap 715. In other embodiments, the heuristic module 730 (described herein) can determine the source device 705 and the destination device 710 by analyzing data packets within the network data in order to generate the metadata.
[0158] The communication network 720 can be similar to the communication network 130 (FIG. 1 ). The communication network 720 can be a public computer network such as the Internet, or a private computer network such as a wireless telecommunication network, wide area network, or local area network.
[0159] The controller 725 can be any digital device or software that receives network data from the tap 715. In some embodiments, the controller 725 is contained within the computer worm sensor 105 (FIG. 1 ). In other embodiments, the controller 725 may be contained within a separate traffic analysis device 135 (FIG. 1 ) or a stand-alone digital device. The controller 725 can comprise a heuristic module 730, a scheduler 735, a fingerprint module 740, a virtual machine pool 745, an analysis environment 750, and a policy engine 755. In some embodiments, the tap 715 can be contained within the controller 725.
[0160] The heuristic module 730 receives the copy of the network data from the tap 715. The heuristic module 730 applies heuristics and/or probability analysis to determine if the network data might contain suspicious activity. In one example, the heuristic module 730 flags network data as suspicious. The network data can then be buffered and organized into a data flow. The data flow is then provided to the scheduler 735. In some embodiments, the network data is provided directly to the scheduler 735 without buffering or organizing the data flow.
[0161] The heuristic module 730 can perform any heuristic and/or probability analysis. In one example, the heuristic module 730 performs a dark internet protocol (IP) heuristic. A dark IP heuristic can flag network data coming from a source device 705 that has not previously been identified by the heuristic module 730. The dark IP heuristic can also flag network data going to a previously unused port address. In an example, an attacker scans random IP addresses of a network to identify an active server or workstation. The dark IP heuristic can flag network data directed to an unassigned IP address.
[0162] The heuristic module 730 can also perform a dark port heuristic. A dark port heuristic can flag network data transmitted to an unassigned or unusual port address. In one example, network data is transmitted to a previously unused (or unseen) port address. Such network data transmitted to an unusual port can be indicative of a port scan by a worm or hacker. Further, the heuristic module 730 can flag network data from the source device 705 that are significantly different than traditional data traffic transmitted by the source device 705. For example, the heuristic module 730 can flag network data from a source device 705 such as a laptop that begins to transmit network data that is common to a server.
[0163] The heuristic module 730 can retain data packets belonging to a particular data flow previously copied by the tap 715. In one example, the heuristic module 730 receives data packets from the tap 715 and stores the data packets within a buffer or other memory. Once the heuristic module 730 receives a predetermined number of data packets from a particular data flow, the heuristic module 730 performs the heuristics and/or probability analysis.
[0164] In some embodiments, the heuristic module 730 performs heuristic and/or probability analysis on a set of data packets belonging to a data flow and then stores the data packets within a buffer or other memory. The heuristic module 730 can then continue to receive new data packets belonging to the same data flow. Once a predetermined number of new data packets belonging to the same data flow are received, the heuristic and/or probability analysis can be performed upon the combination of buffered and new data packets to determine a likelihood of suspicious activity.
[0165] In some embodiments, an optional buffer receives the flagged network data from the heuristic module 730. The buffer can buffer and organize the flagged network data into one or more data flows before providing the one or more data flows to the scheduler 735. In various embodiments, the buffer can buffer network data and stall before providing the network data to the scheduler 735. In one example, the buffer stalls the network data to allow other components of the controller 725 time to complete functions or otherwise clear data congestion.
[0166] The scheduler 735 identifies the destination device 710 and retrieves a virtual machine associated with the destination device 710. A virtual machine is software that is configured to mimic the performance of a device (e.g., the destination device 710). The virtual machine can be retrieved from the virtual machine pool 745.
[0167] In some embodiments, the heuristic module 730 transmits the metadata identifying the destination device 710 to the scheduler 735. In other embodiments, the scheduler 735 receives one or more data packets of the network data from the heuristic module 730 and analyzes the one or more data packets to identify the destination device 710. In yet other embodiments, the metadata can be received from the tap 715.
[0168] The scheduler 735 can retrieve and configure the virtual machine to mimic the pertinent performance characteristics of the destination device 710. In one example, the scheduler 735 configures the characteristics of the virtual machine to mimic only those features of the destination device 710 that are affected by the network data copied by the tap 715. The scheduler 735 can determine the features of the destination device 710 that are affected by the network data by receiving and analyzing the network data from the tap 715. Such features of the destination device 710 can include ports that are to receive the network data, select device drivers that are to respond to the network data and any other devices coupled to or contained within the destination device 710 that can respond to the network data. In other embodiments, the heuristic module 730 can determine the features of the destination device 710 that are affected by the network data by receiving and analyzing the network data from the tap 715. The heuristic module 730 can then transmit the features of the destination device to the scheduler 735.
[0169] The optional fingerprint module 740 is configured to determine the packet format of the network data to assist the scheduler 735 in the retrieval and/or configuration of the virtual machine. In one example, the fingerprint module 740 determines that the network data is based on a transmission control protocol/internet protocol (TCP/IP). Thereafter, the scheduler 735 will configure a virtual machine with the appropriate ports to receive TCP/IP packets. In another example, the fingerprint module 740 can configure a virtual machine with the appropriate ports to receive user datagram protocol/internet protocol (UDP/IP) packets. The fingerprint module 740 can determine any type of packet format of network data.
[0170] The virtual machine pool 745 is configured to store virtual machines. The virtual machine pool 745 can be any storage capable of storing software. In one example, the virtual machine pool 745 stores a single virtual machine that can be configured by the scheduler 735 to mimic the performance of any destination device 710 on the communication network 720. The virtual machine pool 745 can store any number of distinct virtual machines that can be configured to simulate the performance of any destination devices 710.
[0171] The analysis environment 750 simulates transmission of the network data between the source device 705 and the destination device 710 to analyze the effects of the network data upon the destination device 710. The analysis environment 750 can identify the effects of malware or illegitimate computer users (e.g., a hacker, computer cracker, or other computer user) by analyzing the simulation of the effects of the network data upon the destination device 710 that is carried out on the virtual machine. There can be multiple analysis environments 750 to simulate multiple network data. The analysis environment 750 is further discussed with respect to FIG. 8 .
[0172] The optional policy engine 755 is coupled to the heuristic module 730 and can identify network data as suspicious based upon policies contained within the policy engine 755. In one example, a destination device 710 can be a computer designed to attract hackers and/or worms (e.g., a “honey pot”). The policy engine 755 can contain a policy to flag any network data directed to the “honey pot” as suspicious since the “honey pot” should not be receiving any legitimate network data. In another example, the policy engine 755 can contain a policy to flag network data directed to any destination device 710 that contains highly sensitive or “mission critical” information.
[0173] The policy engine 755 can also dynamically apply a rule to copy all network data related to network data already flagged by the heuristic module 730. In one example, the heuristic module 730 flags a single packet of network data as suspicious. The policy engine 755 then applies a rule to flag all data related to the single packet (e.g., data flows) as suspicious. In some embodiments, the policy engine 755 flags network data related to suspicious network data until the analysis environment 750 determines that the network data flagged as suspicious is related to unauthorized activity.
[0174] Although FIG. 7 depicts data transmitted from the source device 705 to the destination device 710, either device can transmit and receive data from the other. Similarly, although only two devices are depicted, any number of devices can send and/or receive data across the communication network 720. Moreover, the tap 715 can monitor and copy data transmitted from multiple devices without appreciably effecting the performance of the communication network 720 or the devices coupled to the communication network 720.
[0175] FIG. 8 depicts an analysis environment 750, in accordance with one embodiment of the present invention. The analysis environment 750 comprises a replayer 805, a virtual switch 810, and a virtual machine 815. The replayer 805 receives network data that has been flagged by the heuristic module 730 and replays the network data in the analysis environment 750. The replayer 805 is similar to the protocol sequence replayer 220 (FIG. 2 ). In some embodiments, the replayer 805 mimics the behavior of the source device 705 in transmitting the flagged network data. There can be any number of replayers 805 simulating network data between the source device 705 and the destination device 710. In a further embodiment, the replayer dynamically modifies session variables, as is appropriate, to emulate a “live” client or server of the protocol sequence being replayed. In one example, dynamic variables that may be dynamically substituted include dynamically assigned ports, transaction IDs, and any other variable that is dynamic to each protocol session.
[0176] The virtual switch 810 is software that is capable of forwarding packets of flagged network data to the virtual machine 815. In one example, the replayer 805 simulates the transmission of the data flow by the source device 705. The virtual switch 810 simulates the communication network 720 and the virtual machine 815 simulates the destination device 710. The virtual switch 810 can route the data packets of the data flow to the correct ports of the virtual machine 815.
[0177] The virtual machine 815 is a representation of the destination device that can be provided to the analysis environment 750 by the scheduler 735. In one example, the scheduler 735 retrieves a virtual machine 815 from the virtual machine pool 745 and configures the virtual machine 815 to mimic a destination device 710. The configured virtual machine 815 is then provided to the analysis environment 750 where it can receive flagged network data from the virtual switch 810.
[0178] As the analysis environment 750 simulates the transmission of the network data, behavior of the virtual machine 815 can be closely monitored for unauthorized activity. If the virtual machine 815 crashes, performs illegal operations, performs abnormally, or allows access of data to an unauthorized computer user, the analysis environment 750 can react. In one example, the analysis environment 750 can transmit a command to the destination device 710 to stop accepting the network data or data flows from the source device 705.
[0179] In some embodiments, the analysis environment 750 monitors and analyzes the behavior of the virtual machine 815 in order to determine a specific type of malware or the presence of an illicit computer user. The analysis environment 750 can also generate computer code configured to eliminate new viruses, worms, or other malware. In various embodiments, the analysis environment 750 can generate computer code configured to repair damage performed by malware or the illicit computer user. By simulating the transmission of suspicious network data and analyzing the response of the virtual machine, the analysis environment 750 can identify known and previously unidentified malware and the activities of illicit computer users before a computer system is damaged or compromised.
[0180] FIG. 9 depicts a flow chart for a method of detecting unauthorized activity, in accordance with one embodiment of the present invention. In step 900, network data is copied. For example, the network data can be copied by a tap, such as the tap 715. In some embodiments, the tap 715 can be coupled directly to the source device 705, the destination device 710, or the communication network 720.
[0181] In step 905, the network data is analyzed to determine whether the network data is suspicious. For example, a heuristic module, such as the heuristic module 730, can analyze the network data. The heuristic module can base the determination on heuristic and/or probabilistic analyses. In various embodiments, the heuristic module has a very low threshold to determine whether the network data is suspicious. For example, a single command within the network data directed to an unusual port of the destination device can cause the network data to be flagged as suspicious.
[0182] Step 905 can alternatively include flagging network data as suspicious based on policies such as the identity of a source device, a destination device, or the activity of the network data. In one example, even if the heuristic module does not flag the network data, the network data can be flagged as suspicious based on a policy if the network data was transmitted from a device that does not normally transmit network data. Similarly, based on another policy, if the destination device contains trade secrets or other critical data, then any network data transmitted to the destination device can be flagged suspicious. Similarly, if the network data is directed to a particularly important database or is attempting to gain rights or privileges within the communication network or the destination device, then the network data can be flagged as suspicious. In various embodiments, the policy engine 755 flags network data based on these and/or other policies.
[0183] In step 910, the transmission of the network data is orchestrated to analyze unauthorized activity. In one example, the transmission of the network data over a network is simulated to analyze the resulting action of the destination device. The simulation can be monitored and analyzed to identify the effects of malware or illegitimate computer use.
[0184] FIG. 10 depicts a flow chart for a method for orchestrating the transmission of network data, in accordance with one embodiment of the present invention. In step 1000, the replayer 805 within the analysis environment 750 is configured to perform as the source device 705. In one example, the replayer 805 simply transmits the flagged network data to simulate network data transmission. There can be multiple replayers 805 transmitting different network data from a single source device 705. Alternately, there can be multiple replayers 805 that mimic different source devices 705 that transmit different network data.
[0185] In step 1005, a virtual machine 815 is retrieved and configured to mimic the destination device 710. The scheduler 735 identifies the destination device 710 and retrieves a virtual machine 815 from the virtual machine pool 745. In some embodiments, the scheduler 735 further configures the virtual machine 815 to mimic the performance characteristics of the destination device 710. The scheduler 735 then transmits the virtual machine 815 to the analysis environment 750.
[0186] In step 1010, the analysis environment 750 replays transmission of the network data between the configured replayer 805 and the virtual machine 815 to detect unauthorized activity. The replayer 805 is configured to simulate the source device 705 transmitting the network data and the virtual machine 815 is configured to mimic the features of the destination device 710 that is affected by the network data. The virtual switch 810 can simulate the communication network 720 in delivering the network data to the destination device 710.
[0187] As the transmission of the network data on the model destination device 710 is simulated, results are monitored to determine if the network data is generated by malware or activity generated by illegitimate computer use. In one example, if the network data attempts to replicate programs within the virtual machine 815, then a virus can be identified. In another example, if the network data constantly attempts to access different ports of the virtual machine 815, then a worm or hacker can be identified.
[0188] Since the effects of network data transmission are simulated and the result analyzed, the controller 725 need not wait for repetitive behavior of malware or computer hackers before detecting their presence. In some examples of the prior art, new viruses and hackers are detected only upon multiple events that cause similar damage. By contrast, in some embodiments, a single data flow can be flagged and identified as harmful within a simulation thereby identifying malware, hackers, and unwitting computer users before damage is done.
[0189] In the foregoing specification, the invention is described with reference to specific embodiments thereof, but those skilled in the art will recognize that the invention is not limited thereto. Various features and aspects of the above-described invention can be used individually or jointly. Further, the invention can be utilized in any number of environments and applications beyond those described herein without departing from the broader spirit and scope of the specification. The specification and drawings are, accordingly, to be regarded as illustrative rather than restrictive. It will be recognized that the terms “comprising,” “including,” and “having,” as used herein, are specifically intended to be read as open-ended terms of art.
Claims
What is claimed is:
1. A system comprising:
one or more network devices including a first network device configured to receive a portion of network traffic, the first network device comprises one or more virtual machines that, based on a subscribed protection level, performs operations in response to a processing of the received portion of the analyzed network traffic, the first network device being further configured to (i) monitor behaviors of the one or more virtual machines during processing of the portion of the analyzed network traffic, (ii) detect whether at least a behavior of the behaviors is anomalous, and (iii) generate an identifier for malware being part of the portion of the analyzed network in response to at least the detected behavior; and
a management system communicatively coupled to the one or more network devices, the management system to control a setting of the subscribed protection level for the first network device that controls a frequency of receipt of identifiers associated with analyzed network traffic from a second network device of the one or more network devices by the first network device, the second network device being different from the first network device.
2. The system of claim 1, wherein the detected behavior corresponds to one of (i) a communication anomaly, including an unexpected network communication performed by the first network device or (ii) an execution anomaly, including an unexpected execution of computer program code.
3. The system of claim 1, wherein the identifier includes a signature of the malware.
4. The system of claim 1, wherein the management system to distribute the identifiers to the first network device in accordance with a first distribution scheme when the first network device is set to a first subscribed protection level and to distribute the identifiers to the first network device in accordance with a second distribution scheme when the first network device is set to a second subscribed protection level, the second subscribed protection level being a lower level than the first subscribed protection level.
5. The system of claim 4, wherein the first distribution scheme includes a distribution of the identifiers once the management system becomes aware of the identifiers while the second distribution scheme is a distribution slower than the distribution of the identifiers once the management system becomes aware of the identifiers.
6. The system of claim 5, wherein the second distribution scheme includes the distribution that is periodic on a temporal basis.
7. The system of claim 1, wherein the management system to control the setting of the subscribed protection level for the first network device to (i) receive the identifiers originating from at least the second network device of the one or more network devices in accordance with a first distribution scheme in response to payment of a first subscription rate or (ii) receive the identifiers originating from at least the second network device of the one or more network devices in accordance with a second distribution scheme in response to payment of a second subscription rate, the first distribution scheme occurring at a faster response time than the second distribution scheme and the first subscription rate being a greater amount of payment than the second subscription rate.
8. The system of claim 1, wherein the management system to control the setting of the subscribed protection level for the first network device by deactivating the first network device in response to a failure to pay a subscription fee or activating the first network device in response to payment of the subscription fee.
9. The system of claim 8, wherein the management system to apply credits to the subscription fee in response to receipt of the identifier originating from the first network device and to subsequently transmit the identifier to another network device of the one or more network devices.
10. The system of claim 1, wherein the management system to receive the identifier from the first network device and distribute the identifier to a computer system for use in disabling operations of malware residing within the computer system.
11. The system of claim 1, wherein the management system to receive one or more repair scripts from the first network device and distribute the one or more repair scripts to a computer system for use in repairing software infected by malware residing in the computer system.
12. A network device adapted for communicative coupling with a management system, the network device comprising:
one or more virtual machines configured to perform operations in response to a processing of a portion of received network traffic; and
a controller device communicatively coupled to the one or more virtual machines, the controller device to (i) monitor behaviors of the one or more virtual machines during processing of the portion of the received network traffic and (ii) determine, based on the monitored behaviors, whether a first computer system communicatively coupled to the network device is subject to an attack,
wherein a level of service provided by the network device in protecting a network including at least the first computer system against the attack is set by the management system based on a selected subscription rate for the network device, the selected subscription rate controls a frequency in receipt of identifiers associated with malware detected by a second network device different than the network device.
13. The network device of claim 12, wherein the selected subscription rate is based on a size of the network being protected by the network device, the size being determined based on a number of computer systems including the first computer system within the network.
14. The network device of claim 13, the management system being configured to allow a subscriber of a plurality of subscribers to obtain different levels of service in protecting computer systems associated with the subscriber, each of the plurality of subscribers having a subscriber account managed by the management system.
15. The network device of claim 12, wherein the management system to control a setting of the level of service for the network device that alters the frequency of receipt of identifiers, each of the identifiers includes a signature or a vector associated with a detected malware.
16. The network device of claim 15, wherein the controller to further generate one or more identifiers for transmission to the management system, the one or more identifiers being distributed by the management system to the second network device.
17. The network device of claim 12, wherein the controller to generate one or more repair scripts for transmission to the management system that initiates a repair of software infected by malware residing in the first computer system.
18. The network device of claim 12, wherein the controller to generate an identifier for the portion of the received network traffic associated with the monitored behaviors that identify that the first computer system communicatively coupled to the network device is subject to the attack.
19. A system for detecting and blocking malware, comprising:
a network that comprises a plurality of computer systems including a first computer system;
a network device including one or more virtual machines configured to perform operations during processing of a portion of received network traffic and a controller, communicatively coupled to the one or more virtual machines, to (i) monitor behaviors of the one or more virtual machines during processing of the portion of the received network traffic and (ii) determine, based on the monitored behaviors, whether the first computer system that is part of the network is subject to an attack; and
a management system communicatively coupled to the network device, the management system to continue to provide a level of protection that includes continued activation of the network device in processing a second portion of the received network traffic received subsequent to the portion of the received network traffic based on a receipt of a payment of a subscription fee, the subscription fee being based, at least in part, on a size of the subscriber network.
20. The system of claim 19, wherein the size of the subscriber network is determined based, at least in part, on a number of the plurality of computer systems including the first computer system within the subscriber network.
21. The system of claim 19, wherein the controller of the network device to generate one or more repair scripts for transmission to the management system that initiates a repair of software infected by malware residing in the first computer system.
Patent Citations (626)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4292580(A) | 1981-09-01 | Ott et al. | Applicant |
| US5175732(A) | 1992-12-01 | Hendel et al. | Applicant |
| US5440723(A) | 1995-08-01 | Arnold et al. | Applicant |
| US5490249(A) | 1996-02-01 | Miller | Applicant |
| US5657473(A) | 1997-08-01 | Killean et al. | Applicant |
| US5842002(A) | 1998-11-01 | Schnurer et al. | Applicant |
| US5978917(A) | 1999-11-01 | Chi | Applicant |
| US6088803(A) | 2000-07-01 | Tso et al. | Applicant |
| US6094677(A) | 2000-07-01 | Capek et al. | Applicant |
| US6108799(A) | 2000-08-01 | Boulay et al. | Applicant |
| US6118382(A) | 2000-09-01 | Hibbs et al. | Applicant |
| US6269330(B1) | 2001-07-01 | Cidon et al. | Applicant |
| US6272641(B1) | 2001-08-01 | Ji | Applicant |
| US6279113(B1) | 2001-08-01 | Vaidya | Applicant |
| US6298445(B1) | 2001-10-01 | Shostack et al. | Applicant |
| US6357008(B1) | 2002-03-01 | Nachenberg | Applicant |
| US6417774(B1) | 2002-07-01 | Hibbs et al. | Applicant |
| US6424627(B1) | 2002-07-01 | Sørhaug et al. | Applicant |
| US6442696(B1) | 2002-08-01 | Wray et al. | Applicant |
| US6484315(B1) | 2002-11-01 | Ziese | Applicant |
| US6487666(B1) | 2002-11-01 | Shanklin et al. | Applicant |
| US6493756(B1) | 2002-12-01 | O'Brien et al. | Applicant |
| US6550012(B1) | 2003-04-01 | Villa et al. | Applicant |
| US6700497(B2) | 2004-03-01 | Hibbs et al. | Applicant |
| US6775657(B1) | 2004-08-01 | Baker | Applicant |
| US6831893(B1) | 2004-12-01 | Ben Nun et al. | Applicant |
| US6832367(B1) | 2004-12-01 | Choi et al. | Applicant |
| US6895550(B2) | 2005-05-01 | Kanchirayappa et al. | Applicant |
| US6898632(B2) | 2005-05-01 | Gordy et al. | Applicant |
| US6907396(B1) | 2005-06-01 | Muttik et al. | Applicant |
| US6941348(B2) | 2005-09-01 | Petry et al. | Applicant |
| US6971097(B1) | 2005-11-01 | Wallman | Applicant |
| US6981279(B1) | 2005-12-01 | Arnold et al. | Applicant |
| US6995665(B2) | 2006-02-01 | Appelt et al. | Applicant |
| US7007107(B1) | 2006-02-01 | Ivchenko et al. | Applicant |
| US7028179(B2) | 2006-04-01 | Anderson et al. | Applicant |
| US7043757(B2) | 2006-05-01 | Hoefelmeyer et al. | Applicant |
| US7069316(B1) | 2006-06-01 | Gryaznov | Applicant |
| US7080407(B1) | 2006-07-01 | Zhao et al. | Applicant |
| US7080408(B1) | 2006-07-01 | Pak et al. | Applicant |
| US7093002(B2) | 2006-08-01 | Wolff et al. | Applicant |
| US7093239(B1) | 2006-08-01 | van der Made | Applicant |
| US7096498(B2) | 2006-08-01 | Judge | Applicant |
| US7100201(B2) | 2006-08-01 | Izatt | Applicant |
| US7107617(B2) | 2006-09-01 | Hursey et al. | Applicant |
| US7146305(B2) | 2006-12-01 | van der Made | Examiner |
| US7159149(B2) | 2007-01-01 | Spiegel et al. | Applicant |
| US7213260(B2) | 2007-05-01 | Judge | Applicant |
| US7231667(B2) | 2007-06-01 | Jordan | Applicant |
| US7240364(B1) | 2007-07-01 | Branscomb et al. | Applicant |
| US7240368(B1) | 2007-07-01 | Roesch et al. | Applicant |
| US7243371(B1) | 2007-07-01 | Kasper et al. | Applicant |
| US7249175(B1) | 2007-07-01 | Donaldson | Applicant |
| US7251215(B1) | 2007-07-01 | Turner | Examiner |
| US7287278(B2) | 2007-10-01 | Liang | Applicant |
| US7308716(B2) | 2007-12-01 | Danford et al. | Applicant |
| US7328453(B2) | 2008-02-01 | Merkle, Jr. et al. | Applicant |
| US7346486(B2) | 2008-03-01 | Ivancic et al. | Applicant |
| US7356736(B2) | 2008-04-01 | Natvig | Applicant |
| US7386888(B2) | 2008-06-01 | Liang et al. | Applicant |
| US7392542(B2) | 2008-06-01 | Bucher | Applicant |
| US7418729(B2) | 2008-08-01 | Szor | Applicant |
| US7428300(B1) | 2008-09-01 | Drew et al. | Applicant |
| US7441272(B2) | 2008-10-01 | Durham et al. | Applicant |
| US7448084(B1) | 2008-11-01 | Apap et al. | Applicant |
| US7458098(B2) | 2008-11-01 | Judge et al. | Applicant |
| US7464404(B2) | 2008-12-01 | Carpenter et al. | Applicant |
| US7464407(B2) | 2008-12-01 | Nakae et al. | Applicant |
| US7467408(B1) | 2008-12-01 | O'Toole, Jr. | Examiner |
| US7478428(B1) | 2009-01-01 | Thomlinson | Applicant |
| US7480773(B1) | 2009-01-01 | Reed | Applicant |
| US7487543(B2) | 2009-02-01 | Arnold et al. | Applicant |
| US7496960(B1) | 2009-02-01 | Chen et al. | Applicant |
| US7496961(B2) | 2009-02-01 | Zimmer et al. | Applicant |
| US7516488(B1) | 2009-04-01 | Kienzle et al. | Applicant |
| US7519990(B1) | 2009-04-01 | Xie | Applicant |
| US7523493(B2) | 2009-04-01 | Liang et al. | Applicant |
| US7530104(B1) | 2009-05-01 | Thrower et al. | Applicant |
| US7540025(B2) | 2009-05-01 | Tzadikario | Applicant |
| US7565550(B2) | 2009-07-01 | Liang et al. | Applicant |
| US7568233(B1) | 2009-07-01 | Szor et al. | Applicant |
| US7584455(B2) | 2009-09-01 | Ball | Applicant |
| US7603715(B2) | 2009-10-01 | Costa et al. | Applicant |
| US7607171(B1) | 2009-10-01 | Marsden et al. | Applicant |
| US7639714(B2) | 2009-12-01 | Stolfo et al. | Applicant |
| US7644441(B2) | 2010-01-01 | Schmid et al. | Applicant |
| US7650639(B2) | 2010-01-01 | Kramer et al. | Applicant |
| US7657419(B2) | 2010-02-01 | van der Made | Applicant |
| US7676841(B2) | 2010-03-01 | Sobchuk et al. | Applicant |
| US7698548(B2) | 2010-04-01 | Shelest et al. | Applicant |
| US7707633(B2) | 2010-04-01 | Danford et al. | Applicant |
| US7712136(B2) | 2010-05-01 | Sprosts et al. | Applicant |
| US7730011(B1) | 2010-06-01 | Deninger et al. | Applicant |
| US7739740(B1) | 2010-06-01 | Nachenberg et al. | Applicant |
| US7779463(B2) | 2010-08-01 | Stolfo et al. | Applicant |
| US7784097(B1) | 2010-08-01 | Stolfo et al. | Applicant |
| US7832008(B1) | 2010-11-01 | Kraemer | Applicant |
| US7836502(B1) | 2010-11-01 | Zhao et al. | Applicant |
| US7849506(B1) | 2010-12-01 | Dansey et al. | Applicant |
| US7854007(B2) | 2010-12-01 | Sprosts et al. | Applicant |
| US7869073(B2) | 2011-01-01 | Oshima | Applicant |
| US7877803(B2) | 2011-01-01 | Enstone et al. | Applicant |
| US7904959(B2) | 2011-03-01 | Sidiroglou et al. | Applicant |
| US7908660(B2) | 2011-03-01 | Bahl | Applicant |
| US7930738(B1) | 2011-04-01 | Petersen | Applicant |
| US7937387(B2) | 2011-05-01 | Frazier et al. | Applicant |
| US7937761(B1) | 2011-05-01 | Bennett | Applicant |
| US7949849(B2) | 2011-05-01 | Lowe et al. | Applicant |
| US7996556(B2) | 2011-08-01 | Raghavan et al. | Applicant |
| US7996836(B1) | 2011-08-01 | McCorkendale et al. | Applicant |
| US7996904(B1) | 2011-08-01 | Chiueh et al. | Applicant |
| US7996905(B2) | 2011-08-01 | Arnold et al. | Applicant |
| US8006305(B2) | 2011-08-01 | Aziz | Applicant |
| US8010667(B2) | 2011-08-01 | Zhang et al. | Applicant |
| US8020206(B2) | 2011-09-01 | Hubbard et al. | Applicant |
| US8028338(B1) | 2011-09-01 | Schneider et al. | Applicant |
| US8042184(B1) | 2011-10-01 | Batenin | Applicant |
| US8045094(B2) | 2011-10-01 | Teragawa | Applicant |
| US8045458(B2) | 2011-10-01 | Alperovitch et al. | Applicant |
| US8069484(B2) | 2011-11-01 | McMillan et al. | Applicant |
| US8087086(B1) | 2011-12-01 | Lai et al. | Applicant |
| US8171553(B2) | 2012-05-01 | Aziz et al. | Applicant |
| US8176049(B2) | 2012-05-01 | Deninger et al. | Applicant |
| US8176480(B1) | 2012-05-01 | Spertus | Applicant |
| US8201246(B1) | 2012-06-01 | Wu et al. | Applicant |
| US8204984(B1) | 2012-06-01 | Aziz et al. | Applicant |
| US8214905(B1) | 2012-07-01 | Doukhvalov et al. | Applicant |
| US8220055(B1) | 2012-07-01 | Kennedy | Applicant |
| US8225288(B2) | 2012-07-01 | Miller et al. | Applicant |
| US8225373(B2) | 2012-07-01 | Kraemer | Applicant |
| US8233882(B2) | 2012-07-01 | Rogel | Applicant |
| US8234640(B1) | 2012-07-01 | Fitzgerald et al. | Applicant |
| US8234709(B2) | 2012-07-01 | Viljoen et al. | Applicant |
| US8239944(B1) | 2012-08-01 | Nachenberg et al. | Applicant |
| US8260914(B1) | 2012-09-01 | Ranjan | Applicant |
| US8266091(B1) | 2012-09-01 | Gubin et al. | Applicant |
| US8286251(B2) | 2012-10-01 | Eker et al. | Applicant |
| US8291499(B2) | 2012-10-01 | Aziz et al. | Applicant |
| US8307435(B1) | 2012-11-01 | Mann et al. | Applicant |
| US8307443(B2) | 2012-11-01 | Wang et al. | Applicant |
| US8312545(B2) | 2012-11-01 | Tuvell et al. | Applicant |
| US8321936(B1) | 2012-11-01 | Green et al. | Applicant |
| US8321941(B2) | 2012-11-01 | Tuvell et al. | Applicant |
| US8332571(B1) | 2012-12-01 | Edwards, Sr. | Applicant |
| US8365286(B2) | 2013-01-01 | Poston | Applicant |
| US8365297(B1) | 2013-01-01 | Parshin et al. | Applicant |
| US8370938(B1) | 2013-02-01 | Daswani et al. | Applicant |
| US8370939(B2) | 2013-02-01 | Zaitsev et al. | Applicant |
| US8375444(B2) | 2013-02-01 | Aziz et al. | Applicant |
| US8381299(B2) | 2013-02-01 | Stolfo et al. | Applicant |
| US8402529(B1) | 2013-03-01 | Green et al. | Applicant |
| US8464340(B2) | 2013-06-01 | Ahn et al. | Applicant |
| US8479174(B2) | 2013-07-01 | Chiriac | Applicant |
| US8479276(B1) | 2013-07-01 | Vaystikh et al. | Applicant |
| US8479291(B1) | 2013-07-01 | Bodke | Applicant |
| US8510827(B1) | 2013-08-01 | Leake et al. | Applicant |
| US8510828(B1) | 2013-08-01 | Guo et al. | Applicant |
| US8510842(B2) | 2013-08-01 | Amit et al. | Applicant |
| US8516478(B1) | 2013-08-01 | Edwards et al. | Applicant |
| US8516590(B1) | 2013-08-01 | Ranadive et al. | Applicant |
| US8516593(B2) | 2013-08-01 | Aziz | Applicant |
| US8522348(B2) | 2013-08-01 | Chen et al. | Applicant |
| US8528086(B1) | 2013-09-01 | Aziz | Applicant |
| US8533824(B2) | 2013-09-01 | Hutton et al. | Applicant |
| US8539582(B1) | 2013-09-01 | Aziz et al. | Applicant |
| US8549638(B2) | 2013-10-01 | Aziz | Applicant |
| US8555391(B1) | 2013-10-01 | Demir et al. | Applicant |
| US8561177(B1) | 2013-10-01 | Aziz et al. | Applicant |
| US8566476(B2) | 2013-10-01 | Shiffer et al. | Applicant |
| US8566946(B1) | 2013-10-01 | Aziz et al. | Applicant |
| US8584094(B2) | 2013-11-01 | Dadhia et al. | Applicant |
| US8584234(B1) | 2013-11-01 | Sobel et al. | Applicant |
| US8584239(B2) | 2013-11-01 | Aziz et al. | Applicant |
| US8595834(B2) | 2013-11-01 | Xie et al. | Applicant |
| US8627476(B1) | 2014-01-01 | Satish et al. | Applicant |
| US8635696(B1) | 2014-01-01 | Aziz | Applicant |
| US8682054(B2) | 2014-03-01 | Xue et al. | Applicant |
| US8682812(B1) | 2014-03-01 | Ranjan | Applicant |
| US8689333(B2) | 2014-04-01 | Aziz | Applicant |
| US8695096(B1) | 2014-04-01 | Zhang | Applicant |
| US8713631(B1) | 2014-04-01 | Pavlyushchik | Applicant |
| US8713681(B2) | 2014-04-01 | Silberman et al. | Applicant |
| US8726392(B1) | 2014-05-01 | McCorkendale et al. | Applicant |
| US8739280(B2) | 2014-05-01 | Chess et al. | Applicant |
| US8776229(B1) | 2014-07-01 | Aziz | Applicant |
| US8782792(B1) | 2014-07-01 | Bodke | Applicant |
| US8789172(B2) | 2014-07-01 | Stolfo et al. | Applicant |
| US8789178(B2) | 2014-07-01 | Kejriwal et al. | Applicant |
| US8793278(B2) | 2014-07-01 | Frazier et al. | Applicant |
| US8793787(B2) | 2014-07-01 | Ismael et al. | Applicant |
| US8805947(B1) | 2014-08-01 | Kuzkin et al. | Applicant |
| US8806647(B1) | 2014-08-01 | Daswani et al. | Applicant |
| US8832829(B2) | 2014-09-01 | Manni et al. | Applicant |
| US8850570(B1) | 2014-09-01 | Ramzan | Applicant |
| US8850571(B2) | 2014-09-01 | Staniford et al. | Applicant |
| US8881234(B2) | 2014-11-01 | Narasimhan et al. | Applicant |
| US8881271(B2) | 2014-11-01 | Butler, II | Applicant |
| US8881282(B1) | 2014-11-01 | Aziz et al. | Applicant |
| US8898788(B1) | 2014-11-01 | Aziz et al. | Applicant |
| US8935779(B2) | 2015-01-01 | Manni et al. | Applicant |
| US8949257(B2) | 2015-02-01 | Shiffer et al. | Applicant |
| US8984638(B1) | 2015-03-01 | Aziz et al. | Applicant |
| US8990939(B2) | 2015-03-01 | Staniford et al. | Applicant |
| US8990944(B1) | 2015-03-01 | Singh et al. | Applicant |
| US8997219(B2) | 2015-03-01 | Staniford et al. | Applicant |
| US9009822(B1) | 2015-04-01 | Ismael et al. | Applicant |
| US9009823(B1) | 2015-04-01 | Ismael et al. | Applicant |
| US9027135(B1) | 2015-05-01 | Aziz | Applicant |
| US9071638(B1) | 2015-06-01 | Aziz et al. | Applicant |
| US9104867(B1) | 2015-08-01 | Thioux et al. | Applicant |
| US9106630(B2) | 2015-08-01 | Frazier et al. | Applicant |
| US9106694(B2) | 2015-08-01 | Aziz et al. | Applicant |
| US9118715(B2) | 2015-08-01 | Staniford et al. | Applicant |
| US9159035(B1) | 2015-10-01 | Ismael et al. | Applicant |
| US9171160(B2) | 2015-10-01 | Vincent et al. | Applicant |
| US9176843(B1) | 2015-11-01 | Ismael et al. | Applicant |
| US9189627(B1) | 2015-11-01 | Islam | Applicant |
| US9195829(B1) | 2015-11-01 | Goradia et al. | Applicant |
| US9197664(B1) | 2015-11-01 | Aziz et al. | Applicant |
| US9223972(B1) | 2015-12-01 | Vincent et al. | Applicant |
| US9225740(B1) | 2015-12-01 | Ismael et al. | Applicant |
| US9241010(B1) | 2016-01-01 | Bennett et al. | Applicant |
| US9251343(B1) | 2016-02-01 | Vincent et al. | Applicant |
| US9262635(B2) | 2016-02-01 | Paithane et al. | Applicant |
| US9268936(B2) | 2016-02-01 | Butler | Applicant |
| US9275229(B2) | 2016-03-01 | LeMasters | Applicant |
| US9282109(B1) | 2016-03-01 | Aziz et al. | Applicant |
| US9294501(B2) | 2016-03-01 | Mesdaq et al. | Applicant |
| US9300686(B2) | 2016-03-01 | Pidathala et al. | Applicant |
| US9306960(B1) | 2016-04-01 | Aziz | Applicant |
| US9306974(B1) | 2016-04-01 | Aziz et al. | Applicant |
| US9311479(B1) | 2016-04-01 | Manni et al. | Applicant |
| US9355247(B1) | 2016-05-01 | Thioux et al. | Applicant |
| US9356944(B1) | 2016-05-01 | Aziz | Applicant |
| US9363280(B1) | 2016-06-01 | Rivlin et al. | Applicant |
| US9367681(B1) | 2016-06-01 | Ismael et al. | Applicant |
| US9398028(B1) | 2016-07-01 | Karandikar et al. | Applicant |
| US9413781(B2) | 2016-08-01 | Cunningham et al. | Applicant |
| US9430646(B1) | 2016-08-01 | Mushtaq et al. | Applicant |
| US9432389(B1) | 2016-08-01 | Khalid et al. | Applicant |
| US9438613(B1) | 2016-09-01 | Paithane et al. | Applicant |
| US9438622(B1) | 2016-09-01 | Staniford et al. | Applicant |
| US9438623(B1) | 2016-09-01 | Thioux et al. | Applicant |
| US9459901(B2) | 2016-10-01 | Jung et al. | Applicant |
| US9483644(B1) | 2016-11-01 | Paithane et al. | Applicant |
| US9495180(B2) | 2016-11-01 | Ismael | Applicant |
| US9497213(B2) | 2016-11-01 | Thompson et al. | Applicant |
| US9516057(B2) | 2016-12-01 | Aziz | Applicant |
| US9519782(B2) | 2016-12-01 | Aziz et al. | Applicant |
| US9536091(B2) | 2017-01-01 | Paithane et al. | Applicant |
| US9560059(B1) | 2017-01-01 | Islam | Applicant |
| US9565202(B1) | 2017-02-01 | Kindlund et al. | Applicant |
| US9591015(B1) | 2017-03-01 | Amin et al. | Applicant |
| US9591020(B1) | 2017-03-01 | Aziz | Applicant |
| US9594904(B1) | 2017-03-01 | Jain et al. | Applicant |
| US9594905(B1) | 2017-03-01 | Ismael et al. | Applicant |
| US9594912(B1) | 2017-03-01 | Thioux et al. | Applicant |
| US9609007(B1) | 2017-03-01 | Rivlin et al. | Applicant |
| US9626509(B1) | 2017-04-01 | Khalid et al. | Applicant |
| US9628498(B1) | 2017-04-01 | Aziz et al. | Applicant |
| US9628507(B2) | 2017-04-01 | Haq et al. | Applicant |
| US9633134(B2) | 2017-04-01 | Ross | Applicant |
| US9635039(B1) | 2017-04-01 | Islam et al. | Applicant |
| US9641546(B1) | 2017-05-01 | Manni et al. | Applicant |
| US2001/0005889(A1) | 2001-06-01 | Albrecht | Applicant |
| US2001/0047326(A1) | 2001-11-01 | Broadbent et al. | Applicant |
| US2002/0018903(A1) | 2002-02-01 | Kokubo et al. | Applicant |
| US2002/0038430(A1) | 2002-03-01 | Edwards et al. | Applicant |
| US2002/0091819(A1) | 2002-07-01 | Melchione et al. | Applicant |
| US2002/0095607(A1) | 2002-07-01 | Lin-Hendel | Applicant |
| US2002/0116627(A1) | 2002-08-01 | Tarbotton et al. | Applicant |
| US2002/0144156(A1) | 2002-10-01 | Copeland | Applicant |
| US2002/0162015(A1) | 2002-10-01 | Tang | Applicant |
| US2002/0166063(A1) | 2002-11-01 | Lachman et al. | Applicant |
| US2002/0169952(A1) | 2002-11-01 | DiSanto et al. | Applicant |
| US2002/0184528(A1) | 2002-12-01 | Shevenell et al. | Applicant |
| US2002/0188887(A1) | 2002-12-01 | Largman et al. | Applicant |
| US2002/0194490(A1) | 2002-12-01 | Halperin et al. | Applicant |
| US2003/0018903(A1) | 2003-01-01 | Greca et al. | Applicant |
| US2003/0074578(A1) | 2003-04-01 | Ford et al. | Applicant |
| US2003/0084318(A1) | 2003-05-01 | Schertz | Applicant |
| US2003/0101381(A1) | 2003-05-01 | Mateev et al. | Applicant |
| US2003/0115483(A1) | 2003-06-01 | Liang | Applicant |
| US2003/0188190(A1) | 2003-10-01 | Aaron et al. | Applicant |
| US2003/0191957(A1) | 2003-10-01 | Hypponen et al. | Applicant |
| US2003/0200460(A1) | 2003-10-01 | Morota et al. | Applicant |
| US2003/0212902(A1) | 2003-11-01 | van der Made | Applicant |
| US2003/0229801(A1) | 2003-12-01 | Kouznetsov et al. | Applicant |
| US2003/0237000(A1) | 2003-12-01 | Denton et al. | Applicant |
| US2004/0003323(A1) | 2004-01-01 | Bennett et al. | Applicant |
| US2004/0015712(A1) | 2004-01-01 | Szor | Applicant |
| US2004/0016558(A1) | 2004-01-01 | Mueller et al. | Applicant |
| US2004/0019832(A1) | 2004-01-01 | Arnold et al. | Applicant |
| US2004/0047356(A1) | 2004-03-01 | Bauer | Applicant |
| US2004/0083408(A1) | 2004-04-01 | Spiegel et al. | Applicant |
| US2004/0088581(A1) | 2004-05-01 | Brawn et al. | Applicant |
| US2004/0093513(A1) | 2004-05-01 | Cantrell | Examiner |
| US2004/0111531(A1) | 2004-06-01 | Staniford et al. | Applicant |
| US2004/0117478(A1) | 2004-06-01 | Triulzi et al. | Applicant |
| US2004/0117624(A1) | 2004-06-01 | Brandt et al. | Applicant |
| US2004/0128355(A1) | 2004-07-01 | Chao et al. | Applicant |
| US2004/0165588(A1) | 2004-08-01 | Pandya | Applicant |
| US2004/0236963(A1) | 2004-11-01 | Danford et al. | Applicant |
| US2004/0243349(A1) | 2004-12-01 | Greifeneder et al. | Applicant |
| US2004/0249911(A1) | 2004-12-01 | Alkhatib et al. | Applicant |
| US2004/0255161(A1) | 2004-12-01 | Cavanaugh | Applicant |
| US2004/0268147(A1) | 2004-12-01 | Wiederin et al. | Applicant |
| US2005/0005159(A1) | 2005-01-01 | Oliphant | Applicant |
| US2005/0021740(A1) | 2005-01-01 | Bar | Examiner |
| US2005/0033960(A1) | 2005-02-01 | Vialen et al. | Applicant |
| US2005/0033989(A1) | 2005-02-01 | Poletto et al. | Applicant |
| US2005/0050148(A1) | 2005-03-01 | Mohammadioun et al. | Applicant |
| US2005/0086523(A1) | 2005-04-01 | Zimmer et al. | Applicant |
| US2005/0091513(A1) | 2005-04-01 | Mitomo et al. | Applicant |
| US2005/0091533(A1) | 2005-04-01 | Omote et al. | Applicant |
| US2005/0091652(A1) | 2005-04-01 | Ross et al. | Applicant |
| US2005/0108562(A1) | 2005-05-01 | Khazan et al. | Applicant |
| US2005/0114663(A1) | 2005-05-01 | Cornell et al. | Applicant |
| US2005/0125195(A1) | 2005-06-01 | Brendel | Applicant |
| US2005/0149726(A1) | 2005-07-01 | Joshi et al. | Applicant |
| US2005/0157662(A1) | 2005-07-01 | Bingham et al. | Applicant |
| US2005/0183143(A1) | 2005-08-01 | Anderholm et al. | Applicant |
| US2005/0201297(A1) | 2005-09-01 | Peikari | Applicant |
| US2005/0210533(A1) | 2005-09-01 | Copeland et al. | Applicant |
| US2005/0238005(A1) | 2005-10-01 | Chen et al. | Applicant |
| US2005/0240781(A1) | 2005-10-01 | Gassoway | Applicant |
| US2005/0262562(A1) | 2005-11-01 | Gassoway | Applicant |
| US2005/0265331(A1) | 2005-12-01 | Stolfo | Applicant |
| US2005/0283839(A1) | 2005-12-01 | Cowbum | Applicant |
| US2006/0010495(A1) | 2006-01-01 | Cohen et al. | Applicant |
| US2006/0015416(A1) | 2006-01-01 | Hoffman et al. | Applicant |
| US2006/0015715(A1) | 2006-01-01 | Anderson | Applicant |
| US2006/0015747(A1) | 2006-01-01 | Van de Ven | Applicant |
| US2006/0021029(A1) | 2006-01-01 | Brickell et al. | Applicant |
| US2006/0021054(A1) | 2006-01-01 | Costa et al. | Applicant |
| US2006/0031476(A1) | 2006-02-01 | Mathes et al. | Applicant |
| US2006/0047665(A1) | 2006-03-01 | Neil | Applicant |
| US2006/0070130(A1) | 2006-03-01 | Costea et al. | Applicant |
| US2006/0075496(A1) | 2006-04-01 | Carpenter et al. | Applicant |
| US2006/0095968(A1) | 2006-05-01 | Portolani et al. | Applicant |
| US2006/0101516(A1) | 2006-05-01 | Sudaharan et al. | Applicant |
| US2006/0101517(A1) | 2006-05-01 | Banzhaf et al. | Applicant |
| US2006/0117385(A1) | 2006-06-01 | Mester et al. | Applicant |
| US2006/0123477(A1) | 2006-06-01 | Raghavan et al. | Applicant |
| US2006/0143709(A1) | 2006-06-01 | Brooks et al. | Applicant |
| US2006/0150249(A1) | 2006-07-01 | Gassen et al. | Applicant |
| US2006/0161983(A1) | 2006-07-01 | Cothrell et al. | Applicant |
| US2006/0161987(A1) | 2006-07-01 | Levy-Yurista | Applicant |
| US2006/0161989(A1) | 2006-07-01 | Reshef et al. | Applicant |
| US2006/0164199(A1) | 2006-07-01 | Gilde et al. | Applicant |
| US2006/0173992(A1) | 2006-08-01 | Weber et al. | Applicant |
| US2006/0179147(A1) | 2006-08-01 | Tran et al. | Applicant |
| US2006/0184632(A1) | 2006-08-01 | Marino et al. | Applicant |
| US2006/0191010(A1) | 2006-08-01 | Benjamin | Applicant |
| US2006/0221956(A1) | 2006-10-01 | Narayan et al. | Applicant |
| US2006/0236393(A1) | 2006-10-01 | Kramer et al. | Applicant |
| US2006/0242709(A1) | 2006-10-01 | Seinfeld et al. | Applicant |
| US2006/0248519(A1) | 2006-11-01 | Jaeger et al. | Applicant |
| US2006/0248582(A1) | 2006-11-01 | Panjwani et al. | Applicant |
| US2006/0251104(A1) | 2006-11-01 | Koga | Applicant |
| US2006/0288417(A1) | 2006-12-01 | Bookbinder et al. | Applicant |
| US2007/0006288(A1) | 2007-01-01 | Mayfield et al. | Applicant |
| US2007/0006313(A1) | 2007-01-01 | Porras et al. | Applicant |
| US2007/0011174(A1) | 2007-01-01 | Takaragi et al. | Applicant |
| US2007/0016951(A1) | 2007-01-01 | Piccard et al. | Applicant |
| US2007/0033645(A1) | 2007-02-01 | Jones | Applicant |
| US2007/0038943(A1) | 2007-02-01 | FitzGerald et al. | Applicant |
| US2007/0064689(A1) | 2007-03-01 | Shin et al. | Applicant |
| US2007/0074169(A1) | 2007-03-01 | Chess et al. | Applicant |
| US2007/0094730(A1) | 2007-04-01 | Bhikkaji et al. | Applicant |
| US2007/0101435(A1) | 2007-05-01 | Konanka et al. | Applicant |
| US2007/0128855(A1) | 2007-06-01 | Cho et al. | Applicant |
| US2007/0142030(A1) | 2007-06-01 | Sinha et al. | Applicant |
| US2007/0143827(A1) | 2007-06-01 | Nicodemus et al. | Applicant |
| US2007/0156895(A1) | 2007-07-01 | Vuong | Applicant |
| US2007/0157180(A1) | 2007-07-01 | Tillmann et al. | Applicant |
| US2007/0157306(A1) | 2007-07-01 | Elrod et al. | Applicant |
| US2007/0168988(A1) | 2007-07-01 | Eisner et al. | Applicant |
| US2007/0171824(A1) | 2007-07-01 | Ruello et al. | Applicant |
| US2007/0174915(A1) | 2007-07-01 | Gribble et al. | Applicant |
| US2007/0192500(A1) | 2007-08-01 | Lum | Applicant |
| US2007/0192858(A1) | 2007-08-01 | Lum | Applicant |
| US2007/0198275(A1) | 2007-08-01 | Malden et al. | Applicant |
| US2007/0208822(A1) | 2007-09-01 | Wang et al. | Applicant |
| US2007/0220607(A1) | 2007-09-01 | Sprosts et al. | Applicant |
| US2007/0240218(A1) | 2007-10-01 | Tuvell et al. | Applicant |
| US2007/0240219(A1) | 2007-10-01 | Tuvell et al. | Applicant |
| US2007/0240220(A1) | 2007-10-01 | Tuvell et al. | Applicant |
| US2007/0240222(A1) | 2007-10-01 | Tuvell et al. | Applicant |
| US2007/0250930(A1) | 2007-10-01 | Aziz et al. | Applicant |
| US2007/0256132(A2) | 2007-11-01 | Oliphant | Applicant |
| US2007/0271446(A1) | 2007-11-01 | Nakamura | Applicant |
| US2008/0005782(A1) | 2008-01-01 | Aziz | Applicant |
| US2008/0028463(A1) | 2008-01-01 | Dagon et al. | Applicant |
| US2008/0032556(A1) | 2008-02-01 | Schreier | Applicant |
| US2008/0040710(A1) | 2008-02-01 | Chiriac | Applicant |
| US2008/0046781(A1) | 2008-02-01 | Childs et al. | Applicant |
| US2008/0066179(A1) | 2008-03-01 | Liu | Applicant |
| US2008/0072326(A1) | 2008-03-01 | Danford et al. | Applicant |
| US2008/0077793(A1) | 2008-03-01 | Tan et al. | Applicant |
| US2008/0080518(A1) | 2008-04-01 | Hoeflin et al. | Applicant |
| US2008/0086720(A1) | 2008-04-01 | Lekel | Applicant |
| US2008/0098476(A1) | 2008-04-01 | Syversen | Applicant |
| US2008/0120722(A1) | 2008-05-01 | Sima et al. | Applicant |
| US2008/0134178(A1) | 2008-06-01 | Fitzgerald et al. | Applicant |
| US2008/0134334(A1) | 2008-06-01 | Kim et al. | Applicant |
| US2008/0141376(A1) | 2008-06-01 | Clausen et al. | Applicant |
| US2008/0181227(A1) | 2008-07-01 | Todd | Applicant |
| US2008/0184367(A1) | 2008-07-01 | McMillan et al. | Applicant |
| US2008/0184373(A1) | 2008-07-01 | Traut et al. | Applicant |
| US2008/0189787(A1) | 2008-08-01 | Arnold et al. | Applicant |
| US2008/0201778(A1) | 2008-08-01 | Guo et al. | Applicant |
| US2008/0209557(A1) | 2008-08-01 | Herley et al. | Applicant |
| US2008/0215742(A1) | 2008-09-01 | Goldszmidt et al. | Applicant |
| US2008/0222728(A1) | 2008-09-01 | Chavez et al. | Applicant |
| US2008/0222729(A1) | 2008-09-01 | Chen et al. | Applicant |
| US2008/0263665(A1) | 2008-10-01 | Ma et al. | Applicant |
| US2008/0295172(A1) | 2008-11-01 | Bohacek | Applicant |
| US2008/0301810(A1) | 2008-12-01 | Lehane et al. | Applicant |
| US2008/0307524(A1) | 2008-12-01 | Singh et al. | Applicant |
| US2008/0313738(A1) | 2008-12-01 | Enderby | Applicant |
| US2008/0320594(A1) | 2008-12-01 | Jiang | Applicant |
| US2009/0003317(A1) | 2009-01-01 | Kasralikar et al. | Applicant |
| US2009/0007100(A1) | 2009-01-01 | Field et al. | Applicant |
| US2009/0013408(A1) | 2009-01-01 | Schipka | Applicant |
| US2009/0031423(A1) | 2009-01-01 | Liu et al. | Applicant |
| US2009/0036111(A1) | 2009-02-01 | Danford et al. | Applicant |
| US2009/0037835(A1) | 2009-02-01 | Goldman | Applicant |
| US2009/0044024(A1) | 2009-02-01 | Oberheide et al. | Applicant |
| US2009/0044274(A1) | 2009-02-01 | Budko et al. | Applicant |
| US2009/0064332(A1) | 2009-03-01 | Porras et al. | Applicant |
| US2009/0077666(A1) | 2009-03-01 | Chen et al. | Applicant |
| US2009/0083369(A1) | 2009-03-01 | Marmor | Applicant |
| US2009/0083855(A1) | 2009-03-01 | Apap et al. | Applicant |
| US2009/0089879(A1) | 2009-04-01 | Wang et al. | Applicant |
| US2009/0094697(A1) | 2009-04-01 | Provos et al. | Applicant |
| US2009/0113425(A1) | 2009-04-01 | Ports et al. | Applicant |
| US2009/0125976(A1) | 2009-05-01 | Wassermann et al. | Applicant |
| US2009/0126015(A1) | 2009-05-01 | Monastyrsky et al. | Applicant |
| US2009/0126016(A1) | 2009-05-01 | Sobko et al. | Applicant |
| US2009/0133125(A1) | 2009-05-01 | Choi et al. | Applicant |
| US2009/0144823(A1) | 2009-06-01 | Lamastra et al. | Applicant |
| US2009/0158430(A1) | 2009-06-01 | Borders | Applicant |
| US2009/0172815(A1) | 2009-07-01 | Gu et al. | Applicant |
| US2009/0187992(A1) | 2009-07-01 | Poston | Applicant |
| US2009/0193293(A1) | 2009-07-01 | Stolfo et al. | Applicant |
| US2009/0198651(A1) | 2009-08-01 | Shiffer et al. | Applicant |
| US2009/0198670(A1) | 2009-08-01 | Shiffer et al. | Applicant |
| US2009/0198689(A1) | 2009-08-01 | Frazier et al. | Applicant |
| US2009/0199274(A1) | 2009-08-01 | Frazier et al. | Applicant |
| US2009/0199296(A1) | 2009-08-01 | Xie et al. | Applicant |
| US2009/0228233(A1) | 2009-09-01 | Anderson et al. | Applicant |
| US2009/0241187(A1) | 2009-09-01 | Troyansky | Applicant |
| US2009/0241190(A1) | 2009-09-01 | Todd et al. | Applicant |
| US2009/0265692(A1) | 2009-10-01 | Godefroid et al. | Applicant |
| US2009/0271867(A1) | 2009-10-01 | Zhang | Applicant |
| US2009/0300415(A1) | 2009-12-01 | Zhang et al. | Applicant |
| US2009/0300761(A1) | 2009-12-01 | Park et al. | Applicant |
| US2009/0328185(A1) | 2009-12-01 | Berg et al. | Applicant |
| US2009/0328221(A1) | 2009-12-01 | Blumfield et al. | Applicant |
| US2010/0005146(A1) | 2010-01-01 | Drako et al. | Applicant |
| US2010/0011205(A1) | 2010-01-01 | McKenna | Applicant |
| US2010/0017546(A1) | 2010-01-01 | Poo et al. | Applicant |
| US2010/0030996(A1) | 2010-02-01 | Butler, II | Applicant |
| US2010/0031353(A1) | 2010-02-01 | Thomas et al. | Applicant |
| US2010/0037314(A1) | 2010-02-01 | Perdisci et al. | Applicant |
| US2010/0043073(A1) | 2010-02-01 | Kuwamura | Applicant |
| US2010/0054278(A1) | 2010-03-01 | Stolfo et al. | Applicant |
| US2010/0058474(A1) | 2010-03-01 | Hicks | Applicant |
| US2010/0064044(A1) | 2010-03-01 | Nonoyama | Applicant |
| US2010/0077481(A1) | 2010-03-01 | Polyakov et al. | Applicant |
| US2010/0083376(A1) | 2010-04-01 | Pereira et al. | Applicant |
| US2010/0100718(A1) | 2010-04-01 | Srinivasan | Applicant |
| US2010/0115621(A1) | 2010-05-01 | Staniford et al. | Applicant |
| US2010/0132038(A1) | 2010-05-01 | Zaitsev | Applicant |
| US2010/0154056(A1) | 2010-06-01 | Smith et al. | Applicant |
| US2010/0180344(A1) | 2010-07-01 | Malyshev et al. | Applicant |
| US2010/0192223(A1) | 2010-07-01 | Ismael et al. | Applicant |
| US2010/0220863(A1) | 2010-09-01 | Dupaquis et al. | Applicant |
| US2010/0235831(A1) | 2010-09-01 | Dittmer | Applicant |
| US2010/0251104(A1) | 2010-09-01 | Massand | Applicant |
| US2010/0281102(A1) | 2010-11-01 | Chinta et al. | Applicant |
| US2010/0281541(A1) | 2010-11-01 | Stolfo et al. | Applicant |
| US2010/0281542(A1) | 2010-11-01 | Stolfo et al. | Applicant |
| US2010/0287260(A1) | 2010-11-01 | Peterson et al. | Applicant |
| US2010/0299754(A1) | 2010-11-01 | Amit et al. | Applicant |
| US2010/0306173(A1) | 2010-12-01 | Frank | Applicant |
| US2011/0004737(A1) | 2011-01-01 | Greenebaum | Applicant |
| US2011/0025504(A1) | 2011-02-01 | Lyon et al. | Applicant |
| US2011/0041179(A1) | 2011-02-01 | St Hlberg | Applicant |
| US2011/0047594(A1) | 2011-02-01 | Mahaffey et al. | Applicant |
| US2011/0047620(A1) | 2011-02-01 | Mahaffey et al. | Applicant |
| US2011/0055907(A1) | 2011-03-01 | Narasimhan et al. | Applicant |
| US2011/0078794(A1) | 2011-03-01 | Manni et al. | Applicant |
| US2011/0093951(A1) | 2011-04-01 | Aziz | Applicant |
| US2011/0099620(A1) | 2011-04-01 | Stavrou et al. | Applicant |
| US2011/0099633(A1) | 2011-04-01 | Aziz | Applicant |
| US2011/0099635(A1) | 2011-04-01 | Silberman et al. | Applicant |
| US2011/0113231(A1) | 2011-05-01 | Kaminsky | Applicant |
| US2011/0145918(A1) | 2011-06-01 | Jung et al. | Applicant |
| US2011/0145920(A1) | 2011-06-01 | Mahaffey et al. | Applicant |
| US2011/0145934(A1) | 2011-06-01 | Abramovici et al. | Applicant |
| US2011/0167493(A1) | 2011-07-01 | Song et al. | Applicant |
| US2011/0167494(A1) | 2011-07-01 | Bowen et al. | Applicant |
| US2011/0173213(A1) | 2011-07-01 | Frazier et al. | Applicant |
| US2011/0173460(A1) | 2011-07-01 | Ito et al. | Applicant |
| US2011/0219449(A1) | 2011-09-01 | St. Neitzel et al. | Applicant |
| US2011/0219450(A1) | 2011-09-01 | McDougal et al. | Applicant |
| US2011/0225624(A1) | 2011-09-01 | Sawhney et al. | Applicant |
| US2011/0225655(A1) | 2011-09-01 | Niemela et al. | Applicant |
| US2011/0247072(A1) | 2011-10-01 | Staniford et al. | Applicant |
| US2011/0265182(A1) | 2011-10-01 | Peinado et al. | Applicant |
| US2011/0289582(A1) | 2011-11-01 | Kejriwal et al. | Applicant |
| US2011/0302587(A1) | 2011-12-01 | Nishikawa et al. | Applicant |
| US2011/0307954(A1) | 2011-12-01 | Melnik et al. | Applicant |
| US2011/0307955(A1) | 2011-12-01 | Kaplan et al. | Applicant |
| US2011/0307956(A1) | 2011-12-01 | Yermakov et al. | Applicant |
| US2011/0314546(A1) | 2011-12-01 | Aziz et al. | Applicant |
| US2012/0023593(A1) | 2012-01-01 | Puder et al. | Applicant |
| US2012/0054869(A1) | 2012-03-01 | Yen et al. | Applicant |
| US2012/0066698(A1) | 2012-03-01 | Yanoo | Applicant |
| US2012/0079596(A1) | 2012-03-01 | Thomas et al. | Applicant |
| US2012/0084859(A1) | 2012-04-01 | Radinsky et al. | Applicant |
| US2012/0110667(A1) | 2012-05-01 | Zubrilin et al. | Applicant |
| US2012/0117652(A1) | 2012-05-01 | Manni et al. | Applicant |
| US2012/0121154(A1) | 2012-05-01 | Xue et al. | Applicant |
| US2012/0124426(A1) | 2012-05-01 | Maybee et al. | Applicant |
| US2012/0174186(A1) | 2012-07-01 | Aziz et al. | Applicant |
| US2012/0174196(A1) | 2012-07-01 | Bhogavilli et al. | Applicant |
| US2012/0174218(A1) | 2012-07-01 | McCoy et al. | Applicant |
| US2012/0198279(A1) | 2012-08-01 | Schroeder | Applicant |
| US2012/0210423(A1) | 2012-08-01 | Friedrichs et al. | Applicant |
| US2012/0222121(A1) | 2012-08-01 | Staniford et al. | Applicant |
| US2012/0255015(A1) | 2012-10-01 | Sahita et al. | Applicant |
| US2012/0255017(A1) | 2012-10-01 | Sallam | Applicant |
| US2012/0260342(A1) | 2012-10-01 | Dube et al. | Applicant |
| US2012/0266244(A1) | 2012-10-01 | Green et al. | Applicant |
| US2012/0278886(A1) | 2012-11-01 | Luna | Applicant |
| US2012/0297489(A1) | 2012-11-01 | Dequevy | Applicant |
| US2012/0330801(A1) | 2012-12-01 | McDougal et al. | Applicant |
| US2012/0331553(A1) | 2012-12-01 | Aziz et al. | Applicant |
| US2013/0014259(A1) | 2013-01-01 | Gribble et al. | Applicant |
| US2013/0036472(A1) | 2013-02-01 | Aziz | Applicant |
| US2013/0047257(A1) | 2013-02-01 | Aziz | Applicant |
| US2013/0074185(A1) | 2013-03-01 | McDougal et al. | Applicant |
| US2013/0086684(A1) | 2013-04-01 | Mohler | Applicant |
| US2013/0097699(A1) | 2013-04-01 | Balupari et al. | Applicant |
| US2013/0097706(A1) | 2013-04-01 | Titonis et al. | Applicant |
| US2013/0111587(A1) | 2013-05-01 | Goel et al. | Applicant |
| US2013/0117852(A1) | 2013-05-01 | Stute | Applicant |
| US2013/0117855(A1) | 2013-05-01 | Kim et al. | Applicant |
| US2013/0139264(A1) | 2013-05-01 | Brinkley et al. | Applicant |
| US2013/0160125(A1) | 2013-06-01 | Likhachev et al. | Applicant |
| US2013/0160127(A1) | 2013-06-01 | Jeong et al. | Applicant |
| US2013/0160130(A1) | 2013-06-01 | Mendelev et al. | Applicant |
| US2013/0160131(A1) | 2013-06-01 | Madou et al. | Applicant |
| US2013/0167236(A1) | 2013-06-01 | Sick | Applicant |
| US2013/0174214(A1) | 2013-07-01 | Duncan | Applicant |
| US2013/0185789(A1) | 2013-07-01 | Hagiwara et al. | Applicant |
| US2013/0185795(A1) | 2013-07-01 | Winn et al. | Applicant |
| US2013/0185798(A1) | 2013-07-01 | Saunders et al. | Applicant |
| US2013/0191915(A1) | 2013-07-01 | Antonakakis et al. | Applicant |
| US2013/0196649(A1) | 2013-08-01 | Paddon et al. | Applicant |
| US2013/0227691(A1) | 2013-08-01 | Aziz et al. | Applicant |
| US2013/0246370(A1) | 2013-09-01 | Bartram et al. | Applicant |
| US2013/0247186(A1) | 2013-09-01 | LeMasters | Applicant |
| US2013/0263260(A1) | 2013-10-01 | Mahaffey et al. | Applicant |
| US2013/0291109(A1) | 2013-10-01 | Staniford et al. | Applicant |
| US2013/0298243(A1) | 2013-11-01 | Kumar et al. | Applicant |
| US2013/0318038(A1) | 2013-11-01 | Shiffer et al. | Applicant |
| US2013/0318073(A1) | 2013-11-01 | Shiffer et al. | Applicant |
| US2013/0325791(A1) | 2013-12-01 | Shiffer et al. | Applicant |
| US2013/0325792(A1) | 2013-12-01 | Shiffer et al. | Applicant |
| US2013/0325871(A1) | 2013-12-01 | Shiffer et al. | Applicant |
| US2013/0325872(A1) | 2013-12-01 | Shiffer et al. | Applicant |
| US2014/0032875(A1) | 2014-01-01 | Butler | Applicant |
| US2014/0053260(A1) | 2014-02-01 | Gupta et al. | Applicant |
| US2014/0053261(A1) | 2014-02-01 | Gupta et al. | Applicant |
| US2014/0130158(A1) | 2014-05-01 | Wang et al. | Applicant |
| US2014/0137180(A1) | 2014-05-01 | Lukacs et al. | Applicant |
| US2014/0169762(A1) | 2014-06-01 | Ryu | Applicant |
| US2014/0179360(A1) | 2014-06-01 | Jackson et al. | Applicant |
| US2014/0181131(A1) | 2014-06-01 | Ross | Applicant |
| US2014/0189687(A1) | 2014-07-01 | Jung et al. | Applicant |
| US2014/0189866(A1) | 2014-07-01 | Shiffer et al. | Applicant |
| US2014/0189882(A1) | 2014-07-01 | Jung et al. | Applicant |
| US2014/0237600(A1) | 2014-08-01 | Silberman et al. | Applicant |
| US2014/0280245(A1) | 2014-09-01 | Wilson | Applicant |
| US2014/0283037(A1) | 2014-09-01 | Sikorski et al. | Applicant |
| US2014/0283063(A1) | 2014-09-01 | Thompson et al. | Applicant |
| US2014/0328204(A1) | 2014-11-01 | Klotsche et al. | Applicant |
| US2014/0337836(A1) | 2014-11-01 | Ismael | Applicant |
| US2014/0344926(A1) | 2014-11-01 | Cunningham et al. | Applicant |
| US2014/0351935(A1) | 2014-11-01 | Shao et al. | Applicant |
| US2014/0380473(A1) | 2014-12-01 | Bu et al. | Applicant |
| US2014/0380474(A1) | 2014-12-01 | Paithane et al. | Applicant |
| US2015/0007312(A1) | 2015-01-01 | Pidathala et al. | Applicant |
| US2015/0096022(A1) | 2015-04-01 | Vincent et al. | Applicant |
| US2015/0096023(A1) | 2015-04-01 | Mesdaq et al. | Applicant |
| US2015/0096024(A1) | 2015-04-01 | Haq et al. | Applicant |
| US2015/0096025(A1) | 2015-04-01 | Ismael | Applicant |
| US2015/0180886(A1) | 2015-06-01 | Staniford et al. | Applicant |
| US2015/0186645(A1) | 2015-07-01 | Aziz et al. | Applicant |
| US2015/0220735(A1) | 2015-08-01 | Paithane et al. | Applicant |
| US2015/0372980(A1) | 2015-12-01 | Eyada | Applicant |
| US2016/0044000(A1) | 2016-02-01 | Cunningham | Applicant |
| US2016/0127393(A1) | 2016-05-01 | Aziz et al. | Applicant |
| US2016/0191547(A1) | 2016-06-01 | Zafar et al. | Applicant |
| US2016/0261612(A1) | 2016-09-01 | Mesdaq et al. | Applicant |
| US2016/0285914(A1) | 2016-09-01 | Singh et al. | Applicant |
| US2016/0301703(A1) | 2016-10-01 | Aziz | Applicant |
| US2016/0335110(A1) | 2016-11-01 | Paithane et al. | Applicant |
| US2017/0083703(A1) | 2017-03-01 | Abbasi et al. | Applicant |
| GB2439806(A) | 2008-01-01 | Applicant | |
| GB2490431(A) | 2012-10-01 | Applicant | |
| WO2/006928(A2) | 2002-01-01 | Applicant | |
| WO2/23805(A2) | 2002-03-01 | Applicant | |
| WO2007/022454(A2) | 2007-02-01 | Applicant | |
| WO2007117636(A2) | 2007-10-01 | Applicant | |
| WO2008041950(A2) | 2008-04-01 | Applicant | |
| WO2008/084259(A1) | 2008-07-01 | Applicant | |
| WO2011084431(A2) | 2011-07-01 | Applicant | |
| WO2011/112348(A1) | 2011-09-01 | Applicant | |
| WO2012/075336(A1) | 2012-06-01 | Applicant | |
| WO2012145066(A1) | 2012-10-01 | Applicant | |
| WO2013/067505(A1) | 2013-05-01 | Applicant |
Non-Patent Literature (97)
- “Network Security: NetDetector—Network Intrusion Forensic System (NIFS) Whitepaper”, (“NetDetector Whitepaper”), (2003).Applicant
- “Packet”, Microsoft Computer Dictionary, Microsoft Press, (Mar. 2002), 1 page.Applicant
- “When Virtual is Better Than Real”, IEEEXplore Digital Library, available at, http://ieeexplore.ieee.org/xpl/articleDetails.isp?reload=true&arnumbe- r=990073, (Dec. 7, 2013).Applicant
- Abdullah, et al., Visualizing Network Data for Intrusion Detection, 2005 IEEE Workshop on Information Assurance and Security, pp. 100-108.Applicant
- Adetoye, Adedayo, et al., “Network Intrusion Detection & Response System”, (“Adetoye”), (Sep. 2003).Applicant
- Adobe Systems Incorporated, “PDF 32000-1:2008, Document management—Portable document format—Part1:PDF 1.7”, First Edition, Jul. 1, 2008, 756 pages.Applicant
- AltaVista Advanced Search Results. “attack vector identifier”. Http://www.altavista.com/web/results?Itag=ody&pg=aq&aqmode=aqa=Event+Orch- estrator . . . , (Accessed on Sep. 15, 2009).Applicant
- AltaVista Advanced Search Results. “Event Orchestrator”. Http://www.altavista.com/web/results?Itag=ody&pg=aq&aqmode=aqa=Event+Orch- esrator . . . , (Accessed on Sep. 3, 2009).Applicant
- Apostolopoulos, George; hassapis, Constantinos; “V-eM: A cluster of Virtual Machines for Robust, Detailed, and High-Performance Network Emulation”, 14th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, Sep. 11-14, 2006, pp. 117-126.Applicant
- Aura, Tuomas, “Scanning electronic documents for personally identifiable information”, Proceedings of the 5th ACM workshop on Privacy in electronic society. ACM, 2006.Applicant
- Baecher, “The Nepenthes Platform: An Efficient Approach to collect Malware”, Springer-verlag Berlin Heidelberg, (2006), pp. 165-184.Applicant
- Baldi, Mario; Risso, Fulvio; “A Framework for Rapid Development and Portable Execution of Packet-Handling Applications”, 5th IEEE International Symposium Processing and Information Technology, Dec. 21, 2005, pp. 233-238.Applicant
- Bayer, et al., “Dynamic Analysis of Malicious Code”, J Comput Virol, Springer-Verlag, France., (2006), pp. 67-77.Applicant
- Boubalos, Chris, “extracting syslog data out of raw pcap dumps, seclists.org, Honeypots mailing list archives”, available at http://seclists.org/honeypots/2003/q2/319 (“Boubalos”), (Jun. 5, 2003).Applicant
- Chaudet, C., et al., “Optimal Positioning of Active and Passive Monitoring Devices”, International Conference on Emerging Networking Experiments and Technologies, Proceedings of the 2005 ACM Conference on Emerging Network Experiment and Technology, CoNEXT '05, Toulousse, France, (Oct. 2005), pp. 71-82.Applicant
- Chen, P. M. and Noble, B. D., “When Virtual is Better Than Real, Department of Electrical Engineering and Computer Science”, University of Michigan (“Chen”) (2001).Applicant
- Cisco “Intrusion Prevention for the Cisco ASA 5500-x Series” Data Sheet (2012).Applicant
- Cisco, Configuring the Catalyst Switched Port Analyzer (SPAN) (“Cisco”), (1992).Applicant
- Clark, John, Sylvian Leblanc,and Scott Knight. “Risks associated with usb hardware trojan devices used by insiders.” Systems Conference (SysCon), 2011 IEEE International. IEEE, 2011.Applicant
- Cohen, M.I., “PyFlag—An advanced network forensic framework”, Digital investigation 5, Elsevier, (2008), pp. S112-S120.Applicant
- Costa, M., et al., “Vigilante: End-to-End Containment of Internet Worms”, SOSP '05, Association for Computing Machinery, Inc., Brighton U.K., (Oct. 23-26, 2005).Applicant
- Crandall, J.R., et al., “Minos:Control Data Attack Prevention Orthogonal to Memory Model”, 37th International Symposium on Microarchitecture, Portland, Oregon, (Dec. 2004).Applicant
- Deutsch, P., “Zlib compressed data format specification version 3.3” RFC 1950, (1996).Applicant
- Distler, “Malware Analysis: An Introduction”, SANS Institute InfoSec Reading Room, SANS Institute, (2007).Applicant
- Dunlap, George W., et al., “ReVirt: Enabling Intrusion Analysis through Virtual-Machine Logging and Replay”, Proceeding of the 5th Symposium on Operating Systems Design and Implementation, USENIX Association, (“Dunlap”), (Dec. 9, 2002).Applicant
- EP 1 277 4315, Extended European Search Report, dated Oct. 30, 2014.Applicant
- Excerpt regarding First Printing Date for Merike Kaeo, Designing Network Security (“Kaeo”), (2005).Applicant
- Filiol, Eric , et al., “Combinatorial Optimisation of Worm Propagation on an Unknown Network”, International Journal of Computer Science 2.2 (2007).Applicant
- FireEye Malware Analysis & Exchange Network, Malware Protection System, FireEye Inc., 2010.Applicant
- FireEye Malware Analysis, Modern Malware Forensics, FireEye Inc., 2010.Applicant
- FireEye v.6.0 Security Target, pp. 1-35, Version 1.1, FireEye Inc., May 2011.Applicant
- Gibler, Clint, et al. AndroidLeaks: automatically detecting potential privacy leaks in android applications on a large scale. Springer Berlin Heidelberg, 2012.Applicant
- Goel, et al., Reconstructing System State for Intrusion Analysis, Apr. 2008 SIGOPS Operating Systems Review, vol. 42 Issue 3, pp. 21-28.Applicant
- Gregg Keizer: “Microsoft's HoneyMonkeys Show Patching Windows Works”, Aug. 8, 2005, XP055143386, Retrieved from the Internet: URL:http://www.informationweek.com/microsofts-honeymonkeys-show-patching-windows-works/d/d-id/1035069? [retrieved on Jun. 1, 2016].Applicant
- Heng Yin et al, Panorama: Capturing System-Wide Information Flow for Malware Detection and Analysis, Research Showcase @ CMU, Carnegie Mellon University, 2007.Applicant
- Hjelmvik, Erik, “Passive Network Security Analysis with NetworkMiner”, (IN)Secure, Issue 18, (Oct. 2008), pp. 1-100.Applicant
- Idika et al., A-Survey-of-Malware-Detection-Techniques, Feb. 2, 2007, Department of Computer Science, Purdue University.Applicant
- IEEE Xplore Digital Library Sear Results for “detection of unknown computer worms”. Http//ieeexplore.ieee.org/searchresult.jsp?SortField=Score&SortOrder=desc- &ResultC . . . , (Accessed on Aug. 28, 2009).Applicant
- Isohara, Takamasa, Keisuke Takemori, and Ayumu Kubota. “Kernel-based behavior analysis for android malware detection.” Computational intelligence and Security (CIS), 2011 Seventh International Conference on. IEEE, 2011.Applicant
- Kaeo, Merike, “Designing Network Security”, (“Kaeo”), (Nov. 2003).Applicant
- Kevin A Roundy et al: “Hybrid Analysis and Control of Malware”, Sep. 15, 2010, Recent Advances in Intrusion Detection, Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 317-338, XP019150454 ISBN:978-3-642-15511-6.Applicant
- Kim, H. , et al., “Autograph: Toward Automated, Distributed Worm Signature Detection”, Proceedings of the 13th Usenix Security Symposium (Security 2004), San Diego, (Aug. 2004), pp. 271-286.Applicant
- King, Samuel T., et al., “Operating System Support for Virtual Machines”, (“King”) (2003).Applicant
- Krasnyansky, Max , et al., Universal TUN/TAP driver, available at https://www.kernel.org/doc/Documentation/networking/tuntap.txt (2002) (“Krasnyansky”).Applicant
- Kreibich, C., et al., “Honeycomb-Creating Intrusion Detection Signatures Using Honeypots”, 2nd Workshop on Hot Topics in Networks (HotNets-11), Boston, USA, (2003).Applicant
- Kristoff, J., “Botnets, Detection and Mitigation: DNS-Based Techniques”, NU Security Day, (2005), 23 pages.Applicant
- Leading Colleges Select FireEye to Stop Malware-Related Data Breaches, FireEye Inc., 2009.Applicant
- Li et al., A VMM-Based System Call Interposition Framework for Program Monitoring, Dec. 2010, IEEE 16th International Conference on Parallel and Distributed Systems, pp. 706-711.Applicant
- Liljenstam, Michael, et al., “Simulating Realistic Network Traffic for Worm Warning System Design and Testing”, Institute for Security Technology studies, Dartmouth College (“Liljenstam”), (Oct. 27, 2003).Applicant
- Lindorfer, Martina, Clemens Kolbitsch, and Paolo Milani Comparetti “Detecting environment-sensitive malware.” Recent Advances in Intrusion Detection. Springer Berlin Heidelberg, 2011.Applicant
- Lok Kwong et al: “DroidScope: Seamlessly Reconstructing the OS and Dalvik Semantic Views for Dynamic Android Malware Analysis”, Aug. 10, 2012, XP055158513, Retrieved from the Internet: URL:https://www.usenix.org/system/files/conference/usenixsecurity12/sec12--final107.pdf [retrieved on Dec. 15, 2014].Applicant
- Marchette, David J., “Computer Intrusion Detection and Network Monitoring: A Statistical Viewpoint”, (“Marchette”), (2001).Applicant
- Margolis, P.E., “Random House Webster's ‘Computer & Internet Dictionary 3rd Edition’”, ISBN 0375703519, (Dec. 1998).Applicant
- Moore, D., et al., “Internet Quarantine: Requirements for Containing Self-Propagating Code”, INFOCOM, vol. 3, (Mar. 30-Apr. 3, 2003), pp. 1901-1910.Applicant
- Morales, Jose A., et al., ““Analyzing and exploiting network behaviors of malware.””, Security and Privacy in Communication Networks. Springer Berlin Heidelberg, 2010. 20-34.Applicant
- Mori, Detecting Unknown Computer Viruses, 2004, Springer-Verlag Berlin Heidelberg.Applicant
- Natvig, Kurt, “SANDBOXII: Internet”, Virus Bulletin Conference, (“Natvig”), (Sep. 2002).Applicant
- NetBIOS Working Group. Protocol Standard for a NetBIOS Service on a TCP/UDP transport: Concepts and Methods. STD 19, RFC 1001, Mar. 1987.Applicant
- Newsome, J., et al., “Dynamic Taint Analysis for Automatic Detection, Analysis, and Signature Generation of Exploits on Commodity Software”, In Proceedings of the 12th Annual Network and Distributed System Security, Symposium (NDSS '05), (Feb. 2005).Applicant
- Newsome, J., et al., “Polygraph: Automatically Generating Signatures for Polymorphic Worms”, In Proceedings of the IEEE Symposium on Security and Privacy, (May 2005).Applicant
- Nojiri, D., et al., “Cooperation Response Strategies for Large Scale Attack Mitigation”, DARPA Information Survivability Conference and Exposition, vol. 1, (Apr. 22-24, 2003), pp. 293-302.Applicant
- Oberheide et al., CloudAV.sub.—N-Version Antivirus in the Network Cloud, 17th USENIX Security Symposium USENIX Security '08 Jul. 28-Aug. 1, 2008 San Jose, CA.Applicant
- PCT/US12/21916 filed Jan. 19, 2012 International Search Report and Written Opinion dated May 10, 2012.Applicant
- PCT/US12/26402 filed Feb. 23, 2012 International Search Report and Written Opinion dated May 25, 2012.Applicant
- PCT/US2014/043726, filed Jun. 23, 2013 International Search Report and Written Opinion, dated Oct. 9, 2014.Applicant
- PCT/US2014/043727, filed Jun. 23, 2014 International Search Report and Written Opinion, dated Oct. 9, 2014.Applicant
- Reiner Sailer, Enriquillo Valdez, Trent Jaeger, Roonald Perez, Leendert van Doorn, John Linwood Griffin, Stefan Berger., sHype: Secure Hypervisor Appraoch to Trusted Virtualized Systems (Feb. 2, 2005) (“Sailer”).Applicant
- Silicon Defense, “Worm Containment in the Internal Network”, (Mar. 2003), pp. 1-25.Applicant
- Singh, S. , et al., “Automated Worm Fingerprinting”, Proceedings of the ACM/USENIX Symposium on Operating System Design and Implementation, San Francisco, California, (Dec. 2004).Applicant
- Spitzner, Lance, “Honeypots: Tracking Hackers”, (“Spizner”), (Sep. 17, 2002).Applicant
- The Sniffers's Guide to Raw Traffic available at: yuba.stanford.edu/.about.casado/pcap/section1.html, (Jan. 6, 2014).Applicant
- Thomas H. Ptacek, and Timothy N. Newsham , “Insertion, Evasion, and Denial of Service: Eluding Network Intrusion Detection”, Secure Networks, (“Ptacek”), (Jan. 1998).Applicant
- U.S. Appl. No. 11/152,286, filed Jun. 13, 2005 Final Office Action dated Oct. 28, 2009.Applicant
- U.S. Appl. No. 11/152,286, filed Jun. 13, 2005 Non-Final Office Action dated Apr. 2, 2009.Applicant
- U.S. Appl. No. 11/152,286, filed Jun. 13, 2005 Non-Final Office Action dated Aug. 31, 2010.Applicant
- U.S. Appl. No. 11/409,355, filed Apr. 20, 2015, Final Office Action dated Aug. 23, 2011.Applicant
- U.S. Appl. No. 11/409,355, filed Apr. 20, 2015, Final Office Action dated Feb. 11, 2009.Applicant
- U.S. Appl. No. 11/409,355, filed Apr. 20, 2015, Final Office Action dated Mar. 29, 2010.Applicant
- U.S. Appl. No. 11/409,355, filed Apr. 20, 2015, Final Office Action dated May 10, 2011.Applicant
- U.S. Appl. No. 11/409,355, filed Apr. 20, 2015, Non-Final Office Action dated Aug. 4, 2009.Applicant
- U.S. Appl. No. 11/409,355, filed Apr. 20, 2015, Non-Final Office Action dated Aug. 8, 2008.Applicant
- U.S. Appl. No. 11/409,355, filed Apr. 20, 2015, Non-Final Office Action dated Nov. 24, 2010.Applicant
- U.S. Appl. No. 11/011,344, filed Jan. 21, 2011 Non-Final Office Action, dated Sep. 30, 2014.Applicant
- U.S. Appl. No. 13/469,046, filed May 10, 2012 Non-Final Office Action, dated Sep. 30, 2014.Applicant
- U.S. Appl. No. 13/651,331, filed Oct. 12, 2012 Non-Final Office Action dated Feb. 4, 2013.Applicant
- U.S. Appl. No. 13/775,166, filed Feb. 23, 2013 Final Office Action, dated Oct. 22, 2014.Applicant
- U.S. Appl. No. 14/012,945, filed Aug. 28, 2013 Non-Final Office Action, dated Nov. 6, 2013.Applicant
- U.S. Appl. No. 14/059,381, filed Oct. 21, 2013 Non-Final Office Action, dated Oct. 29, 2014.Applicant
- U.S. Pat. No. 8,171,553 filed Apr. 20, 2006, Inter Parties Review Decision dated Jul. 10, 2015.Applicant
- U.S. Pat. No. 8,291,499 filed Mar. 16, 2012, Inter Parties Review Decision dated Jul. 10, 2015.Applicant
- U.S. Pat. No. 8,291,499 Petition for Inter Partes Review Under 35 U.S.C. §§ 311-319 and 37 C.F.R. § 42, Finjan, Inc, Petitioner V. FireEye, Inc, Patent Owner; and Declaration of Professor Trent Jaeger in Support of Inter Partes Review of U.S. Pat. No. 8,291,499,—Jan. 9, 2014.Applicant
- Venezia, Paul, “NetDetector Captures Intrusions”, InfoWorld Issue 27, (“Venezia”), (Jul. 14, 2003).Applicant
- Wahid et al., Characterising the Evolution in Scanning Activity of Suspicious Hosts, Oct. 2009, Third International Conference on Network and System Security, pp. 344-350.Applicant
- Whyte, et al., “DNS-Based Detection of Scanning Works in an Enterprise Network”, Proceedings of the 12th Annual Network and Distributed System Security Symposium, (Feb. 2005), 15 pages.Applicant
- Williamson, Matthew M., “Throttling Viruses: Restricting Propagation to Defeat Malicious Mobile Code”, ACSAC Conference, Las Vegas, NV, USA, (Dec. 2002), pp. 1-9.Applicant
- Yuhei Kawakoya et al: “Memory behavior-based automatic malware unpacking in stealth debugging environment”, Malicious and Unwanted Software (Malware), 2010 5th International Conference on, IEEE, Piscataway, NJ, USA, Oct. 19, 2010, pp. 39-46, XP031833827, ISBN:978-1-4244-8-9353-1.Applicant
- Zhang et al., The Effects of Threading, Infection Time, and Multiple-Attacker Collaboration on Malware Propagation, Sep. 2009, IEEE 28th International Symposium on Reliable Distributed Systems, pp. 73-82.Applicant