Enhanced malware detection for generated objects

Information

  • Patent Grant
  • 10581879
  • Patent Number
    10,581,879
  • Date Filed
    Monday, June 19, 2017
    8 years ago
  • Date Issued
    Tuesday, March 3, 2020
    5 years ago
Abstract
A computerized method to identify malicious code generated by seemingly benign objects is described. The generated malware detection system described identifies generated objects (code) and analyzes each generated object to collect features which may be associated with maliciousness. The analysis may determine if an Abstract Syntax Tree (AST) representation of the generated object is correlated with known malware ASTs. Correlation of the features identified during processing of the generated objects, including the sequences of generated object, may be used in classifying the object as malicious. The malware detection system may communicate with the one or more endpoint devices to influence detection and reporting of behaviors and malware by those device(s).
Description
FIELD

Embodiments of the invention relate generally to cyber security and more particularly to enhancing detection of malware.


BACKGROUND

Computer security and the prevention of cyber-attacks has become an important service for enterprises. Cyber-attacks may employ malicious software, delivered via a public network connection, to exploit a target computer or an enterprise network and execute malicious activity on the target. The malware may be designed by the malware author to evade detection.


Conventional network-based malware detection systems may monitor and analyze network content received, via a network connection, to determine if the content should be deemed malware. These conventional systems may use malicious signature databases to match content with known malware as well as static analysis engines and dynamic analysis engines to determine if the network content is malicious. A static analysis engine may scan the received network content and determine if characteristics of the content may be correlated with those of malware. Similarly, the dynamic analysis engine may process (e.g. execute) the network content in a virtualized computing engine, which may mimic one or more devices on the monitored network to identify malicious behaviors observed during processing which may be correlated with those of malware. Some systems may combine the correlations of a number of engines to classify the analyzed network content as malicious.


These conventional analysis techniques may also generate false negatives when the network content, delivered through the monitored network connection is configured to cloak malicious activities. It is desirable to provide enhanced detection techniques to avoid false negatives.





BRIEF DESCRIPTION OF THE DRAWINGS

Embodiments of this disclosure 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:



FIG. 1 is an exemplary block diagram of an architecture comprising a malware detection system and a generated malware detection system, including one or more virtual machine(s) coupled to an event database and logic, AST generator, a correlation engine, a classification engine, and a reporting engine;



FIG. 2 is a flowchart illustrating an exemplary method for detecting and reporting if objects generated while processing an object in a virtual machine of the generated malware detection system of FIG. 1, represents malware;



FIG. 3 is an exemplary embodiment of a logical representation of the generated malware detection system of FIG. 1; and



FIG. 4 is a flowchart illustrating an exemplary recursive generated malware detection method for detecting and reporting if generated objects represent malware, using the generated malware detection system of FIG. 1.





DETAILED DESCRIPTION

A malware detection system (MDS) and method identifies a cyber-security attack by processing an object received by the system and analyzing the features of the received object and any objects generated or spawned in response to processing the original, received object, to assess if the features of any of these objects are associated with those of malware. The generation of additional objects during such processing of the original object (or a previously generated additional object) may in itself be a feature of potential maliciousness, although not dispositive of maliciousness. By determining a generated object is malicious, the malware detection system may, by inference, determine that the original object is malicious and that a cyber-security attack is under way.


Embodiments of the invention perform an analysis relying, at least in part, on a syntax tree representation, such as an Abstract Syntax Tree (AST), generated for each object. An AST is a tree representation of the abstract syntactic structure of human-readable source code. The source code may be a script written in a scripting programming language such as JavaScript® or ActionScript®. Each node of the tree denotes a construct occurring in the source code. The syntax in an AST is “abstract” in not representing every detail appearing in the real syntax. In representing the structure of program code (e.g., script) without its low-level details, the AST facilitates program analysis and comparison of its key features with those of other scripts, including those constituting known malware. The syntax tree representation may take other forms as well, depending on the embodiment, such as a concrete syntax tree (e.g., parse tree), as will be apparent to those of skill in this art, however, the syntax tree will be referred to herein as an AST for convenience. Moreover, the generated objects of interest herein include, without limitation, those that require compiling, such as just-in-time compiling, during runtime, such as objects comprising scripts.


More specifically, each of the original and the one or more associated generated objects, is statically scanned to identify its characteristics, is executed or otherwise processed in a run-time environment established by a virtual machine to capture its runtime behaviors, and its AST is analyzed to identify additional features relevant to a determination of maliciousness based on machine learning and experiential knowledge. The analysis correlates these features of the original and associated generated objects with those of known malware to determine a probability of maliciousness. In some embodiments, the features of the original and associated generated objects may be correlated with the features of known malicious objects on an object-by-object basis (that is, each of the original and associated generated objects correlated separately with those of known malware and benign objects). In some embodiments, the combined features of the original and associated generated objects may be correlated with those of known malware that conducts a cyber-security attack via plural objects (e.g., an original malware kit and one or more “dropped” or generated objects). In some embodiments, the combined feature set is only correlated when the object-by-object analysis results are inconclusive.


The correlation may be performed by a single correlation engine, which determines a probability of maliciousness that, if in excess of a threshold, results in classification of the original object as malicious and generation of an alert of a cyber-security attack. In some embodiments, the correlation engine may operate as two separate units, a first unit dedicated to the correlation of features determined by analysis of the ASTs for all the objects under test with those determined by analysis of ASTs of known malicious and/or benign objects, the second unit correlating the static and behavioral features with those known malicious and/or benign objects, and the then resulting probabilities of both are combined and compared with a threshold. In another embodiment, the correlation engine may operate as two separate units. In this case, a first unit is dedicated to correlation of features of original objects and the second is dedicated to correlation of features of the generated objects, and then the resulting probabilities of both are combined and compared with a threshold.


In some embodiments, the malware detection system and method may identify behaviors of each of the objects (including the generation of additional objects) during processing in a virtual machine (VM), the virtual machine configured with monitoring logic, an operating system, and one or more computer applications. The monitoring logic of the VM may, during processing of an object (either the original object or a generated object), identify when a new or additional object is generated, the generation of the additional object being identified as a behavioral feature associated with the processed object. Then, each of the generated objects is also processed in the VM and its behaviors monitored and captured. This may continue in an iterative process as additional objects are generated. The behaviors detected by the monitoring logic are features associated with the object being processed.


The malware detection system may include AST analysis logic which generates an AST for each original object and associated generated object. In some embodiments, the AST analysis logic correlates the AST features of each of the objects with the AST features of known labelled objects (the previously labelled objects being classified and confirmed as either “malicious” or “benign” based on machine learning and experiential knowledge). In other embodiments the AST analysis logic may perform an analysis separately on the AST features of each generated object, and then perform the analysis on a combined set of AST features for all the original and associated generated objects.


In some embodiments, the MDS may process the original, received object and identify, capture and analyze any associated generated objects. In other embodiments, the MDS may be separate from a generated malware detection system (“GMDS”). In these embodiments, the MDS provides the generated objects its captures during processing to the GMDS, which may be operationally integrated with the MDS, and either locally (but separately) or remotely located, and connected via a communication link or a network to the MDS. The GMDS is responsible for analyzing the generated objects.


I. Terminology

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


The term “process” may include an instance of a computer program (e.g., a collection of instructions, also referred to herein as an application). In one embodiment, the process may be comprised of one or more threads executing concurrently (e.g., each thread may be executing the same or a different instruction concurrently).


The term “processing” may include execution of a binary or script, or launching an application in which an object is processed, wherein launching should be interpreted as placing the application in an open state and, in some implementations, performing simulations of actions typical of human interactions with the application. For example, the application, an internet browsing application, may be processed such that the application is opened and actions such as “visiting” a website, downloading website pages, scrolling the website page, and activating a link from the website are performed.


An “interpreter” is a software component that is configured to interpret and execute objects (e.g. often called bytecode) which is not native to an operating system for the electronic device targeted to receive the object, but features a higher level construct. The interpreter typically translates the higher level code (e.g., command lines from an interpreted JavaScript®, etc.) in the context of a corresponding application. For ease of deployment, when an electronic device is implemented with a particular interpreter, content within a received file is commonly translated from non-native to native code. The bytecode instructions or higher-level language code are typically translated without any consideration that the object may be malicious. Thereafter, after being interpreted (i.e. converted from non-native to native code for execution), the object is processed.


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 categorized or typed for purposes of analysis. During analysis, for example, the object may exhibit a set of expected and/or unexpected characteristics and, during processing, a set of expected and/or unexpected behaviors, which may evidence the presence of malware and potentially allow the object to be categorized or typed as malware. For example, an unexpected behavior of an object may include the generation of additional objects by an object being processed. In one embodiment, an object may include a binary file that may be executed within a virtual machine. Herein, the terms “binary file” and “binary” will be used interchangeably.


The term “feature” may be understood to refer, collectively, to the characteristics of an object that may be detected statically and the behaviors manifested in response to the processing of the object. Characteristics may include information about the object captured without requiring execution or “running” of the object. For example, characteristics may include metadata associated with the object, including, anomalous formatting or structuring of the object. Features may also include behaviors, where behaviors include information about the object and its activities captured during its execution or processing. Behaviors may include, but are not limited to, attempted outbound communications over a network connection or with other processes (e.g. the operating system, etc.), patterns of activity or inactivity, and/or attempts to access system resources.


The term “network device” may be construed as any intelligent electronic device with the capability of connecting to a network. Such a network may be a public network such as the internet or a private network such as a wireless data telecommunication network, wide area network, a type of local area network (LAN), or a combination of networks. Examples of a network device may include, but are not limited or restricted to, a laptop, a mobile phone, a tablet, etc.


The term “malicious” may represent a probability (or level of confidence) that the object is associated with a malicious attack or known vulnerability. For instance, the probability may be based, at least in part, on (i) pattern matches; (ii) analyzed deviations in messaging practices set forth in applicable communication protocols (e.g., HTTP, TCP, etc.) and/or proprietary document specifications (e.g., Adobe PDF document specification); (iii) analyzed compliance with certain message formats established for the protocol (e.g., out-of-order commands); (iv) analyzed header or payload parameters to determine compliance, (v) attempts to communicate with external servers during processing in one or more VMs, (vi) attempts to access, without the appropriate permissions, memory allocated for the application during processing, and/or (vii) other factors (including those noted elsewhere herein) that may evidence unwanted or malicious activity.


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


A. Generated Malware Detection System



FIG. 1 is an exemplary block diagram of an exemplary architecture of a generated malware detection system 100 (GMDS) connected to a monitored network 102. The GMDS 100 comprises at least a dynamic analysis logic 110 and, in some embodiments, may also comprise a static analysis logic 105. In some embodiments the dynamic analysis logic 110 may further comprise at least one or more virtual machine(s) 120, each virtual machine configured with an operating system 121 (OS), one or more applications 122, and monitoring logic 124. Still further embodiments of the GMDS may also comprise a scheduler 130 and profile store 125.


Generally speaking, the generated malware detection system 100 may be implemented as one or more network-connected electronic devices, where each includes physical hardware comprising hardware processor(s), network interface(s), a memory, a system interconnect, an optional user interface as shown in FIG. 3. Accordingly, each of the components of the generated malware detection system 100 shown in FIG. 1 and described below may be implemented as one or more computer programs or modules executable on one or more processors and stored in memory.


The GMDS 100 receives objects for analysis via the communication interface 305 and determines if the received object is suspicious. In some embodiments, the GMDS may analyze the objects using a static analysis logic 105 configured to extract characteristics of the object and determine if the object is suspicious by scanning for known patterns or characteristics and/or representations of machine code identified as correlating with the features of malware. If the static analysis logic determines the object is suspicious (definitively neither “benign” nor “malicious”), the static analysis logic may provide the suspicious object to a scheduler 130 of the dynamic analysis logic 110 for further analysis.


The static analysis logic 105 may comprise an indicator scanner 106 which receives features associated with each object and compares it with unique identifiers. The unique identifiers are each associated with a previously encountered object know to be “benign” or “malicious”. In some embodiments, the indicator scanner 106 may be configured with a whitelist (identifiers determined to be benign) and a blacklist (identifiers determined to be malicious). The indicator scanner 106 may effect a comparison by generating the unique identifier of the object from a hash of its machine code or other characteristics of the object and comparing the hash to the labelled hashes (e.g. of a set of known malicious or benign objects). In some embodiments, if the object is deemed suspicious and/or cannot be determined to be either benign or malicious, the static analysis logic may direct continued processing of the object by the heuristics engine 107 of the static analysis logic 105.


The heuristics engine 107 associates characteristics of the objects, such as formatting or patterns of the content, and uses such characteristics to determine a probability of maliciousness. The heuristics engine 107 applies heuristic rules and/or probability analysis to determine if the objects might contain or constitute malware. Heuristics engine 107 is adapted for analysis of an object to determine whether it satisfies a rule or corresponds to a particular malware pattern. Heuristics rules are distinct from indicators as they are not generated to represent a particular malicious object, but the characteristic properties of an object. The heuristics engine 107 may then assign a probability to the results, often well less than 100%, which indicates whether an object is malicious. The identifiers may represent identified characteristics (features) of the potential malware. The heuristics engine 107 may create an identifier associated with one or more characteristics of the object by generating a hash of the characteristics. The heuristics engine 107 may include a scoring logic to correlate one or more characteristics of potential malware with a score of maliciousness, the score indicating the level of suspiciousness and/or maliciousness of the object. If the heuristics engine 107 determines that the maliciousness score exceeds a suspiciousness threshold but does not exceed a maliciousness threshold, the static analysis logic 105 will identify the object as suspicious and provide the object to the scheduler 130 for further analysis by the dynamic analysis logic 110.


The generated malware detection system 100 includes at least a dynamic analysis logic 110, a correlation engine 170, a classification engine 180, and a reporting logic 190. The dynamic analysis logic 110 includes one or more virtual machine(s) 120, a software profile store 125, a scheduler 130, an event database and logic 150, and an AST generator 160. Each virtual machine containing an operating system 121, one or more applications 122, and a monitoring logic 124 to intercept activities of the one or more applications. In some embodiments the scheduler 130 is configured to receive an object, from the static analysis logic 105, to be scheduled for processing by the one or more virtual machines 120. The object may be provided to the system with metadata indicating the object has been identified by a prior analysis as suspicious. In other embodiments the scheduler 130 may be configured to process received objects based on the available processing resources of the generated malware detection system.


The scheduler 130 is responsible for provisioning and instantiating a virtual machine 120 to execute the object at a schedule time. The scheduler 130 may receive suspicious objects from the malware detection system 105 for analysis in the virtual machine 120. In some embodiments, the scheduler may receive metadata associated with the object to be processed identifying a destination device to the scheduler 130. The scheduler may use network resources to identify a software profile similar to the destination device. The scheduler 130 may then provision one or more virtual machine(s) 120 with a software profile (operating system (OS) 121 and one or more applications 122) retrieved from the software profile store 125 and other components appropriate for execution of the object. A virtual machine is executable software that is configured to mimic the performance of a device (e.g., the destination device).


The scheduler 130 can configure the virtual machine to mimic the performance characteristics of a destination device that are pertinent for behavioral monitoring for malware detection. The virtual machine 120 can be provisioned from the store of software profiles 125. In one example, the scheduler 130 configures the characteristics of the virtual machine to mimic only those features (which include statically detected characteristics and dynamically monitored behaviors) that are affected by an object to be executed (opened, loaded, and/or executed) and analyzed. Such features can include ports that are to receive the network data, select device drivers that are to respond to the network data and any other devices that could be coupled to or contained within a device that can respond to the network data.


The store of software profiles 125 is configured to store virtual machine images. The store of software profiles 125 can be any storage capable of storing software. In one example, the store of software profiles 125 stores a single virtual machine image that can be configured by the scheduler 130 to mimic the performance of any destination device on the network. The store of software profiles 125 can store any number of distinct virtual machine images that can be configured to simulate the performance of any destination devices when processed in one or more virtual machine(s) 120.


The processing of an object may occur within one or more virtual machine(s) 120, which may be provisioned with one or more software profiles. The software profile may be configured in response to configuration information provided by the scheduler 130, information extracted from the metadata associated with the object, and/or a default analysis software profile. Each software profile may include an operating system 121 and/or software applications 122. Each of the one or more virtual machine(s) 120 may be configured with monitoring logic 124, which in an alternative embodiment may configured as an aspect of the software profile. The monitoring logic 124 is configured to observe, capture and report information regarding run-time behavior of an object under analysis during processing within the virtual machine. During run-time, for example, a generated object may contain features undetected by the static analysis logic 105 due to obfuscation (e.g., by compilation, encryption, etc.,), the processing thereby exposing obfuscated features.


The monitoring logic 124 may be embedded as an aspect of the virtual machine 120 and/or integrated into the operation of the one or more applications 122 of the virtual machine. The application 122 may comprise at least one interpreter to process the suspicious object script and/or an object script generated by processing an object by the application. In some embodiments, the monitoring logic 124 intercepts the processing of an application 122 processing an object. The monitoring logic 124 is configured to detect the generation of a new object by the interpreter processing an object within the context of an application 122 in the virtual machine 120.


During processing in the one or more virtual machine(s) 120, monitoring logic 124 of the virtual machine are configured to identify generated objects (i.e. additional objects). The generation of additional objects may be monitored by monitoring signaling that is triggered from calls of an interpreter and/or operations conducted by the interpreter. The interpreter may be an application and/or operate within the context of an application. The signaling from the interpreter may be monitored through intercept points (sometimes referred to as “hooks”) to certain software calls (e.g., Application Programming Interface “API” call, library, procedure, function, or system call). The operations of the interpreter may be monitored through another type of intercept point (herein sometimes referred to as “instrumentation”) in code closely operating with the interpreter or within the interpreter itself to detect a certain type of activity, which may include an activity prompting a particular software call. In some embodiments, the monitoring logic may be embodied as hooks or instrumentation associated with calls to an interpreter's just-in-time (JIT) compiler. By intercepting calls to the compiler of the interpreter, the monitoring logic may detect the generation of new code (i.e., generated object). For example, monitoring logic may intercept calls from an interpreter's compiler when a call is executed to generate new machine code for processing by a processor. The generated object may be provided, by the monitoring logic 124, to the AST generator 160, the event database and logic 150, and/or the correlation engine 170 for further processing. The observed and captured run-time behavior information as well as effects on the virtual machine, otherwise known as features, along with related metadata may be provided to the event database and logic 150 for further processing.


An event database and logic 150 may receive the monitored and detected features from the one or more virtual machine(s) 120. The event database and logic 150 is configured to detect anomalous activity (e.g., unexpected, abnormal, etc.) for reporting to the correlation engine 170. In some embodiments, the event database and logic 150 may be implemented as separate modules, e.g. an event database and an event logic. Herein, the event database and logic is described as a single module with an event database aspect and an event logic aspect. The received features are processed by the event logic aspect of the event database and logic 150 in combination with the data stored in the event database aspect of the event database and logic. The event database aspect of the event database and logic 150 may contain predefined definitions and/or rules that indicate malicious, anomalous or unwanted behaviors. For example, during the processing of a generated object, a user input interface may be created to accept information, e.g., a username and password. The monitoring logic would generate an event in response to the user input interface creation and provide to the event database and logic 150 to associate with the relevant feature, the feature provided for correlation to the correlation engine 170. These predefined definitions and/or rules may be continuously updated via software updates received via the cloud computing services (not shown) and/or via a network administrator. In some embodiments the event database and logic 150 may receive features from the one or more virtual machine(s) 120 when the monitoring logic identifies a generated object in the virtual machine. Similarly, the AST generator 160 receives the generated object when the one or more virtual machine(s) 120 complete an object generation routine.


The AST generator 160 receives each generated object from the one or more virtual machines 120. Subsequently, the AST generator 160 generates an AST from the generated object. Finally, the AST generator 160 may remove superfluous parameters from the AST, which may include, but is not limited or restricted to, removing hardcoded parameters or variables from the AST, determining and removing portions of the AST that are not accessible (e.g., dead code, construed as software code that does not affect the results of running the software code) and/or determining and removing infinite loops within the AST. In one embodiment, the AST generator 160 may comprise a compiler. In a second embodiment, the AST generator 160 may comprise one or more software libraries (e.g., open source libraries) configured to generate an AST.


The correlation engine 170 receives the AST from the AST generator 160 and correlates the AST with one or more entries in a database (not shown). Each entry in the database represents an AST of a labelled sample (e.g. benign, malicious, suspicious, etc.). The result of a correlation of the AST and an entry in the database is a score (e.g., a percentage, a numerical value, a weighted numerical value) that represents how similar the AST is to the AST of the labelled sample represented by the database entry. In one embodiment, each database entry takes the form of a hash value (e.g., a MD5 hash value, a secure hash algorithm (SHA-1) hash value, etc.). In such an embodiment, the correlation logic 170 computes a hash value representing the AST and performs the correlation of hash values. In other embodiments, other representations may be used in place of hash values. Additionally, the correlations between the AST and the entries in the database may involve, for each entire AST or may be of one or more portions of the AST.


In one embodiment, machine learning may be utilized to determine if a generated AST is “similar” to a sample stored in a labelled cluster of stored objects. Upon detection of a “similar” AST, the suspect object may be associated with the cluster and correlated based on the level of similarity with the cluster. For example, the suspect object may be classified as malware, non-malware, or with an unknown status based on the classification of objects within the cluster.


The correlation logic 170 may generate additional correlations based on metadata associated with the received generated object combined with the AST associated with each received generated object. In some embodiments, the metadata associated each of the received generated object may relate to a timestamp indicating when the code was generated. The timestamp may be used by the correlation logic to arrange a sequence of generated objects and the associated ASTs. A correlation with maliciousness may be generated correlating the similarity of generated ASTs with patterns of labelled ASTs. Similarly, a correlation with maliciousness may be generated by correlating sequences of generated ASTs (coupled with the original object) with labelled sequences of ASTs. In other embodiments the sequence of generated object may be identified using an incremental sequence identifier. In some embodiments the metadata may include a timestamp associated with the time when the generated object was processed in the virtual machine, thereby generating a sequence for AST similarity analysis based processing of the generated objects. The similarity analysis, conducted by the correlation engine 170 of ASTs may comprise an algorithm to determine the syntactical distance between AST features of the object and features of labelled objects. An exemplary algorithm that may be used in some embodiments is a variation of the “Levenshtein distance,” modified to determine the distance in number of operations needed to find the syntactical difference between an AST features and the features from a labelled set.


The correlation logic 170 provides information associated with the correlation of the object (and the generated object produced by processing the object) to the classification engine 180. The provided information may include a measure of the similarity of the generated AST with a labelled set of ASTs, the associated likelihood of maliciousness associated with each feature, a likelihood of maliciousness associated with the sequence of objects generated by the processing of the object, and/or the score of the correlation of AST and generated object coupled with the score associated with the object processed. The classification engine 180 is configured to provide the classification information to the reporting engine 190. In some embodiments, the classification engine may provide information to the reporting engine only if the processed object is classified as malicious.


The reporting engine 190 is adapted to receive information from the classifying engine 180 and generate alerts that identify to a network administrator and/or an expert network analyst the likelihood of maliciousness of the processed object. Other additional information regarding the malicious object may optionally be included in the alerts. For example, the targeted applications associated with the malicious object may be included.


B. Generated Malware Detection Methodology


Referring now to FIG. 2, a flowchart, illustrating an exemplary method for monitoring suspicious content being processed using a virtual machine and determining if the suspicious content may be used to execute a malicious attack. Each block illustrated in FIG. 2 represents an operation performed in the method 200 of detecting malicious attacks with the generated malware detection system 100. The method 200 starts at step 205 and proceeds to step 210 wherein the generated malware detection system 100 receives an object for processing. The object received by the system for processing may represent, in some embodiments, network content (or a subset of the traffic) received by the system for processing via the network interface. In some embodiments the object received may represent digital content not received via the network interface as network traffic (e.g. an electronic message, etc.). In some embodiments of the process, the object received by the generated malware detection system may be limited to objects that are identified as suspicious (bearing one or more features of maliciousness, though not determined to exceed a maliciousness classification threshold) by a separate system, such as a malware detection system 105, coordinating with the system described herein.


In step 215, the generated malware detection system launches the object (begins processing the received object) in a virtual machine 120 of the generated malware detection system 100. In one embodiment, the processing of the object includes launching the object within a virtual machine 120, wherein one or more processes (a process represents an instance of an application 122) are initiated and while the object is being processed, the processed object launches an additional process within the virtual machine to execute generated object. The application process may contain a monitoring logic 124, the monitoring logic configured to detect behavioral features of the object during processing. The virtual machine 120 is configured, using the monitoring logic 124 (as described above), to monitor the processing of objects within the virtual machine and determine if additional objects are generated by a process within the virtual machine.


During step 220, the monitoring logic 124 of the virtual machine 120 determines, during processing of an object, if a new object is generated by the process. The generated object may reflect additional code generated by the object in the same process as the object generated in another process. The additional code may be processed in the same application as the generating object, or it may run in a separate application instance. For example, the first object processed by the system may be a JavaScript® object processing in a web browser (e.g. Google® Chrome®) and during processing may generate an additional Silverlight object which is to be processed in another browser (e.g. Microsoft® Internet Explorer®). The generated object (i.e. the Silverlight object) would be identified by the monitoring logic 124 and the new process launched for processing the generated object would be monitored by the monitoring logic. If no additional object is identified by the monitoring logic 124 of the virtual machine 120, the process ends at step 270 without a classification of maliciousness as the first object to be processed did not generate an additional object, where the first object is seemingly benign.


If, in step 220, an additional object is determined to have been generated in response to the processing of the first object, the virtual machine 120 provides the generated object to the event database and logic 150 and the AST generator 160 while continuing to process the object (including instructions to process the generated object). In some embodiments, any additional restrictions to processing the object in the virtual machine are modified to permit further processing of the generated object (e.g. if the object to be processed was allotted two minutes for processing and the generation of objects is identified, the analysis timer may be reset to permit an additional two minutes for processing). The generated object may continue to generate objects recursively. In some embodiments a limit may be set on the total available processing time for subsequent processing of the object. In some embodiments the limit placed on processing a generated object may be limited to the number generated object segments processed, dynamically limited based on the processing needs as determined by the scheduler 130 and/or “factory-set”. If an additional object is not detected to have been generated in step 220, the process continues in step 260 by correlating the identified features (identified during processing of the object by the dynamic analysis logic 110 and optionally the static analysis logic 105) for classification of the object as malicious or benign.


In step 225, the generated object is provided to an abstract syntax tree (AST) generator 160 for processing and construction of a generated AST. The AST generated for each object is analyzed to extract a set of AST features. The AST features of each object may be provided to the correlation engine 170 for correlation with known malware. In alternative embodiments, the AST generator may further comprise an AST feature analysis logic, the logic responsible for correlating the AST features with the AST features of known malware. The correlation with AST features would then be provided to the correlation engine 170 for correlation with other detected features of the object and classified as “malicious”, “benign”, or “suspicious”. In some embodiments the AST generator may also provide the generated object, associated with the AST, to the correlation engine for correlation with maliciousness.


During step 230, the event database and logic 150 receives the generated object from the virtual machine and processes the object using a set of heuristics stored in the event database aspect of the event database and logic. The event logic aspect, of the event database and logic 150, processes the received code using the heuristics stored in the event database to identify relevant features. In some embodiments the heuristics may not be stored as rules but as data stored in the database. The features identified during step 230 may be provided to the correlation engine in step 250. The features provided to the correlation engine may be combined with a score associated with maliciousness of each feature.


In step 235, the generated object created by processing the object may continue to be processed until the generated object is called. The generated object may run in the same process as the calling code or in another process. The monitoring logic of the virtual machine may be configured to monitor the features of the generated object and further determine, in step 240, if the content is generating additional objects. If in step 240, the virtual machine monitoring logic identifies additional objects being generated, the process returns to step 215 (described above) to continue processing the newly generated object. In some embodiments the system may return to step 215 and continue with the analysis in step 250, the system functions operating in parallel. If no additional generated object is identified in step 240, the process continues to step 250.


The process continues in step 250 where the event database and logic 150 provides the features extracted from the generated object to the correlation engine for correlation with known malicious samples. Similarly, in step 255 the AST generator provides the rendered AST (or AST features extracted from the AST of the generated object) for each generated object to the correlation engine for correlation with labelled samples and to determine maliciousness by a classification engine 180.


In step 260 the correlation engine combines and correlates the features received from the event database and logic 150 and the AST generator 160 for correlation. As described above, the correlation engine 170 generates a score associated with the received features and provides the score to the classification engine 180. The correlation engine 170 may correlate the features received with known behaviors and characteristics of benign and malicious objects. The correlation engine 170 may generate a score based on each correlation of an observed feature with known behaviors and characteristics of benign and malicious objects. The classification engine 180 may utilize the scores generated by the classification engine 170 to classify the object as malicious if it exceeds a threshold. The threshold may be fixed or dynamic. The maliciousness threshold used by the classification engine to determine if the object is malicious may be “factory-set,” “user-set,” and/or modified based on the features of the object analyzed.


The process continues in step 265 wherein, the reporting engine 190 receives information from the classification engine 180 and generates alerts issued via the communication interface 305 that identify to an administrator (or an expert network analyst) the likelihood of cyber-attack originating from the object processed by the one or more virtual machine(s) 120. Additional information regarding the malicious object may optionally be included in the alerts. For example, additional reported information may contain, in part, typical behaviors associated with the malware, and/or users that may be targeted. The reporting engine 190 may also provide connected network security systems with updated information regarding malicious attacks and their correlation with particular behaviors. In some embodiments, if the classification engine 180 does not determine the object is malicious the reporting engine 190 may alert a network administrator via an alert, while in alternative embodiments the reporting engine will not issue an alert. Once step 265 is complete, the generated malware detection procedure concludes at step 270.



FIG. 3 is an exemplary embodiment of a logical representation of the generated malware system 100 of FIG. 1. The generated malware detection system 100, in an embodiment may include a housing, which is made entirely or partially of a hardened material (e.g., hardened plastic, metal, glass, composite or any combination thereof) that protect circuitry within the housing, namely one or more processors 310 that are coupled to a communication interface 305 via a first transmission medium 307. The communication interface 305, in combination with a communication logic 320, enables communications with external network devices and/or other network appliances to receive updates for the generated malware detection system 100. According to one embodiment of the disclosure, the communication interface 305 may be implemented as a physical interface including one or more ports for wired connectors. Additionally, or in the alternative, the communication interface 305 may be implemented with one or more radio units for supporting wireless communications with other electronic devices. The communication interface logic 320 may include logic for performing operations of receiving and transmitting one or more objects via the communication interface 305 to enable communication between the generated malware detection system 100 and network devices via the a network (e.g., the internet) and/or cloud computing services.


The processor(s) 310 is further coupled to a persistent storage 315 via a second transmission medium 313. According to one embodiment of the disclosure, the persistent storage 315 may include, an optional static analysis logic 105 comprising an indicator scanner 106 and/or a heuristics engine 107, a dynamic analysis logic comprising one or more virtual machine(s) 120, a scheduler 130, an event database and logic 150, an AST generator 160, and a correlation engine 170, a classifying engine 180, a reporting engine 190, as well as the communication interface logic 320. Of course, when implemented as hardware, one or more of these logic units could be implemented separately from each other.


Referring now to FIG. 4, an exemplary flowchart illustrating the analysis process 400 of the generated malware detection system 100. The analysis process 400 starts with step 405 and proceeds to step 410 where the generated malware detection system 100 receives a suspicious object for processing from a locally or remotely located static analysis logic 105 where the object is determined to be suspicious (i.e. potentially malicious).


The suspicious object is analyzed by processing in the one or more virtual machines 120 of a dynamic analysis logic 110. In some embodiments, the dynamic analysis logic 110 may schedule the suspicious object for analysis using a scheduler 130. In some embodiments, the scheduler 130 may select a software profile (as described above) from a software profile store 125 to be used when processing the suspicious object in each of the one or more virtual machines 120. In step 420, the generated malware detection system 100 processes the suspicious object in what may be a recursive process. The processing of the suspicious object may recursively generate additional objects. The object processed may be either the suspicious, original, object received by the generated malware detection system 100 or a generated object (a new object generated dynamically by processing another object under analysis, for example, recursively). In step 422 the object is processed by the virtual machine 120 and its behavioral effect on the virtual machine is detected as behavioral features in step 424. During the monitoring of the object by the virtual machine 120, the monitoring logic 124 (described above) may intercept calls when the object attempts to generate a new object. During the monitoring of the processing of the object in the virtual machine 120, the monitored behaviors are provided to the event database and logic 150 for analysis. In step 438, the event database and logic 150 processes the received behaviors (each associated with the object or generated object that was being processed when it was monitored) with respect to suspicious patterns or behaviors, thereby extracting the features of the object. The features extracted by the event database and logic 150 in step 438 will be provided to and analyzed by the correlation engine 170 in step 440.


If the generation of a new object is detected by the monitoring logic 124 of the virtual machine 120, in step 426, the application 122 shall continue to step 428 whereby the virtual machine continues the processing (from the interception point identifying the generation of a new object) and generates the new object. The new object that is generated in step 428 is provided is processed by the virtual machine 120 when it is called by a process running in the virtual machine. The newly generated object may be run by the same application 122 as the original, calling object or in a separate application. When the object generated in step 428 is called for processing by the previous object, the recursive process 420 begins anew. The generated object created in step 428 is also provided to the feature extraction process of step 430. More specifically, the generated object created in step 428 is provided to an AST generator 160 and an event database and logic 150 for further processing of the generated object. In step 432, the AST generator 160 receives each generated object created in step 428 and generates an Abstract Syntax Tree (AST) associated with the object. The AST generated in step 432 is analyzed by the correlation engine 170 (as described above) to generate correlations with known malicious AST hallmarks and patterns in step 434. The extracted features of each AST created in step 434 are provided to the correlation engine 170 (as described above, the correlation engine 170 may be operationally combined with a classification engine 180). Similarly, the generated object received by the event database and logic 150 in step 436, is processed and characteristics of the object are extracted. The characteristics may include the object's formatting or patterns within the object.


In step 440 the correlation engine 170 receives the features extracted from the AST generator 160 (i.e. the AST features) and/or the event database and logic 150 (the event database and logic extracts both characteristics of the object and generated objects and behavioral information related to the processing of the processing of each object or generated object). The features, including the meta-information associated with the information (e.g. sequence of processing of each object and generated object, sequence of generated object AST, etc.) may be used by the correlation engine 170 to generate a probability of maliciousness associated with those features. The probability of maliciousness associated with each of the objects processed in the virtual machine 120 in step 440 are provided to the classification engine 180 in step 445 where the classification engine classifies the objects as either benign, suspicious, or malicious, based, at least in part, on their probability of maliciousness. The classification engine 180 may provide the classification to a reporting engine 190, the reporting engine, generating alerts in response to the received classification for a network security analyst. The process generated malware analysis process ends at step 450. In some embodiments, the correlation engine 170 and the classification engine 180 may be integrated into a single module or may operate as two separate modules.


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
  • 1. A system to detect malware generated by an object, the system comprising: a storage device;one or more processors communicatively coupled to the storage device, the one or more processors configured to execute dynamic analysis logic, an Abstract Syntax Tree (AST) generator, a correlation engine, a classification engine and a reporting engine, wherein the dynamic analysis logic, stored in the storage device and configured with a monitoring logic, to process the object and identify features associated with the processing of the object, detect an object generated during the processing of the object, and provide the generated object to the AST generator and the correlation engine;the AST generator, stored in the storage device, being configured to receive the generated object, generate an AST representation of the generated object and remove one or more parameters from the AST representation prior to providing the AST representation to the correlation engine;the correlation engine, stored in the storage device, being configured to (i) receive the features generated during the processing of the object by the dynamic analysis logic and the AST representation and (ii) perform a correlation of at least the AST representation with a labeled set of one or more ASTs associated with known malicious objects, to generate a likelihood of maliciousness;the classification engine, stored in the storage device, being configured to receive from the correlation engine the likelihood of maliciousness associated with the generated object and the AST representation, and classifying the object as malicious in response to the correlation; andthe reporting engine being configured to generate and issue alerts in response to the object being classified as malicious by the classification engine.
  • 2. The system of claim 1, wherein the monitoring logic detects creation of the generated object by identifying the use of a virtual machine resource to generate the generated object.
  • 3. The system of claim 1, wherein the AST generator comprises a compiler.
  • 4. The system of claim 1, wherein the dynamic analysis logic includes one or more virtual machines configured to process the object to determine if one or more generated objects are created during processing.
  • 5. The system of claim 4, wherein the correlation engine correlates a sequence comprising the object and one or more generated objects with a likelihood of maliciousness associated with the sequence and provides the likelihood of maliciousness to the classification engine, wherein the sequence indicated by a sequence identifier being part of metadata associated with the object or a generated object of the one or more generated objects.
  • 6. The system of claim 5, wherein the sequence identifier is a timestamp associated with the generation of each generated object.
  • 7. The system of claim 5, wherein the sequence identifier is a timestamp associated with the beginning of processing of each generated object.
  • 8. The system of claim 1, further comprising reporting of the classification of the object via a communication interface, by issuing an alert associated with the object.
  • 9. The system of claim 1, further comprising: the features associated with the processing of the object are received by the correlation engine, the features extracted by an event database and logic from events monitored by the monitoring logic;the correlation engine combining the features received from the event database and logic with features associated with the AST representation to generate a further correlation with maliciousness; andthe further correlation with maliciousness provided to the classification engine.
  • 10. The system of claim 1, wherein a scheduler terminates further processing by the virtual machine when processing time exceeds a specified duration.
  • 11. The system of claim 10, wherein the scheduler modifies the specified duration for processing by the virtual machine in response to the generation of the generated object.
  • 12. The system of claim 1, wherein the correlation engine determines a likelihood of maliciousness for the AST representation of each generated object in response to a similarity analysis, including (i) performing a fuzzy hash to generate a hash list, and (ii) applying one or more similarity checks to one or more entries in the hash list.
  • 13. The system of claim 5, wherein the correlation engine determines a likelihood of maliciousness for the sequence of AST representations of the generated object in response to a similarity analysis, including (i) performing a fuzzy hash to generate a hash list, and (ii) applying one or more similarity checks to one or more entries in the hash list.
  • 14. The system of claim 1, wherein the dynamic analysis logic is configured to process and monitor the behavior of objects using one or more virtual machines configured with the monitoring logic.
  • 15. The system of claim 1, wherein the AST generator is configured to extract AST features from the AST representation of the generated object and provide the extract AST features to the correlation engine.
  • 16. A computerized method for detecting a generated malware cyber-attack, the method comprising: monitoring the processing of a first object in a virtual machine of a malware detection system; andresponsive to detecting a second object generated during processing of the first object by an application operating within the virtual machine, where the second object is different than the first object, providing the generated second object to an Abstract Syntax Tree (AST) generator;generating an AST representation by the AST generator for the received generated second object and providing the AST representation to a correlation engine;determining correlation results, by the correlation engine, based at least in part on the received AST representation and providing the correlation results to a classification engine; andclassifying, by the classification engine, the first object as malicious in response to the received correlation results exceeding a maliciousness threshold.
  • 17. The method of claim 16, wherein the correlation of the AST representation includes performing a similarity analysis on at least a portion of the received AST representation with respect to a set of one or more AST representations of known malicious objects to generate a similarity score indicating whether the first object is associated with malware.
  • 18. The method of claim 17, wherein the correlation of the AST representation is performed on a sequence of AST representations associated with the generated second objects created during processing of the first object in the virtual machine.
  • 19. The method of claim 16, wherein the processing time for the first object in the virtual machine is limited by a scheduler.
  • 20. The method of claim 16, wherein responsive to detecting the generation of the generated second object in the virtual machine, the processing time is modified by the scheduler.
  • 21. The method of claim 16, further comprising generating a report related to the maliciousness of the first object and issuing an alert by the reporting engine in response to a classification by the classification engine.
  • 22. The method of claim 16, further comprising the correlation engine: extracting features of the generated second object;generating a correlation with maliciousness of the extracted features by the correlation engine; andproviding the correlation associated with the extracted features to the classification engine.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims the benefit of priority on U.S. Provisional Application No. 62/438,338 filed Dec. 22, 2016, the entire contents of which are incorporated by reference herein.

US Referenced Citations (727)
Number Name Date Kind
4292580 Ott et al. Sep 1981 A
5175732 Hendel et al. Dec 1992 A
5319776 Hile et al. Jun 1994 A
5440723 Arnold et al. Aug 1995 A
5490249 Miller Feb 1996 A
5657473 Killean et al. Aug 1997 A
5802277 Cowlard Sep 1998 A
5842002 Schnurer et al. Nov 1998 A
5960170 Chen et al. Sep 1999 A
5978917 Chi Nov 1999 A
5983348 Ji Nov 1999 A
6088803 Tso et al. Jul 2000 A
6092194 Touboul Jul 2000 A
6094677 Capek et al. Jul 2000 A
6108799 Boulay et al. Aug 2000 A
6154844 Touboul et al. Nov 2000 A
6269330 Cidon et al. Jul 2001 B1
6272641 Ji Aug 2001 B1
6279113 Vaidya Aug 2001 B1
6298445 Shostack et al. Oct 2001 B1
6357008 Nachenberg Mar 2002 B1
6424627 Sorhaug et al. Jul 2002 B1
6442696 Wray et al. Aug 2002 B1
6484315 Ziese Nov 2002 B1
6487666 Shanklin et al. Nov 2002 B1
6493756 O'Brien et al. Dec 2002 B1
6550012 Villa et al. Apr 2003 B1
6775657 Baker Aug 2004 B1
6831893 Ben Nun et al. Dec 2004 B1
6832367 Choi et al. Dec 2004 B1
6895550 Kanchirayappa et al. May 2005 B2
6898632 Gordy et al. May 2005 B2
6907396 Muttik et al. Jun 2005 B1
6941348 Petry et al. Sep 2005 B2
6971097 Wallman Nov 2005 B1
6981279 Arnold et al. Dec 2005 B1
7007107 Ivchenko et al. Feb 2006 B1
7028179 Anderson et al. Apr 2006 B2
7043757 Hoefelmeyer et al. May 2006 B2
7058822 Edery et al. Jun 2006 B2
7069316 Gryaznov Jun 2006 B1
7080407 Zhao et al. Jul 2006 B1
7080408 Pak et al. Jul 2006 B1
7093002 Wolff et al. Aug 2006 B2
7093239 van der Made Aug 2006 B1
7096498 Judge Aug 2006 B2
7100201 Izatt Aug 2006 B2
7107617 Hursey et al. Sep 2006 B2
7159149 Spiegel et al. Jan 2007 B2
7213260 Judge May 2007 B2
7231667 Jordan Jun 2007 B2
7240364 Branscomb et al. Jul 2007 B1
7240368 Roesch et al. Jul 2007 B1
7243371 Kasper et al. Jul 2007 B1
7249175 Donaldson Jul 2007 B1
7287278 Liang Oct 2007 B2
7308716 Danford et al. Dec 2007 B2
7328453 Merkle, Jr. et al. Feb 2008 B2
7346486 Ivancic et al. Mar 2008 B2
7356736 Natvig Apr 2008 B2
7386888 Liang et al. Jun 2008 B2
7392542 Bucher Jun 2008 B2
7418729 Szor Aug 2008 B2
7428300 Drew et al. Sep 2008 B1
7441272 Durham et al. Oct 2008 B2
7448084 Apap et al. Nov 2008 B1
7458098 Judge et al. Nov 2008 B2
7464404 Carpenter et al. Dec 2008 B2
7464407 Nakae et al. Dec 2008 B2
7467408 O'Toole, Jr. Dec 2008 B1
7478428 Thomlinson Jan 2009 B1
7480773 Reed Jan 2009 B1
7487543 Arnold et al. Feb 2009 B2
7496960 Chen et al. Feb 2009 B1
7496961 Zimmer et al. Feb 2009 B2
7519990 Xie Apr 2009 B1
7523493 Liang et al. Apr 2009 B2
7530104 Thrower et al. May 2009 B1
7540025 Tzadikario May 2009 B2
7546638 Anderson et al. Jun 2009 B2
7565550 Liang et al. Jul 2009 B2
7568233 Szor et al. Jul 2009 B1
7584455 Ball Sep 2009 B2
7603715 Costa et al. Oct 2009 B2
7607171 Marsden et al. Oct 2009 B1
7639714 Stolfo et al. Dec 2009 B2
7644441 Schmid et al. Jan 2010 B2
7657419 van der Made Feb 2010 B2
7676841 Sobchuk et al. Mar 2010 B2
7698548 Shelest et al. Apr 2010 B2
7707633 Danford et al. Apr 2010 B2
7712136 Sprosts et al. May 2010 B2
7730011 Deninger et al. Jun 2010 B1
7739740 Nachenberg et al. Jun 2010 B1
7779463 Stolfo et al. Aug 2010 B2
7784097 Stolfo et al. Aug 2010 B1
7832008 Kraemer Nov 2010 B1
7836502 Zhao et al. Nov 2010 B1
7849506 Dansey et al. Dec 2010 B1
7854007 Sprosts et al. Dec 2010 B2
7869073 Oshima Jan 2011 B2
7877803 Enstone et al. Jan 2011 B2
7904959 Sidiroglou et al. Mar 2011 B2
7908660 Bahl Mar 2011 B2
7930738 Petersen Apr 2011 B1
7937387 Frazier et al. May 2011 B2
7937761 Bennett May 2011 B1
7949849 Lowe et al. May 2011 B2
7996556 Raghavan et al. Aug 2011 B2
7996836 McCorkendale et al. Aug 2011 B1
7996904 Chiueh et al. Aug 2011 B1
7996905 Arnold et al. Aug 2011 B2
8006305 Aziz Aug 2011 B2
8010667 Zhang et al. Aug 2011 B2
8020206 Hubbard et al. Sep 2011 B2
8028338 Schneider et al. Sep 2011 B1
8042184 Batenin Oct 2011 B1
8045094 Teragawa Oct 2011 B2
8045458 Alperovitch et al. Oct 2011 B2
8069484 McMillan et al. Nov 2011 B2
8087086 Lai et al. Dec 2011 B1
8171553 Aziz et al. May 2012 B2
8176049 Deninger et al. May 2012 B2
8176480 Spertus May 2012 B1
8201246 Wu et al. Jun 2012 B1
8204984 Aziz et al. Jun 2012 B1
8214905 Doukhvalov et al. Jul 2012 B1
8220055 Kennedy Jul 2012 B1
8225288 Miller et al. Jul 2012 B2
8225373 Kraemer Jul 2012 B2
8233882 Rogel Jul 2012 B2
8234640 Fitzgerald et al. Jul 2012 B1
8234709 Viljoen et al. Jul 2012 B2
8239944 Nachenberg et al. Aug 2012 B1
8260914 Ranjan Sep 2012 B1
8266091 Gubin et al. Sep 2012 B1
8286251 Eker et al. Oct 2012 B2
8291499 Aziz et al. Oct 2012 B2
8307435 Mann et al. Nov 2012 B1
8307443 Wang et al. Nov 2012 B2
8312545 Tuvell et al. Nov 2012 B2
8321936 Green et al. Nov 2012 B1
8321941 Tuvell et al. Nov 2012 B2
8332571 Edwards, Sr. Dec 2012 B1
8365286 Poston Jan 2013 B2
8365297 Parshin et al. Jan 2013 B1
8370938 Daswani et al. Feb 2013 B1
8370939 Zaitsev et al. Feb 2013 B2
8375444 Aziz et al. Feb 2013 B2
8381299 Stolfo et al. Feb 2013 B2
8402529 Green et al. Mar 2013 B1
8464340 Ahn et al. Jun 2013 B2
8479174 Chiriac Jul 2013 B2
8479276 Vaystikh et al. Jul 2013 B1
8479291 Bodke Jul 2013 B1
8510827 Leake et al. Aug 2013 B1
8510828 Guo et al. Aug 2013 B1
8510842 Amit et al. Aug 2013 B2
8516478 Edwards et al. Aug 2013 B1
8516590 Ranadive et al. Aug 2013 B1
8516593 Aziz Aug 2013 B2
8522348 Chen et al. Aug 2013 B2
8528086 Aziz Sep 2013 B1
8533824 Hutton et al. Sep 2013 B2
8539582 Aziz et al. Sep 2013 B1
8549638 Aziz Oct 2013 B2
8555391 Demir et al. Oct 2013 B1
8561177 Aziz et al. Oct 2013 B1
8566476 Shiffer et al. Oct 2013 B2
8566946 Aziz et al. Oct 2013 B1
8584094 Dadhia et al. Nov 2013 B2
8584234 Sobel et al. Nov 2013 B1
8584239 Aziz et al. Nov 2013 B2
8595834 Xie et al. Nov 2013 B2
8627476 Satish et al. Jan 2014 B1
8635696 Aziz Jan 2014 B1
8682054 Xue et al. Mar 2014 B2
8682812 Ranjan Mar 2014 B1
8689333 Aziz Apr 2014 B2
8695096 Zhang Apr 2014 B1
8713631 Pavlyushchik Apr 2014 B1
8713681 Silberman et al. Apr 2014 B2
8726392 McCorkendale et al. May 2014 B1
8739280 Chess et al. May 2014 B2
8776229 Aziz Jul 2014 B1
8782792 Bodke Jul 2014 B1
8789172 Stolfo et al. Jul 2014 B2
8789178 Kejriwal et al. Jul 2014 B2
8793278 Frazier et al. Jul 2014 B2
8793787 Ismael et al. Jul 2014 B2
8805947 Kuzkin et al. Aug 2014 B1
8806647 Daswani et al. Aug 2014 B1
8832829 Manni et al. Sep 2014 B2
8850570 Ramzan Sep 2014 B1
8850571 Staniford et al. Sep 2014 B2
8881234 Narasimhan et al. Nov 2014 B2
8881271 Butler, II Nov 2014 B2
8881282 Aziz et al. Nov 2014 B1
8893294 Steele, III Nov 2014 B1
8898788 Aziz et al. Nov 2014 B1
8935779 Manni et al. Jan 2015 B2
8949257 Shiffer et al. Feb 2015 B2
8984638 Aziz et al. Mar 2015 B1
8990939 Staniford et al. Mar 2015 B2
8990944 Singh et al. Mar 2015 B1
8997219 Staniford et al. Mar 2015 B2
9009822 Ismael et al. Apr 2015 B1
9009823 Ismael et al. Apr 2015 B1
9027135 Aziz May 2015 B1
9071638 Aziz et al. Jun 2015 B1
9081961 Yermakov Jul 2015 B2
9104867 Thioux et al. Aug 2015 B1
9106630 Frazier et al. Aug 2015 B2
9106694 Aziz et al. Aug 2015 B2
9118715 Staniford et al. Aug 2015 B2
9128728 Siman Sep 2015 B2
9159035 Ismael et al. Oct 2015 B1
9171160 Vincent et al. Oct 2015 B2
9176843 Ismael et al. Nov 2015 B1
9189627 Islam Nov 2015 B1
9195829 Goradia et al. Nov 2015 B1
9197664 Aziz et al. Nov 2015 B1
9223972 Vincent et al. Dec 2015 B1
9225740 Ismael et al. Dec 2015 B1
9241010 Bennett et al. Jan 2016 B1
9251343 Vincent et al. Feb 2016 B1
9262635 Paithane et al. Feb 2016 B2
9268936 Butler Feb 2016 B2
9275229 LeMasters Mar 2016 B2
9282109 Aziz et al. Mar 2016 B1
9292686 Ismael et al. Mar 2016 B2
9294501 Mesdaq et al. Mar 2016 B2
9300686 Pidathala et al. Mar 2016 B2
9306960 Aziz Apr 2016 B1
9306974 Aziz et al. Apr 2016 B1
9311479 Manni et al. Apr 2016 B1
9355247 Thioux et al. May 2016 B1
9356944 Aziz May 2016 B1
9363280 Rivlin et al. Jun 2016 B1
9367681 Ismael et al. Jun 2016 B1
9398028 Karandikar et al. Jul 2016 B1
9413781 Cunningham et al. Aug 2016 B2
9426071 Caldejon et al. Aug 2016 B1
9430646 Mushtaq et al. Aug 2016 B1
9432389 Khalid et al. Aug 2016 B1
9438613 Paithane et al. Sep 2016 B1
9438622 Staniford et al. Sep 2016 B1
9438623 Thioux et al. Sep 2016 B1
9459901 Jung et al. Oct 2016 B2
9467460 Otvagin et al. Oct 2016 B1
9483644 Paithane et al. Nov 2016 B1
9495180 Ismael Nov 2016 B2
9497213 Thompson et al. Nov 2016 B2
9507935 Ismael et al. Nov 2016 B2
9516057 Aziz Dec 2016 B2
9519782 Aziz et al. Dec 2016 B2
9536091 Paithane et al. Jan 2017 B2
9537972 Edwards et al. Jan 2017 B1
9560059 Islam Jan 2017 B1
9565202 Kindlund et al. Feb 2017 B1
9591015 Amin et al. Mar 2017 B1
9591020 Aziz Mar 2017 B1
9594904 Jain et al. Mar 2017 B1
9594905 Ismael et al. Mar 2017 B1
9594912 Thioux et al. Mar 2017 B1
9609007 Rivlin et al. Mar 2017 B1
9626509 Khalid et al. Apr 2017 B1
9628498 Aziz et al. Apr 2017 B1
9628507 Haq et al. Apr 2017 B2
9633134 Ross Apr 2017 B2
9635039 Islam et al. Apr 2017 B1
9641546 Manni et al. May 2017 B1
9654485 Neumann May 2017 B1
9661009 Karandikar et al. May 2017 B1
9661018 Aziz May 2017 B1
9674298 Edwards et al. Jun 2017 B1
9680862 Ismael et al. Jun 2017 B2
9690606 Ha et al. Jun 2017 B1
9690933 Singh et al. Jun 2017 B1
9690935 Shifter et al. Jun 2017 B2
9690936 Malik et al. Jun 2017 B1
9736179 Ismael Aug 2017 B2
9740857 Ismael et al. Aug 2017 B2
9747446 Pidathala et al. Aug 2017 B1
9756074 Aziz et al. Sep 2017 B2
9773112 Rathor et al. Sep 2017 B1
9781144 Otvagin et al. Oct 2017 B1
9787700 Amin et al. Oct 2017 B1
9787706 Otvagin et al. Oct 2017 B1
9792196 Ismael et al. Oct 2017 B1
9792443 Sheridan Oct 2017 B1
9805203 Johns Oct 2017 B2
9824209 Ismael et al. Nov 2017 B1
9824211 Wilson Nov 2017 B2
9824216 Khalid et al. Nov 2017 B1
9825976 Gomez Nov 2017 B1
9825989 Mehra et al. Nov 2017 B1
9838408 Karandikar et al. Dec 2017 B1
9838411 Aziz Dec 2017 B1
9838416 Aziz Dec 2017 B1
9838417 Khalid et al. Dec 2017 B1
9846776 Paithane et al. Dec 2017 B1
9876701 Caldejon et al. Jan 2018 B1
9888016 Amin et al. Feb 2018 B1
9888019 Pidathala et al. Feb 2018 B1
9910988 Vincent et al. Mar 2018 B1
9912644 Cunningham Mar 2018 B2
9912681 Ismael et al. Mar 2018 B1
9912684 Aziz et al. Mar 2018 B1
9912691 Mesdaq et al. Mar 2018 B2
9912698 Thioux et al. Mar 2018 B1
9916440 Paithane et al. Mar 2018 B1
9921978 Chan et al. Mar 2018 B1
9934376 Ismael Apr 2018 B1
9934381 Kindlund et al. Apr 2018 B1
9946568 Ismael et al. Apr 2018 B1
9954890 Staniford et al. Apr 2018 B1
9973531 Thioux May 2018 B1
9992025 Mahaffey Jun 2018 B2
10002252 Ismael et al. Jun 2018 B2
10019338 Goradia et al. Jul 2018 B1
10019573 Silberman et al. Jul 2018 B2
10025691 Ismael et al. Jul 2018 B1
10025927 Khalid et al. Jul 2018 B1
10027689 Rathor et al. Jul 2018 B1
10027690 Aziz et al. Jul 2018 B2
10027696 Rivlin et al. Jul 2018 B1
10033747 Paithane et al. Jul 2018 B1
10033748 Cunningham et al. Jul 2018 B1
10033753 Islam et al. Jul 2018 B1
10033759 Kabra et al. Jul 2018 B1
10050998 Singh Aug 2018 B1
10068091 Aziz et al. Sep 2018 B1
10075455 Zafar et al. Sep 2018 B2
10083302 Paithane et al. Sep 2018 B1
10084813 Eyada Sep 2018 B2
10089461 Ha et al. Oct 2018 B1
10097573 Aziz Oct 2018 B1
10104102 Neumann Oct 2018 B1
10108446 Steinberg et al. Oct 2018 B1
10121000 Rivlin et al. Nov 2018 B1
10122746 Manni et al. Nov 2018 B1
10133863 Bu et al. Nov 2018 B2
10133866 Kumar et al. Nov 2018 B1
10146810 Shiffer et al. Dec 2018 B2
10148693 Singh et al. Dec 2018 B2
10165000 Aziz et al. Dec 2018 B1
10169585 Pilipenko et al. Jan 2019 B1
10176321 Abbasi et al. Jan 2019 B2
10181029 Ismael et al. Jan 2019 B1
10191861 Steinberg et al. Jan 2019 B1
10192052 Singh et al. Jan 2019 B1
10198574 Thioux et al. Feb 2019 B1
10200384 Mushtaq et al. Feb 2019 B1
10210329 Malik et al. Feb 2019 B1
10216927 Steinberg Feb 2019 B1
10218740 Mesdaq et al. Feb 2019 B1
10242185 Goradia Mar 2019 B1
20010005889 Albrecht Jun 2001 A1
20010047326 Broadbent et al. Nov 2001 A1
20020018903 Kokubo et al. Feb 2002 A1
20020038430 Edwards et al. Mar 2002 A1
20020091819 Melchione et al. Jul 2002 A1
20020095607 Lin-Hendel Jul 2002 A1
20020116627 Tarbotton et al. Aug 2002 A1
20020144156 Copeland Oct 2002 A1
20020162015 Tang Oct 2002 A1
20020166063 Lachman et al. Nov 2002 A1
20020169952 DiSanto et al. Nov 2002 A1
20020184528 Shevenell et al. Dec 2002 A1
20020188887 Largman et al. Dec 2002 A1
20020194490 Halperin et al. Dec 2002 A1
20030021728 Sharpe et al. Jan 2003 A1
20030074578 Ford et al. Apr 2003 A1
20030084318 Schertz May 2003 A1
20030101381 Mateev et al. May 2003 A1
20030115483 Liang Jun 2003 A1
20030188190 Aaron et al. Oct 2003 A1
20030191957 Hypponen et al. Oct 2003 A1
20030200460 Morota et al. Oct 2003 A1
20030212902 van der Made Nov 2003 A1
20030229801 Kouznetsov et al. Dec 2003 A1
20030237000 Denton et al. Dec 2003 A1
20040003323 Bennett et al. Jan 2004 A1
20040006473 Mills et al. Jan 2004 A1
20040015712 Szor Jan 2004 A1
20040019832 Arnold et al. Jan 2004 A1
20040047356 Bauer Mar 2004 A1
20040083408 Spiegel et al. Apr 2004 A1
20040088581 Brawn et al. May 2004 A1
20040093513 Cantrell et al. May 2004 A1
20040111531 Staniford et al. Jun 2004 A1
20040117478 Triulzi et al. Jun 2004 A1
20040117624 Brandt et al. Jun 2004 A1
20040128355 Chao et al. Jul 2004 A1
20040165588 Pandya Aug 2004 A1
20040236963 Danford et al. Nov 2004 A1
20040243349 Greifeneder et al. Dec 2004 A1
20040249911 Alkhatib et al. Dec 2004 A1
20040255161 Cavanaugh Dec 2004 A1
20040268147 Wiederin et al. Dec 2004 A1
20050005159 Oliphant Jan 2005 A1
20050021740 Bar et al. Jan 2005 A1
20050033960 Vialen et al. Feb 2005 A1
20050033989 Poletto et al. Feb 2005 A1
20050050148 Mohammadioun et al. Mar 2005 A1
20050086523 Zimmer et al. Apr 2005 A1
20050091513 Mitomo et al. Apr 2005 A1
20050091533 Omote et al. Apr 2005 A1
20050091652 Ross et al. Apr 2005 A1
20050108562 Khazan et al. May 2005 A1
20050114663 Cornell et al. May 2005 A1
20050125195 Brendel Jun 2005 A1
20050149726 Joshi et al. Jul 2005 A1
20050157662 Bingham et al. Jul 2005 A1
20050183143 Anderholm et al. Aug 2005 A1
20050201297 Peikari Sep 2005 A1
20050210533 Copeland et al. Sep 2005 A1
20050238005 Chen et al. Oct 2005 A1
20050240781 Gassoway Oct 2005 A1
20050262562 Gassoway Nov 2005 A1
20050265331 Stolfo Dec 2005 A1
20050283839 Cowburn Dec 2005 A1
20060010495 Cohen et al. Jan 2006 A1
20060015416 Hoffman et al. Jan 2006 A1
20060015715 Anderson Jan 2006 A1
20060015747 Van de Ven Jan 2006 A1
20060021029 Brickell et al. Jan 2006 A1
20060021054 Costa et al. Jan 2006 A1
20060031476 Mathes et al. Feb 2006 A1
20060047665 Neil Mar 2006 A1
20060070130 Costea et al. Mar 2006 A1
20060075496 Carpenter et al. Apr 2006 A1
20060095968 Portolani et al. May 2006 A1
20060101516 Sudaharan et al. May 2006 A1
20060101517 Banzhof et al. May 2006 A1
20060117385 Mester et al. Jun 2006 A1
20060123477 Raghavan et al. Jun 2006 A1
20060143709 Brooks et al. Jun 2006 A1
20060150249 Gassen et al. Jul 2006 A1
20060161983 Cothrell et al. Jul 2006 A1
20060161987 Levy-Yurista Jul 2006 A1
20060161989 Reshef et al. Jul 2006 A1
20060164199 Glide et al. Jul 2006 A1
20060173992 Weber et al. Aug 2006 A1
20060179147 Tran et al. Aug 2006 A1
20060184632 Marino et al. Aug 2006 A1
20060191010 Benjamin Aug 2006 A1
20060221956 Narayan et al. Oct 2006 A1
20060236393 Kramer et al. Oct 2006 A1
20060242709 Seinfeld et al. Oct 2006 A1
20060248519 Jaeger et al. Nov 2006 A1
20060248582 Panjwani et al. Nov 2006 A1
20060251104 Koga Nov 2006 A1
20060288417 Bookbinder et al. Dec 2006 A1
20070006288 Mayfield et al. Jan 2007 A1
20070006313 Porras et al. Jan 2007 A1
20070011174 Takaragi et al. Jan 2007 A1
20070016951 Piccard et al. Jan 2007 A1
20070016953 Morris Jan 2007 A1
20070019286 Kikuchi Jan 2007 A1
20070033645 Jones Feb 2007 A1
20070038943 FitzGerald et al. Feb 2007 A1
20070064689 Shin et al. Mar 2007 A1
20070074169 Chess et al. Mar 2007 A1
20070094730 Bhikkaji et al. Apr 2007 A1
20070101435 Konanka et al. May 2007 A1
20070128855 Cho et al. Jun 2007 A1
20070142030 Sinha et al. Jun 2007 A1
20070143827 Nicodemus et al. Jun 2007 A1
20070156895 Vuong Jul 2007 A1
20070157180 Tillmann et al. Jul 2007 A1
20070157306 Elrod et al. Jul 2007 A1
20070168988 Eisner et al. Jul 2007 A1
20070171824 Ruello et al. Jul 2007 A1
20070174915 Gribble et al. Jul 2007 A1
20070192500 Lum Aug 2007 A1
20070192858 Lum Aug 2007 A1
20070198275 Malden et al. Aug 2007 A1
20070208822 Wang et al. Sep 2007 A1
20070220607 Sprosts et al. Sep 2007 A1
20070240218 Tuvell et al. Oct 2007 A1
20070240219 Tuvell et al. Oct 2007 A1
20070240220 Tuvell et al. Oct 2007 A1
20070240222 Tuvell et al. Oct 2007 A1
20070250930 Aziz et al. Oct 2007 A1
20070256132 Oliphant Nov 2007 A2
20070271446 Nakamura Nov 2007 A1
20080005782 Aziz Jan 2008 A1
20080018122 Zierler et al. Jan 2008 A1
20080028463 Dagon et al. Jan 2008 A1
20080040710 Chiriac Feb 2008 A1
20080046781 Childs et al. Feb 2008 A1
20080066179 Liu Mar 2008 A1
20080072326 Danford et al. Mar 2008 A1
20080077793 Tan et al. Mar 2008 A1
20080080518 Hoeflin et al. Apr 2008 A1
20080086720 Lekel Apr 2008 A1
20080098476 Syversen Apr 2008 A1
20080120722 Sima et al. May 2008 A1
20080134178 Fitzgerald et al. Jun 2008 A1
20080134334 Kim et al. Jun 2008 A1
20080141376 Clausen et al. Jun 2008 A1
20080184367 McMillan et al. Jul 2008 A1
20080184373 Traut et al. Jul 2008 A1
20080189787 Arnold et al. Aug 2008 A1
20080201778 Guo et al. Aug 2008 A1
20080209557 Herley et al. Aug 2008 A1
20080215742 Goldszmidt et al. Sep 2008 A1
20080222729 Chen et al. Sep 2008 A1
20080263665 Ma et al. Oct 2008 A1
20080295172 Bohacek Nov 2008 A1
20080301810 Lehane et al. Dec 2008 A1
20080307524 Singh et al. Dec 2008 A1
20080313738 Enderby Dec 2008 A1
20080320594 Jiang Dec 2008 A1
20090003317 Kasralikar et al. Jan 2009 A1
20090007100 Field et al. Jan 2009 A1
20090013408 Schipka Jan 2009 A1
20090031423 Liu et al. Jan 2009 A1
20090036111 Danford et al. Feb 2009 A1
20090037835 Goldman Feb 2009 A1
20090044024 Oberheide et al. Feb 2009 A1
20090044274 Budko et al. Feb 2009 A1
20090064332 Porras et al. Mar 2009 A1
20090077666 Chen et al. Mar 2009 A1
20090083369 Marmor Mar 2009 A1
20090083855 Apap et al. Mar 2009 A1
20090089879 Wang et al. Apr 2009 A1
20090094697 Provos et al. Apr 2009 A1
20090113425 Ports et al. Apr 2009 A1
20090125976 Wassermann et al. May 2009 A1
20090126015 Monastyrsky et al. May 2009 A1
20090126016 Sobko et al. May 2009 A1
20090133125 Choi et al. May 2009 A1
20090144823 Lamastra et al. Jun 2009 A1
20090158430 Borders Jun 2009 A1
20090172815 Gu et al. Jul 2009 A1
20090187992 Poston Jul 2009 A1
20090193293 Stolfo et al. Jul 2009 A1
20090198651 Shiffer et al. Aug 2009 A1
20090198670 Shiffer et al. Aug 2009 A1
20090198689 Frazier et al. Aug 2009 A1
20090199274 Frazier et al. Aug 2009 A1
20090199296 Xie et al. Aug 2009 A1
20090228233 Anderson et al. Sep 2009 A1
20090241187 Troyansky Sep 2009 A1
20090241190 Todd et al. Sep 2009 A1
20090265692 Godefroid et al. Oct 2009 A1
20090271867 Zhang Oct 2009 A1
20090300415 Zhang et al. Dec 2009 A1
20090300761 Park et al. Dec 2009 A1
20090328185 Berg et al. Dec 2009 A1
20090328221 Blumfield et al. Dec 2009 A1
20100005146 Drako et al. Jan 2010 A1
20100011205 McKenna Jan 2010 A1
20100017546 Poo et al. Jan 2010 A1
20100030996 Butler, II Feb 2010 A1
20100031353 Thomas et al. Feb 2010 A1
20100037314 Perdisci et al. Feb 2010 A1
20100043073 Kuwamura Feb 2010 A1
20100054278 Stolfo et al. Mar 2010 A1
20100058474 Hicks Mar 2010 A1
20100064044 Nonoyama Mar 2010 A1
20100077481 Polyakov et al. Mar 2010 A1
20100083376 Pereira et al. Apr 2010 A1
20100115621 Staniford May 2010 A1
20100132038 Zaitsev May 2010 A1
20100154056 Smith et al. Jun 2010 A1
20100180344 Malyshev et al. Jul 2010 A1
20100192223 Ismael et al. Jul 2010 A1
20100220863 Dupaquis et al. Sep 2010 A1
20100235831 Dittmer Sep 2010 A1
20100251104 Massand Sep 2010 A1
20100281102 Chinta et al. Nov 2010 A1
20100281541 Stolfo et al. Nov 2010 A1
20100281542 Stolfo et al. Nov 2010 A1
20100287260 Peterson et al. Nov 2010 A1
20100299754 Amit et al. Nov 2010 A1
20100306173 Frank Dec 2010 A1
20110004737 Greenebaum Jan 2011 A1
20110025504 Lyon et al. Feb 2011 A1
20110041179 St Hlberg Feb 2011 A1
20110047594 Mahaffey et al. Feb 2011 A1
20110047618 Evans Feb 2011 A1
20110047620 Mahaffey et al. Feb 2011 A1
20110055907 Narasimhan et al. Mar 2011 A1
20110078794 Manni et al. Mar 2011 A1
20110093951 Aziz Apr 2011 A1
20110099620 Stavrou et al. Apr 2011 A1
20110099633 Aziz Apr 2011 A1
20110099635 Silberman et al. Apr 2011 A1
20110113231 Kaminsky May 2011 A1
20110145918 Jung et al. Jun 2011 A1
20110145920 Mahaffey et al. Jun 2011 A1
20110145934 Abramovici et al. Jun 2011 A1
20110167493 Song et al. Jul 2011 A1
20110167494 Bowen et al. Jul 2011 A1
20110173213 Frazier et al. Jul 2011 A1
20110173460 Ito et al. Jul 2011 A1
20110179484 Tuvell Jul 2011 A1
20110219449 St. Neitzel et al. Sep 2011 A1
20110219450 McDougal et al. Sep 2011 A1
20110225624 Sawhney et al. Sep 2011 A1
20110225655 Niemela et al. Sep 2011 A1
20110247072 Staniford et al. Oct 2011 A1
20110265182 Peinado et al. Oct 2011 A1
20110289582 Kejriwal et al. Nov 2011 A1
20110302587 Nishikawa et al. Dec 2011 A1
20110307954 Melnik et al. Dec 2011 A1
20110307955 Kaplan et al. Dec 2011 A1
20110307956 Yermakov et al. Dec 2011 A1
20110314546 Aziz et al. Dec 2011 A1
20120023593 Puder et al. Jan 2012 A1
20120054869 Yen et al. Mar 2012 A1
20120066698 Yanoo Mar 2012 A1
20120079596 Thomas et al. Mar 2012 A1
20120084859 Radinsky et al. Apr 2012 A1
20120096553 Srivastava et al. Apr 2012 A1
20120110667 Zubrilin et al. May 2012 A1
20120117652 Manni et al. May 2012 A1
20120121154 Xue et al. May 2012 A1
20120124426 Maybee et al. May 2012 A1
20120174186 Aziz et al. Jul 2012 A1
20120174196 Bhogavilli et al. Jul 2012 A1
20120174218 McCoy et al. Jul 2012 A1
20120198279 Schroeder Aug 2012 A1
20120210423 Friedrichs et al. Aug 2012 A1
20120216280 Zorn Aug 2012 A1
20120222121 Staniford et al. Aug 2012 A1
20120255015 Sahita et al. Oct 2012 A1
20120255017 Sallam Oct 2012 A1
20120260304 Morris Oct 2012 A1
20120260342 Dube et al. Oct 2012 A1
20120266244 Green Oct 2012 A1
20120278886 Luna Nov 2012 A1
20120297489 Dequevy Nov 2012 A1
20120330801 McDougal et al. Dec 2012 A1
20120331553 Aziz et al. Dec 2012 A1
20130014259 Gribble et al. Jan 2013 A1
20130036472 Aziz Feb 2013 A1
20130047257 Aziz Feb 2013 A1
20130074185 McDougal et al. Mar 2013 A1
20130086684 Mohler Apr 2013 A1
20130097699 Balupari et al. Apr 2013 A1
20130097706 Titonis et al. Apr 2013 A1
20130111587 Goel et al. May 2013 A1
20130117852 Stute May 2013 A1
20130117855 Kim et al. May 2013 A1
20130139264 Brinkley et al. May 2013 A1
20130160125 Likhachev et al. Jun 2013 A1
20130160127 Jeong et al. Jun 2013 A1
20130160130 Mendelev et al. Jun 2013 A1
20130160131 Madou et al. Jun 2013 A1
20130167236 Sick Jun 2013 A1
20130174214 Duncan Jul 2013 A1
20130185789 Hagiwara et al. Jul 2013 A1
20130185795 Winn et al. Jul 2013 A1
20130185798 Saunders et al. Jul 2013 A1
20130191915 Antonakakis et al. Jul 2013 A1
20130196649 Paddon et al. Aug 2013 A1
20130227691 Aziz et al. Aug 2013 A1
20130246370 Bartram et al. Sep 2013 A1
20130247186 LeMasters Sep 2013 A1
20130263260 Mahaffey et al. Oct 2013 A1
20130291109 Staniford et al. Oct 2013 A1
20130298243 Kumar et al. Nov 2013 A1
20130318038 Shiffer et al. Nov 2013 A1
20130318073 Shiffer et al. Nov 2013 A1
20130325791 Shiffer et al. Dec 2013 A1
20130325792 Shiffer et al. Dec 2013 A1
20130325871 Shiffer et al. Dec 2013 A1
20130325872 Shiffer et al. Dec 2013 A1
20140032875 Butler Jan 2014 A1
20140053260 Gupta et al. Feb 2014 A1
20140053261 Gupta et al. Feb 2014 A1
20140130158 Wang et al. May 2014 A1
20140137180 Lukacs et al. May 2014 A1
20140157407 Krishnan Jun 2014 A1
20140169762 Ryu Jun 2014 A1
20140179360 Jackson et al. Jun 2014 A1
20140181131 Ross Jun 2014 A1
20140189687 Jung et al. Jul 2014 A1
20140189866 Shiffer et al. Jul 2014 A1
20140189882 Jung et al. Jul 2014 A1
20140237600 Silberman et al. Aug 2014 A1
20140280245 Wilson Sep 2014 A1
20140283037 Sikorski et al. Sep 2014 A1
20140283063 Thompson et al. Sep 2014 A1
20140328204 Klotsche et al. Nov 2014 A1
20140337836 Ismael Nov 2014 A1
20140344926 Cunningham et al. Nov 2014 A1
20140351935 Shao et al. Nov 2014 A1
20140380473 Bu et al. Dec 2014 A1
20140380474 Paithane et al. Dec 2014 A1
20150007312 Pidathala et al. Jan 2015 A1
20150067839 Wardman Mar 2015 A1
20150096022 Vincent et al. Apr 2015 A1
20150096023 Mesdaq et al. Apr 2015 A1
20150096024 Haq et al. Apr 2015 A1
20150096025 Ismael Apr 2015 A1
20150180886 Staniford et al. Jun 2015 A1
20150186645 Aziz et al. Jul 2015 A1
20150199513 Ismael et al. Jul 2015 A1
20150199531 Ismael et al. Jul 2015 A1
20150199532 Ismael et al. Jul 2015 A1
20150220735 Paithane et al. Aug 2015 A1
20150363598 Xu Dec 2015 A1
20150372980 Eyada Dec 2015 A1
20160004869 Ismael et al. Jan 2016 A1
20160006756 Ismael et al. Jan 2016 A1
20160044000 Cunningham Feb 2016 A1
20160094572 Tyagi Mar 2016 A1
20160127393 Aziz et al. May 2016 A1
20160191547 Zafar et al. Jun 2016 A1
20160191550 Ismael et al. Jun 2016 A1
20160253500 Alme Sep 2016 A1
20160261612 Mesdaq et al. Sep 2016 A1
20160285914 Singh et al. Sep 2016 A1
20160301703 Aziz Oct 2016 A1
20160330219 Hasan Nov 2016 A1
20160335110 Paithane et al. Nov 2016 A1
20170083703 Abbasi et al. Mar 2017 A1
20180013770 Ismael Jan 2018 A1
20180048660 Paithane et al. Feb 2018 A1
20180121316 Ismael et al. May 2018 A1
20180288077 Siddiqui et al. Oct 2018 A1
Foreign Referenced Citations (11)
Number Date Country
2439806 Jan 2008 GB
2490431 Oct 2012 GB
02006928 Jan 2002 WO
0223805 Mar 2002 WO
2007117636 Oct 2007 WO
2008041950 Apr 2008 WO
2011084431 Jul 2011 WO
2011112348 Sep 2011 WO
2012075336 Jun 2012 WO
2012145066 Oct 2012 WO
2013067505 May 2013 WO
Non-Patent Literature Citations (58)
Entry
David French, “Fuzzy Hashing Against Different Types of Malware”, Oct. 24, 2011, SEI Insights. (Year: 2011).
Venezia, Paul , “NetDetector Captures Intrusions”, InfoWorld Issue 27, (“Venezia”), (Jul. 14, 2003).
Vladimir Getov: “Security as a Service in Smart Clouds—Opportunities and Concerns”, Computer Software and Applications Conference (COMPSAC), 2012 IEEE 36th Annual, IEEE, Jul. 16, 2012 (Jul. 16, 2012).
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.
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.
Williamson, Matthew M., “Throttling Viruses: Restricting Propagation to Defeat Malicious Mobile Code”, ACSAC Conference, Las Vegas, NV, USA, (Dec. 2002), pp. 1-9.
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.
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.
“Mining Specification of Malicious Behavior”—Jha et al, UCSB, Sep. 2007 https://www.cs.ucsb.edu/.about.chris/research/doc/esec07.sub.--mining.pdf-.
“Network Security: NetDetector—Network Intrusion Forensic System (NIFS) Whitepaper”, (“NetDetector Whitepaper”), (2003).
“When Virtual is Better Than Real”, IEEEXplore Digital Library, available at, http://ieeexplore.ieee.org/xpl/articleDetails.isp?reload=true&arnumbe- r=990073, (Dec. 7, 2013).
Abdullah, et al., Visualizing Network Data for Intrusion Detection, 2005 IEEE Workshop on Information Assurance and Security, pp. 100-108.
Adetoye, Adedayo , et al., “Network Intrusion Detection & Response System”, (“Adetoye”), (Sep. 2003).
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.
Aura, Tuomas, “Scanning electronic documents for personally identifiable information”, Proceedings of the 5th ACM workshop on Privacy in electronic society. ACM, 2006.
Baecher, “The Nepenthes Platform: An Efficient Approach to collect Malware”, Springer-verlag Berlin Heidelberg, (2006), pp. 165-184.
Bayer, et al., “Dynamic Analysis of Malicious Code”, J Comput Virol, Springer-Verlag, France., (2006), pp. 67-77.
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).
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.
Chen, P. M. and Noble, B. D., “When Virtual is Better Than Real, Department of Electrical Engineering and Computer Science”, University of Michigan (“Chen”) (2001).
Cisco “Intrusion Prevention for the Cisco ASA 5500-x Series” Data Sheet (2012).
Cohen, M.I. , “PyFlag—An advanced network forensic framework”, Digital investigation 5, Elsevier, (2008), pp. S112-S120.
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).
Didier Stevens, “Malicious PDF Documents Explained”, Security & Privacy, IEEE, IEEE Service Center, Los Alamitos, CA, US, vol. 9, No. 1, Jan. 1, 2011, pp. 80-82, XP011329453, ISSN: 1540-7993, DOI: 10.1109/MSP.2011.14.
Distler, “Malware Analysis: An Introduction”, SANS Institute InfoSec Reading Room, SANS Institute, (2007).
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).
FireEye Malware Analysis & Exchange Network, Malware Protection System, FireEye Inc., 2010.
FireEye Malware Analysis, Modern Malware Forensics, FireEye Inc., 2010.
FireEye v.6.0 Security Target, pp. 1-35, Version 1.1, FireEye Inc., May 2011.
Goel, et al., Reconstructing System State for Intrusion Analysis, Apr. 2008 SIGOPS Operating Systems Review, vol. 42 Issue 3, pp. 21-28.
Gregg Keizer: “Microsoft's HoneyMonkeys Show Patching Windows Works”, Aug. 8, 2005, XP055143386, Retrieved from the Internet: URL:http://www.informationweek.com/microsofts-honeymonkeys-show-patching-windows-works/d/d-id/1035069? [retrieved on Jun. 1, 2016].
Heng Yin et al, Panorama: Capturing System-Wide Information Flow for Malware Detection and Analysis, Research Showcase @ CMU, Carnegie Mellon University, 2007.
Hiroshi Shinotsuka, Malware Authors Using New Techniques to Evade Automated Threat Analysis Systems, Oct. 26, 2012, http://www.symantec.com/connect/blogs/, pp. 1-4.
Idika et al., A-Survey-of-Malware-Detection-Techniques, Feb. 2, 2007, Department of Computer Science, Purdue University.
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.
Kaeo, Merike , “Designing Network Security”, (“Kaeo”), (Nov. 2003).
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.
Khaled Salah et al: “Using Cloud Computing to Implement a Security Overlay Network”, Security & Privacy, IEEE, IEEE Service Center, Los Alamitos, CA, US, vol. 11, No. 1, Jan. 1, 2013 (Jan. 1, 2013).
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.
King, Samuel T., et al., “Operating System Support for Virtual Machines”, (“King”), (2003).
Kreibich, C. , et al., “Honeycomb-Creating Intrusion Detection Signatures Using Honeypots”, 2nd Workshop on Hot Topics in Networks (HotNets-11), Boston, USA, (2003).
Kristoff, J. , “Botnets, Detection and Mitigation: DNS-Based Techniques”, NU Security Day, (2005), 23 pages.
Lastline Labs, The Threat of Evasive Malware, Feb. 25, 2013, Lastline Labs, pp. 1-8.
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.
Lindorfer, Martina, Clemens Kolbitsch, and Paolo Milani Comparetti. “Detecting environment-sensitive malware.” Recent Advances in Intrusion Detection. Springer Berlin Heidelberg, 2011.
Marchette, David J., “Computer Intrusion Detection and Network Monitoring: A Statistical Viewpoint”, (“Marchette”), (2001).
Moore, D. , et al., “Internet Quarantine: Requirements for Containing Self-Propagating Code”, INFOCOM, vol. 3, (Mar. 30-Apr. 3, 2003), pp. 1901-1910.
Morales, Jose A., et al., ““Analyzing and exploiting network behaviors of malware.””, Security and Privacy in communication Networks. Springer Berlin Heidelberg, 2010. 20-34.
Mori, Detecting Unknown Computer Viruses, 2004, Springer-Verlag Berlin Heidelberg.
Natvig, Kurt , “SANDBOXII: Internet”, Virus Bulletin Conference, (“Natvig”), (Sep. 2002).
NetBIOS Working Group. Protocol Standard for a NetBIOS Service on a TCP/UDP transport: Concepts and Methods. STD 19, RFC 1001, Mar. 1987.
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).
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.
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.
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”).
Silicon Defense, “Worm Containment in the Internal Network”, (Mar. 2003), pp. 1-25.
Singh, S. , et al., “Automated Worm Fingerprinting”, Proceedings of the ACM/USENIX Symposium on Operating System Design and Implementation, San Francisco, California, (Dec. 2004).
Thomas H. Ptacek, and Timothy N. Newsham , “Insertion, Evasion, and Denial of Service: Eluding Network Intrusion Detection”, Secure Networks, (“Ptacek”), (Jan. 1998).
Provisional Applications (1)
Number Date Country
62438338 Dec 2016 US