US 9,747,446 B1Grant
System and method for run-time object classification
Issue Date:2017-08-29
•32 Claims
•13 Drawing Sheets
Abstract
One embodiment of an electronic device comprises a processor and a memory accessible by the processor. The memory comprises virtual execution logic and run-time classifier logic. The virtual execution logic includes at least one virtual machine that is configured to virtually process content within an object under analysis and monitor for anomalous behaviors during the virtual processing that are indicative of malware. The run-time classifier logic performs, during run-time, a first analysis on the monitored anomalous behaviors and a pre-stored identifier to determine if the monitored anomalous behaviors indicate that the object is malware belonging to a classified malware family. The pre-stored identifier is a collection of data associated with anomalous behaviors that uniquely identify the malware family.
Metadata
Assignee
- FireEye, Inc.
Inventors
- Vinay K. Pidathala
- Zheng Bu
- Ashar Aziz
Application Information
Application Number:US 14/228,094
Filing Date:2014-03-27
Priority Date:2013-12-26
Art Unit:2446
Classifications
IPC:
G06F21/56
Field of Search:
G06F 21/56G06F 21/566
Patent Drawings (13 sheets)
Description
Cross-Reference to Related Applications
[0001] This application claims the benefit of priority on U.S. Provisional Application No. 61/921,045, 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 data security. More specifically, one embodiment of the disclosure relates to a run-time classification of malicious objects, including advanced persistent threats (APTs).
General Background
[0003] Over the last decade, malicious software (malware) has become a pervasive problem for Internet users. In some situations, malware is a program or file that is embedded within downloadable content and designed to adversely influence or attack normal operations of a computer. Examples of different types of malware may include bots, computer viruses, worms, Trojan horses, spyware, adware, or any other programming that operates within an electronic device (e.g., computer, smartphone, server, router, wearable technology, or other types of electronics with data processing capabilities) without permission by the user or an administrator.
[0004] In general, an advanced persistent threat (APT) is malware that targets an entity and may be configured to exfiltrate (send out) information that is accessible to that entity. The targeted entity may include an individual or organization with high value information (e.g., classified or sensitive defense secrets, trade secrets, intellectual property, or the like). Currently, the classification of different types of malware, such as APTs for example, is quite resource intensive. For APTs, classification may require off-line system and workforce training.
Brief Description of the Drawings
[0005] 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:
[0006] FIG. 1 is an exemplary block diagram of an operational flow of a run-time malware classification conducted within an electronic device.
[0007] FIG. 2 is an exemplary block diagram of a first illustrative embodiment of an APT detection system that is adapted to perform run-time APT classification on incoming objects.
[0008] FIG. 3 is an exemplary block diagram of an illustrative embodiment of a communication system deploying run-time APT classification.
[0009] FIG. 4 is an illustrative embodiment of operations conducted by family identifier generator logic to generate a family identifier, such as an APT family identifier.
[0010] FIG. 5 is a detailed exemplary of a component diagram of the APT server according to one embodiment of the invention.
[0011] FIGS. 6A-6B are illustrative embodiments a method for identifying and classifying APT objects.
[0012] FIGS. 7A-7B are exemplary web-interfaces for submitting a suspected object to the APT server from the client device and receipt of a warning message.
[0013] FIG. 8 is an exemplary block diagram of a second illustrative embodiment of an electronic device that is adapted to perform run-time APT classification on incoming objects.
[0014] FIG. 9 is an illustrative embodiment of a communication system implemented with the electronic device FIG. 8 with run-time APT classification functionality.
[0015] FIG. 10 is an illustrative embodiment of a method for identifying malicious objects supplemented by use of a run-time classifier.
Detailed Description
[0016] I. Overview
[0017] Unlike conventional Advanced Persistent Threat (APT) detection systems, a first embodiment of the disclosure are directed to an APT detection system that is capable of automatically and quickly identifying a suspect object based on previously classified APT families in order to enable a network administrator or user to more easily understand the severity, origin, or tendencies of the recently detected APT.
[0018] A second embodiment of the disclosure is directed to a networked security appliance that is deployed with logic (e.g. run-time classifier) to accelerate detection of APT and non-APT malicious objects based on anomalous behaviors uncovered during virtual processing of the suspect object and anomalous behaviors that uniquely identify both known APT families and other malware type families.
[0019] As generally stated, an “APT” is a type of malware that is directed at a targeted entity and seeks to surveil, extract, and/or manipulate data to which the targeted entity would have access. In some instances, in lieu of data gathering, APTs may seek to perform nation state attacks for the purposes of political terrorism or cyber/industrial espionage. Hence, APTs are generally viewed as more serious threats because these attacks target a specific person or persons to acquire information (normally for nefarious reasons) and are persistent. Herein, a number of benefits may be realized through classification of APT and malware families for subsequent analysis, such as the following: (1) faster detection of APTs; (2) more accurate detection of APTs, including APTs that are morphing within a family; and/or (3) faster responsiveness to attacks that may be realized by reporting the names of recognized APT and other malware attacks.
[0020] More specifically, according to a first embodiment of the disclosure, an electronic device may be implemented with a run-time classifier, which is logic that is capable of accelerating the detection of malware, especially advanced persistent threats (APTs). The run-time classifier is configured to perform, during run-time (e.g., generally contemporaneously with virtual execution operations), an analysis based on (i) anomalous behaviors that are detected during virtual processing of a suspect object within a virtual execution environment and (ii) pre-stored family identifiers. A “family identifier” (also referred to as a “template”) is a collection of data (samples) associated with anomalous behaviors that uniquely identify a particular (APT and/or non-APT) malware family. These anomalous behaviors may constitute (1) unexpected or undesired operations and/or (2) statistically significant usages/accesses of logical components (e.g., files, registry keys, etc.).
[0021] The framework for run-time APT analysis comprises one or more databases including family identifiers for APT families and/or malware (non-APT) families. Initially, it is contemplated that the database(s) may be pre-loaded with identifiers associated with currently known APT and non-APT malware families. Thereafter, the database(s) may be updated via one or more external sources and/or in real-time based on results of the APT analysis as described below.
[0022] More specifically, as stated above, each family identifier is a collection of data (samples) of anomalous behaviors that uniquely identify a given malware family, namely a collection of related APT malware (referred to as “APT family”) and/or a collection of related malware other than APT malware (referred to as a “non-APT family”. According to one embodiment of the disclosure, the samples of anomalous behaviors may be made generic by removal of the actual arguments (e.g., variable parameters) associated with these behaviors. Hence, this anomalous behavior data (referred to herein as common indicators of compromise “Common IOCs”) may be selected based, at least in part, on the counts maintained for each type of anomalous behavior (IOC) that is associated with the malware forming an entire malware family, namely the related APTs forming a particular APT family or the related malware forming the non-APT family.
[0023] For instance, the Common IOCs may be a subset of all samples of anomalous behaviors (IOCs) associated with a particular APT family, where each Common IOC may be generally generated or selected based on (a) removal of actual arguments (parameter values) to make the IOCs generic, and/or (b) filtering out IOCs that would not provide sufficient distinction from other APT families.
[0024] The filtering involves removing IOCs (1) with a low occurrence rate with the particular APT family (e.g., less than a first count threshold) and (2) with a high occurrence rate across other known APT families (e.g., greater than a second count threshold). The same technique may be used to generate Common IOCs (family identifiers) for non-APT malware. As a result, Common IOCs are a collection of anomalous behaviors (IOCs) that may be used to uniquely define a given malware family, namely an APT family or a non-APT family.
[0025] Stated differently, an APT family identifier for a first APT family, for example, may be generated by obtaining a count of each type of anomalous behavior (IOC) associated with the APTs forming the first APT family, where the count represents the number of occurrences for that anomalous behavior (e.g., IOC). This produces a set of IOCs (e.g., collection of samples of anomalous behaviors) where each IOC may be associated with one or likely more APTs within the first APT family.
[0026] Thereafter, the set of IOCs is filtered to remove (i) any IOC from the set of IOCs having a low occurrence rate within the first APT family (e.g., less than the first count threshold) and (ii) any IOC from the set of IOCs having a high occurrence rate across other APT families (e.g., greater than the second count threshold). The later condition ensures entropy among the different APT families to provide sufficient distinctiveness between the APT families. Thereafter, the remaining IOCs, which form a subset of the set of IOCs, are referred to as “Common IOCs” and are used as the “APT family identifier” for the first APT family. A similar process may be conducted to produce a “malware family identifier,” namely a family identifier for a particular (non-APT) malware family.
[0027] According to one embodiment of the disclosure, when deployed within an APT detection system, a run-time classifier is configured to initially determine whether anomalous behaviors (IOCs) monitored during virtual processing of a received suspect object within a virtual execution environment statistically matches any (non-APT) malware family identifiers. In other words, the monitored IOCs are compared to the Common IOCs associated with every malware family identifier. Upon detecting a statistical match (e.g. IOCs match 90% or more of the Common IOCs), the analysis for confirming whether the suspect object is an APT is discontinued as the suspect object has now been identified as non-APT malware.
[0028] However, if no statistical match is detected, the monitored IOCs are compared with each of the APT family identifiers (e.g. Common IOCs representing each of the APT families). If a statistical match is detected for any of these APT family identifiers (e.g. IOCs match 90% or more of the Common IOCs for a previously classified APT family identifier), the suspect object is considered to be an APT that is part of that previously classified APT family. The family name and/or other stored information associated with the classified APT may be reported to the source submitting the suspect object and/or another electronic device (e.g., network administrator, etc.). This comparison of monitored IOCs with APT family identifiers is performed to provide faster detection of APT malware, as described below.
[0029] If no statistical match is detected again, a secondary analysis of the IOCs associated with the suspect object is performed in order to determine whether the suspect object may be classified as some unknown APT (that is not a member of a classified APT family) or malware that is not associated with a classified malware family. This secondary analysis is directed to analyzing the substantive nature of the anomalous behaviors to determine whether these behaviors constitute an APT. For instance, the secondary analysis may review anomalous behaviors involving data theft, statistically significant usages/access of certain logical components such as registry keys), or the like.
[0030] After the run-time classifier has completed its analysis, the results may be reported to a targeted destination (e.g., a user of the client device(s), network administrator, etc.) and/or stored in a database. The results may include an identifier for the APT family (hereinafter referred to as the “APT family identifier”), the name of the APT family, monitored behaviors characteristics of the APT family, or the like.
[0031] According to a second embodiment, APT family identifiers and/or malware family identifiers may be supplied to an electronic device (e.g., firewall, client device, a threat detection and prevention “TDP” system, etc.) for use in automated detection and prevention of future APT or other malicious attacks. When deployed within the electronic device, a run-time classifier is configured to determine whether anomalous behaviors (IOCs) monitored during virtual processing of a suspect object within a virtual execution environment of the electronic device statistically matches any pre-stored family identifiers such as APT or malware family identifiers. If so, the run-time classifier generates a measurement (referred to as a “score”) and provides the score to a logic unit within the electronic device. The logic unit may use the score, in whole or in part, to determine and signify (to a user, administrator or other entity associated with the source of the suspect object) whether the suspect object is malicious or not. If malicious, based on the finding of the run-time classifier, a name associated with the potential APT or malware family to which the suspect object belongs may be provided.
[0032] As an illustrative example, the run-time classifier may be configured to generate a score whose value may be highly correlated to the type of family identifier detected. This score may contribute to the classification of the suspect object as malicious, where the amount of contribution may be based on the weighting applied to this score in determining whether a suspect object is malicious. For instance, the score from the run-time classifier may be aggregated with scores produced from other threat detection processes to produce an overall score that identifies if the suspect object appears to be benign or malware such as APT malware. Alternatively, the score may be utilized in a different manner to potentially influence the overall score.
[0033] For instance, when determining that the IOCs suggest that the suspect object is an APT, the run-time classifier may output a first score value. Depending on the weight assigned to scores provided by the run-time classifier (as compared to other scores provided by the other threat detection processes), the first score value may significantly (and perhaps definitely) cause the overall score to represent that the suspect object is malicious. While some embodiments may only use the first score value to signify (perhaps definitively) that the suspect object as malicious, other embodiments may use the first score value to signify (and perhaps definitively) that the suspect object is not only malicious but is an APT.
[0034] Also, when determining that the IOCs suggest that the suspect object is not any known malware family, the run-time classifier may output a second score value. Again, depending on the weight assigned, the second score value may have an impact in classifying the suspect object as benign or may have little impact on the classification of the suspect object as malicious.
[0035] It is contemplated that the scores output from the run-time classifier may be static for each type of family (e.g. each APT or malware family assigned the same score) or may vary between different types of families (APT, malware) as well as between different types of malware families, between different types of APT families, and between different malware or APTs within their corresponding malware or APT families.
[0036] In accordance with another specific implementation, IOCs are stored within a run-time log (e.g., maintained by behavior monitoring logic) of behaviors detected (monitored) during virtual processing of a suspect object within a virtual execution environment and are made generic (prior to storage or thereafter) by removal of actual arguments (parameter values). These monitored behaviors may be used to generate a template (CIOC) as described above. In one embodiment, the logged behaviors may be time-stamped so as to preserve their chronological order during processing and the CIOC is generated to reflect the processing sequence of the CIOC.
[0037] II. Terminology
[0038] 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.
[0039] 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.
[0040] 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. The objects may be associated with network traffic. 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 malware and allow the object to be classified as at least “malicious” and perhaps classified as an advanced persistent threat (APT), when warranted.
[0041] 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 broadly refers to a series of bits or bytes having a prescribed format, which may include packets, frames, or cells. A “message” may be broadly referred to as any series of bits or bytes having a prescribed format as well.
[0042] 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.
[0043] As noted above, an APT is a type of sophisticated network attack that is directed at a particular target and seeks to surveil, extract, and/or manipulate data to which a targeted entity would have access. APTs may seek to maintain a persistent attack on a targeted electronic device and may initially lay dormant (prior to activation) for a prolonged period of time in comparison with traditional malware.
[0044] For example, a self-contained element of a flow, such as an APT-latent email message for example, may be specifically directed to a particular individual at a company (e.g., an officer of the company) in an attempt to extract sensitive data accessible by that individual. Sometimes, the APT-latent email message may include text/greetings that are personalized for the targeted entity along with an attachment (e.g., a Portable Document Format (PDF) document). The attachment may contain malicious content such that, upon opening or otherwise activating the attachment, the malicious content attempts to extract and/or manipulate targeted data accessible to the defined target.
[0045] Malware may be construed broadly as software that, upon execution, is designed to take advantage of a vulnerability, for example, to harm or co-opt operation of an electronic device or misappropriate, modify or delete data as for APT malware. Conventionally, malware is often said to be designed with malicious intent. An object may constitute or contain malware, whether APT malware or non-APT malware.
[0046] 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.
[0047] In general, a “virtual machine” (VM) is a simulation of an electronic device (abstract or real) that is usually different from the electronic device conducting the simulation. A VM may be used to provide a sandbox or safe runtime environment to enable detection of APTs and/or other types of malware in a safe environment. The VM may be based on specifications of a hypothetical computer or emulate the computer architecture and functions of a real world computer.
[0048] The term “computerized” generally represents that any corresponding operations are conducted by hardware in combination with software and/or firmware. Also, the term “compare” or “comparison” generally means determining if a statistical match (e.g., a certain level of correlation) is achieved between two items where one of the items may include a particular family identifier, as described below in detail.
[0049] 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.” The phrase “(A, B, . . . , etc.)” has a similar connotation. An exception to this definition will occur only when a combination of elements, functions, steps or acts are in some way inherently mutually exclusive.
[0050] 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.
[0051] III. General Operation Flow of Run-Time Malware Classification
[0052] Referring to FIG. 1 , an exemplary block diagram of an operational flow of a run-time malware classification conducted within an electronic device 100 is shown. Herein, incoming objects 120 originally associated with network traffic are uploaded into a virtual environment 130. Herein, the virtual environment 130 comprises virtual execution logic including one or more virtual machines that virtually process (also referred to as “detonate”) each of the incoming objects 120. The virtual environment 130 further monitors behaviors during such virtual processing. Some or all of these monitored behaviors 140 are provided to a run-time classifier 150 for analysis in real-time. For this embodiment, only anomalous behaviors, namely unexpected or undesired operations by the suspect object and/or statistically significant usages/access of certain logical components (e.g., registry keys, certain ports or files, etc.), are provided to the run-time classifier 150. Of course, all monitored behaviors may be provided to the run-time classifier 150, which would be provided functionality for identifying the anomalous behaviors from normal behaviors.
[0053] According to one embodiment of the disclosure, the run-time classifier 150 is configured to initially determine whether the anomalous behaviors 140 (sometimes referred to as “indicators of compromise” or “IOCs), being part of the monitored behaviors during virtual processing of an object, statistically match one of a plurality of preconfigured family identifiers stored in database 160. For this embodiment, a family identifier may be either (i) an APT family identifier directed to a particular APT family or (ii) a malware family identifier directed to a non-APT malware family.
[0054] Herein, according to one embodiment of the disclosure, the family identifier database 160 may follow a relational, object, hierarchical, or any other type of database model. In one embodiment, the family identifier database 160 is spread across one or more persistent data stores. The persistent data stores may be integrated within the electronic device 100 (e.g., APT detection system 200 or TDP system 9101 described below) or within a separate host electronic device. For example, the family identifier database 160 may be located at a remote or even geographically remote location that is communicatively coupled (e.g., by a dedicated communication link or a network) to the electronic device 100.
[0055] As stated above, each family identifier is a collection of samples of anomalous behaviors, also referred to herein as common indicators of compromise (“Common IOCs”). The Common IOCs may be selected based, at least in part, on the counts maintained for each type of anomalous behavior (IOC) that is associated with the APTs (or malware) forming a particular family (e.g., APT family, malware family, etc.).
[0056] Therefore, if the IOCs associated with the suspect object statistically match any Common IOCs corresponding to the family identifiers, the run-time classifier 150 determines that the suspect object is part of that particular (APT or malware) family. Depending on the deployment for the run-time classifier, a number of actions may be undertaken by the electronic device when the IOCs statistically match any Common IOCs representing a family identifier. For instance, as an example, the particulars associated with the uncovered family may be reported, as represented by output 170. As another example, further analysis in determining whether the suspect object is an APT may be discontinued or may be continued to obtain further analytical information. As yet another example, a score associated with the uncovered family may be provided to logic within the electronic device that is responsible for deciding whether the incoming suspect object is malicious or not, as represented by output 180. The determination logic can rely solely on the determination or weigh other considerations when making the decision.
[0057] If no statistical match is detected, a secondary analysis of the IOCs associated with the suspect object may be performed to determine whether the suspect object still may be classified as an APT (e.g., the suspect object is an APT that does not belong to any classified APT or malware families, as represented by output 190.
[0058] Hence, the run-time classifier 150 is useful to more quickly detect APTs and other types of non-APT malware. This may enable network administrators to address malicious attacks before serious security issues may arise.
[0059] IV. APT Detection System Deployment of Run-Time Classifier
[0060] Referring to FIG. 2 , an exemplary block diagram of a first illustrative embodiment of an APT detection system 200 that is adapted to perform run-time APT classification on incoming objects 220 is shown. Received from a source via network 210, the incoming objects 220 are directed to virtual execution logic 230, which is part of the APT analysis system 330 as shown in FIG. 3 .
[0061] Herein, the incoming objects 220 may be captured and filtered from some or all of the incoming objects associated with network traffic. For instance, as an illustrative example, before receipt of an incoming object (e.g., one of incoming objects 220) by virtual execution logic 230, it is contemplated that intrusion protection system (IPS) logic or heuristic logic (not shown) may be deployed to filter incoming objects 220 from a larger set of objects (not shown). Such filtering may be conducted through signature checks or other static analysis processes, where the incoming objects 220 are tagged for more in-depth analysis. Given that the source (not shown) may be an electronic device that has already determined that some or all of the incoming objects 220 may be malicious, the operations of the IPS logic and/or heuristic logic may be suspended or the amount of filtering realized may be de minimis. In fact, for some deployments, the IPS/heuristic logic is unnecessary and may not be implemented.
[0062] Herein, the virtual execution logic 230 comprises one or more virtual machines 2351-235N (N≧1), which virtually processes (sometimes referred to as “detonate”) each of the incoming objects 220 and monitors for anomalous behaviors during such virtual processing, as described below. These anomalous behaviors 240 are provided to the run-time classifier 150 for analysis.
[0063] According to one embodiment of the disclosure, the run-time classifier 150 is configured to initially determine whether the anomalous behaviors 240 (IOCs) statistically match any malware family identifiers. According to this embodiment of the disclosure, the malware family identifiers may be retrieved from malware family identifier database 162, which along with an APT family identifier database 164 forms the family identifier database 160. Family identifier database 160 may be located within the APT detection system 200 or may be located at remote or even geographically remote location that is communicatively coupled (e.g., by a dedicated communication link or via network 210) to the APT detection system 200 (e.g., cloud services; dedicated external server; etc.). Both the malware family identifiers and the APT family identifiers may be updated in a periodic or aperiodic manner, based on data downloaded from an external server (not shown) or data from suspect objects 220 detected as APTs or other malware by run-time classifier 150.
[0064] As stated above, each family identifier is a collection of data (samples) associated with anomalous behaviors that uniquely identify a given APT (or malware) family. This collection of anomalous behavior data (Common IOCs) may be selected based, at least in part, on the counts maintained for each type of anomalous behavior that is associated with the APTs (or malware) forming a particular APT (or malware) family. For instance, the Common IOCs (S1, S2, S4, S8 and S18) representing a first APT family identifier for a first APT family may be a subset of samples S1-S20 of anomalous behaviors for the first APT family. Each Common IOC (S1, S2, S4, S8 and S18) may be selected based on (1) a high occurrence rate of an IOC (e.g., greater than a first count threshold) for the first APT family and (2) a lower occurrence rate of this behavior (e.g., less than a second count threshold) across other APT families stored in APT family identifier database 164. Similarly, the Common IOCs (S3-S4, S10 and S28) representing a second APT family identifier may be a subset of samples (S1-S5, S10-S12 and S21-S30) of anomalous behaviors for the second APT family. It is noted that some Common IOCs may be shared between different APT family identifiers, provided that the Common IOCs in their entirety are collectively distinct and unique.
[0065] Therefore, if the IOCs associated with the suspect object statistically match any of the malware family identifiers retrieved from malware family identifier database 162, the run-time classifier 150 determines that the suspect object is not an APT and discontinues its analysis.
[0066] If no statistical match is detected, the monitored IOCs from the suspect object are compared with each of the APT family identifiers retrieved from APT family identifier database 164. If a statistical match is detected, the suspect object is considered to be an APT that is part of a previously classified APT family. Information 250 associated with the classified APT family (e.g., family name, suspect object, Common IOCs used, etc.) may be received by reporting logic 260 and forwarded to the source submitting the object or to another electronic device (e.g., administrator, etc.), as denoted by flow 265.
[0067] If no statistical match is detected, a secondary analysis of the IOCs associated with the suspect object may be performed by a secondary classifier 280 that receives at least the anomalous behaviors 270 to determine whether the suspect object may be classified as an APT or not. This secondary analysis may involve substantive review for anomalous behaviors directed to data theft, statistically significant usages/access of certain logical components such as registry keys, or the like. Hence, the run-time APT analysis is used prior to this analysis to achieve faster detection of APTs associated with APT families that have already been classified, as further described below.
[0068] Referring now to FIG. 3 , an exemplary block diagram of an illustrative embodiment of a communication system 300 is shown, where a source 310 may upload suspect objects to the APT detection system 200 for analysis as to whether each of these suspect objects is an APT. Herein, the communication system 300 comprises APT detection system 200 communicatively coupled to the source 310 over transmission medium forming the network 210. In general, according to one embodiment of the disclosure, the APT detection system 200 comprises one or more electronic devices that are configured to receive one or more suspect objects 320 from the source 310 (e.g., client devices 310A and 310B) for APT detection and potential APT family classification.
[0069] More specifically, according to this embodiment, the APT detection system 200 comprises an APT analysis system 330, an APT server 360, and the family identifier database 160. In particular, the APT server 360 operates in combination with the family identifier database 160 and/or APT analysis system 330 to automatically determine whether an incoming suspect object 320 is an APT belonging to a previously classified APT family.
[0070] According to one embodiment of the disclosure, the suspect object 320 is provided to the APT analysis system 330, in particular the virtual execution logic 230 within the APT analysis system 330. The virtual execution logic 230 comprises a run-time virtual execution environment 340 that comprises one or more virtual machines (VMs) 3451-345M (M≧1), where one or more of the VMs 3451-345M may be configured for virtual processing the suspect object 320 which may cause anomalous behaviors to occur.
[0071] Although not shown, VMs 3451-345M may be configured based on the results of the signature checks conducted prior to routing the subject object 320 to the APT analysis system 330. Alternatively, metadata associated with the subject object 320 may be used, at least in part, to determine protocols, application types and other information that may be used to determine particular software profile(s). The software profile(s) are used for selecting corresponding software images within a data store 335 for use in configuring a run-time environment in the one or more virtual machines 3451-345M. These software profile(s) may be directed to different versions of the same software application for fetching corresponding software image(s) from data store 370.
[0072] During virtual execution of the subject object by one or more of the VMs 3451-345M, the behaviors exhibited during virtual processing are monitored by a behavior monitoring logic 350. Of these monitored behaviors, a count may be maintained by behavior counter 365 (deployed in APT analysis system 330 or APT server 360 as shown) for at least each type of monitored anomalous behavior 352. The anomalous behaviors 352 are provided from APT analysis system 330 to the run-time classifier 150 of the APT server 360. The dropped object extractor 355 performs operations to detect, extract, and pass dropped objects during virtual processing by the suspect object 320 by VM(s) 3451, . . . and/or 345M.
[0073] As illustrated in FIG. 3 , the APT server 360 comprises the behavior counter 365, an APT classifier 370, a warning generator 380, and reporting logic 260. Herein the APT classifier 370 includes the run-time classifier 150, secondary classifier 280 and family identifier generator 375. While run-time classifier 150 and secondary classifier 280 are configured to attempt to classify suspect objects 320 as APTs based on an analysis relying on family identifiers, the family identifier generator 375 is configured to generate such family identifiers.
[0074] Referring to FIG. 4 , in accordance with formulation of the framework for conducting the run-time APT analysis using the family databases, an illustrative embodiment of operations conducted by the family identifier generator 375 to generate a family identifier, such as an APT family identifier for example, is shown. Initially, the family filter generator obtains samples of all types of anomalous behaviors (IOCs) associated with the APTs forming a particular APT family along with their corresponding counts (operation 400). These IOCs may be referred to as a set of IOCs. Upon obtaining the set of IOCs, the family filter generator performs a first filtering operation by eliminating any IOC that falls below a first occurrence rate within the particular APT family to produce a first subset of IOCs (operation 410). The first occurrence rate may represent a first count threshold, which may be a static value or a dynamic value.
[0075] Thereafter, the family filter generator performs a second filtering operation on the first subset of IOCs by eliminating any IOC having a second occurrence rate within APT families other than the particular APT family (operation 420). The second filter operation produces a second subset of IOCs. Herein, the second occurrence rate may represent a second count threshold, which may be greater (and perhaps substantially greater by a few factors) than the first count threshold. Similarly, the second count threshold may be a static value or a dynamic value. Of course, it is contemplated that the second filtering operation may be conducted prior to the first filtering operation as the ordering of these operations may be changed providing both filtering operations are performed.
[0076] After performing the first and second filtering operations, the second subset of IOCS may constitute the Common IOCs that represent the APT family identifier for the particular APT family (operation 430). Of course, based on the number of IOCs forming the second subset of IOCs, it is contemplated that only some of the second subset of IOCs may be used as the APT family identifier.
[0077] Referring back to FIG. 3 , after receipt of the anomalous behaviors 352 (e.g., IOCs) associated with the suspect object 320 from APT analysis system 330, the run-time classifier 150 within the APT server 360 determines if the suspect object corresponds to any malware family identifiers (e.g. corresponds to a predetermined percentage of CIOCs forming the malware family identifier), which may be obtained from the malware family identifier database 162. In general, this determination involves a statistical comparison of the IOCs associated with the suspect object 320 to the malware family identifiers within the malware family identifier database 162. Upon determining that the IOCs associated with the suspect object 320 statistically match any of the malware family identifiers, the run-time classifier 150 discontinues analysis on the suspect object 320 as it has been classified other than an APT. For instance, a “statistical match” may be a determination that ninety percent (90%) or more of the IOCs match the compared Common IOCs as described above.
[0078] Upon failing to detect a statistical match between the IOCs associated with the subject object 320 and the malware family identifiers, the run-time classifier 150 analyzes these IOCs in connection with the APT family identifiers, which may be retrieved from APT family identifier database 164. Upon comparing the IOCs with some or all of APT family identifiers and detecting a statistical match, the run-time classifier 150 has identified the suspect object 320 as an APT that is part of the classified APT family. It is contemplated that, for testing purposes, the suspect object 320 may be an APT from a known APT family in order to better define APT family boundaries.
[0079] In response to detecting that object 320 is an APT of a classified APT family, the warning generator 380 of the APT server 360 generates and transmits a warning message 385 to the source 310 (e.g., a corresponding client device 310A). The warning message 385 may indicate to a targeted recipient (e.g., client, IT personnel, etc.) that the suspect object 320 is an APT, perhaps along with its determined APT family name; the APT family identifier for use in detecting future attacks, namely the Common IOCs representing the APT family (e.g., anomalous behaviors such as data theft, statistically significant usages/access of certain logical components such as registry keys); or the like. Alternatively, the warning message 385 may be routed to another electronic device (e.g., administrator, etc.).
[0080] If no statistical match is still detected by run-time classifier 150, a secondary classifier 280 is now provided with the IOCs associated with the subject object 320 and analyzes the substantive nature of these IOCs to determine whether the suspect object may be classified as an APT or not.
[0081] Referring still to FIG. 3 , one or more client devices 310A and 310B are coupled to the APT detection system 200 through the network 210. Network 210 may be a private network (e.g., enterprise network) in which both the APT detection system 110 and the client devices 310A and 310B are on the same network. Alternatively, network 210 may be a public network in which the APT detection system 200 is remotely accessed by an electronic device (e.g., client 310A/310B, etc.).
[0082] Herein, the client device(s) 310A/310B may be any type of electronic device, including laptop computers, desktop computers, tablet computers, smartphones, servers, network devices (e.g., firewalls and routers), wearable technology, process controllers, or other types of electronics with data processing capabilities and typically have network connectivity. Furthermore, the client device(s) 310A/310B may include one or more processors with corresponding memory units for processing data. The processors and memory units are generally used herein to refer to any suitable combination of programmable data processing components and data storage that conduct the operations needed to implement the various functions and operations of the client device(s) 120. The processors may be special purpose processors such as an application-specific integrated circuit (ASIC), a general purpose microprocessor, a field-programmable gate array (FPGA), a digital signal controller, or a set of hardware logic structures (e.g., filters, arithmetic logic units, and dedicated state machines) while the memory units may refer to non-volatile memory. An operating system may be stored in the memory units of the client device(s) 310A/310B, along with application programs specific to the various functions of the client device(s) 310A/310B, which are to be run or executed by the processors to perform the various functions of the client device(s) 310A/310B. For example, the memory units of a client device 310A/310B may store email and/or web-browser applications that are run by associated processors to send, receive, and view information associated with the objects.
[0083] FIG. 5 shows a component diagram of the APT server 360 according to one embodiment of the invention. As shown, the APT server 360 may include one or more processors 500 and a persistent data store 530, where processor(s) 500 is further coupled to persistent storage 530 via transmission medium 525.
[0084] The one or more processors 500 and the persistent data store 530 are generally used herein to refer to any suitable combination of programmable data processing components and data storage that conduct the operations needed to implement the various functions and operations of the APT server 360. The processor(s) 500 may be one or more special purpose processors such as an application-specific integrated circuit (ASIC), a general purpose microprocessor, a field-programmable gate array (FPGA), a digital signal controller, or a set of hardware logic structures (e.g., filters, arithmetic logic units, and dedicated state machines) while the persistent data store 530 may refer to non-volatile memory. An operating system may be stored in the persistent data store 530, along with application programs specific to the run-time classifier 150 and other various functions of the APT server 360, which are to be run or executed by the processors 500 to perform the various functions of the APT server 360.
[0085] In one embodiment, the APT server 360 may include one or more input/output (I/O) interfaces 510 for communicating with various components external to the APT server 360. The I/O interface(s) 510 may be implemented as a physical interface including one or more ports for wired connectors. Additionally, or in the alternative, I/O interface 510 may be implemented with one or more radio units for supporting wireless communications with other electronic devices. Hence, the I/O interface(s) 510 enables communications with one or more electronic devices using wireless and/or wired protocols, including the IEEE 802.3 and the IEEE 802.11 suite of standards.
[0086] In one embodiment, as shown in FIG. 5 , the I/O interface(s) 510 allows the APT server 360 to communicate with the family identifier database 160, an external server 540, APT analysis system 330, and/or the source 310 for suspect objects over one or more wired and/or wireless transmission mediums. It is contemplated that the APT analysis system 330 may be optional where the virtual processing of the suspect object occurs outside the APT detection system 200, and anomalous behaviors are provided to APT server 360 from other resources (including remote sources.
[0087] Referring still to FIG. 5 , the persistent data store 530 may store logic, including the run-time classifier 150, the secondary classifier 280, the warning generator 380 and reporting logic 260 (e.g., a graphical user interface “GUI”). Each of these logic elements may be discrete software components that may be processed/run by one or more of the processors 500. Each element stored in the persistent data store 530 and shown in FIG. 5 will be described below in accordance with the method of operation described in FIGS. 6A-6B .
[0088] Referring to both FIGS. 5-6A , an illustrative embodiment of a method for identifying and classifying APT objects is shown. Herein, at operation 500, a suspect object is received by the APT detection system 200, namely the virtual execution logic within the APT analysis system 330 receives the suspect object 320 from the source 310 (e.g., client device 310A, a threat detection and prevention “TDP” system of FIG. 9 , etc.). It is contemplated that, where the source 310 is a TDP system which also analyzes the suspect object for malware, the suspect object is provided directly to the APT detection system 200 to verify whether the suspect object includes APT malware. However, where the source 310 is the client device 310A, it may utilize the APT detection system 200 as a primary malware detection system, and thus, APT server 360 may include graphics user interface (GUI) logic 550 that allow a user of the client device 310A to submit a suspect object through an interface. The interface may be generated by the GUI logic 550 and served to the client device 310A. In this fashion, the APT server 330 may operate as a web-server to deliver data and provide a user interface to the client device 310A.
[0089] Referring to FIG. 7A , an exemplary web-interface 700 for submitting a suspected object to the APT server 360 from client device 310A is shown. In this example interface, a user may direct a web browser running on the client device 310A to view the web-interface 700. The user may thereinafter enter the address/location of a suspect object into the web-interface 700 using the address input field 710 and the “BROWSE” button 720. The entered address indicates the location of the suspect object in storage on the client device 310A or on a remote device (e.g., stored on a server). After selection of the suspect object, the user may submit the suspect object to the APT server 360 by selecting the “SCAN” button 730 in the web-interface 700. The suspect object may be transmitted from the client device 310A such that it is received by the APT server 360 for processing as described above at operation 600.
[0090] Although the APT server 360 is described above to serve the web-interface 700 to a browser of the client device 310A, in other embodiments, a separate web-server may be in communication with the client device 310A and the APT server 360 to provide the web-interface 700 and facilitate transmission of the suspect object to the APT server 360 from the client device 310A.
[0091] Referring back to FIGS. 5-6A , following receipt of the suspect object, APT analysis system 330 detonates the suspect object (e.g., processes by virtual execution or other operations to activate the suspect object) to produce data describing the anomalous behaviors of the suspect object during virtual processing (operation 605). In one embodiment, the APT analysis system 330 comprises one or more separate computing devices or processing units that may independently and discretely process the suspect object and monitor (e.g., log, count, etc.) the resultant operations.
[0092] For example, in one embodiment, the suspect object may be a self-contained element of a flow such as a PDF file. In this embodiment, APT analysis system 330 may configure a VM with Adobe® Reader® or other appropriate document reader to detonate the PDF file (e.g., performs virtual operations on the PDF file). The resultant behaviors performed during virtual processing of the suspect object are monitored by behavior monitoring logic 375, and a count (number of occurrences) for each type of monitored, anomalous behavior may be maintained. Each of these counts may include the number of occurrences of a particular anomalous behavior during virtual processing of the suspect object and/or associated dropped objects (hereinafter referred to as “behavior count value”).
[0093] After detonating the suspect object, the APT analysis system 330 monitors and records at least the anomalous behaviors and their aggregated behavior count values. This recorded data describing the suspect object. Use of the APT analysis system 330 ensures that detonation of the suspect object is controlled and will not result in infection of the client device 310A and/or the compromise of sensitive data. According to one embodiment, the APT analysis system 330 conducts heuristic analysis.
[0094] According to another embodiment, the APT analysis system 330 includes a plurality of VMs with various profiles, and may, in some cases, simulate the client device 310A during detonation of the suspect object. These profiles may include software to be run by a VM to process a suspect object. For example, the profiles may include an operating system and one or more suitable computer applications that are required to process the objects. In this example, one of the applications may include a document reader (e.g., an Adobe® Reader for PDF documents) and/or a web browser (for web pages) for detonating the suspect object. The APT analysis system 330 may include separate virtual processors and memory units for use in detonating different types of objects.
[0095] As noted above, detonation of the suspect object at operation 305 produces data that describes anomalous behaviors of the suspect object. Of course, besides data directed to the anomalous behaviors and their corresponding count values, the data may also include details regarding the origin of the suspect object stored in metadata, data generated by the suspect object during detonation, data attempted to be accessed by the suspect object (both locally and from remote systems) during detonation, etc.
[0096] During detonation, in some cases, the suspect object may generate/drop separate objects during detonation. These dropped objects may be new files (e.g., binary files) or other segments of data or executable code created by the original suspect object. In this embodiment, the dropped objects may be uncovered and passed back to operation 605 for detonation by the dropped object extractor (operations 610 and 615). Accordingly, each of the dropped objects is detonated in a similar fashion as described in relation to the suspect object to generate data associated with each dropped object and behavior count values for behaviors detected during analysis of the original suspect object may be augmented to reflect the actual number of occurrences for each particular behavior.
[0097] As shown in operation 620, after detonation of the suspect object and any dropped objects produced by the suspect object, anomalous behaviors associated with the suspect and dropped objects may be determined from the data. Additionally, the behavior count values may be tallied or, in the alternative, determined by the run-time classifier 150 in lieu of the APT analysis system 330 performing the behavior count analysis.
[0098] As an illustrative example, monitored anomalous behaviors of the objects during detonation along with the number of occurrences of these particular behaviors (behavior count value) are maintained. For instance, a first behavior count value associated with a first anomalous behavior may represent the number of occurrences that a suspect object attempts to make out-bound communications to outside data sources during virtual processing of that object. Outbound communications may seek instructions, for example from a malicious server, as to conduct malicious activity. In another embodiment, a second behavior count value associated with a second anomalous behavior may represent the number of occurrences that a suspect object is attempting to exfiltrate (or send out) data to an external resource. In fact, exfiltration of data alone may indicate that the object is an APT.
[0099] Hence, the anomalous behaviors provide a comprehensive description of an associated object such that a comparison of anomalous behaviors, and analysis of their corresponding count values may be performed. Such comparison/analysis is conducted to determine whether the object is an APT and/or belongs to a particular APT family, as described below.
[0100] Optionally, data related to the suspect object and the dropped objects may be further retrieved from external data sources while anomalous behaviors are being monitored during virtual processing of the suspect object. For example, data may be retrieved from the external server 540 through the I/O interface 510. In this embodiment, the external server 540 may be a device on the same local area network as the APT detection system 200 or connected to the APT detection system 200 over a wide area network (e.g., the Internet). For example, as discussed above, the external server 540 may be connected to the APT detection system 200 through the network 210 of FIG. 3 .
[0101] In one embodiment, the data retrieved from the external server 540 may include data related to servers attempted to be accessed by the suspect and dropped objects while being detonated (e.g., internet protocol (IP) address of a server) where APT analysis system 200 physically processes the object in lieu of logical (virtual) processing. In another embodiment, the external data may include data collected by third parties related to the suspect object (e.g., malware classification information). In one embodiment, operation 620 may be performed by the run-time classifier 150.
[0102] Following generation of behaviors for the suspect object and/or the dropped objects, as shown in operation 625, the APT classifier 250 may analyze the data to automatically (1) determine whether the suspect object belongs to a known malware (non-APT) family. If not, the APT classifier 250 may determine (i) whether the suspect object is an APT belonging to a previously classified APT family, or (2) whether the suspect object is an APT where a family associated with the suspect object has not been classified.
[0103] More specifically, as shown in FIG. 6A , the run-time classifier 150 performs an analysis of the anomalous behaviors (IOCs) associated with the suspect object to any or all of the malware family identifiers (block 525). This analysis may involve statistical comparison of the IOCs associated with the suspect object to the Common IOCs formulating each of the malware family identifiers. If a statistical match is detected, the run-time classifier discontinues further processing of the suspect object as the object is now determined to be malware other than an APT (operations 630 and 635). However, it is contemplated that the analytic data may be generated and reported. Otherwise, if no statistical match is detected, the run-time classifier continues further analysis (operation 640).
[0104] Referring now to FIG. 6B , after conducting a first analysis by statistically comparing the IOCs of the suspect object to the Common IOCs associated with the malware family identifiers, the run-time classifier conducts a second analysis by comparing the IOCs of the suspect object to the Common IOCs associated with previously classified APT families as retrieved from the family identifier database (operation 645). If a statistical match is detected, the object is an APT and is classified as belonging to that APT family (blocks 650 and 655).
[0105] In one embodiment, each entry in the APT family identifier database 164 may include the suspect object along with the APT family identifier that uniquely identifies the object in the APT family identifier database. Other information that may be stored within APT family identifier database 164 may include one or more of the monitored anomalous behaviors (e.g., IOCs) for the suspect object, data from external server or other resources, or the like (operation 655).
[0106] Upon determining that the suspect object is APT malware and storage of its behaviors (IOCs), the suspect object is flagged as APT malware in the APT family identifier database (operation 660). In one embodiment, flagging the suspect object as APT malware includes setting an APT malware data value associated with the suspect object in the APT family identifier database 164 to a selected value, e.g., “true”. Also, the APT family identifier is stored to identify that the APT malware belongs to a certain APT family from which information associated with the APT family can be accessed for inclusion within the warning message or subsequently accessed by the user or administrator using the APT family identifier.
[0107] After flagging the suspect object as APT malware in the APT family identifier database, the warning generator within the APT server generates a warning message to a targeted destination such as a source of the suspect object (e.g., client device 310A or TDP system) or another electronic device (operation 665). The warning message identifies that the suspect object is APT malware and should be discarded, deleted, quarantined or otherwise avoided.
[0108] By the warning generator 389 transmitting a warning message or other messages to the source identifying a classification of the suspect object, a user or administrator of the source may be better prepared and less susceptible to APTs and other malicious attacks. For example, upon receiving a warning message from the APT detection system 200 of FIG. 3 , the user may delete/quarantine the suspect object(s) (e.g., an email or file) and/or report the suspect object(s) to a network administrator. Also, the APT detection system 200 may generate the APT family identifier for the APT malware including its metadata, such as, for example, its behaviors observed during processing. The APT family identifiers may be stored in the APT family identifier database 162 and may be distributed to one or more other electronic devices. The APT family identifier (or parts thereof) may be used to generate a signature for the APT malware, which may be used in turn by the source or other electronic devices to block future objects/content where signature statistically matches are found. This proactive action may prevent the source from being infected by the suspect object and sensitive data accessible to the user is not compromised by the suspect object.
[0109] In one embodiment, the warning message may be a transmission to a component of the web-interface 700. For example, as shown in FIG. 7B , a dialog box 750 of the web-interface 700 may be updated to indicate that the suspect object is APT malware. In other embodiments, other warnings may be transmitted to the client device 310A. For example, email messages, pop-up messages, or other signals may be transmitted between the APT detection system 200 and the client device 310A to represent the warning message.
[0110] Similarly, upon determining at operation 650 that the suspect object is not APT malware, the run-time classifier stores the suspect object, some or all of the anomalous behaviors (IOCs) associated with the suspect object, and/or data from external sources into the APT family identifier database 164 (operation 670). Thereafter, the secondary classifier is configured to determine whether the suspect object is APT malware or non-APT malware based on comparisons with anomalous behaviors of the suspect object to highly common anomalous behaviors (operation 675). This comparison may be performed using machine learning and statistical analysis.
[0111] Upon determining that the suspect object is non-APT malware, the secondary classifier 280 flags the suspect object as non-APT malware (operation 685). In one embodiment, flagging the suspect object as non-APT malware includes setting an APT malware data value associated with the suspect object temporarily stored the APT family identifier database 164 to a selected value, e.g., “false”. However, upon determining that the suspect object is new APT malware, the suspect object is flagged as APT malware in the APT family identifier database 164 (operation 685), where the APT may be assigned to a new APT family identifier or assigned to a “known” classification for now. Thereafter, the analytic data has been generated (operation 690).
[0112] V. Threat Detection and Protection System (TDP) System Deployment of Run-Time Classifier
[0113] Although described above as transmission of a suspect object, in other embodiments, a suspect object may be analyzed separate from the APT detection system 200, where the monitored APT detection functionality deployed within an electronic device (e.g., firewall, client device, a threat detection and prevention “TDP” system, etc.). According to a second embodiment of the disclosure, as shown in FIG. 8 , the electronic device 800 may be adapted to receive the APT family identifiers and/or malware family identifiers for use in automated detection and prevention of future APT or other malicious attacks at the appliance level.
[0114] In contrast to deployment within the APT detection system, when deployed within the electronic device 800, a run-time classifier 850 may be configured to determine whether anomalous behaviors (IOCs) monitored during virtual processing of a suspect object within a virtual execution environment statistically matches any pre-stored APT or malware family identifiers within family identifier database 160. If so, the run-time classifier 850 generates a measurement (referred to as a “score”) that is provided to the score determination logic 860 within the electronic device. The score determination logic 860 may use the score, in whole or in part, in determining whether the suspect object is to be classified malicious or not.
[0115] As an illustrative example, received from a source via network 210, incoming objects 805 are captured and subsequently analyzed by static analysis logic 810 to (i) filter a subset of the objects 820 from the incoming objects 805 and/or (ii) generate a score (Score_1) 815 associated with each object that reflects the likelihood of the object being malware (and perhaps the severity of the potential malware).
[0116] In particular, as an illustrative example, before receipt of objects 820 by virtual execution logic 825, the static analysis logic 810 (e.g., IPS logic, heuristic logic) may conduct signature checks (e.g., exploit signature checks, vulnerability signature checks, etc.) or other scanning operations on the objects 805, where a subset of objects 820 are tagged for more in-depth analysis. Furthermore, the static analysis logic 810 may be configured to generate a score (Score_1) 815 for each analyzed object, which represents the probability (or level of confidence) that the characteristics of that analyzed object are indicative of malware. In other words, the score represents a value that classifies the threat level of the possible malware characterized by the particular analyzed object.
[0117] For instance, as an illustrative example, upon detecting one type of characteristic that suggests an object 820 under analysis is malware, the static analysis logic 810 may generate a score having a first value (e.g., score of 5 out of 20) associated with that object. However, upon detecting multiple characteristics or another type of characteristic that more strongly suggests the object under analysis is malware, a higher score (e.g., score of 13 out of 20) may be generated.
[0118] Herein, the virtual execution logic 825 comprises a run-time virtual execution environment 830 that features one or more virtual machines 8351-835N (N≧1), which virtually processes (sometimes referred to as “detonate”) each of the incoming objects 820. Behavior monitoring logic 840 monitors the behaviors produced during virtual processing of a suspect object 820 and determines which the these behaviors are anomalous. These anomalous behaviors 845 are provided to the run-time classifier 850 for analysis.
[0119] The run-time classifier 850 may be configured to generate a score (Score_2) 855 whose value may be dependent on whether the suspect object is classified to be part of a known malware (non-APT or APT) family and/or the type of malware family. Score_2 855 may contribute to the classification of the suspect object as malicious, where the amount of contribution may be based on the weighting applied to Score_2 855. For instance, Score_2 855 may be aggregated with scores produced from other threat detection processes (e.g., Score_1 produced by static analysis logic 810) or may be utilized in a different manner to influence the overall score used to identify whether the suspect object is malicious or not. The score determination logic 860 generates the overall score 865 to an object classifier 870 that identifies to reporting logic 880 within electronic device 800 if the suspect object appears to be benign, non-APT malware or APT malware.
[0120] For instance, when determining that the anomalous behaviors (IOCs) 845 suggest that the suspect object is an APT, the run-time classifier 850 may output a first score value. Depending on the weight assigned to scores provided by the run-time classifier 850 (as compared to other scores produced by analysis of the anomalous behaviors received from behavior monitoring logic 840 by score determination logic 860 and Score_1 provided by static analysis logic 810), the output first score value may significantly (and perhaps definitely) cause the overall score produced by score determination logic 860 to represent that the suspect object as malicious. Similarly, when determining that the IOCs suggest that the suspect object does not belong to any malware or APT family, the run-time classifier 850 may output a second score value less than the first score value. Again, depending on the weight assigned, the second score value may have little or no impact in assisting the score determination logic 860 to classify the suspect object as malicious.
[0121] According to one embodiment, it is contemplated that Score_2 output from the run-time classifier 150 may be based on the particular APT or malware family to which the suspect object belongs, where each classified malware and APT family is assigned as particular score value. Of course, it is contemplated that the score values simply may vary between types of families (APT, malware, etc.).
[0122] Referring now to FIG. 9 , an exemplary block diagram of An illustrative embodiment of the communication system 900 implemented with electronic device 800 of FIG. 8 operating as a threat detection and prevention (TDP) system is shown. Herein, the communication system 900 comprises one or more TDP systems (e.g. TDP systems 9101-9103) coupled to management system 920 through a network 925. Herein, the management system 920 may be adapted to upload information associated with recently uncovered APTs and other malware into the TDP systems 9101-9103, such as newly updated malware family identifiers and APT family identifiers to database 160.
[0123] As shown, the TDP system 9101 is adapted to analyze one or more objects associated with network traffic that may have originated from server device 932 via local network 930 and is now propagating over an enterprise network 934. The TDP system 9101 is shown as being coupled with the local network 930, normally behind a firewall 936, via a network interface 938. The network interface 938 operates as a data capturing device (referred to as a “tap” or “network tap”) that is configured to receive network traffic propagating to/from the client device(s) 310A and provide object(s) from the network traffic to the TDP system 9101.
[0124] In general, the network interface 938 is configured to receive and route one or more objects that are received from or targeted to client device 310A, normally without an appreciable decline in network performance. According to one embodiment of the disclosure, the network interface 938 may simply re-route an object for analysis to the TDP system 9101 or, in another embodiment, duplicate the object and provide the same to the TDP system 9101. For instance, the network interface 938 may duplicate one or more files that are part of a data flow or part of the payload contained within certain data packets, metadata, or the like.
[0125] It is contemplated that, for any embodiments where the TDP system 9101 is implemented as an dedicated appliance or a dedicated computer system, the network interface 938 may include an assembly integrated into the appliance or computer system that includes network ports, network interface card and related logic (not shown) for connecting to the local network 930 to non-disruptively “tap” network traffic by providing at least a portion or a copy of the network traffic to TDP system 9101. In other embodiments, the network interface 938 can be integrated into an intermediary device in the communication path (e.g., firewall, router, switch or other network device) or can be a standalone component.
[0126] Alternatively, the TDP system 9101 may be deployed as an inline security appliance (not shown), which analyzes intercepted objects for malware or other indicators of suspicious content. Upon suspecting a presence of malware in an object under analysis, the suspect object may be forwarded to the dynamic analysis engine 970 for further analysis as described below.
[0127] More specifically, as shown in FIG. 9 , the TDP system 9101 comprises an I/O interface 945, static analysis logic 810, a first database 950 (along with family identifier database 160), a scheduler 960, a storage device 965, a dynamic analysis engine 970, object classifier 870 and reporting logic 880. In some embodiments, the network interface 938 may be contained within the TDP system 9101 and operates as I/O interface 945. Also, the static analysis logic 810, the scheduler 960 and/or the dynamic analysis engine 970 may be software modules, which are executed by one or more processors (or different processors) and are configured to receive and analyze content within one or more received objects. After analysis, the potential APT objects (or TDP-detected features) are output from reporting logic 995 to client device 310A via I/O interface 945 and network interface 938.
[0128] In one embodiment, the static analysis logic 810 may serve as a filter to permit subsequent malware analysis only on a portion of incoming data, which effectively conserves system resources and provides faster response time in determining the presence of malware within the analyzed object(s). As shown in FIG. 9 , the static analysis logic 810 is configured to receive incoming objects from the network interface 938 and applies heuristics to determine if any of the objects is “suspicious”. The heuristics applied by the static analysis logic 810 may be based on signature checks and/or rules stored in the database 955. Some of these rules may include APT-centric rules to uncover objects having certain traits common for APT malware (e.g., one or more unexpected attempts to exfiltrate data, etc.). Also, the static analysis logic 810 may examine the image of the object without executing or opening the object.
[0129] For example, the static analysis logic 810 may examine the metadata or attributes of the object under analysis (e.g., portion of an email message, file, document, a binary image of an executable, etc.) to determine whether a certain portion of the object statistically matches (e.g., a prescribed level of correlation with) a predetermined pattern of attributes that is associated with a malicious attack such as an APT attack. According to one embodiment of the disclosure, the static analysis logic 810 tags certain suspect objects within the network traffic as suspicious and supplies a score (Score_1 815) to score determination logic 860 for use in generating an overall score 865 for signaling to object classifier 870 as to whether the suspect object is malicious or not.
[0130] Thereafter, according to one embodiment of the invention, the static analysis logic 810 may be adapted to transmit the suspect objects to the dynamic analysis engine 970 and perhaps at least a portion of the metadata of the suspect objects to scheduler 960. The portion of the metadata may identify attributes of the runtime environment in which the suspect object should be processed and, on occasion, attributes of the client device(s) 310A to which the suspect object was targeted. Such metadata or attributes are used to identify a configuration of the VM needed for subsequent malware analysis. As an alternative embodiment, the dynamic analysis engine 970 may be adapted to receive one or more messages (e.g., data packets) from the static analysis logic 810 and analyze the message(s) to identify the software profile information associated with the needed VM and obtain such needed information.
[0131] As an illustrative example, a suspicious (suspect) object may constitute an email message that was generated, under control of Windows® 7 Operating System, using a Windows® Outlook 2010, version 1. Upon determining that the email message includes an attachment for example, static analysis logic 810 provides software profile information to the scheduler 960 to identify a particular configuration of VM needed to conduct dynamic analysis of the suspect object and its self-contained elements such as the attachment. According to this illustrative example, the software profile information would include (1) Windows® 7 Operating System (OS); (2) Windows® Outlook 2000, version 1; and perhaps an Adobe® reader if the attachment is a PDF document.
[0132] The static analysis logic 810 supplies the software profile information to the scheduler 960, which determines whether any of the VM disk files within storage device 965 feature a software profile supporting the above-identified configuration of OS and one or more applications or a suitable alternative.
[0133] The dynamic analysis engine 970 is adapted to execute one or more VMs 8351-835N, to simulate the receipt and execution of content associated with an object under analysis within a run-time virtual execution environment 830 as expected by the type of object. Furthermore, the behavior monitoring logic 840 within the dynamic analysis engine 970 may be configured to (i) monitor behaviors of the content being analyzed by one or more VMs 8351, . . . , and/or 835N, (ii) detect anomalous behaviors 845 associated with the monitored behaviors, and (iii) provide these anomalous behaviors 845 to both score determination logic 860 and run-time classifier 850. The run-time classifier 850 determines, through analysis of the anomalous behaviors (IOCs) and family identifiers (Common IOCs) as to whether there is a statistical match. If so, a score associated with the matched family identifier (Score_2 855) is provided to score determination logic 860.
[0134] Thereafter, based in part on Score_1 815, Score_2 855, and the results produced from analysis of the anomalous behaviors 845, the score determination logic 860 route the results (e.g., overall score 865, information associated with the detected anomalous behaviors, and other information associated with the detected malicious activity by the suspect object) to the object classifier 870.
[0135] According to one embodiment of the disclosure, the score determination logic 860 comprises one or more software modules that are used to determine a probability (or level of confidence) that the suspect object is malware. Score determination logic 860 is configured to generate the overall score 865 that classifies the threat of the possible malware. Of course, the overall score 865 may be based on a combination of different analysis results.
[0136] For instance, according to one embodiment, the overall score 865 may be an aggregation of a score independently generated by the score determination logic 860 along with Score_1 815 and Score_2 855. Alternatively, the overall score 865 may be an aggregation of these scores, with Score_2 855 being weighted more than Score_1 815. As another alternative, the overall score 865 may be weighted heavily on Score_2 855. In yet another embodiment, the overall score 865 may be based on a weighing primarily relying on the score produced by the score determination logic 860 separate and apart from Score_1 815 and Score_2 845, which may be used to assist in the analysis when the score produced by the score determination logic 860 is borderline as to whether the suspect object is malicious or not.
[0137] Referring to FIG. 10 , an illustrative embodiment of a method for identifying malicious objects supplemented by use of a run-time classifier is shown. Herein, an object is received from a source such as a client device, a TDP system or the like (operation 1000). Upon receipt, the object undergoes static analysis to determine whether the object should undergo further in-depth analysis (e.g., virtual processing within a virtual execution environment) to better determine whether the suspect object is malicious (operation 1010). A first score indicative of a perceived threat level of the suspect object is generated and provided to a score determination logic.
[0138] If additional analysis is needed, the suspect object undergoes virtual processing to uncover anomalous behaviors associated with the suspect object in a sandboxed environment (operation 1020). Thereafter, a run-time analysis is conducted based on these anomalous behaviors (IOCs) and the family identifiers (Common IOCs), which represent known malware families (operation 1030). For instance, the run-time classifier may perform a statistical comparison between IOCs and Common IOCs).
[0139] Based on the analysis, a second score is output (operation 1040). Where the run-time classification determines that the suspect malware belongs to a classified (APT or non-APT) malware family, at least the name of the particular malware (APT or non-APT) family may be provided along with the second score.
[0140] Based on the uncovered anomalous behaviors, and taking in account at least the second score and perhaps the first score (along with any weighting applied to either of these scores), a determination is made as to whether the suspect object is malware (operations 1050). If so, the suspect object is identified as malware, and where the suspect object belongs to a known malware family, the name of the malware family (and other information associated with the identified malware family) may be provided (operations 1060-1070). Otherwise, the suspect object is identified as “benign” and the findings are reported.
[0141] Of course, it is contemplated that additional embodiments of the invention may be deployed. As a first example, logic components or the method of operation may be configured to determine whether the suspect object is malicious and also determine the type of malware (e.g. collective functionality of FIGS. 2 and 8 ). For instance, besides determining that the suspect object is malicious through an overall score as illustrated in FIG. 8 , the run-time classifier may further assist the electronic device in determining (and subsequent reporting) whether the suspect object is an APT or a member of an APT family and the particulars of this determination. Other examples may include an embodiment of a first analysis may be conducted as to whether the suspect object includes any malware type (both APT and non-APT) and a subsequent, second analysis may be conducted to determine whether the malware is of a particular type (e.g. APT), or an embodiment where the malware family and APT family determination is conducted in a single operation in lieu of a series of operations, similar to the illustrative embodiment of FIG. 2 .
[0142] 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 computerized method for identifying and classifying an object as belonging to a malware family, comprising:
receiving one or more anomalous behaviors after processing of the object; and
determining if the object is malware by performing a first analysis on the one or more anomalous behaviors and a pre-stored identifier identifying the malware family, the pre-stored identifier is a collection of data associated with anomalous behaviors that identify the malware family, the performing of the first analysis comprises determining a level of correlation between the one or more anomalous behaviors and the anomalous behaviors associated with the pre-stored identifier that are determined by (i) obtaining a plurality of anomalous behaviors, and (ii) removing one or more anomalous behaviors from the plurality of anomalous behaviors when the one or more anomalous behaviors exhibit (a) a first rate of occurrence in the malware family that is less than a first threshold and (b) a second rate of occurrence in one or more malware families other than the malware family that is greater than a second threshold to produce a subset of the plurality of anomalous behaviors that constitute the anomalous behaviors associated with the pre-stored identifier.
2. The computerized method of claim 1, wherein the malware family is an advanced persistent threat (APT) family.
3. The computerized method of claim 2, wherein the performing of the first analysis comprises performing a statistical comparison between the one or more anomalous behaviors and the anomalous behaviors associated with the pre-stored identifier that uniquely identify the APT family.
4. The computerized method of claim 3, wherein the performing of the first analysis further comprises determining that the one or more anomalous behaviors statistically match the anomalous behaviors associated with the pre-stored identifier that uniquely identify the APT family.
5. The computerized method of claim 1, wherein the removing of the one or more anomalous behaviors from the plurality of anomalous behaviors that exhibit the first rate of occurrence in the malware family comprises filtering at least one anomalous behavior having a count value less than a first count threshold from the plurality of anomalous behaviors to produce a first subset of anomalous behaviors, and the removing of the one or more anomalous behaviors from the plurality of anomalous behaviors that exhibit the second rate of occurrence in malware families other than the malware family comprises filtering at least one anomalous behavior having a count value greater than a second count value for a malware family other than the malware family from the first subset of anomalous behaviors to produce the subset of the plurality of anomalous behaviors, the subset of the plurality of anomalous behaviors being the pre-stored identifier.
6. The computerized method of claim 1, wherein the anomalous behaviors associated with the pre-stored identifier being a filtered subset of the plurality of anomalous behaviors associated with malware belonging to the malware family, the plurality of anomalous behaviors including the anomalous behaviors and at least one additional anomalous behavior different from any of the anomalous behaviors.
7. The computerized method of claim 1 further comprising performing a second analysis of the one or more anomalous behaviors subsequent to the first analysis upon failing to detect the level of correlation that includes conducting a statistical match after comparison of the one or more anomalous behaviors to any of a plurality of pre-stored identifiers each representing a different malware family, the plurality of pre-stored identifiers including the first pre-stored identifier.
8. The computerized method of claim 7, wherein the second analysis is conducted to determine if the object is a member of an advanced persistent threat (APT) family.
9. The computerized method of claim 8 further comprising:
reporting results of the second analysis to a targeted destination, the results including information identifying one or more of an identifier for the APT family, a name of the APT family, or the one or more anomalous behaviors of the second analysis characteristic of the APT family.
10. The computerized method of claim 1, wherein the object is a flow comprising a plurality of related packets that are either received, transmitted, or exchanged during a communication session.
11. The computerized method of claim 1 further comprising:
reporting results of the first analysis to a targeted destination, the results including information identifying one or more of (i) a family name of the malware family, (ii) the object, or (iii) the subset of the plurality of anomalous behaviors.
12. The computerized method of claim 11, wherein each of the subset of the plurality of anomalous behaviors is an indicator of compromise.
13. The computerized method of claim 1, wherein the pre-stored identifier includes a first plurality of indicators of compromise (IOCs) that are filtered from a second plurality of IOCs, where the first plurality of IOCs having a frequency of occurrence within the malware family substantially greater than an occurrence of any of the second plurality of IOCs excluding the first plurality of IOCs within the malware family.
14. The computerized method of claim 13, wherein the first plurality of IOCs are a combination unique to the malware family.
15. The computerized method of claim 1, wherein the first analysis on the one or more anomalous behaviors is conducted during run-time being a time that is contemporaneous with the processing of the object by one or more virtual machines and monitoring of the one or more anomalous behaviors.
16. An electronic device, comprising:
a processor; and
a memory communicatively coupled to the processor, the memory comprises
virtual execution logic including at least one virtual machine configured to process content within an object under analysis and monitor for anomalous behaviors during the processing that are indicative of malware, and
run-time classifier logic that, when executed by the processor, performs a first analysis on the monitored anomalous behaviors and a pre-stored identifier to determine if the monitored anomalous behaviors indicate that the object is malware belonging to a classified malware family, the first analysis includes determining a level of correlation between the monitored anomalous behaviors and one or more anomalous behaviors associated with the pre-stored identifier that uniquely identify the classified malware family, the one or more anomalous behaviors being selected by (i) obtaining a first plurality of anomalous behaviors associated with malware belonging to the malware family, (ii) filtering at least one anomalous behavior having a count value less than a first count threshold from the first plurality of anomalous behaviors to produce a first subset of anomalous behaviors, (iii) filtering at least one anomalous behavior having a count value greater than a second count value for a malware family other than the malware family from the first subset of anomalous behaviors to produce a second subset of anomalous behaviors, the second subset of anomalous behaviors being the one or more anomalous behaviors associated with the pre-stored identifier.
17. The electronic device of claim 16, wherein the malware family is an advanced persistent threat (APT) family.
18. The electronic device of claim 17, wherein the first analysis performed by the run-time classifier logic comprises performing a statistical comparison between the monitored anomalous-behaviors and the anomalous behaviors associated with the pre-stored identifier that uniquely identify the APT family.
19. The electronic device of claim 16, wherein the first analysis performed by the run-time classifier logic comprises performing a statistical comparison between the monitored anomalous behaviors and the anomalous behaviors associated with the pre-stored identifier, the anomalous behaviors being a filtered subset of a plurality of anomalous behaviors associated with malware belonging to the malware family, the plurality of anomalous behaviors including the anomalous behaviors and at least one additional anomalous behavior different from any of the anomalous behaviors.
20. The electronic device of claim 16, wherein the determining of the level of correlation between the monitored anomalous behaviors and the one or more anomalous behaviors associated with the pre-stored identifier comprises performing a statistical comparison between the anomalous monitored behaviors and the one or more anomalous behaviors associated with the pre-stored identifier.
21. The electronic device of claim 16, wherein the memory further comprises a classifier that performs a second analysis of the monitored anomalous behaviors upon the run-time classifier failing to detect a statistical match upon comparing the monitored anomalous behaviors to any anomalous behaviors of a plurality of pre-stored identifiers each representing a different malware family, the plurality of pre-stored identifiers including the first pre-stored identifier.
22. The electronic device of claim 21, wherein the classifier conducts the second analysis by comparing the monitored anomalous behaviors operating as indicators of compromise to one or more anomalous behaviors associated with previously classified malware families.
23. The electronic device of claim 16, wherein the memory further comprises:
reporting logic that, when executed by the processor, is configured to send results of the first analysis to a targeted destination, the results including information identifying one or more of (i) a family name of the malware family, (ii) the object, or (iii) the subset of the plurality of anomalous behaviors.
24. The electronic device of claim 23, wherein each of the subset of the plurality of anomalous behaviors is an indicator of compromise.
25. The electronic device of claim 16, wherein the memory further comprises:
reporting logic that, when executed by the processor, is configured to send results of the second analysis to a targeted destination, the results including information identifying one or more of an identifier for an advanced persistent threat (APT) family, a name of the APT family, or the one or more anomalous behaviors of the second analysis characteristic of the APT family.
26. The electronic device of claim 16, wherein the first analysis on the monitored anomalous behaviors is conducted during run-time being a time that is contemporaneous with processing of the content within the object under analysis by the at least one virtual machine.
27. An electronic device, comprising:
run-time classifier logic configured to perform a first analysis on (i) anomalous behaviors detected during processing of an object suspected of being malware and (ii) at least one pre-stored identifier being a collection of data associated with anomalous behaviors that uniquely identify a malware family, the first analysis to (1) determine if the anomalous behaviors indicate that the object is malware belonging to the malware family and (2) generate a score that represents a level of probability of the object being malware; and
score determination logic that is configured to use the score in determining whether the suspect object is to be classified as malware or not,
wherein the anomalous behaviors of the at least one pre-stored identifier are selected by (i) obtaining a plurality of anomalous behaviors associated with malware belonging to the malware family, (ii) filtering at least one anomalous behavior from the plurality of anomalous behaviors when the at least one anomalous behavior has a count value less than a first count threshold to produce a first subset of anomalous behaviors, (iii) filtering at least one anomalous behavior from the first subset of anomalous behaviors when the at least one anomalous behavior has a count value greater than a second count value for a malware family other than the malware family to produce a second subset of anomalous behaviors, the second subset of anomalous behaviors being the anomalous behaviors associated with the at least one pre-stored identifier.
28. The electronic device of claim 27 further comprising:
virtual execution logic including at least one virtual machine configured to process content within the object and monitors for the anomalous behaviors during processing of the object that are indicative of malware.
29. The electronic device of claim 28 further comprising:
a static analysis engine adapted to (i) filter a first subset of objects having characteristics that are indicative of malware from a plurality of incoming objects and (ii) output the first subset of objects including the object to the virtual execution logic.
30. The electronic device of claim 27 further comprising:
reporting logic configured to send results of the first analysis to a targeted destination, the results including information identifying one or more of (i) a family name of the malware family, (ii) the object, or (iii) the second subset of the plurality of anomalous behaviors.
31. The electronic device of claim 30, wherein each of the second subset of the plurality of anomalous behaviors is an indicator of compromise.
32. The electronic device of claim 27, wherein the first analysis on the anomalous behaviors is contemporaneous with the processing of the object by one or more virtual machines and monitoring of behaviors of the object during the processing of the object.
Patent Citations (515)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4292580(A) | 1981-09-01 | Ott et al. | Applicant |
| US5175732(A) | 1992-12-01 | Hendel et al. | Applicant |
| US5440723(A) | 1995-08-01 | Arnold et al. | Applicant |
| US5490249(A) | 1996-02-01 | Miller | Applicant |
| US5657473(A) | 1997-08-01 | Killean et al. | Applicant |
| US5842002(A) | 1998-11-01 | Schnurer et al. | Applicant |
| US5978917(A) | 1999-11-01 | Chi | Applicant |
| US6088803(A) | 2000-07-01 | Tso et al. | Applicant |
| US6094677(A) | 2000-07-01 | Capek et al. | Applicant |
| US6108799(A) | 2000-08-01 | Boulay et al. | Applicant |
| US6118382(A) | 2000-09-01 | Hibbs et al. | Applicant |
| US6269330(B1) | 2001-07-01 | Cidon et al. | Applicant |
| US6272641(B1) | 2001-08-01 | Ji | Applicant |
| US6279113(B1) | 2001-08-01 | Vaidya | Applicant |
| US6298445(B1) | 2001-10-01 | Shostack | 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 | Ben Nun et al. | Applicant |
| US6832367(B1) | 2004-12-01 | Choi et al. | Applicant |
| US6895550(B2) | 2005-05-01 | Kanchirayappa et al. | Applicant |
| US6898632(B2) | 2005-05-01 | Gordy et al. | Applicant |
| US6907396(B1) | 2005-06-01 | Muttik et al. | Applicant |
| US6941348(B2) | 2005-09-01 | Petry et al. | Applicant |
| US6971097(B1) | 2005-11-01 | Wallman | Applicant |
| US6981279(B1) | 2005-12-01 | Arnold et al. | Applicant |
| US6995665(B2) | 2006-02-01 | Appelt et al. | Applicant |
| US7007107(B1) | 2006-02-01 | Ivchenko et al. | Applicant |
| US7028179(B2) | 2006-04-01 | Anderson et al. | Applicant |
| US7043757(B2) | 2006-05-01 | Hoefelmeyer et al. | Applicant |
| US7069316(B1) | 2006-06-01 | Gryaznov | Applicant |
| US7080407(B1) | 2006-07-01 | Zhao et al. | Applicant |
| US7080408(B1) | 2006-07-01 | Pak et al. | Applicant |
| US7093002(B2) | 2006-08-01 | Wolff et al. | Applicant |
| US7093239(B1) | 2006-08-01 | van der Made | Applicant |
| US7096498(B2) | 2006-08-01 | Judge | Applicant |
| US7100201(B2) | 2006-08-01 | Izatt | Applicant |
| US7107617(B2) | 2006-09-01 | Hursey et al. | Applicant |
| 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 |
| US7386888(B2) | 2008-06-01 | Liang et al. | Applicant |
| US7392542(B2) | 2008-06-01 | Bucher | Applicant |
| US7418729(B2) | 2008-08-01 | Szor | Applicant |
| US7428300(B1) | 2008-09-01 | Drew et al. | Applicant |
| US7441272(B2) | 2008-10-01 | Durham et al. | Applicant |
| US7448084(B1) | 2008-11-01 | Apap et al. | Applicant |
| US7458098(B2) | 2008-11-01 | Judge et al. | Applicant |
| US7464404(B2) | 2008-12-01 | Carpenter et al. | Applicant |
| US7464407(B2) | 2008-12-01 | Nakae et al. | Applicant |
| US7467408(B1) | 2008-12-01 | O'Toole, Jr. | 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 |
| 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 | Benett | Applicant |
| US7949849(B2) | 2011-05-01 | Lowe et al. | Applicant |
| US7996556(B2) | 2011-08-01 | Raghavan et al. | Applicant |
| US7996836(B1) | 2011-08-01 | McCorkendale et al. | Applicant |
| US7996904(B1) | 2011-08-01 | Chiueh et al. | Applicant |
| US7996905(B2) | 2011-08-01 | Arnold et al. | Applicant |
| US8006305(B2) | 2011-08-01 | Aziz | Applicant |
| US8010667(B2) | 2011-08-01 | Zhang et al. | Applicant |
| US8020206(B2) | 2011-09-01 | Hubbard et al. | Applicant |
| US8028338(B1) | 2011-09-01 | Schneider et al. | Applicant |
| US8042184(B1) | 2011-10-01 | Batenin | Applicant |
| US8045094(B2) | 2011-10-01 | Teragawa | Applicant |
| US8045458(B2) | 2011-10-01 | Alperovitch et al. | Applicant |
| US8069484(B2) | 2011-11-01 | McMillan et al. | Applicant |
| US8087086(B1) | 2011-12-01 | Lai et al. | Applicant |
| US8171553(B2) | 2012-05-01 | Aziz et al. | Applicant |
| US8176049(B2) | 2012-05-01 | Deninger et al. | Applicant |
| US8176480(B1) | 2012-05-01 | Spertus | Applicant |
| US8201246(B1) | 2012-06-01 | Wu et al. | Applicant |
| US8204984(B1) | 2012-06-01 | Aziz et al. | Applicant |
| US8214905(B1) | 2012-07-01 | Doukhvalov et al. | Applicant |
| US8220055(B1) | 2012-07-01 | Kennedy | Applicant |
| US8225288(B2) | 2012-07-01 | Miller et al. | Applicant |
| US8225373(B2) | 2012-07-01 | Kraemer | Applicant |
| US8233882(B2) | 2012-07-01 | Rogel | Applicant |
| US8234640(B1) | 2012-07-01 | Fitzgerald et al. | Applicant |
| US8234709(B2) | 2012-07-01 | Viljoen et al. | Applicant |
| US8239944(B1) | 2012-08-01 | Nachenberg et al. | Applicant |
| US8260914(B1) | 2012-09-01 | Ranjan | Applicant |
| US8266091(B1) | 2012-09-01 | Gubin et al. | Applicant |
| US8286251(B2) | 2012-10-01 | Eker et al. | Applicant |
| US8291499(B2) | 2012-10-01 | Aziz et al. | Applicant |
| US8307435(B1) | 2012-11-01 | Mann et al. | Applicant |
| US8307443(B2) | 2012-11-01 | Wang et al. | Applicant |
| US8312545(B2) | 2012-11-01 | Tuvell et al. | Applicant |
| US8321936(B1) | 2012-11-01 | Green et al. | Applicant |
| US8321941(B2) | 2012-11-01 | Tuvell et al. | Applicant |
| US8332571(B1) | 2012-12-01 | Edwards, Sr. | Applicant |
| US8365286(B2) | 2013-01-01 | Poston | Applicant |
| US8365297(B1) | 2013-01-01 | Parshin et al. | Applicant |
| US8370938(B1) | 2013-02-01 | Daswani et al. | Applicant |
| US8370939(B2) | 2013-02-01 | Zaitsev et al. | Applicant |
| US8375444(B2) | 2013-02-01 | Aziz et al. | Applicant |
| US8381299(B2) | 2013-02-01 | Stolfo et al. | Applicant |
| US8402529(B1) | 2013-03-01 | Green et al. | Applicant |
| US8464340(B2) | 2013-06-01 | Ahn et al. | Applicant |
| US8479174(B2) | 2013-07-01 | Chiriac | Applicant |
| US8479276(B1) | 2013-07-01 | Vaystikh et al. | Applicant |
| US8479291(B1) | 2013-07-01 | Bodke | Applicant |
| US8510827(B1) | 2013-08-01 | Leake et al. | Applicant |
| US8510828(B1) | 2013-08-01 | Guo et al. | Applicant |
| US8510842(B2) | 2013-08-01 | Amit et al. | Applicant |
| US8516478(B1) | 2013-08-01 | Edwards et al. | Applicant |
| US8516590(B1) | 2013-08-01 | Ranadive et al. | Applicant |
| US8516593(B2) | 2013-08-01 | Aziz | Applicant |
| US8522348(B2) | 2013-08-01 | Chen et al. | Applicant |
| US8528086(B1) | 2013-09-01 | Aziz | Applicant |
| US8533824(B2) | 2013-09-01 | Hutton et al. | Applicant |
| US8539582(B1) | 2013-09-01 | Aziz et al. | Applicant |
| US8549638(B2) | 2013-10-01 | Aziz | Applicant |
| US8555391(B1) | 2013-10-01 | Demir et al. | Applicant |
| US8561177(B1) | 2013-10-01 | Aziz et al. | Applicant |
| US8566946(B1) | 2013-10-01 | Aziz et al. | Applicant |
| US8584094(B2) | 2013-11-01 | Dahdia et al. | Applicant |
| US8584234(B1) | 2013-11-01 | Sobel et al. | Applicant |
| US8584239(B2) | 2013-11-01 | Aziz et al. | Applicant |
| US8595834(B2) | 2013-11-01 | Xie et al. | Applicant |
| US8627476(B1) | 2014-01-01 | Satish et al. | Applicant |
| US8635696(B1) | 2014-01-01 | Aziz | Applicant |
| US8682054(B2) | 2014-03-01 | Xue et al. | Applicant |
| US8682812(B1) | 2014-03-01 | Ranjan | Applicant |
| US8689333(B2) | 2014-04-01 | Aziz | Applicant |
| US8695096(B1) | 2014-04-01 | Zhang | Applicant |
| US8713631(B1) | 2014-04-01 | Pavlyushchik | Applicant |
| US8713681(B2) | 2014-04-01 | Silberman et al. | Applicant |
| US8726392(B1) | 2014-05-01 | McCorkendale et al. | Applicant |
| US8739280(B2) | 2014-05-01 | Chess et al. | Applicant |
| US8776229(B1) | 2014-07-01 | Aziz | Applicant |
| US8782792(B1) | 2014-07-01 | Bodke | Applicant |
| US8789172(B2) | 2014-07-01 | Stolfo et al. | Applicant |
| US8789178(B2) | 2014-07-01 | Kejriwal et al. | Applicant |
| 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 |
| US2001/0005889(A1) | 2001-06-01 | Albrecht | Applicant |
| US2001/0047326(A1) | 2001-11-01 | Broadbent et al. | Applicant |
| US2002/0018903(A1) | 2002-02-01 | Kokubo et al. | Applicant |
| US2002/0038430(A1) | 2002-03-01 | Edwards et al. | Applicant |
| US2002/0091819(A1) | 2002-07-01 | Melchione et al. | Applicant |
| US2002/0095607(A1) | 2002-07-01 | Lin-Hendel | Applicant |
| US2002/0116627(A1) | 2002-08-01 | Tarbotton et al. | Applicant |
| US2002/0144156(A1) | 2002-10-01 | Copeland | Applicant |
| US2002/0162015(A1) | 2002-10-01 | Tang | Applicant |
| US2002/0166063(A1) | 2002-11-01 | Lachman et al. | Applicant |
| US2002/0169952(A1) | 2002-11-01 | DiSanto et al. | Applicant |
| US2002/0184528(A1) | 2002-12-01 | Shevenell et al. | Applicant |
| US2002/0188887(A1) | 2002-12-01 | Largman et al. | Applicant |
| US2002/0194490(A1) | 2002-12-01 | Halperin et al. | Applicant |
| US2003/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/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/0181227(A1) | 2008-07-01 | Todd | 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/0089879(A1) | 2009-04-01 | Wang et al. | Applicant |
| US2009/0094697(A1) | 2009-04-01 | Provos et al. | Applicant |
| US2009/0113425(A1) | 2009-04-01 | Ports et al. | Applicant |
| US2009/0125976(A1) | 2009-05-01 | Wassermann et al. | Applicant |
| US2009/0126015(A1) | 2009-05-01 | Monastyrsky et al. | Applicant |
| US2009/0126016(A1) | 2009-05-01 | Sobko et al. | Applicant |
| US2009/0133125(A1) | 2009-05-01 | Choi et al. | Applicant |
| US2009/0144823(A1) | 2009-06-01 | Lamastra et al. | Applicant |
| US2009/0158430(A1) | 2009-06-01 | Borders | Applicant |
| US2009/0172815(A1) | 2009-07-01 | Gu et al. | Applicant |
| US2009/0187992(A1) | 2009-07-01 | Poston | Applicant |
| US2009/0193293(A1) | 2009-07-01 | Stolfo et al. | Applicant |
| US2009/0199296(A1) | 2009-08-01 | Xie et al. | Applicant |
| US2009/0228233(A1) | 2009-09-01 | Anderson et al. | Applicant |
| US2009/0241187(A1) | 2009-09-01 | Troyansky | Applicant |
| US2009/0241190(A1) | 2009-09-01 | Todd et al. | Applicant |
| US2009/0265692(A1) | 2009-10-01 | Godefroid et al. | Applicant |
| US2009/0271867(A1) | 2009-10-01 | Zhang | Applicant |
| US2009/0300415(A1) | 2009-12-01 | Zhang et al. | Applicant |
| US2009/0300761(A1) | 2009-12-01 | Park et al. | Applicant |
| US2009/0328185(A1) | 2009-12-01 | Berg et al. | Applicant |
| US2009/0328221(A1) | 2009-12-01 | Blumfield et al. | Applicant |
| US2010/0005146(A1) | 2010-01-01 | Drako et al. | Applicant |
| US2010/0011205(A1) | 2010-01-01 | McKenna | Applicant |
| US2010/0017546(A1) | 2010-01-01 | Poo et al. | Applicant |
| US2010/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/0220863(A1) | 2010-09-01 | Dupaquis et al. | Applicant |
| US2010/0235831(A1) | 2010-09-01 | Dittmer | Applicant |
| US2010/0251104(A1) | 2010-09-01 | Massand | Applicant |
| US2010/0281102(A1) | 2010-11-01 | Chinta et al. | Applicant |
| US2010/0281541(A1) | 2010-11-01 | Stolfo et al. | Applicant |
| US2010/0281542(A1) | 2010-11-01 | Stolfo et al. | Applicant |
| US2010/0287260(A1) | 2010-11-01 | Peterson et al. | Applicant |
| US2010/0299754(A1) | 2010-11-01 | Amit et al. | Applicant |
| US2010/0306173(A1) | 2010-12-01 | Frank | Applicant |
| US2011/0004737(A1) | 2011-01-01 | Greenebaum | Applicant |
| US2011/0025504(A1) | 2011-02-01 | Lyon et al. | Applicant |
| US2011/0041179(A1) | 2011-02-01 | 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/0219449(A1) | 2011-09-01 | St. Neitzel et al. | Applicant |
| US2011/0219450(A1) | 2011-09-01 | McDougal et al. | Applicant |
| US2011/0225624(A1) | 2011-09-01 | Sawhney et al. | Applicant |
| US2011/0225655(A1) | 2011-09-01 | Niemela et al. | Applicant |
| US2011/0247072(A1) | 2011-10-01 | Staniford et al. | Applicant |
| US2011/0265182(A1) | 2011-10-01 | Peinado et al. | Applicant |
| US2011/0289582(A1) | 2011-11-01 | Kejriwal et al. | Applicant |
| US2011/0302587(A1) | 2011-12-01 | Nishikawa et al. | Applicant |
| US2011/0307954(A1) | 2011-12-01 | Melnik et al. | Applicant |
| US2011/0307955(A1) | 2011-12-01 | Kaplan et al. | Applicant |
| US2011/0307956(A1) | 2011-12-01 | Yermakov et al. | Applicant |
| US2011/0314546(A1) | 2011-12-01 | Aziz et al. | Applicant |
| US2012/0023593(A1) | 2012-01-01 | Puder et al. | Applicant |
| US2012/0054869(A1) | 2012-03-01 | Yen et al. | Applicant |
| US2012/0066698(A1) | 2012-03-01 | Yanoo | Applicant |
| US2012/0079596(A1) | 2012-03-01 | Thomas et al. | Applicant |
| US2012/0084859(A1) | 2012-04-01 | Radinsky et al. | Applicant |
| US2012/0110667(A1) | 2012-05-01 | Zubrilin et al. | Applicant |
| US2012/0117652(A1) | 2012-05-01 | Manni et al. | Applicant |
| US2012/0121154(A1) | 2012-05-01 | Xue et al. | Applicant |
| US2012/0124426(A1) | 2012-05-01 | Maybee et al. | Applicant |
| US2012/0174186(A1) | 2012-07-01 | Aziz et al. | Applicant |
| US2012/0174196(A1) | 2012-07-01 | Bhogavilli et al. | Applicant |
| US2012/0174218(A1) | 2012-07-01 | McCoy et al. | Applicant |
| US2012/0198279(A1) | 2012-08-01 | Schroeder | Applicant |
| US2012/0210423(A1) | 2012-08-01 | Friedrichs et al. | Applicant |
| US2012/0222121(A1) | 2012-08-01 | Staniford et al. | Applicant |
| US2012/0255015(A1) | 2012-10-01 | Sahita et al. | Applicant |
| US2012/0255017(A1) | 2012-10-01 | Sallam | Applicant |
| US2012/0260342(A1) | 2012-10-01 | Dube et al. | Applicant |
| US2012/0266244(A1) | 2012-10-01 | Green et al. | Applicant |
| US2012/0278886(A1) | 2012-11-01 | Luna | Applicant |
| US2012/0297489(A1) | 2012-11-01 | Dequevy | Applicant |
| US2012/0330801(A1) | 2012-12-01 | McDougal et al. | Applicant |
| US2013/0014259(A1) | 2013-01-01 | Gribble et al. | Applicant |
| US2013/0036472(A1) | 2013-02-01 | Aziz | Applicant |
| US2013/0047257(A1) | 2013-02-01 | Aziz | Applicant |
| US2013/0074185(A1) | 2013-03-01 | McDougal et al. | Applicant |
| US2013/0086684(A1) | 2013-04-01 | Mohler | Applicant |
| US2013/0097699(A1) | 2013-04-01 | Balupari et al. | Applicant |
| US2013/0097706(A1) | 2013-04-01 | Titonis et al. | Applicant |
| US2013/0111587(A1) | 2013-05-01 | Goel et al. | Applicant |
| US2013/0117852(A1) | 2013-05-01 | Stute | Applicant |
| US2013/0117855(A1) | 2013-05-01 | Kim et al. | Applicant |
| US2013/0139264(A1) | 2013-05-01 | Brinkley et al. | Applicant |
| US2013/0160125(A1) | 2013-06-01 | Likhachev et al. | Applicant |
| US2013/0160127(A1) | 2013-06-01 | Jeong et al. | Applicant |
| US2013/0160130(A1) | 2013-06-01 | Mendelev et al. | Applicant |
| US2013/0160131(A1) | 2013-06-01 | Madou et al. | Applicant |
| US2013/0167236(A1) | 2013-06-01 | Sick | Applicant |
| US2013/0174214(A1) | 2013-07-01 | Duncan | Applicant |
| US2013/0185789(A1) | 2013-07-01 | Hagiwara et al. | Applicant |
| US2013/0185795(A1) | 2013-07-01 | Winn et al. | Applicant |
| US2013/0185798(A1) | 2013-07-01 | Saunders et al. | Applicant |
| US2013/0191915(A1) | 2013-07-01 | Antonakakis et al. | Applicant |
| US2013/0196649(A1) | 2013-08-01 | Paddon et al. | Applicant |
| US2013/0227691(A1) | 2013-08-01 | Aziz et al. | Applicant |
| US2013/0246370(A1) | 2013-09-01 | Bartram et al. | Applicant |
| US2013/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/0130158(A1) | 2014-05-01 | Wang et al. | Applicant |
| US2014/0137180(A1) | 2014-05-01 | Lukacs et al. | Applicant |
| US2014/0169762(A1) | 2014-06-01 | Ryu | Applicant |
| US2014/0179360(A1) | 2014-06-01 | Jackson et al. | Applicant |
| US2014/0328204(A1) | 2014-11-01 | Klotsche et al. | Applicant |
| US2014/0337836(A1) | 2014-11-01 | Ismael | Applicant |
| US2014/0351935(A1) | 2014-11-01 | Shao et al. | Applicant |
| US2015/0096025(A1) | 2015-04-01 | Ismael | 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 | |
| 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 (75)
- 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
- Cisco “Intrusion Prevention for the Cisco ASA 5500-x Series” Data Sheet (2012).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
- 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
- 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
- IEEE Xplore Digital Library Sear Results for “detection of unknown computer worms”. Http//ieeexplore.ieee.org/searchresult.jsp?SortField=Score&SortOrder=desc&ResultC . . . , (Accessed on Aug. 28, 2009).Applicant
- 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
- 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/xpl/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
- Goel, et al., Reconstructing System State for Intrusion Analysis, Apr. 2008 SIGOPS Operating Systems Review, vol. 42 Issue 3, pp. 21-28.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.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
- Thomas H. Ptacek, and Timothy N. Newsham, “Insertion, Evasion, and Denial of Service: Eluding Network Intrusion Detection”, Secure Networks, (“Ptacek”), (Jan. 1998).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