US 9,756,074 B2Grant

System and method for IPS and VM-based detection of suspicious objects

Issue Date:2017-09-05

•23 Claims

•15 Drawing Sheets

Abstract

A threat detection system is integrated with intrusion protection system (IPS) logic and virtual execution logic is shown. The IPS logic is configured to receive a first plurality of objects and filter the first plurality of objects by identifying a second plurality of objects as suspicious objects. The second plurality of objects is a subset of the first plurality of objects and is lesser or equal in number to the first plurality of objects. The virtual execution logic is configured to automatically verify whether any of the suspicious objects is an exploit. The virtual execution logic comprises at least one virtual machine configured to virtually process content within the suspicious objects and monitor for anomalous behaviors during the virtual processing that are indicative of exploits.

Metadata

Assignee

FireEye, Inc.

Inventors

Ashar Aziz
Muhammad Amin
Osman Abdoul Ismael
Zheng Bu

Application Information

Application Number:US 14/228,073

Filing Date:2014-03-27

Priority Date:2013-12-26

Art Unit:2495

Classifications

IPC:

H04L29/06G06F21/56G06F9/455

Field of Search:

H04L 63/1441H04L 63/1491H04L 63/1433G06F 9/45558G06F 21/56G06F 21/564G06F 2009/45587

Patent Drawings (15 sheets)

Description

CROSS-REFERENCE TO RELATED APPLICATIONS

[0001] This application claims the benefit of priority on U.S. Provisional Application No. 61/921,033, filed Dec. 26, 2013, the entire contents of which are incorporated by reference herein.

FIELD

[0002] Embodiments of the disclosure relate to the field of network security. More specifically, one embodiment of the disclosure relates to a system, apparatus and method for identifying a suspicious object, automatically verifying the suspect object as an exploit through virtual processing.

GENERAL BACKGROUND

[0003] Over the last decade, malicious software has become a pervasive problem for Internet users as most networked resources include software vulnerabilities that are subject to attack. For instance, over the past few years, more and more vulnerabilities are being discovered in software that is loaded onto network devices, such as vulnerabilities within operating systems for example. While some vulnerabilities continue to be addressed through software patches, prior to the release of such software patches, network resources continue to be the targeted by exploits.

[0004] In general, an exploit is information that attempts to take advantage of a vulnerability in computer software by adversely influencing or attacking normal operations of a targeted computer. As an illustrative example, a Portable Execution Format (PDF) file may be infected with an exploit that is activated upon execution (opening) of the PDF file and takes advantage of a vulnerability associated with Acrobat® Reader version 9.0.

[0005] Currently, one type of security application widely used for detecting exploits is an intrusion prevention system (IPS). Typically implemented as part of a firewall, an IPS is designed to identify packets suspected of containing known exploits, attempt to block/halt propagation of such exploits, and log/report information associated with such packets through an alert. However, conventional IPS technology suffers from a number of disadvantages.

[0006] One disadvantage with conventional IPS technology in that the IPS does not rely on any mechanism to automatically verify its results. Rather, verification of the results produced from a conventional IPS is handled manually.

[0007] Another disadvantage is that, without automated verification, the IPS tends to produce a large number of false positives, namely incorrect alerts that occur when the IPS reports certain benign objects as exploits. These false positives cause a variety of adverse effects. For instance, due to the large number of false positives, one adverse effect is that actual exploits detected within network traffic may go unnoticed by an administrator. Other adverse effects may include (i) needless blocking of incoming network traffic; (ii) unnecessarily reduction of processing resources; (iii) significant drainage of administrative resources to handle incorrectly classified objects; and (iv) development of a culture (or policy) of sporadically checking only some of the suspect objects.

[0008] In efforts to mitigate the number of false positives, the IPS may frequently require customized and periodic tuning of its signature database, which is a costly endeavor. Furthermore, simply tuning the IPS to significantly reduce the number of false positives can severely degrade the effectiveness of the IPS and/or severely disrupt network operability.

BRIEF DESCRIPTION OF THE DRAWINGS

[0009] Embodiments of the invention are illustrated by way of example and not by way of limitation in the figures of the accompanying drawings, in which like references indicate similar elements and in which:

[0010] FIG. 1A is a first exemplary block diagram of an operational flow of threat detection and prevention within an electronic device.

[0011] FIG. 1B is a second exemplary block diagram of an operational flow of threat detection and prevention within an electronic device.

[0012] FIG. 2A is a first exemplary block diagram of a communication system deploying a plurality of threat detection and prevention (TDP) systems with framework for conducting exploit analysis using intrusion protection system (IPS) logic with results verified by virtual execution logic.

[0013] FIG. 2B is a second exemplary block diagram of a communication system deploying a plurality of TDP systems with framework for conducting exploit analysis using IPS logic with results verified by virtual execution logic.

[0014] FIG. 3 is an exemplary block diagram of logic associated with the TDP system of FIGS. 2A-2B.

[0015] FIG. 4 is an exemplary diagram of a flowchart illustrating operations of the threat detection and prevention process.

[0016] FIGS. 5A-5B are exemplary embodiments of user interface display screens produced by display logic, where the display screens provides an interactive dashboard.

[0017] FIGS. 6A-6B are exemplary block diagrams of operational flows of analyzed objects associated with network traffic in accordance with an alternative embodiment of the TCP system.

[0018] FIGS. 7A-7B are exemplary block diagrams of a communication system deploying a plurality of threat detection and prevention (TDP) systems with a framework for conducting exploit analysis using intrusion protection system (IPS) logic and heuristic logic with results verified by the virtual execution logic pursuant to the alternative embodiment.

[0019] FIGS. 8A-8B are exemplary diagrams of a flowchart illustrating operations of the threat detection and prevention process according to the framework of FIGS. 7A-7B.

DETAILED DESCRIPTION

[0020] Various embodiments of the disclosure relate to an electronic device with network connectivity, such as a threat detection and prevention (TDP) system for example, where the electronic device comprises a static analysis engine, a dynamic analysis engine and reporting logic. According to one embodiment of the disclosure, the static analysis engine comprises intrusion protection system (IPS) logic that conducts at least exploit signature checks and/or vulnerability signature checks on objects under analysis to identify whether characteristics of any of these objects are indicative of an exploit. Those objects with these identified characteristics are label “suspect” or “suspicious” objects. The dynamic analysis engine comprises virtual execution logic to automatically and subsequently analyze, without user assistance, content within suspect objects provided from the IPS logic in order to possibly verify whether any of the suspect objects is an exploit.

[0021] Based on analysis results from the IPS logic and the virtual execution logic, reporting logic within the TDP system generates a report (e.g., one or more display screens, printed report, etc.) that highlights information associated with these “verified” exploits, namely suspect objects initially identified by the IPS logic that have been verified by the virtual execution logic to be exploits. Some or all of the information associated with the verified exploits (referred to as “verified exploit information”) may be highlighted to visibly denote the verified exploits from the non-verified exploits, namely suspect objects initially identified by the IPS logic that have not been verified by the virtual execution logic. Examples as to how the verified exploit information is highlighted may include (1) altering location or ordering of at least certain portions of the verified exploit information to prominently display such information within the report; (2) modifying the font (e.g., color, size, type, style, and/or effects) used in conveying some of the verified exploit information; (3) placement of one or more images proximate to a listing of the verified exploit information; or the like.

I. Terminology

[0022] In the following description, certain terminology is used to describe features of the invention. For example, in certain situations, both terms “logic” and “engine” are representative of hardware, firmware and/or software that is configured to perform one or more functions. As hardware, logic (or engine) may include circuitry having data processing or storage functionality. Examples of such circuitry may include, but is not limited or restricted to a microprocessor, one or more processor cores, a programmable gate array, a microcontroller, an application specific integrated circuit, wireless receiver, transmitter and/or transceiver circuitry, semiconductor memory, or combinatorial logic.

[0023] Logic (or engine) may be software in the form of one or more software modules, such as executable code in the form of an executable application, an application programming interface (API), a subroutine, a function, a procedure, an applet, a servlet, a routine, source code, object code, a shared library/dynamic load library, or one or more instructions. These software modules may be stored in any type of a suitable non-transitory storage medium, or transitory storage medium (e.g., electrical, optical, acoustical or other form of propagated signals such as carrier waves, infrared signals, or digital signals). Examples of non-transitory storage medium may include, but are not limited or restricted to a programmable circuit; a semiconductor memory; non-persistent storage such as volatile memory (e.g., any type of random access memory “RAM”); persistent storage such as non-volatile memory (e.g., read-only memory “ROM”, power-backed RAM, flash memory, phase-change memory, etc.), a solid-state drive, hard disk drive, an optical disc drive, or a portable memory device. As firmware, the executable code is stored in persistent storage.

[0024] The term “object” generally refers to a collection of data, whether in transit (e.g., over a network) or at rest (e.g., stored), often having a logical structure or organization that enables it to be classified for purposes of analysis. During analysis, for example, the object may exhibit a set of expected characteristics and, during processing, a set of expected behaviors. The object may also exhibit a set of unexpected characteristics and a set of unexpected behaviors that may evidence an exploit and potentially allow the object to be classified as an exploit.

[0025] Examples of objects may include one or more flows or a self-contained element within a flow itself. A “flow” generally refers to related packets that are received, transmitted, or exchanged within a communication session. For convenience, a packet is broadly referred to as a series of bits or bytes having a prescribed format, which may include packets, frames, or cells.

[0026] As an illustrative example, an object may include a set of flows such as (1) a sequence of transmissions in accordance with a particular communication protocol (e.g., User Datagram Protocol (UDP); Transmission Control Protocol (TCP); or Hypertext Transfer Protocol (HTTP); etc.), or (2) inter-process communications (e.g. Remote Procedure Call “RPC” or analogous processes, etc.). Similar, as another illustrative example, the object may be a self-contained element, where different types of such objects may include an executable file, non-executable file (such as a document or a dynamically link library), a Portable Document Format (PDF) file, a JavaScript file, Zip file, a Flash file, a document (for example, a Microsoft Office® document), an electronic mail (email), downloaded web page, an instant messaging element in accordance with Session Initiation Protocol (SIP) or another messaging protocol, or the like.

[0027] An “exploit” may be construed broadly as information (e.g., executable code, data, command(s), etc.) that attempts to take advantage of a software vulnerability. Typically, a “vulnerability” is a coding error or artifact of software (e.g., computer program) that allows an attacker to alter legitimate control flow during processing of the software (computer program) by an electronic device, and thus, causes the electronic device to experience undesirable or unexpected behaviors. The undesired or unexpected behaviors may include a communication-based anomaly or an execution-based anomaly, which, for example, could (1) alter the functionality of an electronic device executing application software in a malicious manner; (2) alter the functionality of the electronic device executing that application software without any malicious intent; and/or (3) provide unwanted functionality which may be generally acceptable in another context. To illustrate, a computer program may be considered as a state machine, where all valid states (and transitions between states) are managed and defined by the program, in which case an exploit may be viewed as seeking to alter one or more of the states (or transitions) from those defined by the program.

[0028] Malware may be construed broadly as computer code that executes an exploit to take advantage of a vulnerability, for example, to harm or co-opt operation of an electronic device or misappropriate, modify or delete data. Conventionally, malware is often said to be designed with malicious intent. An object may constitute or contain malware.

[0029] The term “transmission medium” is a physical or logical communication path between two or more electronic devices (e.g., any devices with data processing and network connectivity such as, for example, a security appliance, a server, a mainframe, a computer such as a desktop or laptop, netbook, tablet, firewall, smart phone, router, switch, bridge, etc.). For instance, the communication path may include wired and/or wireless segments. Examples of wired and/or wireless segments include electrical wiring, optical fiber, cable, bus trace, or a wireless channel using infrared, radio frequency (RF), or any other wired/wireless signaling mechanism.

[0030] In certain instances, the terms “detected” and “verified” are used herein to represent that there is a prescribed level of confidence (or probability) on the presence of an exploit within an object under analysis. For instance, the IPS logic (described below) “detects” a potential exploit by examining characteristics or features of an object under analysis, and, in response, determining whether the object has characteristics indicative of an exploit (a “suspect object”). This determination may be conducted through analysis as to whether there exists at least a first probability of the object under analysis being an exploit. Likewise, the virtual execution logic “verifies” the presence of the exploit by monitoring or observing unexpected or anomalous behaviors or activities, and, in response, determining that suspect object is an exploit. According to one embodiment of the disclosure, the determination by the virtual execution logic may involve an analysis as to whether there exists a second probability of the suspect exploit being an exploit. The second probability may be greater than the first probability and may take into account the first probability.

[0031] The term “computerized” generally represents that any corresponding operations are conducted by hardware in combination with software and/or firmware. Also, the terms “compare” or “comparison” generally mean determining if a match (e.g., a certain level of correlation) is achieved between two items where one of the items may include a particular signature pattern.

[0032] Lastly, the terms “or” and “and/or” as used herein are to be interpreted as inclusive or meaning any one or any combination. Therefore, “A, B or C” or “A, B and/or C” mean “any of the following: A; B; C; A and B; A and C; B and C; A, B and C.” An exception to this definition will occur only when a combination of elements, functions, steps or acts are in some way inherently mutually exclusive.

[0033] The invention may be utilized for detection, verification and/or prioritization of malicious content such as exploits. As this invention is susceptible to embodiments of many different forms, it is intended that the present disclosure is to be considered as an example of the principles of the invention and not intended to limit the invention to the specific embodiments shown and described.

II. First Embodiment—IPS Logic with Virtual Execution Logic Verification

A. Communication Flow

[0034] Referring to FIG. 1A, an exemplary block diagram of an operational flow of threat detection and prevention within an electronic device 100 is shown. Herein, some or all of the incoming objects 110 associated with monitored network traffic are received by IPS logic 120, which is part of the static analysis engine of FIGS. 2A-2B for example. The IPS logic 120 is configured as a capture and filter device that receives the incoming objects 110 and filters, using at least exploit signatures and/or vulnerability signatures, which objects are to be provided for more in-depth analysis. The exploit signatures and/or vulnerability signatures may be updated in a periodic or aperiodic manner.

[0035] More specifically, a suspected exploit may be detected by conducting exploit signature checks and/or vulnerability signature checks, namely comparing an object under analysis to one or more pre-stored exploit signatures and/or vulnerability signatures to determine if a match is detected. In general, an “exploit signature” includes information directed to a previously detected or known attack pattern while a “vulnerability signature” includes information that characterizes a potential attempt to capitalize on a previously detected or known vulnerability, even when no specific exploit for that vulnerability is known. According to one embodiment of the disclosure, the vulnerability signature may be considered a protocol state machine that maintains state and is normally configured to define parameters for an object being a set of flows that represent an attempt being made to capitalize on a particular software vulnerability that the vulnerability signature is attempting to protect.

[0036] Upon conducting at least exploit signature checks and/or vulnerability signature checks on the incoming objects 110 and identifying a first subset of objects 130 having characteristics indicative of an exploit (“suspect objects”), the IPS logic 120 provides the first set of suspect objects 130 to verification logic 150 and provides results 140 of its analysis (referred to herein as “IPS-based results”) to reporting logic 170 for storage and subsequent access.

[0037] It is contemplated that the first subset of objects 130 may be lesser in number (and potentially significantly less in number) than the incoming objects 110. For example, while the first subset of objects 130 may be a stream of objects, for ease of discussion in this section, the first subset of objects 130 may refer to at least one incoming object initially suspected of being an exploit (e.g., a suspect object matches a pre-stored exploit signature or a vulnerability signature). Hence, the IPS logic 120 routes the suspect object 130 to verification logic 150 and outputs the IPS-based results 140 associated with suspect object 130 to reporting logic 170.

[0038] The IPS-based results 140 may provide details directed to one or more suspected exploits within the suspect object 130. As an example, the details may include (i) an exploit identifier such as a particular name/family of the suspected exploit (if known); (ii) source address (e.g., Uniform Resource Locator “URL”, Internet Protocol “IP” address, etc.) of the electronic device sending the suspect object; (iii) time of analysis; (iv) information associated with anticipated anomalous activities that may be conducted by the suspected exploit; (v) information regarding anticipated communication deviations from the protocol applicable to the network traffic; and/or (vi) recommended remediation techniques for this type of exploit.

[0039] As mentioned above, the suspect object 130 is routed to verification logic 150 (e.g., virtual execution logic being part of a dynamic analysis engine 270 as illustrated in FIGS. 2A-2B). The verification logic 150 attempts to verify whether the suspect object 130 is an exploit by virtual processing content within the suspect object 130 and monitoring behaviors during such virtual processing, as described below.

[0040] The results 160 of this analysis are output from the verification logic 150 for subsequent use by reporting logic 170 in generating a report 180 that visibly denotes and filters the suspect objects from the first set of objects 130 that have been verified (verified exploits) from those suspect objects from the first set of objects 130 that have not been verified (non-verified exploits). Although not illustrated in FIG. 1A, the VM-based results 160 may include (1) the suspect object; (2) time of analysis; (3) one or more scores that may be used to verify that the suspect object is likely an exploit, and if so: (i) the exploit identifier; (ii) characteristics or anomalous behaviors associated with the verified exploit, which may include video/images of anomalous behaviors; and/or (iii) name and/or version number of software detected to be vulnerable to the verified exploit.

[0041] Thereafter, at least portions of the IPS-based results 140 and the VM-based results 160 for the suspect object are combined. More specifically, in the event that the VM-based results 160 indicate that the verification logic 150 failed to verify that the suspect object 130 is an exploit (e.g., a computed score below a prescribed threshold), some or all of the IPS-based results 140 and the VM-based results 160 for that object are combined and added as part of “non-verified exploit information” 190 for storage and use by the reporting logic 170.

[0042] However, when the VM-based results 160 indicate that the verification logic 150 has verified that the suspect object 130 is an exploit (e.g., the computed score is equal to or above a prescribed threshold), some or all of the IPS-based results 140 and the VM-based results 160 may be modified to achieve a highlighted display of at least the verified exploits. For example, certain portions of the results 140 and/or 160 may be associated with display commands, which are recognized by a display controller being part of display logic within the reporting logic 170 and causes the display logic to produce an output that may visibly denotes differences between displayed results associated with verified exploits from displayed results associated with the non-verified exploits. This exploit information associated with the verified exploit may be stored as part of the “verified exploit information” 195″.

[0043] The display logic 290 also may be configured to recognize that the verified exploit information 195 is to be displayed more prominently than the non-verified exploit information 190. For instance, display logic 290 may be configured to prominently display the verified exploit information within different display screens, within different display windows, within a certain section of a display screen, or positioned at a top of a listing. Additionally or in the alternative, at least a portion of the verified exploit information for each verified exploit may be conveyed using a different font (e.g., color, size, type, style, and/or effects) than the font used for conveying exploit information associated with non-verified exploits. Additionally or in the alternative, one or more images may be placed proximate to exploit information associated with each verified exploit. Illustrative examples of screen displays are shown in FIGS. 5A-5B.

[0044] Besides displaying the exploit information, the reporting logic 170 may issue an alert (e.g., by email or text message) to security administrators for example, communicating the urgency in handling one or more verified exploits. The reporting logic 170 may also issue alerts for one or more non-verified exploits by providing alerts in a manner that denotes to users a selected threat level.

[0045] As further shown, the IPS logic 120 may be communicatively coupled to a network 105 (e.g., public or private network) to receive incoming objects 110, such as one or more flows for example, destined for a particular client device. The IPS logic 120 is configured to conduct exploit signature checks and/or vulnerability signature checks on the incoming objects 110 to determine whether any of the objects 110 have characteristics indicative of an exploit, and thereafter, provide the suspect object(s) 130 to verification logic 150.

[0046] According to one embodiment of the disclosure, the communicative coupling between the IPS logic 120 and the verification logic 150 is provided in a sideband configuration, where the suspect object(s) 130 (or a copy thereof) may be temporarily stored and processed in the verification logic 150 concurrently with analysis of other objects by the IPS logic 120. This allows for the detection of exploits through a longer duration of analysis by the verification logic 150 (e.g., longer processing and monitoring of processing of the suspect object 130 within the virtual execution logic). This also allows detection of exploits with delayed activation, including time-bombs. However, it is contemplated that the IPS logic 120 may be configured in-line with verification logic 150 as shown in FIG. 1B. Herein, the IPS logic 120 may provide both the suspect objects 130 and IPS-based results 140 to the verification logic 150, where the IPS-based results may be subsequently routed to reporting logic 170 from the verification logic 150.

B. General Architecture—First Embodiment

[0047] Referring to FIG. 2A, an exemplary block diagram of a communication system 200 deploying a plurality of threat detection and prevention (TDP) systems 210₁-210_N(N>1, e.g., N=3) communicatively coupled to a management system 220 via a network 225 is shown. In general, management system 220 is adapted to manage TDP systems 210₁-210₃. For instance, management system 220 is responsible for automatically updating one or more exploit signatures and/or vulnerability signatures used by IPS logic within some or all of TDP systems 210₁-210_N. Each of these signatures may represent a prior detected exploit or an uncovered software vulnerability. Such sharing may be conducted automatically or manually uploaded by an administrator. Also, such sharing may be conducted freely among the TDP systems 210₁-210₃or subject to a subscription basis.

[0048] Herein, according to the embodiment illustrated in FIG. 2A, a first TDP system 210₁is an electronic device that is adapted to analyze information associated with network traffic routed over a communication network 230 between at least one server device 232 and at least one client device 234. The communication network 230 may include a public network such as the Internet, in which case an optional firewall 236 (represented by dashed lines) may be interposed prior to accessing client device 234. Alternatively, the communication network 230 may be a private network such as a wireless data telecommunication network, wide area network, a type of local area network (LAN), or a combination of networks.

[0049] As shown, the first TDP system 210₁may be communicatively coupled with the communication network 230 via a network interface 238. In general, the network interface 238 operates as a data capturing device (sometimes referred to as a “tap” or “network tap”) that is configured to receive data propagating to/from the client device 234 and provide at least some of this data to the first TDP system 210₁. Alternatively, as shown in FIG. 2B, the first TDP system 210₁may be positioned behind the firewall 236 and in-line with client device 234.

[0050] According to one embodiment of the disclosure, the network interface 238 is capable of receiving and routing objects associated with network traffic to the first TDP system 210₁. The network interface 238 may provide the entire object or certain content within the object, for example, one or more files that are part of a set of flows, packet payloads, or the like. In some embodiments, although not shown, network interface 238 may be contained within the first TDP system 210₁.

[0051] According to an embodiment of the disclosure, the network interface 238 may be further configured to capture metadata from network traffic intended for client device 234. According to one embodiment, the metadata may be used, at least in part, to determine protocols, application types and other information that may be used by logic within the first TDP system 210₁to determine particular software profile(s). The software profile(s) are used for selecting and/or configuring a run-time environment in one or more virtual machines selected or configured as part of the dynamic analysis engine 270, as described below. However, according to another embodiment, a “matched” vulnerability signature may be used for VM configuration to specify software profile(s) (or corresponding software image(s)) having the specific vulnerability associated with the matched vulnerability signature. These software profile(s) may be directed to different versions of the same software application for fetching corresponding software image(s) from storage device 265.

[0052] It is contemplated that, for any embodiments where the first TDP system 210₁is implemented as an dedicated appliance or a dedicated computer system, the network interface 238 may include an assembly integrated into the appliance or computer system that includes a network interface card and related logic (not shown) for connecting to the communication network 230 to non-disruptively “tap” network traffic propagating through firewall 236 and provide either a duplicate copy of at least a portion of the network traffic or at least a portion the network traffic itself to a static analysis engine 250. In other embodiments, the network interface 238 can be integrated into an intermediary device in the communication path (e.g., firewall 236, router, switch or other networked electronic device, which in some embodiments may be equipped with SPAN ports) or can be a standalone component, such as an appropriate commercially available network tap. In virtual environments, a virtual tap (vTAP) can be used to duplicate files from virtual networks.

[0053] As further shown in FIG. 2A, the first TDP system 210₁comprises the static analysis engine 250, a database 255, a scheduler 260, a storage device 265, a dynamic analysis engine 270, an optional classification logic 285, and a display logic 290. It is contemplated that the functionality of the classification logic 285 may be integrated into the display logic 290, where the display logic 290 would be configured with the prioritization logic 286 and/or the tag image generation logic 288.

[0054] In some embodiments, as shown in FIGS. 2A-2B, static analysis engine 250 may include one or more software modules that, when executed by one or more processors, performs multi-level static scanning on a particular object, namely exploit signature checks and/or vulnerability signature checks by IPS logic 120. Such signature check operations may involve accessing pre-stored signatures from one or more non-transitory storage mediums such as signature database 251. The static analysis engine 250 and the dynamic analysis engine 270 may be one or more software modules executed by the same processor or different processors, where these different processors may be located within the same processor package (e.g., different processor cores) and/or located at remote or even geographically remote locations that are communicatively coupled (e.g. by a dedicated communication link) or a network.

[0055] In general, referring to FIG. 2A, the static analysis engine 250 is communicatively coupled to receive one or more objects from network traffic which may be related or unrelated to each other. For instance, one object may be a series of HTTP packets operating as a flow routed over communication network 230. The static analysis engine 250 comprises IPS logic 120, where the IPS logic 120 analyzes each of the objects for known exploits using exploit signatures as well as for the protocol activity using vulnerability signatures. For instance, the exploit matching logic 252 within the IPS logic 120 performs exploit signature checks, which may involve a comparison of one or more pre-stored exploit signatures (pre-configured and predetermined attack patterns against the suspect object) from signature database 251. Similarly, the signature matching logic 253 within the IPS logic 120 performs vulnerability signature checks, which may involve a process of uncovering deviations in messaging practices set forth in applicable communication protocols (e.g., HTTP, TCP, etc.). As an illustrative example, HTTP messages may be analyzed to determine compliance with certain message formats established for the protocol (e.g., out-of-order commands). Furthermore, payload parameters of the HTTP messages may be analyzed to determine further compliance.

[0056] Upon detecting a match during the exploit signature check and/or the vulnerability signature check (an object under analysis has characteristics that suggest the object is an exploit), the IPS logic may be adapted to upload the IPS-based results 140 for storage in database 255. These results 140 may include, but are not limited or restricted to (i) an exploit identifier such as a particular name/family of the suspected exploit (if known); (ii) source address (e.g., Uniform Resource Locator “URL”, Internet Protocol “IP” address, etc.) of a source of the suspect object; (iii) time of analysis; (iv) information associated with anticipated anomalous activities that may be conducted by the suspect exploit; (v) information regarding anticipated communication deviations from the protocol applicable to the network traffic; and/or (vi) recommended remediation techniques. The IPS-based results 140 may be accessible by classification logic 285 and/or display logic 290, as described below.

[0057] Furthermore, the IPS logic 120 routes suspect object to the virtual execution logic 150 within dynamic analysis engine 270. The dynamic analysis engine 270 is configured to provide more in-depth analysis of suspect object(s) from the IPS logic 120 by analyzing the content of the suspect object(s) in order to verify whether or not the suspect object is an exploit. Additionally, according to one embodiment of the disclosure, a tag value may accompany or be associated with the suspect object for use in subsequently locating the suspect object's corresponding stored IPS-based results 140 after virtual processing within the dynamic analysis engine 270. For instance, the tag value may be an address, an index number, or the like. It is contemplated that tag value may be separate from the suspect object or may be strategically placed within the suspect object itself (e.g., within a header portion, payload, etc.).

[0058] More specifically, after static scanning has been completed, the IPS logic 120 provides the suspect object to the dynamic analysis engine 270 for in-depth dynamic analysis using virtual machines (VMs) 275₁-275_M(M≧1). For instance, the dynamic analysis engine 270 may simulate transmission and/or receipt by a destination device comprising the virtual machine. Of course, if the object is not suspected of being an exploit, the IPS logic 120 may simply store the IPS-based results within database 255 and denote that the object is benign.

[0059] According to one embodiment, one or more VMs 275₁-275_Mwithin the virtual execution environment 272 may be configured based on the results of the exploit signature check and the vulnerability signature check conducted by the IPS logic 120. For instance, for an unknown vulnerability, the VMs 275₁-275_Mmay be configured with all of the software profiles corresponding to the software images stored within storage device 265. Alternatively, the VMs 275₁-275_Mmay be configured according to a prevalent software configuration, software configuration used by an electronic device within a particular enterprise network (e.g., client device 234), or an environment that is required for the object to be processed, including software such as a web browser application, PDF™ reader application, or the like. However, for a known vulnerability which occurs after a successful match during a vulnerability signature check, the VMs 275₁-275_Mmay be more narrowly configured to software profiles associated with vulnerable software.

[0060] As a first illustrative example, upon determining that the suspect object matches a particular vulnerability signature, the scheduler 260 may determine (1) what vulnerability signature has been tagged; (2) if the vulnerability is a server side vulnerability or client side vulnerability; and/or (3) which software image(s) are associated with software having the vulnerability associated with the tagged vulnerability signature. Thereafter, the software profile(s) are selected by the scheduler 260 to fetch these software image(s) for configuration of VM 275₁. This tailored selection scheme avoids VM configuration for software that does not feature the matched (tagged) software vulnerability.

[0061] As a second illustrative example, the scheduler 260 may be adapted to configure the multiple VMs 275₁-275_Mfor concurrent virtual execution of a variety of different versions of the software in efforts to verify that the suspect object identified by the signature matching logic 253 is an exploit.

[0062] Of course, it is contemplated that the VM configuration described above may be handled by logic other than the scheduler 260. For instance, although not shown, the static analysis engine 250 may include configuration logic that is adapted to determine (1) what vulnerability signature was tagged; (2) if the vulnerability is a server side vulnerability or client side vulnerability; and/or (3) which software image(s) are associated with software having the vulnerability associated with the tagged vulnerability signature. This configuration logic may transmit the VM configuration information to the scheduler 260 and/or dynamic analysis engine 270 to handle VM configuration as described above.

[0063] According to one embodiment of the disclosure, the dynamic analysis engine 270 is adapted to execute one or more VMs 275₁-275_Mto simulate the receipt and execution of content associated with an object under analysis within a run-time environment as expected by the type of object. For instance, dynamic analysis engine 270 may optionally include a protocol sequence replayer (replay logic) 280 to replay the suspect object and provide replayed data flows to the VM(s) 275₁, . . . , and/or 275_Mor object extractor logic 282 to extract a self-contained object within a data flow for virtual processing by VM(s) 275₁, . . . , and/or 275_M. One embodiment of the protocol sequence replayer is described in U.S. Pat. No. 8,375,444, the entire contents of which are incorporated by reference herein.

[0064] For example, the replay logic 280 may be adapted to provide, and sometimes modify (e.g. modify IP address, etc.) packets associated with the suspect objects and synchronize any return network traffic generated by the virtual execution environment 272 in response to the packets. Hence, the replay logic 280 may suppress (e.g., discard) the return network traffic such that the return network traffic is not transmitted to the communication network 230. According to one embodiment of the disclosure, for a particular suspect object being a flow such as a TCP or UDP sequence, the replay logic 280 may replay the data packets by sending packets to the virtual execution environment 272 via a TCP connection or UDP session. Furthermore, the protocol sequence replay logic 280 synchronizes return network traffic by terminating the TCP connection or UDP session.

[0065] As further shown in FIG. 2A, the monitoring logic 276 within the dynamic analysis engine 270 may be configured to monitor behavior of the content being analyzed by one or more VMs 275₁, . . . , and/or 275_M, for detecting anomalous or unexpected activity indicative of an exploit. If so, the content may be determined as being associated with malicious activity, and thereafter, monitoring logic 276 operating with a score determination logic 278 may route the VM-based results 160 (e.g., computed score, information associated with the detected anomalous behaviors, and other information associated with the detected malicious activity by the suspect object) to classification logic 285 and/or database 255. It is noted that the tag value, if used, may be provided as part of the VM-based results 160.

[0066] According to one embodiment of the disclosure, the score determination logic 278 comprises one or more software modules that are used to determine a probability (or level of confidence) that the suspect object is an exploit. Score determination logic 278 is configured to generate a value (referred to as a “score”) that classifies the threat of the possible exploit. Of course, a score may be assigned to the suspect object as a whole by mathematically combining the scores determined by analysis of different content associated with the same suspect object to obtain an overall score for that suspect object. Thereafter, the suspect object and/or score are routed to classification logic 285 for use in prioritization.

[0067] In general, the classification logic 285 may be configured to receive the VM-based results 160. According to one embodiment of the disclosure, the score may be used, at least in part, to determine whether the virtual execution logic 150 has verified that the suspect object is an exploit. Where the score represents that the suspect object 130 has not been verified by the virtual execution logic 150 to have the characteristics of an exploit, some or all of the VM-based results 160 may be combined with its corresponding IPS-based results to produce the non-verified exploit information 190, which is stored in database 255.

[0068] However, if the score represents that the suspect object 130 has been verified by the virtual execution logic 150 as an exploit, at least some of the combined IPS-based results 140 and/or the VM-based results 160 may be modified by the classification logic 285 and subsequently stored as at least part of the verified exploit information 195. Stated differently, the classification logic 285 operating with the database 255 may be responsible for prioritizing the display of exploit information associated with the verified exploits. This may involve the classification logic 285 modifying order or position for the displayed verified exploit information, or adding information to the verified exploit information that is used by the display logic 290 to modify display order or positioning; modifying the type of font (e.g., color, size, type, style, and/or effects) used for text conveying certain verified exploit information; placing one or more images proximate to verified exploit information for each verified exploit; or the like.

[0069] Of course, it is contemplated that other parameters, combined with or separate from the score, may be used or relied upon to determine whether and/or how to highlight display of the exploit information associated with the suspect object.

[0070] Thereafter, along with non-verified exploit information 190, the verified exploit information 195 is stored within database 255 and accessible by display logic 290.

[0071] More specifically, according to one embodiment of the disclosure, classification logic 285 comprises prioritization logic 286 and tag image generation logic 288. According to one embodiment of the disclosure, the prioritization logic 286 may be adapted to modify (e.g., alter or associate display commands to) exploit information associated with verified exploits based one or more factors, including (i) score associated with the object; (ii) source of the object; (iii) repeated detection of the same exploit in different suspect objects; or the like. This modification may involve modifying font (e.g., color, size, type, style, and/or effects) used to convey the exploit information associated with verified exploits. As another example, this modification may involve classification and storage of the exploit information as verified exploit information 195 which, when accessed by the display logic 290, places the exploit information associated with the verified exploit at a specific location on a display screen or within display image (e.g., within a specific window or display screen listing the verified exploits, at a particular order within the listing of the verified and non-verified exploits, etc.).

[0072] Of course, as an alternative, the display logic 290 may be implemented with some or all of the functionality associated with the prioritization logic 286 and/or tag image generation logic 288 in lieu of deployment within the classification logic 285. Hence, responsive to information received from the classification logic, the display logic 290 may be adapted to modify exploit information associated with verified exploits.

[0073] The tag image generation logic 288 may be adapted to operate in combination with the prioritization logic 286 to generate a tag image (not shown), which is included as part of the verified exploit information 195 associated with suspect object for display. The tag image is used to provide another visual representation of the presence of a verified exploit, namely a suspected exploit detected by the IPS logic 120 whose presence has been verified by the virtual execution logic 150.

[0074] Of course, in lieu of or in addition to static scanning operations being conducted by TDP systems 210₁-210₃, it is contemplated that cloud computing services 240 may be implemented with IPS logic 120 to perform the exploit and/or vulnerability signature checks and/or with virtual execution logic 150 to conduct virtual execution on content within the object under analysis, as described herein. The display logic 290 may cause the display of the exploit information associated with the verified exploits and/or non-verified exploits graphically or otherwise through a downloaded page or pages from the cloud computing services 240 to a client device or to an application running on a client device that displays the results obtained from the cloud computing services 240. In accordance with this embodiment, TDP system 210₁may be adapted to establish secured communications with cloud computing services 240 for exchanging information.

C. General Architecture—Second Embodiment

[0075] Referring now to FIG. 2B, first TDP system 210₁may be coupled with the communication network 230 in line with client device 234. Contrary to the embodiment illustrated in FIG. 2A, first TDP system 210₁comprises an interface unit 295 that directs signaling on communication network 230 to static analysis engine 250 or classification logic 285, given that the dynamic analysis engine 270 is deployed in cloud computing services 240. Hence, objects from network traffic for static analysis are routed to static analysis engine 250 via communication path 296. The suspicious objects may be routed via path 297 to the dynamic analysis engine 270 in cloud computing services 240. Similarly, objects that are not determined to be at least “suspect” may be returned via path 297 for continued routing to client device 234. The results of the dynamic analysis engine 270 (e.g., exploit information) may be routed via path 298 for prioritization and tagging before storage within database 255 for subsequent use by display logic 290.

D. Exemplary Logic Layout of TDP System

[0076] Referring now to FIG. 3, an exemplary block diagram of logic associated with TDP system 210₁of FIGS. 2A-2B is shown. TDP system 210₁comprises one or more processors 300 that are coupled to communication interface logic 310 via a first transmission medium 320. Communication interface logic 310 enables communications with other TDP systems 210₂-210₃and management system 220 of FIG. 2A-2B. According to one embodiment of the disclosure, communication interface logic 310 may be implemented as a physical interface including one or more ports for wired connectors. Additionally, or in the alternative, communication interface logic 310 may be implemented with one or more radio units for supporting wireless communications with other electronic devices.

[0077] Processor(s) 300 is further coupled to persistent storage 330 via transmission medium 325. According to one embodiment of the disclosure, persistent storage 330 may include (i) static analysis engine 250, including first analysis logic (e.g., IPS logic) 250; (ii) the dynamic analysis engine 270, including virtual execution logic 272, monitoring logic 276, score determination logic 278 along with optional replay and object extractor logic 280 and 282; (iii) classification logic 285 including prioritization logic 286 and tag image generation logic 288; and (iv) display logic 290. Of course, when implemented as hardware, one or more of these logic units could be implemented separately from each other.

[0078] IPS logic 120 comprises one or more software modules that conduct a first static analysis on each incoming object. As described above, this analysis may involve performing at least exploit signature checks and vulnerability signature checks on each incoming object to determine whether characteristics of any of these objects are indicative of an exploit. If not, the analysis may be discontinued for the object, or the object may be provided for non-real time forensic review. Upon confirming that one or more suspect objects have characteristics of an exploit, the IPS logic 120 provides the suspect object(s) to the virtual execution logic 150. It is contemplated that a tag value, if used, may accompany (or be associated with) the suspect object to identify a stored location of the IPS-based results 140 for the suspect object, as described above. The IPS-based results 140 are uploaded to data store 350, at least partially operating as a database, for subsequent access by classification logic 285.

[0079] Virtual execution environment 272 comprises one or more software modules that are used for performing an in-depth, dynamic and real-time analysis of the suspect object using one or more VMs. More specifically, the virtual execution environment 272, protocol sequence replay logic 280 and/or object extractor logic 282 are adapted to run the VM(s), which virtually processes the content associated with the suspect objects by simulating receipt and execution of such content in order to determine the presence of one or more exploits. Furthermore, the monitoring logic 276 monitors in real-time and may also log at least anomalous behaviors by the VM(s) configured with certain software and features that are presumably targeted by the matched exploit or vulnerability. In essence, the monitoring logic 276 identifies the effects that the suspect object would have had on a physical electronic device with the same software/feature configuration. Such effects may include unusual network transmissions, unusual changes in performance, and the like.

[0080] Thereafter, according to the observed behavior of the virtually executed content, the monitoring logic 276 may determine that the content is associated with one or more exploits, where the severity of the observed anomalous behavior and/or the likelihood of the anomalous behavior results from an exploit, is evaluated and reflected in a “score” assigned by the score determination logic 278. As a result, these logic units collectively output the VM-based results 160 for use by classification logic 285 to highlight exploit information associated with verified exploits.

[0081] The prioritization logic 286 comprises one or more software modules that are used to highlight information associated with verified exploits, namely the verified exploit information 195. For instance, the prioritization logic 286 may assign higher priority to exploit information directed to verified exploits, where the priority may be used by the display logic 290 to determine an order or location for display. Furthermore, the prioritization logic 286 may be adapted to modify the font used in display of the verified exploit information (e.g., color, size, type, style, and/or effects), or control the placement of one or more images provided by the tag image generation logic 288 proximate to its corresponding exploit information.

[0082] Continuing the above example, processor(s) 300 may invoke display logic 290, which produces one or more screen displays for conveying a detailed summary of verified and/or non-verified exploits detected by the TDP system 210₁. According to one embodiment of the disclosure, the information associated with the verified exploits (verified exploit information 195) may be presented in a first area of a display screen while information associated with the non-verified exploits (non-verified exploit information 190) may be presented in a second area of the display screen. As another example, the verified exploit information 195 may be presented as top entries in a listing of all exploits detected by the IPS logic while the non-verified exploit information 190 is presented subsequently. As another example, some or all of the verified exploit information 195 may be presented in different font (e.g., different type, color, style such as bold or italic, effects such as underlining or shadow, etc.) than font used for conveying the non-verified exploit information 190. As yet another example, a tag image may be positioned next to the verified exploit information 195 unlike non-verified exploit information 190 associated with suspect objects.

E. Display and Prioritization of Detected Exploits

[0083] Referring to FIG. 4, an exemplary diagram of a flowchart illustrating a threat detection and prevention process which generates a report that highlights information associated with suspected exploits detected by the IPS logic and verified by the virtual execution environment is shown. Upon receipt of an object, the TDP system conducts a first static analysis operation on the object (block 400). Herein, the first static analysis operation may include exploit signature checks and/or vulnerability signature checks by the IPS logic to determine whether characteristics of an object under analysis are indicative of an exploit. Upon determining that the suspect object may have the characteristics of one or more suspected exploits, the object is tagged for VM-based analysis and information associated with the suspect object and/or potential exploit (IPS-based results) is stored for subsequent access (blocks 405 and 410).

[0084] Although not shown, when determining that the suspect object has characteristics of a suspected exploit, the IPS logic may be configured to block the object from proceeding to the targeted client device, although blocking may be delayed until completion of the VM-based analysis to mitigates errors due to false positives. This blocking functionality may be adjusted by the network administrator based on the severity/type of suspected exploit, number of occurrences of this type of exploit within a prescribed time period, or the like. Furthermore, prior to performing further exploit analysis, if used, a tag value may accompany (or being associated with) the suspect object when output from the IPS logic so that the IPS-based results for the suspect object can be related to the subsequent VM-based results for that object.

[0085] After IPS-based analysis for the suspect object has concluded, the content of the suspect object may undergo VM-based analysis (blocks 415 and 420). The results of the VM-based analysis (VM-based results) are provided for subsequent review (block 425). According to one embodiment of the disclosure, the classification logic performs such review, although in the alternative, logic within the dynamic analysis engine may conduct this review.

[0086] Normally, if the VM-based analysis fails to verify that the suspect object is an exploit, a score may be assigned to denote that no exploit has been detected (block 430). In this case, information produced during the VM analysis of the suspect object along with its corresponding IPS-based results are stored as part of the non-verified exploit information (block 435). However, during virtual execution of the object, if the monitored behavior denotes that the suspect object is an exploit, a score is assigned that represents the likelihood and/or threat level for the “verified” exploit(s).

[0087] According to one embodiment of the disclosure, the classification logic may be configured to obtain the IPS-based results associated with the verified exploit, where some or all of the information from the IPS-based results and the VM-based results may be prominently displayed (highlighted) as illustrated in blocks 440 and 445. Such highlighting may include (i) assigning a specific display location for exploit information associated with verified exploits that is different from exploit information associated with non-verified exploits; (ii) modifying the presentation (e.g., font type, color, style, etc.) of exploit information associated with verified exploits where the exploit information associated with the non-verified exploits will have a different presentation; (iii) controlling placement of one or more images proximate to exploit information associated with verified suspect objects only. Other display adjustments may be used, as this highlighting is conducted to visibly differentiate exploit information associated with the verified exploits from exploit information associated with the non-verified exploits.

[0088] Thereafter, the (highlighted) verified exploit information is uploaded into the database for storage and now accessible by display logic for rendering (blocks 450 and 455).

F. Display Screens of Detected Malicious Objects

[0089] Referring now to FIG. 5A, an exemplary embodiment of a first user interface display screen 500 produced by the display logic of FIGS. 2A-2B that provides an interactive dashboard is shown. Herein, rendered by the display logic, the display screen 500 comprises a plurality of display areas 510 and 530 that illustrate information directed to exploits uncovered over a selected time period by the TDP system. It is noted that multiple highlighting techniques are shown in display screens 500 and 545, although it is contemplated that any one or more highlighting technique may be conducted for a particular display.

[0090] More specifically, according to one embodiment of the disclosure, a first area 510 displays a plurality of entries 520₁-520_R(R≧1, R=6 for this embodiment) that provide information directed verified exploits and/or non-verified exploits. As shown, each row of entries (e.g., 520₁) rendered by the display logic comprises a plurality of fields, including one or more of the following: (1) a name 521 of the exploit associated with a suspect object; (2) a signature pattern 522 applicable to the object under analysis; (3) addressing information 523 (e.g., Internet Protocol “IP” address, Media Access Control “MAC” address, etc.) for a source device providing the verified or non-verified exploit; (4) a level of severity 524 (e.g., high, medium, low) of the detected exploit, where the severity level corresponds, at least in part, to the threat score; (5) a time 525 during which the exploit analysis process was conducted; and/or (6) name and/or version number 526 of software detected to be vulnerable to the detected exploit.

[0091] A second area 530 may be configured with one or more images corresponding to each entry for a verified exploit, namely an object initially identified by the IPS logic as having characteristics indicative of an exploit and verified of being an exploit by the virtual execution logic. For instance, as illustrated in FIG. 5A, image 535 is displayed proximate to information associated with a corresponding verified exploit named “HTTP Exploit_ID1.” Similar images are illustrated for verified exploit information associated with verified exploits named “HTTP Exploit_ID2,” “Java Exploit_ID1,” and “HTML Exploit_ID1.”

[0092] It is noted that the mere existence of a verified exploit may warrant heightened severity level, but does not require heightened severity levels as illustrated by the fact that certain non-verified exploits may be assigned higher severity levels than some verified exploits. Rather, exploit information associated with the verified exploits is highlighted, namely this exploit information is displayed more prominently than exploit information associated with non-verified exploits for example. This allows a network administrator to more quickly and easily determine verified exploits and thereby substantially mitigate administrative and operational disadvantages from false-positives.

[0093] As an example, as a highlighting technique, the font associated with the exploit names (HTTP Exploit_ID1; HTTP Exploit_ID2; Java Exploit_ID1; and HTML Exploit_ID1) may be displayed differently than the font associated with the exploit names for non-verified exploits (e.g., Java Exploit_ID2). Alternatively, the verified exploit information associated with the verified exploits may be ordered at the top of the listing (see FIG. 5B). Also, a single display screen may produce two areas, where a first area includes exploit information associated with verified exploits while a second area includes exploit information associated with non-verified exploits (see FIG. 5B).

[0094] Furthermore, although not shown, it is contemplated that selection of a portion of the entry (e.g., entries within fields 521/522/523/524/526 (as represented by an underlined portion) and/or a separate “Details” field 540) may enable the network administrator to obtain more detailed information of the exploit and/or analysis associated with that exploit.

[0095] For instance, by selecting the particular listed exploit 521, the administrator may be able to uncover family and other information related to the exploit (e.g., documented attacks, recommended remediation techniques, targeted client device(s), etc.). Also, by selecting the signature 522, the administrator may have access to additional information concerning what signature (exploit, vulnerability, etc.) was determined by the IPS to match the suspect object. Additional information (e.g., information on signature updates, detection history of this signature with other objects, etc.) may be provided as well.

[0096] Similarly, by selecting the corresponding host address 523 or the severity level 524, the administrator may be provided with additional information directed to geographic location of the source of the suspect object corresponding to that exploit, addressing information directed to intermediary devices that received the suspect object, the particular network operations targeted by the exploit, or the like. Also, by selecting the software type 526, a listing of all software types detected to be vulnerable to the verified exploit (along with video/images of monitored anomalous behaviors denoting the presence of such exploit) may be accessed.

[0097] Referring now to FIG. 5B, an exemplary embodiment of a second user interface display screen 545 produced by the display logic of FIGS. 2A-2B that provides an interactive dashboard is shown. Herein, the display screen 545 comprises a plurality of areas 550, 570 and 580 that display results of IPS detection analysis over a selected time period.

[0098] As shown, similar to the first user interface display screen 500, first area 550 of the second user interface display screen 545 displays a plurality of entries 560₁-560_S(S≧1, S=4 for this embodiment) that provides information directed to verified exploits. Each of the entries (e.g., 560₁) rendered by the display logic comprises: (1) a name 561 of the verified exploit (suspect object verified to be an exploit); (2) a signature 562 that initially identified the suspect object as having characteristics indicative of an exploit; (3) addressing information 563 (e.g., Internet Protocol “IP” address, Media Access Control “MAC” address, etc.) for a source device providing the detected exploit; (4) a level of severity 564 (e.g., high, medium, low) of the detected exploit that corresponds, at least in part, to the threat score; (5) a time 565 during which the exploit analysis process was conducted; and/or (6) name and/or version number 566 of software detected to be vulnerable to the detected exploit.

[0099] As shown, a second area 570 may be provided, which comprises an image corresponding to each entry that is associated with the verified exploits, as described above. As illustrated in FIG. 5B, image 535 is displayed with information associated with a corresponding verified exploit named “HTTP Exploit_ID1.” Similar images are illustrated as highlighted verified exploit information for verified exploits named “HTTP Exploit_ID2,” “Java Exploit_ID1,” and “HTML Exploit_ID1.”

[0100] A third area 580 illustrates exploit information associated with non-verified exploits named “Java Exploit_ID2”, “RPC Exploit_ID1” for example.

II. Alternative Embodiment—IPS Logic & Secondary Analysis Logic with Virtual Execution Logic Verification

[0101] According to an alternative embodiment of the disclosure, the static analysis engine may be configured with a first static analysis logic (e.g., IPS logic) and a second static analysis logic (e.g., heuristic logic), which is configured to operate independently from the IPS logic and identifies whether characteristics of any of the incoming objects are indicative of an exploit. As described below, the first static analysis logic and the second static analysis logic may operate in parallel or in tandem.

[0102] In particular, as described above, the first static analysis logic (IPS logic) conducts at least exploit signature checks and/or vulnerability signature checks on the incoming objects to identify a first subset of objects having characteristics indicative of an exploit. The second static analysis logic (heuristic logic) may be configured to analyze the same or different objects, where such analysis may be in accordance with at least a set of rules and/or signatures different than those utilized by the first static analysis logic (IPS logic).

[0103] More specifically, according to this embodiment of the invention, upon identifying the suspect objects (first subset of objects), the first static analysis logic (IPS logic) provides suspect objects, perhaps each accompanied by or associated with a tag identifier (hereinafter referred to as “tag_ID1”), to the verification logic 150 of FIGS. 6A-6B. Tag_ID1 may be used to indicate to other logic that the suspect object originated from the first static analysis logic (IPS logic).

[0104] The second static analysis logic (heuristic logic) is configured to analyze the incoming objects to determine whether the presence, absence or modification of information within an object may denote potential malicious activity indicating that object may be an exploit. Such determination may involve the second static analysis logic (heuristic logic) conducting operations to determine whether certain portions of the object corresponds to one or more “malicious identifiers,” which may include, but are not limited or restricted to a particular source or destination address (e.g., URLs, IP addresses, MAC addresses, etc.) that is associated with known exploits; exploit patterns; or shell code patterns.

[0105] Additionally, with each suspect object, the heuristic logic may provide a tag identifier (tag_ID2) for use in locating corresponding heuristic-based results 640 associated with each suspect object 630. Hence, tag_ID2 may be further used to identify to other logic that this suspect object originated from the heuristic logic 620.

[0106] After either the first static analysis logic (IPS logic) or the second static analysis logic determine which of the incoming objects have characteristics indicative of an exploit, the suspect objects are provided to the virtual execution logic for more in-depth dynamic analysis using one or more virtual machines (VMs). Such dynamic analysis may include virtual execution of the content of the suspect objects with one or more configured VMs, as described above. The behaviors of the VM(s) are monitored for detection of anomalous or unexpected activity.

[0107] It is contemplated that the first static analysis logic (IPS logic) and the second static analysis logic (heuristic logic) may operate in parallel in which both of these logic units conduct the preliminary exploit detection analysis on the same suspect objects. More specifically, the second static analysis logic (heuristic logic) may conduct its analysis on an object extracted from the network traffic concurrently (i.e. at least partially overlapping in time) with the analysis of the same object by the IPS logic. This provides the TDP system with an ability to account for false negatives that signify a lack of detection of an exploit by the IPS logic. Also, such parallel analysis may be conducted in order to increase scrutiny of network traffic for objects originating from a certain geographic location prone to exploits, from a certain IP addresses that have been identified as a malicious source, or the like.

[0108] Of course, it is contemplated that the first static analysis logic (IPS logic) and second static analysis logic (heuristic logic) may operate in tandem in which an incoming object is capable of being processed by either the IPS logic or the heuristic logic within the embodiment. Control of the selection as to whether the static analysis is performed by the first static analysis logic (IPS logic) or the second static analysis logic (heuristic logic) may be assigned to additional control logic within the static analysis engine. Such control may be based on the type of object under analysis, source, traffic conditions, or the like.

A. General Communication Flow

[0109] Referring to FIG. 6A, an exemplary block diagram of an operational flow of threat detection and prevention within an electronic device 600 is shown. Herein, some or all of the incoming objects 110 associated with the monitored network traffic may be received by a first static analysis logic (e.g., IPS logic 120 of FIG. 1A), as described above. The IPS logic 120 is configured to perform at least exploit signature checks and/or vulnerability signature checks on some or all of the incoming objects 110.

[0110] Upon identifying that a first subset 610 of the incoming objects 110 are “suspicious” (e.g., one or more objects 110 match an exploit signature and/or vulnerability signature), the IPS logic 120 subsequently routes the first subset of suspect objects 610 to the verification logic 150 (e.g., virtual execution logic). Each of these objects may be accompanied by a tag identifier (tag_ID1) and provided to the verification logic 150.

[0111] Besides being used for subsequently locating the IPS-based results 140 associated with the suspect object (provided from the IPS logic 120 to the reporting logic 170), tag_ID1 may be used to additionally to identify to the verification logic 150 and/or reporting logic 170 that these suspect objects 610 are provided from the IPS logic 120. Such information may be useful for identifying exploit information associated with verified exploits originating from the IPS logic, where this exploit information may be highlighted even differently than exploit information associated with verified exploits originating from a second static analysis logic 620.

[0112] Operating in tandem or in parallel with IPS logic 120, the second static analysis logic 620 (e.g., heuristic logic) conducts another type of static analysis on some or all of the objects 110 to produce a subset of objects 630 having characteristics indicative of an exploit. Hence, when operating in parallel, heuristic logic 620 may receive the incoming objects 110, which are also being received and analyzed by IPS logic 120. When operating in tandem with the IPS logic 120, the heuristic logic 620 may receive some or all of the incoming objects 110, where the switching between receipt of specific incoming objects by either the IPS logic 120 or the heuristic logic 620 may be conducted by switching logic 645 via control signals 647 from scheduler 260 or some other logic within TDP system 210₁, as shown in FIG. 6B.

[0113] The suspect objects 610 and/or 630 (collectively referred to as “suspect objects 635”), detected by the IPS logic 120 and/or heuristic logic 620, are routed to the verification logic 150. The verification logic 150 is adapted to verify whether any of the suspect objects is an exploit through virtual processing of the content within these objects 635. The VM-based results 650 of this analysis are output from the verification logic 150 for subsequent use by reporting logic 170 for display purposes, as described above.

[0114] More specifically, the first static analysis logic (e.g., IPS logic 120) conducts at least exploit signature checks and/or vulnerability signature checks to identify whether characteristics of any of the analyzed objects 110 are indicative of an exploit. If so, the IPS logic 120 forwards these suspect object(s) 610 to the verification logic 150.

[0115] Additionally, one or more heuristic checks may be conducted on some or all of objects 110, including various scanning operations conducted on portions of the objects to determine correspondence with one or more malicious identifiers, as described above. While the IPS logic 120 is adapted to identify objects in accordance with at least exploit signature checks and/or vulnerability signature checks, the heuristic checks are directed to a more expansive static analysis of some or all of objects 110, including the use of different types of signatures or other static analysis schemes.

[0116] After performing the heuristic check(s) by the heuristic logic 620, a second set of suspect objects 630 is provided to the verification logic 150. Again, the second set of objects 630 may be lesser (and potentially significantly less) in number than the incoming objects 110.

[0117] After virtual processing of content within each of the suspect objects 610 and/or 630, and thereafter verifying that particular objects are exploits (verified exploits), the verification logic 150 provides VM-based results 650 that may be modified, along with its corresponding IPS-based results 140, to generate a report 660 (e.g., one or more display screens, printed report, etc.). The report 660 is configured to visibly highlight exploit information associated with verified exploits. As an alternative, the report 660 may also be configured to visibly highlight exploit information associated with verified exploits from exploit information associated with non-verified exploits (suspect objects having characteristics of exploits that were not verified by the VMs).

B. General Architecture

[0118] Referring to FIG. 7A, an exemplary block diagram of a communication system 700 deploying a plurality of threat detection and prevention (TDP) systems 710₁-710_N(N>1, e.g., N=3) is shown. TDP system 710₁is identical to TDP system 210₁of FIG. 2A, except that static analysis engine 750 includes two different static analysis logic units. More specifically, as shown in FIGS. 7A and 7B, static analysis engine 750 may include one or more software modules that, when executed by one or more processors, performs multi-level static scanning on a particular object, namely both exploit and vulnerability signature checks by IPS logic 120 and heuristic checks by heuristic logic 620.

[0119] Operating in parallel or tandem with IPS logic 120, the heuristic logic 620 is configured to conduct one or more heuristic checks on objects under analysis. These heuristic checks may be considered more expansive in analysis than the exploit and/or vulnerability checks conducted by the IPS logic 120 as mentioned above.

[0120] Herein, based on the results of the heuristic checks conducted by heuristic logic 620, score determination logic 720 determines the probability (or level of confidence) that the characteristics of the analyzed object are indicative of an exploit. In other words, score determination logic 720 is configured to generate a value that classifies the threat level of the possible exploit characterized by each of the analyzed objects. For instance, if the heuristic checks detect one type of characteristic that suggests the object under analysis is an exploit, the object may be classified with a first threat level. The first threat level may be represented by a score (value) corresponding to the likelihood of the object being an exploit (e.g., score of 3 out of 10). However, if the heuristic checks detect multiple characteristics or another type of characteristic that more strongly suggests the object under analysis is an exploit, a higher score (e.g., score of 8 out of 10) may be assigned by score determination logic 720 to denote a higher probability of the detected presence of an exploit.

[0121] Thereafter, the objects and their corresponding scores may be routed from the static analysis engine 750 to the dynamic analysis engine 270 for use in further analysis to verify which of the suspect objects, if any, are exploits. Additionally or in the alternative, it is contemplated that the score may be provided to classification logic 785 for use in prioritization.

[0122] More specifically, after static scanning has completed, the object may be provided to the dynamic analysis engine 270 for in-depth dynamic analysis using virtual machines (VMs) 275₁-275_M(M≧1). Of course, if the characteristics of the object are not indicative of an exploit, the heuristic logic 620 may halt further analysis of content with the object.

[0123] In general, besides receiving VM-based results 160 from dynamic analysis engine 270, the classification logic 785 may be configured to receive assigned scores from static analysis engine 750. Classification logic 785 may be configured to mathematically combine the scores assigned to content associated with the suspect object (based on findings from static analysis engine 750 and dynamic analysis 270) to obtain an overall score that is assigned with the verified or non-verified exploit.

[0124] According to one embodiment of the disclosure, the overall score may be used, at least in part, to identify verified exploits from non-verified exploits. Also, the score may be used, at least in part, for highlighting operations such as assigning a display priority that may influence the display ordering as described above. However, it is contemplated that other parameters, combined with or separate from the score assigned to the exploit, may be used to classify exploits or influence display priority. For instance, the overall score along with other parameters, such as the presence of the tag_ID1 or tag_ID2 as part of exploit information included in the VM-based results, may influence the display ordering of that exploit.

[0125] Referring now to FIG. 7B, first TDP system 710₁may be coupled with the communication network 230 in line with client device 234. As similarly illustrated in FIG. 2B, first TDP system 710₁comprises an interface unit 295 that directs signaling on communication network 230 to static analysis engine 750 or classification logic 785, given that the dynamic analysis engine 270 is deployed in cloud computing services 240.

C. Display and Prioritization of Detected Exploits

[0126] Referring to FIGS. 8A-8B, an exemplary diagram of a flowchart illustrating a threat detection and prevention process, utilizing IPS logic and/or heuristic logic for static analysis, is shown, where the process generates a report that highlights information associated with suspected exploits detected by the IPS or heuristic logic and verified by the virtual execution environment. Herein, the IPS logic and the heuristic logic may operate in parallel or in tandem.

[0127] The IPS logic and heuristic logic may be configured to operate in parallel (or in tandem) based on factors that may warrant increased scrutiny in efforts to detect exploits. For instance, there is an increased amount of objects originating from a certain geographic location prone to exploits or from a certain IP address that has been identified as a malicious source. For parallel processing, operations associated with blocks 805-825 and 830-855 of FIG. 8A are conducted in parallel. For this discussion, however, the IPS logic and heuristic logic are operating in tandem. Also, for certain governmental agencies, its sensitivity to exploits and/or its history in experiencing exploits may warrant additional analysis.

[0128] Upon receipt of an object under analysis, as set forth in block 800, the TDP system conducts a determination as to whether the static analysis should be conducted by the first static analysis logic (IPS logic) and/or the second static analysis logic (heuristic logic). According to one embodiment, as a default, the IPS logic is selected.

[0129] When selected, the IPS logic conducts exploit signature checks and/or vulnerability signature checks to determine whether characteristics of the object under analysis are indicative of an exploit (block 805). Upon determining that the characteristics of the object under analysis are indicative of an exploit, information associated with the suspect object and/or exploit (IPS-based results) is stored for subsequent access (blocks 810 and 815).

[0130] Although not shown, when determining that the suspect object has characteristics of a suspected exploit, the IPS logic may be configured to block the object from proceeding to the targeted client device, although blocking may be delayed until completion of the VM-based analysis. This blocking functionality may be adjusted by the network administrator based on the severity/type of suspected exploit, number of occurrences of this type of exploit within a prescribed time period, or the like. Furthermore, prior to performing further exploit analysis, as an optional feature identified by dashed lines in FIG. 8A, tag_ID1 may accompany the suspect object when output from the IPS logic so that (1) the IPS-based results for the suspect object can be related to the subsequent VM-based results for that object and (2) the virtual execution logic and/or classification logic can identify that the suspect object originated from the IPS logic (block 820). Thereafter, the suspect object and/or tag_ID1 is provided to the dynamic analysis engine for subsequent analysis (block 825).

[0131] Additionally or in the alternative, a second static analysis may be performed to determine whether characteristics of the object under analysis are indicative of an exploit (block 830). This determination may involve one or more heuristic checks being conducted in efforts to determine if the (i) the object has a certain level of correlation with one or more malicious identifiers or (ii) presence, absence or modification of any content associated with the object identifies a potential exploit. During such analysis, a score may be assigned to identify the likelihood of this object being an exploit (block 835).

[0132] In the event that the suspect object is tagged for VM-based analysis, which may be determined if the assigned score is greater than or equal to a prescribed threshold score, information associated with the suspect object and/or the potential exploit including the score (hereinafter referred to as “heuristic-based results”) may be stored for subsequent access by classification logic (blocks 840 and 845). Thereafter, the suspect object, optionally with tag_ID2, is provided to the dynamic analysis engine for subsequent analysis (blocks 850 and 855).

[0133] Regardless whether the static analysis is conducted by the IPS logic or the heuristic logic, the suspect object may be further analyzed by conducting VM-based analysis on the content associated with the suspect object, where behaviors of the virtual processing of the content by one or more VMs produces VM-based results (blocks 860 and 865). If the VM-based analysis fails to detect any exploit within content of the suspect object, a score may be assigned to denote that no exploit is detected and the VM-based results may be stored (blocks 870 and 875).

[0134] However, when the dynamic analysis engine verifies (during virtual processing of the content within the suspect object) that the suspect object constitutes an exploit, this “verified” exploit is assigned a score representative of the likelihood and/or threat level for the detected exploit(s). More specifically, during subsequent analysis of the content within the suspect object by the virtual execution logic, upon determining that the suspect object is an exploit (e.g., a certain probability that content within the suspect object constitutes an exploit is determined), a score representative of the likelihood and/or threat level for the detected exploit is assigned.

[0135] Thereafter, according to one embodiment of the disclosure, the IPS-based results along with the VM-based results are obtained and some or all of the information from the IPS-based results and the VM-based results may be prominently displayed (highlighted) as illustrated in blocks 880 and 885 and further described above.

[0136] Thereafter, the (highlighted) verified exploit information is uploaded into the database for storage and now accessible by display logic for rendering (blocks 890 and 895).

[0137] In the foregoing description, the invention is described with reference to specific exemplary embodiments thereof. It will, however, be evident that various modifications and changes may be made thereto without departing from the broader spirit and scope of the invention as set forth in the appended claims.

Claims

What is claimed is:

1. A non-transitory computer readable storage medium having stored thereon instructions, the instructions being executable by one or more processors to perform operations including:

receive, by an intrusion protection system (IPS) logic, a first plurality of objects and filter the first plurality of objects by identifying a second plurality of objects as suspicious objects, the second plurality of objects being a subset of the first plurality of objects and being lesser or equal in number to the first plurality of objects; and

automatically verify, with a virtual execution logic, whether any of the suspicious objects includes an exploit using at least one virtual machine configured to (i) process content within the suspicious objects in a runtime environment and (ii) monitor, during the processing of the content, for behaviors that are indicative of exploits, wherein the at least one virtual machine is configured with a first software image based on results of an analysis performed by the IPS logic;

receive, by a display generation logic, information associated with the suspicious objects, the information includes (i) information directed to each of a plurality of suspicious objects identified by the IPS logic and (ii) information directed to each of one or more suspected exploits detected during processing of the content within a first subset of the suspicious objects, the first subset of the suspicious objects being lesser in number than the second plurality of objects; and

generate a display of the suspicious objects, the display being arranged to highlight the information associated with the one or more suspected exploits detected during processing of the content within the first subset of the suspicious objects.

2. The computer readable storage medium of claim 1, further comprising:

receive the first plurality of objects over a network and route the first plurality of objects to the IPS logic.

3. The computer readable storage medium of claim 1, wherein at least one of the first plurality of objects includes a flow comprising a plurality of related packets that are either received, transmitted, or exchanged during a communication session.

4. The computer readable storage medium of claim 3, wherein the IPS logic performs an exploit signature check, the exploit signature check compares each of the first plurality of objects to one or more exploit signatures, wherein an object of the first plurality of objects is identified as a suspicious object of the plurality of suspicious objects upon matching an exploit signature of the one or more exploit signatures.

5. The computer readable storage medium of claim 4, wherein the IPS logic performs a vulnerability signature check by comparing each of the first plurality of objects to one or more vulnerability signatures, wherein an object of the first plurality of objects is identified as a suspicious object of the plurality of suspicious objects upon matching a vulnerability signature that characterizes a sequence of communications that indicate an attempt to attack a software vulnerability protected by the vulnerability signature.

6. The computer readable storage medium of claim 1, wherein the behaviors of the one or more suspected exploits detected during processing of the content within the first subset of the suspicious objects relate to activities that adversely influence or attack operations of an electronic device.

7. The computer readable storage medium of claim 6, wherein information directed to one or more suspected exploits detected during processing of the content within the first subset of the suspicious objects is highlighted to identify the first subset of the suspicious objects was determined to potentially be an exploit by both the IPS logic and the virtual execution logic.

8. The computer readable storage medium of claim 1, wherein the virtual execution logic verifies the first subset of the suspicious objects as being the one or more suspected exploits when the behaviors monitored during the processing of the first subset of suspicious objects are indicative of exploits while a remaining subset of the suspicious objects are not verified as being exploits.

9. The computer readable storage medium of claim 8, wherein

generation of the display highlighting the information associated with the one or more suspected exploits detected from the content within the first subset of suspicious objects is performed by displaying the information associated with the one or more suspected exploits detected from the content within the first subset of suspicious objects at a particular location on a screen display different from a location for information associated with non-verified exploits associated with the remaining subset of the suspicious objects.

10. The computer readable storage medium of claim 8, wherein

generation of the display highlighting the information associated with the one or more suspected exploits detected from the content within the first subset of suspicious objects by modifying the information associated with the one or more suspected exploits detected from the content within the first subset of suspicious objects to appear differently than information associated with non-verified exploits associated with the remaining subset of suspicious objects.

11. The computer readable storage medium of claim 10, wherein the modifying of the information associated with the one or more suspected exploits detected from the content within the first subset of suspicious objects to appear differently from information associated with non-verified exploits associated with the remaining subset of suspicious objects comprises modifying at least one of a color, size or type of a font used to convey the information associated with the one or more suspected exploits detected from the content within the first subset of suspicious objects to be different than a font used to convey information associated with non-verified exploits associated with the remaining subset of suspicious objects.

12. The computer readable storage medium of claim 1, wherein the IPS logic is communicatively coupled to and integrated within the same electronic device as the virtual execution logic.

13. The computer readable storage medium of claim 1, wherein the virtual execution logic simulates receipt of the object by a destination electronic device.

14. The computer readable storage medium of claim 1, wherein the virtual execution logic further comprises a controller for simulating transmission of the object to a destination electronic device, the controller comprises a protocol sequence replayer.

15. An electronic device comprising:

a processor; and

a memory coupled to the processor, the memory including:

(1) an intrusion protection system (IPS) logic to filter a first plurality of objects by identifying a second plurality of objects as suspicious objects, the second plurality of objects being a subset of the first plurality of objects and being lesser or equal in number than the first plurality of objects,

(2) one or more virtual machines configured to (i) process content within the suspicious objects in a runtime environment, (ii) monitor, during the processing of the content, for behaviors that are indicative of exploits, and (iii) automatically verify whether any of the suspicious objects includes an exploit based on the monitoring of the processing of the content,

(3) a display generation logic to (a) receive information associated with the suspicious objects, the information includes (i) information directed to each of a plurality of suspicious objects identified by the IPS logic and (ii) information directed to each of one or more suspected exploits detected during processing of the content within a first subset of the suspicious objects, the first subset of the suspicious objects being lesser in number than the second plurality of objects and (b) generate a display of the suspicious objects, the display being arranged to highlight the information associated with the one or more suspected exploits detected during processing of the content within the first subset of the suspicious objects,

wherein the one or more virtual machines is configured with a first software image based on the characteristics indicative of the exploit detected by IPS logic.

16. The electronic device of claim 15, wherein at least one of the first plurality of objects includes a flow comprising a plurality of related packets that are either received, or transmitted, or exchanged during a communication session.

17. The electronic device of claim 16, wherein the IPS logic, when executed by the processor, performs an exploit signature check, the exploit signature check compares each of the first plurality of objects to one or more exploit signatures, wherein an object of the first plurality of objects is identified as a suspicious object of the plurality of suspicious objects upon matching an exploit signature of the one or more exploit signatures.

18. The electronic device of claim 16, wherein the IPS logic, when executed by the processor, performs a vulnerability signature check by comparing each of the first plurality of objects to one or more vulnerability signatures, wherein an object of the first plurality of objects is identified as a suspicious object of the plurality of suspicious objects upon matching a vulnerability signature that characterizes a sequence of communications that indicate an attempt to attack a software vulnerability protected by the vulnerability signature.

19. The electronic device of claim 16, wherein the one or more virtual machines being configured to operate in combination with a protocol sequence replayer that provides the related packets in accordance with a particular communication sequence indicative of the exploit.

20. The electronic device of claim 15, wherein the display highlights information associated with a first exploit more prominently than information associated with a second exploit.

21. A computerized method comprising:

receiving, by intrusion protection system (IPS) logic, a first plurality of objects;

filtering, by IPS logic, the first plurality of objects to identify a second plurality of objects as suspicious objects, the second plurality of objects being a subset of the first plurality of objects and being lesser or equal in number to the first plurality of objects;

automatically verifying, by a virtual execution logic, that a first subset of suspicious objects from the second plurality of objects includes an exploit, the virtual execution logic including at least one virtual machine configured to process content within the suspicious objects in a runtime environment and monitor, during the processing of the content, for behaviors that are indicative of exploits, wherein the at least one virtual machine is configured with a first software image based on results of an analysis performed by the IPS logic;

generating, by a display generation logic, a display arranged to highlight the information associated with the one or more suspected exploits detected during processing of the content within the first subset of the suspicious objects.

22. The computerized method of claim 21, wherein the filtering of the first plurality of objects by the IPS logic comprises performing either an exploit signature check or a vulnerability signature check on each of the first plurality of objects.

23. The computerized method of claim 21, wherein the information directed to one or more suspected exploits detected during processing of the content within the first subset of the suspicious objects is highlighted to identify the first subset of the suspicious objects was determined to potentially be an exploit by both the IPS logic and the virtual execution logic.

Patent Citations (563)

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
US6167520(A)	2000-12-01	Touboul	Examiner
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	Applicant
US6357008(B1)	2002-03-01	Nachenberg	Applicant
US6417774(B1)	2002-07-01	Hibbs et al.	Applicant
US6424627(B1)	2002-07-01	Sorhaug 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	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
US7117493(B2)	2006-10-01	Matsushima	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
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
US7370233(B1)	2008-05-01	Sobel	Examiner
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
US7437764(B1)	2008-10-01	Sobel	Examiner
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.	Applicant
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
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
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
US7725937(B1)	2010-05-01	Levy	Examiner
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
US7937761(B1)	2011-05-01	Bennett	Applicant
US7949849(B2)	2011-05-01	Lowe et al.	Applicant
US7984483(B2)	2011-07-01	Leitz	Examiner
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	Examiner
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
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
US8756696(B1)	2014-06-01	Miller	Examiner
US8776043(B1)	2014-07-01	Thimsen	Examiner
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
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
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
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
US9106694(B2)	2015-08-01	Aziz et al.	Applicant
US9118715(B2)	2015-08-01	Staniford et al.	Applicant
US9241010(B1)	2016-01-01	Bennett	Examiner
US9594904(B1)	2017-03-01	Jain	Examiner
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, III	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/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/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 et al.	Applicant
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 et al.	Applicant
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/0273856(A1)	2005-12-01	Huddleston	Examiner
US2005/0283839(A1)	2005-12-01	Cowburn	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	Banzhof 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/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/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/0089860(A1)	2009-04-01	Forrester	Examiner
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/0158432(A1)	2009-06-01	Zheng	Examiner
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/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	Examiner
US2009/0265692(A1)	2009-10-01	Godefroid et al.	Applicant
US2009/0271867(A1)	2009-10-01	Zhang	Applicant
US2009/0276771(A1)	2009-11-01	Nickolov	Examiner
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/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/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/0211663(A1)	2010-08-01	Barboy	Examiner
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/0287613(A1)	2010-11-01	Singh 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	Stahlberg	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/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/0173460(A1)	2011-07-01	Ito et al.	Applicant
US2011/0191834(A1)	2011-08-01	Singh	Examiner
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	Niemel 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
US2011/0321166(A1)	2011-12-01	Capalik 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/0072968(A1)	2012-03-01	Wysopal	Examiner
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/0278889(A1)	2012-11-01	El-Moussa	Applicant
US2012/0297489(A1)	2012-11-01	Dequevy	Applicant
US2012/0304244(A1)	2012-11-01	Xie	Examiner
US2012/0324551(A1)	2012-12-01	Bretschneider	Examiner
US2012/0330801(A1)	2012-12-01	McDougal 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/0091570(A1)	2013-04-01	McCorkendale	Examiner
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/0133072(A1)	2013-05-01	Kraitsman	Examiner
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/0198840(A1)	2013-08-01	Drissi	Examiner
US2013/0227691(A1)	2013-08-01	Aziz et al.	Applicant
US2013/0246370(A1)	2013-09-01	Bartram et al.	Applicant
US2013/0254870(A1)	2013-09-01	Sotka	Examiner
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
US2014/0053260(A1)	2014-02-01	Gupta et al.	Applicant
US2014/0053261(A1)	2014-02-01	Gupta et al.	Applicant
US2014/0068775(A1)	2014-03-01	Ward et al.	Applicant
US2014/0082733(A1)	2014-03-01	Benefield	Examiner
US2014/0130158(A1)	2014-05-01	Wang et al.	Applicant
US2014/0137180(A1)	2014-05-01	Lukacs	Examiner
US2014/0169762(A1)	2014-06-01	Ryu	Applicant
US2014/0173739(A1)	2014-06-01	Ahuja	Examiner
US2014/0179360(A1)	2014-06-01	Jackson et al.	Applicant
US2014/0181984(A1)	2014-06-01	Kundu	Examiner
US2014/0230024(A1)	2014-08-01	Uehara	Examiner
US2014/0259169(A1)	2014-09-01	Harrison	Examiner
US2014/0289105(A1)	2014-09-01	Sirota	Examiner
US2014/0304819(A1)	2014-10-01	Ignatchenko	Examiner
US2014/0328204(A1)	2014-11-01	Klotsche et al.	Applicant
US2014/0337621(A1)	2014-11-01	Nakhimov	Examiner
US2014/0337836(A1)	2014-11-01	Ismael	Applicant
US2014/0351935(A1)	2014-11-01	Shao et al.	Applicant
US2014/0380473(A1)	2014-12-01	Bu	Examiner
US2015/0067862(A1)	2015-03-01	Yu	Examiner
US2015/0096025(A1)	2015-04-01	Ismael	Applicant
US2015/0186645(A1)	2015-07-01	Aziz	Examiner
US2016/0036840(A1)	2016-02-01	Dogu	Examiner
US2016/0048680(A1)	2016-02-01	Lutas	Examiner
US2016/0057123(A1)	2016-02-01	Jiang	Examiner
US2016/0110213(A1)	2016-04-01	Chen	Examiner
US2016/0182532(A1)	2016-06-01	Jones	Examiner
US2016/0191547(A1)	2016-06-01	Zafar	Examiner
US2016/0285914(A1)	2016-09-01	Singh	Examiner
US2016/0335110(A1)	2016-11-01	Paithane	Examiner
US2017/0034205(A1)	2017-02-01	Canedo	Examiner
EP2106085(A1)	2009-09-01		Applicant
GB2439806	2008-01-01		Applicant
GB2490431(A)	2012-10-01		Applicant
WO-02/06928	2002-01-01		Applicant
WO-02/23805	2002-03-01		Applicant
WO2/006928(A2)	2003-08-01		Applicant
WO-2007-117636	2007-10-01		Applicant
WO-2008/041950	2008-04-01		Applicant
WO-2011/084431	2011-07-01		Applicant
WO2011/112348(A1)	2011-09-01		Applicant
WO2012/075336(A1)	2012-06-01		Applicant
WO-2012/145066	2012-10-01		Applicant
WO2013/067505(A1)	2013-05-01		Applicant

Non-Patent Literature (80)

IEEE Xplore Digital Library Sear Results for “detection of unknown computer worms”, Http//ieeexplore.ieee.org/searchresult.isp?SortField=Score&SortOrder=desc&ResultC . . . (Accessed on Aug. 28, 2009).Applicant
AltaVista Advanced Search Results. “Event Orchestrator”, Http://www.altavista.com/web/results?Itag=ody&pg=aq&aqmode=aqa=Event+Orchesrator . . . (Accessed on Sep. 3, 2009).Applicant
AltaVista Advanced Search Results. “attack vector identifier”. Http://www.altavista.com/web/results?Itag=ody&pg=aq&aqmode=aqa=Event+Orchestrator . . . (Accessed on Sep. 15, 2009).Applicant
Cisco, Configuring the Catalyst Switched Port Analyzer (SPAN) (“Cisco”), (1992-2003).Applicant
Cisco, Intrusion Prevention for the Cisco ASA 5500-X Series, Data Sheet, (2012).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
Excerpt regarding First Printing Date for Merike Kaeo, Designing Network Security (“Kaeo”), (2005).Applicant
The Sniffers's Guide to Raw Traffic available at: yuba.stanford.edu/˜casado/pcap/section1.html, (Jan. 6, 2014).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
“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/xp1/articleDetails.jsp?reload=true&arnumber=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
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
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
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
Filiol, Eric , et al., “Combinatorial Optimisation of Worm Propagation on an Unknown Network”, International Journal of Computer Science 2.2 (2007).Applicant
Hjelmvik, Erik , “Passive Network Security Analysis with NetworkMiner”, (IN)SECURE, Issue 18, (Oct. 2008), pp. 1-100.Applicant
Kaeo, Merike , “Designing Network Security”, (“Kaeo”), (Nov. 2003).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”).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
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
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
Natvig, Kurt , “SANDBOXII: Internet”, Virus Bulletin Conference, (“Natvig”), (Sep. 2002).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
Peter M. Chen, and Brian D. Noble , “When Virtual Is Better Than Real, Department of Electrical Engineering and Computer Science”, University of Michigan (“Chen”).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
Venezia, Paul , “NetDetector Captures Intrusions”, InfoWorld Issue 27, (“Venezia”), (Jul. 14, 2003).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
Adobe Systems Incorporated, “PDF 32000-1:2008, Document management—Portable document format—Part1:PDF 1.7”, First Edition, Jul. 1, 2008, 756 pages.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
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
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
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:https://web.archive.org/web/20121022220617/http://www.informationweek- .com/microsofts-honeymonkeys-show-patching-wi/167600716 [retrieved on Sep. 29, 2014].Applicant
Heng Yin et al, Panorama: Capturing System-Wide Information Flow for Malware Detection and Analysis, Research Showcase © CMU, Carnegie Mellon University, 2007.Applicant
Idika et al., A-Survey-of-Malware-Detection-Techniques, Feb. 2, 2007, Department of Computer Science, Purdue University.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
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
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
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
Mori, Detecting Unknown Computer Viruses, 2004, Springer-Verlag Berlin Heidelberg.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
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. 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
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
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
PCT/US2014/072292 filed Dec. 23, 2014 International Search Report and Written Opinion dated Feb. 23, 2015.Applicant
PCT/US2015/037245 filed Jun. 23, 2015 International Search Report and Written Opinion dated Sep. 17, 2015.Applicant
U.S. Appl. No. 14/313,934, filed Jun. 24, 2014 Non-Final Office Action dated Sep. 30, 2015.Applicant
U.S. Appl. No. 14/620,055, filed Feb. 11, 2015 Non-Final Office Action dated Jun. 15, 2015.Applicant
PCT/US2014/072292 filed Dec. 23, 2014 International Preliminary Report dated Jul. 7, 2016.Applicant

Abstract

Description

CROSS-REFERENCE TO RELATED APPLICATIONS

[0001] This application claims the benefit of priority on U.S. Provisional Application No. 61/921,033, filed Dec. 26, 2013, the entire contents of which are incorporated by reference herein.

FIELD

GENERAL BACKGROUND

BRIEF DESCRIPTION OF THE DRAWINGS

[0010] FIG. 1A is a first exemplary block diagram of an operational flow of threat detection and prevention within an electronic device.

[0011] FIG. 1B is a second exemplary block diagram of an operational flow of threat detection and prevention within an electronic device.

[0014] FIG. 3 is an exemplary block diagram of logic associated with the TDP system of FIGS. 2A-2B.

[0015] FIG. 4 is an exemplary diagram of a flowchart illustrating operations of the threat detection and prevention process.

[0016] FIGS. 5A-5B are exemplary embodiments of user interface display screens produced by display logic, where the display screens provides an interactive dashboard.

[0017] FIGS. 6A-6B are exemplary block diagrams of operational flows of analyzed objects associated with network traffic in accordance with an alternative embodiment of the TCP system.

[0019] FIGS. 8A-8B are exemplary diagrams of a flowchart illustrating operations of the threat detection and prevention process according to the framework of FIGS. 7A-7B.

DETAILED DESCRIPTION

I. Terminology

II. First Embodiment—IPS Logic with Virtual Execution Logic Verification

A. Communication Flow

B. General Architecture—First Embodiment

[0070] Thereafter, along with non-verified exploit information 190, the verified exploit information 195 is stored within database 255 and accessible by display logic 290.

C. General Architecture—Second Embodiment

D. Exemplary Logic Layout of TDP System

E. Display and Prioritization of Detected Exploits

[0088] Thereafter, the (highlighted) verified exploit information is uploaded into the database for storage and now accessible by display logic for rendering (blocks 450 and 455).

F. Display Screens of Detected Malicious Objects

[0100] A third area 580 illustrates exploit information associated with non-verified exploits named “Java Exploit_ID2”, “RPC Exploit_ID1” for example.

II. Alternative Embodiment—IPS Logic & Secondary Analysis Logic with Virtual Execution Logic Verification

A. General Communication Flow

B. General Architecture

C. Display and Prioritization of Detected Exploits

[0136] Thereafter, the (highlighted) verified exploit information is uploaded into the database for storage and now accessible by display logic for rendering (blocks 890 and 895).

Claims

What is claimed is:

1. A non-transitory computer readable storage medium having stored thereon instructions, the instructions being executable by one or more processors to perform operations including:

2. The computer readable storage medium of claim 1, further comprising:

receive the first plurality of objects over a network and route the first plurality of objects to the IPS logic.

9. The computer readable storage medium of claim 8, wherein

10. The computer readable storage medium of claim 8, wherein

generation of the display highlighting the information associated with the one or more suspected exploits detected from the content within the first subset of suspicious objects by modifying the information associated with the one or more suspected exploits detected from the content within the first subset of suspicious objects to appear differently than information associated with non-verified exploits associated with the remaining subset of suspicious objects.

12. The computer readable storage medium of claim 1, wherein the IPS logic is communicatively coupled to and integrated within the same electronic device as the virtual execution logic.

13. The computer readable storage medium of claim 1, wherein the virtual execution logic simulates receipt of the object by a destination electronic device.

15. An electronic device comprising:

a processor; and

a memory coupled to the processor, the memory including:

wherein the one or more virtual machines is configured with a first software image based on the characteristics indicative of the exploit detected by IPS logic.

20. The electronic device of claim 15, wherein the display highlights information associated with a first exploit more prominently than information associated with a second exploit.

21. A computerized method comprising:

receiving, by intrusion protection system (IPS) logic, a first plurality of objects;

Patent Citations (563)

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
US6167520(A)	2000-12-01	Touboul	Examiner
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	Applicant
US6357008(B1)	2002-03-01	Nachenberg	Applicant
US6417774(B1)	2002-07-01	Hibbs et al.	Applicant
US6424627(B1)	2002-07-01	Sorhaug 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	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
US7117493(B2)	2006-10-01	Matsushima	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
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
US7370233(B1)	2008-05-01	Sobel	Examiner
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
US7437764(B1)	2008-10-01	Sobel	Examiner
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.	Applicant
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
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
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
US7725937(B1)	2010-05-01	Levy	Examiner
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
US7937761(B1)	2011-05-01	Bennett	Applicant
US7949849(B2)	2011-05-01	Lowe et al.	Applicant
US7984483(B2)	2011-07-01	Leitz	Examiner
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	Examiner
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
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
US8756696(B1)	2014-06-01	Miller	Examiner
US8776043(B1)	2014-07-01	Thimsen	Examiner
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
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
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
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
US9106694(B2)	2015-08-01	Aziz et al.	Applicant
US9118715(B2)	2015-08-01	Staniford et al.	Applicant
US9241010(B1)	2016-01-01	Bennett	Examiner
US9594904(B1)	2017-03-01	Jain	Examiner
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, III	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/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/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 et al.	Applicant
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 et al.	Applicant
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/0273856(A1)	2005-12-01	Huddleston	Examiner
US2005/0283839(A1)	2005-12-01	Cowburn	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	Banzhof 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/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/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/0089860(A1)	2009-04-01	Forrester	Examiner
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/0158432(A1)	2009-06-01	Zheng	Examiner
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/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	Examiner
US2009/0265692(A1)	2009-10-01	Godefroid et al.	Applicant
US2009/0271867(A1)	2009-10-01	Zhang	Applicant
US2009/0276771(A1)	2009-11-01	Nickolov	Examiner
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/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/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/0211663(A1)	2010-08-01	Barboy	Examiner
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/0287613(A1)	2010-11-01	Singh 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	Stahlberg	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/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/0173460(A1)	2011-07-01	Ito et al.	Applicant
US2011/0191834(A1)	2011-08-01	Singh	Examiner
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	Niemel 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
US2011/0321166(A1)	2011-12-01	Capalik 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/0072968(A1)	2012-03-01	Wysopal	Examiner
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/0278889(A1)	2012-11-01	El-Moussa	Applicant
US2012/0297489(A1)	2012-11-01	Dequevy	Applicant
US2012/0304244(A1)	2012-11-01	Xie	Examiner
US2012/0324551(A1)	2012-12-01	Bretschneider	Examiner
US2012/0330801(A1)	2012-12-01	McDougal 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/0091570(A1)	2013-04-01	McCorkendale	Examiner
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/0133072(A1)	2013-05-01	Kraitsman	Examiner
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/0198840(A1)	2013-08-01	Drissi	Examiner
US2013/0227691(A1)	2013-08-01	Aziz et al.	Applicant
US2013/0246370(A1)	2013-09-01	Bartram et al.	Applicant
US2013/0254870(A1)	2013-09-01	Sotka	Examiner
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
US2014/0053260(A1)	2014-02-01	Gupta et al.	Applicant
US2014/0053261(A1)	2014-02-01	Gupta et al.	Applicant
US2014/0068775(A1)	2014-03-01	Ward et al.	Applicant
US2014/0082733(A1)	2014-03-01	Benefield	Examiner
US2014/0130158(A1)	2014-05-01	Wang et al.	Applicant
US2014/0137180(A1)	2014-05-01	Lukacs	Examiner
US2014/0169762(A1)	2014-06-01	Ryu	Applicant
US2014/0173739(A1)	2014-06-01	Ahuja	Examiner
US2014/0179360(A1)	2014-06-01	Jackson et al.	Applicant
US2014/0181984(A1)	2014-06-01	Kundu	Examiner
US2014/0230024(A1)	2014-08-01	Uehara	Examiner
US2014/0259169(A1)	2014-09-01	Harrison	Examiner
US2014/0289105(A1)	2014-09-01	Sirota	Examiner
US2014/0304819(A1)	2014-10-01	Ignatchenko	Examiner
US2014/0328204(A1)	2014-11-01	Klotsche et al.	Applicant
US2014/0337621(A1)	2014-11-01	Nakhimov	Examiner
US2014/0337836(A1)	2014-11-01	Ismael	Applicant
US2014/0351935(A1)	2014-11-01	Shao et al.	Applicant
US2014/0380473(A1)	2014-12-01	Bu	Examiner
US2015/0067862(A1)	2015-03-01	Yu	Examiner
US2015/0096025(A1)	2015-04-01	Ismael	Applicant
US2015/0186645(A1)	2015-07-01	Aziz	Examiner
US2016/0036840(A1)	2016-02-01	Dogu	Examiner
US2016/0048680(A1)	2016-02-01	Lutas	Examiner
US2016/0057123(A1)	2016-02-01	Jiang	Examiner
US2016/0110213(A1)	2016-04-01	Chen	Examiner
US2016/0182532(A1)	2016-06-01	Jones	Examiner
US2016/0191547(A1)	2016-06-01	Zafar	Examiner
US2016/0285914(A1)	2016-09-01	Singh	Examiner
US2016/0335110(A1)	2016-11-01	Paithane	Examiner
US2017/0034205(A1)	2017-02-01	Canedo	Examiner
EP2106085(A1)	2009-09-01		Applicant
GB2439806	2008-01-01		Applicant
GB2490431(A)	2012-10-01		Applicant
WO-02/06928	2002-01-01		Applicant
WO-02/23805	2002-03-01		Applicant
WO2/006928(A2)	2003-08-01		Applicant
WO-2007-117636	2007-10-01		Applicant
WO-2008/041950	2008-04-01		Applicant
WO-2011/084431	2011-07-01		Applicant
WO2011/112348(A1)	2011-09-01		Applicant
WO2012/075336(A1)	2012-06-01		Applicant
WO-2012/145066	2012-10-01		Applicant
WO2013/067505(A1)	2013-05-01		Applicant

Non-Patent Literature (80)

IEEE Xplore Digital Library Sear Results for “detection of unknown computer worms”, Http//ieeexplore.ieee.org/searchresult.isp?SortField=Score&SortOrder=desc&ResultC . . . (Accessed on Aug. 28, 2009).Applicant

AltaVista Advanced Search Results. “Event Orchestrator”, Http://www.altavista.com/web/results?Itag=ody&pg=aq&aqmode=aqa=Event+Orchesrator . . . (Accessed on Sep. 3, 2009).Applicant

AltaVista Advanced Search Results. “attack vector identifier”. Http://www.altavista.com/web/results?Itag=ody&pg=aq&aqmode=aqa=Event+Orchestrator . . . (Accessed on Sep. 15, 2009).Applicant

Cisco, Configuring the Catalyst Switched Port Analyzer (SPAN) (“Cisco”), (1992-2003).Applicant

Cisco, Intrusion Prevention for the Cisco ASA 5500-X Series, Data Sheet, (2012).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

Excerpt regarding First Printing Date for Merike Kaeo, Designing Network Security (“Kaeo”), (2005).Applicant

The Sniffers's Guide to Raw Traffic available at: yuba.stanford.edu/˜casado/pcap/section1.html, (Jan. 6, 2014).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

“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/xp1/articleDetails.jsp?reload=true&arnumber=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

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

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

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

Filiol, Eric , et al., “Combinatorial Optimisation of Worm Propagation on an Unknown Network”, International Journal of Computer Science 2.2 (2007).Applicant

Hjelmvik, Erik , “Passive Network Security Analysis with NetworkMiner”, (IN)SECURE, Issue 18, (Oct. 2008), pp. 1-100.Applicant

Kaeo, Merike , “Designing Network Security”, (“Kaeo”), (Nov. 2003).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”).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

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

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

Natvig, Kurt , “SANDBOXII: Internet”, Virus Bulletin Conference, (“Natvig”), (Sep. 2002).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

Peter M. Chen, and Brian D. Noble , “When Virtual Is Better Than Real, Department of Electrical Engineering and Computer Science”, University of Michigan (“Chen”).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

Venezia, Paul , “NetDetector Captures Intrusions”, InfoWorld Issue 27, (“Venezia”), (Jul. 14, 2003).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

Adobe Systems Incorporated, “PDF 32000-1:2008, Document management—Portable document format—Part1:PDF 1.7”, First Edition, Jul. 1, 2008, 756 pages.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

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

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

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:https://web.archive.org/web/20121022220617/http://www.informationweek- .com/microsofts-honeymonkeys-show-patching-wi/167600716 [retrieved on Sep. 29, 2014].Applicant

Heng Yin et al, Panorama: Capturing System-Wide Information Flow for Malware Detection and Analysis, Research Showcase © CMU, Carnegie Mellon University, 2007.Applicant

Idika et al., A-Survey-of-Malware-Detection-Techniques, Feb. 2, 2007, Department of Computer Science, Purdue University.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

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

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

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

Mori, Detecting Unknown Computer Viruses, 2004, Springer-Verlag Berlin Heidelberg.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

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. 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

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

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

PCT/US2014/072292 filed Dec. 23, 2014 International Search Report and Written Opinion dated Feb. 23, 2015.Applicant

PCT/US2015/037245 filed Jun. 23, 2015 International Search Report and Written Opinion dated Sep. 17, 2015.Applicant

U.S. Appl. No. 14/313,934, filed Jun. 24, 2014 Non-Final Office Action dated Sep. 30, 2015.Applicant

U.S. Appl. No. 14/620,055, filed Feb. 11, 2015 Non-Final Office Action dated Jun. 15, 2015.Applicant

PCT/US2014/072292 filed Dec. 23, 2014 International Preliminary Report dated Jul. 7, 2016.Applicant