Advanced malware detection using similarity analysis

Information

  • Patent Grant
  • 10491627
  • Patent Number
    10,491,627
  • Date Filed
    Thursday, September 29, 2016
    8 years ago
  • Date Issued
    Tuesday, November 26, 2019
    4 years ago
  • Inventors
  • Original Assignees
  • Examiners
    • Homayounmehr; Farid
    • Torres-Diaz; Lizbeth
    Agents
    • Rutan & Tucker, LLP
Abstract
A non-computerized method for detection of malware is described. First, an object for analysis is received. Thereafter, the content from the object is extracted and the extracted content is arranged into one or more basic blocks. Each basic block including at least a portion of the content. The object fingerprint is based on an analysis of the one or more basic blocks. Thereafter, the object fingerprint is generated based on an analysis of the one or more basic blocks. Lastly, the object fingerprint is compared to one or more malware family fingerprints to determine if the object is potentially malicious and may be associated with an advanced malware.
Description
FIELD

Embodiments of the disclosure relate to the field of cyber security. More specifically, embodiments of the disclosure relate to a system and method for detecting advanced malware, including zero-day malware, through analysis of data associated with an object and generation of a fingerprint for comparison with fingerprints associated with one or more malware families.


GENERAL BACKGROUND

Over the last decade, cybersecurity attacks have become a pervasive problem for internet users as many networked devices and other resources have been subjected to attack and compromised. The attack may involve the infiltration of malicious software onto a network device or concentration on an exploit residing within a network device to perpetrate the cybersecurity attack (generally referred to as “malware”). In most situations, malware is a program or file that is embedded within downloadable content and designed to allow or directly influence, undermine, disrupt, alter or otherwise attack normal operations of a network device. Examples of different types of malware may include bots, computer viruses, worms, Trojan horses, spyware, adware, or any other programming that operates within an electronic device without permission by a user of the electronic device or a network administrator responsible for protecting an enterprise network with which the electronic device is in communication. In some cases, the attack is designed to exploit a previously unknown vulnerability within software executing on a targeted network device.


Malware may be distributed through a variety of different attack vectors. For example, malware may be installed on a network device through activation of a uniform resource locator (URL), which redirects the user to unknowingly download content from a malicious web site for installation on his or her computer. Similarly, malware may also be installed on a network device upon receipt or opening of an electronic mail (email) message or an attachment with embedded executable malware (e.g., an infected document such as a Portable Document Format “PDF” or word processing document, an infected image, etc.). As yet another example, malware may exist in files that are uploaded from an infected network device onto a networked storage device such as a file share. Also, malware may be imbedded as part of a data stream that are directed to multiple (two or more) network devices. Identifying an advanced malware attack at the network device, such as a zero-day attack or a polymorphic malware attack for example, has been challenging.


A zero-day attack typically poses the substantial threat to an enterprise network. as these types of attacks are designed to exploit a previously unknown vulnerability within software executing on one or more targeted network devices, and often constitutes a previously unseen type of malware or malware that has not been detected before. In either case, no known signature is available for that malware. As “zero day” malware, by definition, has not been detected before, there are no known signatures for detection of this malware type. Accordingly, signature-based solutions typically fail to detect zero-day malware.


Moreover, advanced malware may co-opt and use previously whitelisted domains, i.e., domains not previously known to be malicious. Accordingly, solutions relying on domain-blacklists fail to be sufficiently effective. Finally, advanced malware is often polymorphic, and thus has signatures that change over time while retaining their core malicious functions, and, once again, may escape detection by such solutions.


Known malware detection systems effectively deal with these problems by employing virtualized behavior detection systems, typically at the periphery of an enterprise network. Unfortunately, the overhead necessary to run a virtualized behavior detection system in user space of a network device interferes and significantly impacts the user experience normally offered by a laptop or other endpoint device.





BRIEF DESCRIPTION OF THE DRAWINGS

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



FIG. 1A is a first exemplary embodiment of a network device deploying malware detection logic that is communicatively coupled to a security appliance implemented as part of the enterprise network.



FIG. 1B is a second exemplary embodiment of a network device deploying advanced malware detection logic that is communicatively coupled to cloud services.



FIG. 2 is an exemplary embodiment of the internal architecture of a network device of FIG. 1A or FIG. 1B.



FIG. 3 is a first exemplary embodiment of an operational flow of the advanced malware detection logic deployed within a network device of FIG. 1A or FIG. 1B in generating an object fingerprint based on analysis of disassembled instructions from binary data.



FIGS. 4A and 4B are exemplary embodiments of a control graph formulated during analysis of an incoming object by the advanced malware detection logic for use in generating basic blocks separately analyzed in the formation of an object fingerprint.



FIG. 5 is an exemplary embodiment of an operational flow of the advanced malware detection logic deployed within a network device of FIG. 1A or FIG. 1B in generating the object fingerprint based on disassembled instruction sequences for comparison with fingerprints associated with known malware families in determining whether the object is associated with a zero-day attack.



FIG. 6 is a second exemplary embodiment of an operational flow of the advanced malware detection logic deployed within a network device of FIG. 1A or FIG. 1B in generating the object fingerprint based on analysis of raw data.



FIG. 7 is an exemplary embodiment of an operational flow of the malware detection logic deployed within a network device of FIG. 1A or FIG. 1B in determining whether an object under analysis is advanced malware through object fingerprint comparisons.





DETAILED DESCRIPTION

Various embodiments of the disclosure relate to a system and method for detecting advanced malware through generation and comparison of an object fingerprint with malware family fingerprints. A “fingerprint” may be construed as a plurality of indicators that collectively identify an object under analysis. Each “indicator” uniquely corresponds to a representation of content that is part of the object, such as a hash result produced by performing a cryptographic hash operation (e.g., any type of Secure Hash Algorithm including SHA-256 or SHA-512) on the content. An example of content is ordered data that may include, but is not limited or restricted to the following: (i) a sequence of instructions (e.g., instructions sequenced in the order of disassembly) or (ii) a collection of raw “binary” data (e.g., data ordered as received or as transmitted). Herein, a fingerprint may be computed using a feature vector, namely a plurality of features each uniquely corresponding to a representation of ordered data that is being monitored. Herein, an “object fingerprint” refers to a fingerprint that is produced from data associated with an object under analysis while a “malware family fingerprint” refers to a fingerprint associated with a known category of malware (e.g., malware and variants of a malware).


I. SUMMARY

One embodiment of the disclosure is directed to advanced malware detection logic, which may be implemented as part of a network device. Herein, the advanced malware detection logic conducts an analysis of an object (referred to as a “similarity analysis”) in an attempt to classify the object as malicious or benign. This similarity analysis may include a determination of a level of correlation between indicators of an object fingerprint for an object under analysis (e.g., a hash results associated with a sequence of instructions, an ordered collection of raw “binary” data, or another type of ordered data associated with the object under analysis) and indicators associated with at least known malicious objects. According to one embodiment of the disclosure, this level of correlation may be ascertained by determining the number, percentage or ratio of indicators of the object fingerprint that compare to indicators for each of the malware family fingerprints, when all of the indicators of the malware family fingerprint being equally weighted. Alternatively, the level of correlation may be ascertained by determining whether a certain number of higher weighted indicators of a malware family fingerprint compare to indicators of the object fingerprint. The indicators with an increased weighting may be selected as those indicators whose presence denotes an increased likelihood of the object being associated with a malicious attack.


The advanced malware detection logic is configured to leverage machine learning and experiential knowledge of known malicious and perhaps benign software during its analysis of objects received by the network device to identify malicious software at any point in its attack lifecycle. The operations of the advanced malware detection logic may be conducted by a network device without compromising usability (user experience).


In accordance with one embodiment of the disclosure, the advanced malware detection logic conducts a “moving window” analysis of content, such as instructions that are disassembled from binary code of the object. The instructions are analyzed to generate an object control graph, which represents the operational flow of the object based on an analysis of the disassembled instructions without execution of these instructions. The object control graph features selected groupings of instructions (basic blocks) and control paths between these basic blocks. Thereafter, the advanced malware detection logic produces representations (e.g., hash results, results of reduced size than the sequence of instructions, etc.) for each basic block as defined by an adjusting (sliding) analysis window. These representations are compared to features of a feature vector, and when a representation matches one of the features, that feature is set. Hence, unique portions of the analyzed content are captured as a feature of the feature vector.


After completing analysis of the instructions that form the object control graph, the feature vector now represents an object fingerprint and each “set” feature represents an indicator of the object fingerprint. For classification of the object, the object fingerprint is compared to a plurality of malware family fingerprints. This comparison may involve a determination of a level of correlation between the object fingerprint and any malware family fingerprint, which may include a comparison of the indicators of the object fingerprint to malicious indicators of the malware family fingerprints (e.g., representations of sequences of instructions or ordered data typically used by a particular malware family). The malware family fingerprints may be fetched from a database accessible to the network device via a network, where some or all of the malware family fingerprints may be cached and updates of the malware family fingerprints may occur periodically or aperiodically, employing a “push” or “pull” methodology to secure these malware family fingerprints.


In accordance with another embodiment of the disclosure, the advanced malware detection logic conducts the moving window analysis of a collection of raw “binary” data associated with the object. Herein, the advanced malware detection logic treats the entire collection of binary data as a single basic block of an object control graph, where an illustrative example is described below. A sliding window (e.g., a first number of bytes that define a boundary for the analysis) along with a window step size (e.g., a second number of bytes that is less than the first number of bytes) are selected. As an illustrative example, with a fixed, sliding window of 128 bytes and a fixed, window step size of 16 bytes, the moving window analysis advances 16 bytes after each sliding window calculation of 128 bytes of binary data until a full window of binary data is not available. The iterative analysis creates representations of 16-byte subsets of binary data, which is used in the computation of the object fingerprint associated with the object under analysis by setting those features in the feature vector that match or have a certain level of correlation with that feature (e.g., a predetermined number of bytes match the representation associated with the feature). Thereafter, the feature vector constitutes the object fingerprint.


In accordance with yet another embodiment of the disclosure, a similar technique is applied to classify “unknown” objects, such as a binary object (executable) stored on or being processed by a network device. The technique may be applied, for example, pursuant to a schedule or upon execution of the binary object, not analysis of the content of the object. Significantly, this technique is employed at a network (endpoint) device during its normal operation and often in real time, either as a foreground process or background process.


The advanced malware detection logic deployed within a network device may be configured to conduct operations to detect advanced malware, including the following operations:

    • (1) extract and optionally disassemble an object (e.g., binary code, “raw” binary data) to create an object control graph (a graph of the control flow particular to the object);
    • (2) determine a size for a sliding window (of a size corresponding to the object type) for analysis of the object control graph and optionally the stepwise adjustment of the sliding window;
    • (3) analyze content of the object control graph to determine whether a certain degree of correlation exists between the collective content defined by iterative moving window analyses, where the analysis may involve a comparison of indicators that correspond to hash results associated with certain ordered data (e.g., sequence of instructions, group of binary data, etc.) to malicious and/or benign indicators that represent hash results associated with ordered data associated with known malware and/or benign objects;
    • (4) classify whether the degree of correlation indicates that the object is associated with advanced malware, in some embodiments employing a score generator to arrive at a level of classification (e.g., malicious or benign);
    • (5) if the object is considered to be malicious, determine the content (e.g., code as a sequence of instructions, group of binary data) corresponding to each sliding window, generate an identifier for each sliding window, and generate alerts of maliciousness for transmission to administrators and possible the endpoint user; and
    • (6) distribute the generated identifiers to static detection logic of the network device, to a security appliance or centralized management system on the network, and/or to a remote signature distribution service.


II. TERMINOLOGY

In the following description, certain terminology is used to describe features of the invention. For example, in certain situations, the term “logic” is 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; an application specific integrated circuit; receiver, transmitter and/or transceiver circuitry; semiconductor memory; combinatorial circuitry; or the like. It is contemplated that all logic components, typically represented by boxes in FIGS. 1A-7 herein, may be deployed as hardware, software and/or firmware.


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


The term “content” generally refers to information that is part of the object. One example of content may include one or more sequences of instructions such as opcode, for example, that is disassembled from binary code. Another example of content may include a collection of “raw” binary data (e.g., bits with logic “1” or “0” values). The “object” may include binary code (e.g., executable, dynamic link library “DLL”, etc.), which features one or more processor instructions. Also, the terms “compare,” “comparing,” “comparison” or any tense thereof generally mean determining if a predetermined level of correlation is achieved between two items, where one of the items may include a fingerprint associated with an object under analysis.


The term “object” generally refers to content, namely a collection of data in transit (e.g., propagating over a network) or at rest (e.g., stored), which has a logical structure or organization that enables it to be classified for purposes of analysis for malware. In one embodiment, an object may include an executable in any of a variety of file formats. As illustrative examples, the file formats may include Android™ APK, x86 Windows® supporting 32-bit or 64-bit operating system, Flash® files, or the like.


The term “network device” should be construed as any electronic device with the capability of processing data and 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 netbook, a mobile phone, a tablet, a computer, security appliance, a mainframe, a server, a router, a bridge, a switch, or other intermediary communication device, etc.). Other examples of a network device includes a sensor (described above) as well as a computing node, namely hardware and/or software that operates to receive information from a sensor, and when applicable, perform malware analysis on that information.


According to one embodiment, the term “malware” may be construed broadly as any code or activity that initiates a malicious attack or any operations associated with anomalous or unwanted behavior. For instance, as an illustrative embodiment, malware may correspond to a type of malicious computer code that executes an exploit to take advantage of a vulnerability in software. The undesirable or anomalous behaviors may include a communication-based anomaly or an execution-based anomaly, which, for example, could (1) alter the functionality of a network device executing application software in an atypical manner (a file is opened by a first process where the file is configured to be opened by a second process and not the first process); (2) alter the functionality of the network device executing that application software without any malicious intent; and/or (3) provide unwanted functionality which may be generally acceptable in another context. In yet another alternative, malware may correspond to information that pertains to the unwanted behavior such as a process that causes data such as a contact list from a network device to be uploaded by a network to an external storage device without receiving permission from the user.


The term “transmission medium” is a communication path between two or more network devices. The communication path may include wired and/or wireless segments. Examples of wired and/or wireless segments include electrical wiring, optical fiber, cable, bus trace, or a wireless channel using infrared, radio frequency (RF), or any other wired/wireless signaling mechanism.


In general, a “virtual machine” (VM) is a software that is configured to provide an isolated run-time execution of an object in accordance with one or more selected applications supported by one or more operating systems. The run-time execution mimics the performance of a targeted device.


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.


As this invention is susceptible to embodiments of many different forms, it is intended that the present disclosure is to be considered as an example of the principles of the invention and not intended to limit the invention to the specific embodiments shown and described.


III. GENERAL ARCHITECTURE

Referring to FIGS. 1A-1B, exemplary block diagrams of a malware detection system 100 is shown. The malware detection system 100 features one or more network devices 1101-110M (M≥1) that are communicatively coupled to a centralized system 120. As shown in FIG. 1A, according to one embodiment of the disclosure, the centralized system 120 may be a security appliance 130 that is configured to receive analysis results 140 from any of the network devices 1101-110M (e.g., network device 1101). The analysis results 140 may include an object fingerprint associated with an object that, upon analysis by the network device 1101, is determined, in accordance with a level of confidence (e.g., probability), to be associated with malware. Additionally, the analysis results 140 may further include a representation of the object under analysis (e.g., a hash result of the object, a pointer or link to the object, etc.) or the object itself. Of course, it is contemplated that the network device 1101 may send the analysis results 140 directly to a management system of the centralized system 120 (e.g., cloud-based management system, remotely located management system from the network devices 1101-110M, etc.) in lieu of the security appliance 130.


Based on the analysis results 140 from the network device 1101, the security appliance 130 generates a report 150 and/or alert 152 for transmission to a network administrator. The report 150 may include information from the analysis results 140, including a source of the object under analysis, information that identifies the probability of the object being malicious or benign, the know malicious family to which the object pertains (if malicious), or the like. The alert 152 may simply include signaling that initiating one or more messages (e.g., text message, email message, and/or automated phone call) to warn a network administrator of detection of a malicious object, namely an object having a level of confidence (e.g., probability) of being associated with a malicious attack (e.g., known vulnerability). The security appliance 130 may be further configured to conduct a secondary analysis of the object such as a static analysis of the object (e.g., bit pattern analysis, heuristic analysis, etc.) and/or a dynamic analysis (e.g., virtual machine based executing or processing of the object). Although not shown in detail, it is contemplated that a version of the report 150 and/or alert 152 may be transmitted from the network device 1101 to a network administrator or a management system that provides consolidation of reports.


As further shown in FIG. 1A, the security appliance 130 may be implemented as a network device that is either coupled to the transmission medium 160 directly or communicatively coupled with the transmission medium 160 via an interface (not shown) operating as a data capturing device. For the later embodiment, the interface may operate as a network tap that extracts information from data traffic propagating over the transmission medium 160.


The one or more network devices 1101-110M, sometimes identified as “network device(s),” may be located on-site at an enterprise premises (e.g., part of the enterprise network infrastructure located at a single facility utilized by the customer or at a plurality of facilities). Alternatively, the network device(s) 1101-110M may be mobile devices that communicate with the centralized system 120 located on-site (e.g. at enterprise's premises) or located outside the enterprise network infrastructure, such as cloud-based services 170 of FIG. 1B. The cloud-based services 170 may be hosted by a cybersecurity provider or another entity separate from the customer (enterprise).


Each network device 1101-110M includes an agent 180 that conducts a similarity analysis of an object by determining a level of correlation between indicators associated with a fingerprint pertaining to an object under analysis and indicators associated with a fingerprint pertaining to known malicious and/or benign objects. This level of correlation may be partially or solely used for classification of the object as malicious, benign or suspicious (where not definitely malicious or benign). Herein this level of correlation may be determined by comparing an object fingerprint associated with the object under analysis, where each indicator of the object fingerprint may correspond to a representation of ordered data (e.g., a sequence of instructions, an ordered collection of raw “binary” data, etc.) to indicators of malware family fingerprints. Also, the ordered data for a representation pertains to ordered data within a sliding window (as described below) and different types of representations may include a hash result of the ordered data (e.g., SHA-256 result, MD5 result, SHA-512 result, etc.) or any logical operation on the ordered data that produces the result having a lesser size than the ordered data. The indicators of the object fingerprint are then compared to malicious indicators of one or more malware family fingerprints. The agent 180 may be configured as hardware or as software executed by hardware deployed within a corresponding network device 1101, . . . , or 110M, as described in FIG. 2.


Referring now to FIG. 2, an exemplary embodiment of a logical representation of the architecture of one of the network devices 1102-110M, such as network device 1101 for example, is shown. The network device 1101 includes a housing 200, 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 200. Examples of the circuitry may include one or more processors (hereinafter “processor(s)”) 210, communication interface logic 220, transmission medium 230 and internal storage 240.


As shown, communication interface logic 220 enables communications with other network devices to receive objects for analysis and to output results of the analysis. The communication interface logic 220 is further configured to receive updates to the agent 180. According to one embodiment of the disclosure, communication interface logic 220 may be implemented as a physical interface including one or more ports for wired connectors. Additionally, or in the alternative, communication interface logic 220 may be implemented with one or more radio units for supporting wireless communications with other wireless network devices.


Processor(s) 210 is coupled to the internal storage 240 via transmission medium 230. According to one embodiment of the disclosure, the internal storage 240 includes an object data store 250, a malware family fingerprint data store 252 that operates as cache memory for the malware family fingerprints, and the agent 180 including advanced malware detection logic 254. The advanced malware detection logic 254 includes (a) object identification logic 260, (b) frontend logic 270, and (c) backend logic 280. Although represented as software, the agent 180 or portions of the agent 180 may be configured as hardware, firmware or a collection thereof.


The object identification logic 260 is configured to categorize an object that is being analyzed by the advanced malware detection logic 254. According to one embodiment of the disclosure, the object identification logic 260 categorizes the object by at least determining the object type as different object types require different methods of disassembling and different sliding window sizes. Different object types may include, but are not limited or restricted to Android™ APKs, x86 Windows® binaries, flash files, or the like. Alternatively, or in combination with the object type analysis, the object identification logic 260 may operate to categorize (or further categorize) the object based on the type of operating system (OS) utilized by that object.


The frontend logic 270 is responsible for performing operations to generate an object control graph that is used in the computation of an object fingerprint for the object. According to one embodiment, the frontend logic 270 includes disassembly logic 272, instruction sequence aggregation logic 274 and control flow generation logic 276. The disassembly logic 272 is configured to detect whether the object is binary code, and if so, disassembles the binary code into instruction sequences. Depending on the category selected for the object by the object identification logic 260, the disassembly logic 272 may perform different disassembly operations on the object.


For instance, where the object is an Android™ APK, the disassembly logic 272 may operate as a utility (dexdump) where the output includes opcode (instructions) associated with the Android™ APK under analysis. As another example, where the object is an x86 Windows® binary, the disassembly logic 272 may operate the objdump utility where the output includes opcode (instructions) associated with the binary. As yet another example, where the object is flash file, the disassembly logic 272 may operate an ActionScript program to convert the flash file into opcode (instructions).


Thereafter, after translation of the object into a sequence of instructions, the instruction sequence aggregation logic 274 arranges the instructions into basic blocks. A “basic block” includes one or more instructions that are to be executed in sequence and the sequence completes without a change in control flow. The change in control flow may involve a transition of execution flow without completing an operation associated with the executed instruction (e.g., a Jump instruction, etc.). Hence, parsing through the sequence of instructions, the instruction sequence aggregation logic 274 may produce one or more basic blocks that may be operating sequentially (in serial) and/or in parallel.


Based on the analytic (basic block) information, the control flow generation logic 276 generates a nodal graph (referred to as an “object control graph”). The object control graph is a logical representation of relationships between objects and properties formulated from the analytic information. For instance, for illustrative purposes, each basic block may be logically represented as a node in the object control graph. The control flow may be represented by one or more links (or edges) between the nodes, where multiple links may logically represent multiple paths from an object or multiple paths to an object.


The backend logic 280 is responsible for generating an object fingerprint associated with the object, classifying the object fingerprint for determining whether the object fingerprint is a variant of a malware family fingerprint, and providing the object fingerprints to a separate “knowledge” server based on their classification. Optionally, although not shown, the backend logic 280 may include logic for generating reports that include information based on operations conducted by the classification logic 286. According to one embodiment, the backend logic 280 includes fingerprint generation logic 282, clustering logic 284 and classification logic 286.


The fingerprint generation logic 282 is responsible for analyzing the object control graph associated with the object and generating an object fingerprint based on such analysis. For example, the fingerprint generation logic 282 may be configured to parse an object control graph in accordance with a “moving” window analysis, where the window size may be fixed or may vary, perhaps based on the object type (e.g., window size for APK-type objects being different than window size for x86 Windows® object). For an architecture supporting variable-length sliding windows, metadata for use in determining the sliding window size would need to be provided to the fingerprint generation logic 282. For example, metadata associated with the object type may be provided from the disassembly logic 272 of the frontend logic 270, where the metadata may be used by the fingerprint generation logic 282.


Thereafter, for each subset of instructions or ordered binary data within a basic block of an object control graph that fills an entire sliding window, a representation of the subset of instructions or the ordered binary data is generated (e.g., hash result, result of a lesser bit size that the subset of instructions or ordered binary data). The representation is compared to values within one or more entries of a feature vector, where each feature may correspond to a representation of a predetermined sequence of instructions or a collection of ordered data that is chosen to be monitored. In response to a successful comparison of a representation produced from the similarity analysis to a representation corresponding to a feature of the feature vector, that feature is tagged or set. This operation is performed in an iterative manner until parsing of the object control graph in accordance with the sliding window analysis has completed. Upon completing the parsing of the object control graph, the feature vector corresponds to an object fingerprint for the object under analysis.


The classification logic 286 is responsible for determining whether the object under analysis is potentially malicious or benign, which may be handled by comparing the object fingerprint to one or more malware family fingerprints, some of which may be stored locally within the malware family fingerprint data store 252. In particular, the classification logic 286 conducts (or at least controls) a comparison between indicators of the object fingerprint and corresponding indicators of the malware family fingerprints. This comparison may involve determining whether a number of indicators of the object fingerprint that match a malware family fingerprint exceeds a prescribed threshold value. Alternatively, the comparison may involve a weighted determination in which a matching of some indicators of the object fingerprint to indicators of a malware family fingerprint denotes a comparison.


The clustering logic 284 is responsible for directing the object fingerprint, when determined to be malicious, to a knowledge database or other server that is configured to maintain fingerprints associated with detected malicious object fingerprints.


IV. FINGERPRINT DETECTION METHODOLOGY—BINARY CODE

Referring to FIG. 3, a first exemplary embodiment of operations conducted by the advanced malware detection logic deployed within a network device of FIG. 1A or FIG. 1B in generating an object fingerprint is shown. Herein, in response to receipt of an incoming object (e.g., intercepted during transit over a network, uploaded from a storage device, etc.), the advanced malware detection logic determines the object type (element 300). This determination may include an analysis of the content of the object and/or the format of the object. For instance, as an illustrative example, the object type may be determined by review of a header of the object and magic numbers which are constant numerical or text values used to identify a file format or protocol.


When the object is determined to be a first object type (e.g., Android™ APK), the advanced malware detection logic conducts a disassembly operation on the object to recover instructions forming at least part of the object, and thereafter, determines one or more sequences of instructions each pertaining to a particular basic block of an object control graph (elements 310 and 320). Sequential instructions are placed in the same basic block when there is no change in control flow between these instructions. However, in response to a change in control flow (e.g., presence of a conditional instruction, Jump instructions, Goto instruction, etc.), a new basic block is generated in the object control graph for instructions associated with the control flow change. The grouping of instructions within basic blocks, which are based on changes in control flow, is continued until all of the dissembled instructions have been represented within the object control graph.


Similarly, when the object is determined to be either a second object type (e.g., x86 Windows® binary) or a third object type (e.g., Flash file), the advanced malware detection logic conducts a disassembly operation on the object to recover the instructions forming at least part of the object, and thereafter, determines sequences of instructions that pertain to a particular basic block as described above (elements 312 & 322 and/or elements 314 & 324).


The basic blocks form nodes of the object control graph with edges (links) that are illustrative of the control flow, as shown in FIG. 4A. The content of the object, which may be represented by the object control graph, is analyzed to compute an object fingerprint (element 330), which undergoes a classification operation to determine whether the object fingerprint compares to any malware family fingerprint, namely the level of correlation between the object fingerprint and a malware family fingerprint exceeds a threshold (element 340). If so, the object fingerprint that is determined to be malicious may be uploaded to a remote destination (e.g., remote data server such as security appliance 130 of FIG. 1) for subsequent analysis in clustering this fingerprint to other similar malicious fingerprints (e.g., malware family fingerprints) stored in a knowledge database (element 350).


As shown in FIG. 4A, an illustrative embodiment of an object control graph 400 includes a plurality of basic blocks 410 (e.g., six basic blocks “Bx” 4101-4106) and edges 4201-4207 illustrative of the control path between basic blocks 4101-4106. As shown, a first basic block (B1) 4101 includes four instructions, a third basic block (B3) 4103 includes three instructions and the remainder of the basic blocks B24102 and B44104-B64106 include a single instruction. Upon setting of the sliding window to a fixed size of “n” instructions (e.g., n=3 instructions for this embodiment), the moving window analysis would detect three (3) instruction sequences as potential indicators for an object fingerprint of the object, as shown in FIG. 4B. According to this embodiment, the instruction sequences less than the window size (e.g., 3 instructions) in the sequence are ignored in order to avoid a setting of high number of indicators in the feature vector that may cause unacceptable levels of false positives in malware analysis.


In particular, in accordance with the sliding window-based analysis, a sliding window would capture a first sequence of instructions 450 within basic block 4101, namely instructions Inst_1, Inst_2 and Inst_3. Thereafter, the advanced malware detection logic would conduct an operation on the first sequence of instructions 450, such as a one-way hash operation for example, to generate a representation 455 of the first sequence of instructions 450 that operates and determine whether the representation 455 compares with any features 465 for the feature vector 460, where the features 465 represent instruction sequences being monitored. If so, an indicator 4701 corresponding to the feature 4651 within the feature vector 460 is set.


As further shown in FIG. 4B, in accordance with the moving window analysis, a sliding window would capture a second sequence of instructions 475 within basic block 4101, namely Inst_2, Inst_3 and Inst_4. Thereafter, the advanced malware detection logic would conduct an operation on the second sequence of instructions 475 to generate a representation 480 of the second sequence of instructions 475. When the representation 480 compares to a different feature 4652 of the feature vector 460, an indicator 4702 associated with the feature is set.


Thereafter, a sliding window would capture a third sequence of instructions 485 within the third basic block 4103, namely Inst_5, Inst_6 and Conditional_2 in third basic block 4103. Thereafter, the advanced malware detection logic would conduct an operation on the third sequence of instructions 485 to generate a representation 490 of the third sequence of instructions 485. When the representation 490 compares to yet another different feature 4653 of the feature vector 460, the indicator 4703 of feature 4653 is set. For the illustrative example, as there are no further basic blocks having a size equal to or greater than the window size, no further indicators may be set.


Referring now to FIG. 5, is a first flowchart illustrating an exemplary method for generating an object fingerprint is described below. Initially, a window size may be selected in order to control how sequences of instructions that pertain to one or more basic blocks within the object control graph are parsed (element 500). The window size may influence the number of false positives (smaller windows) or number of false negatives (larger windows) encountered during operability of the malware detection system.


According to one embodiment of the disclosure, the window size may be set to a static, fixed value (e.g., a number of instructions, a number of bytes, etc.). The fixed value for the window size may be in accordance with a default setting that is established by the original equipment manufacturer/software provider. Alternatively, the fixed value for the window size may be selected by a user of the network device or a network administrator during registration of the network device for use on an enterprise network.


According to another embodiment of the disclosure, the window size may be varied based, at least in part, on the expressiveness of the instruction set servicing the particular type of object under analysis. For instance, the variable window size for an Android® APK object is substantially smaller than the variable window size for an x86 Windows® binary because a Delvik® instruction used in an Android™ device is more expressive (i.e., perform more operations) than an x86 instruction. Additionally, or in the alternative, the window size may be varied based on the content itself (e.g., instruction boundaries). For instance, some instruction sets have variable-length instructions, so sliding windows typically represent different number of bytes dependent on the instructions utilized for a specific object type.


Referring still to FIG. 5, upon selecting the window size, a first sequence of instructions associated with the object under analysis is obtained (elements 510 and 515). Based on a moving window analysis and the number of instructions in the first sequence is equal to or exceeds the window size, a representation (e.g., hash result) of a first subset of instructions is obtained (element 520). If the representation of the first subset of instructions compares with any indicators of the feature vector, the indicator is set to denote that the object includes the corresponding instruction sequence (elements 530-535).


Next, for the same basic block, a determination is made as to whether all subsets of the instructions within the basic block have been analyzed, where each neighboring subset of instructions shares at least one instruction (or multiple instructions) with another neighboring subset of instructions (element 540). If all subsets have not been analyzed, the sliding window is adapted to “slide” by a determined number of instructions (e.g., one instruction, two instructions, etc.) to capture a next subset of instructions that are part of the sequence of instructions within the analysis window (element 545). However, if all subsets of the instructions within the basic block have been analyzed, a determination is made whether all sequences in different basic blocks have been analyzed (element 550). If not, the next sequence of instructions within a different basic block is determined and analyzed, as described in elements 515-555. Otherwise, the object fingerprint has been generated for the object (element 560).


V. FINGERPRINT DETECTION METHODOLOGY—RAW DATA

Referring now to FIG. 6, an exemplary embodiment of an operational flow of the malware detection logic deployed within a network device of FIG. 1A or FIG. 1B in generating the object fingerprint based on analysis of raw data is shown. In response to receipt of an incoming object, the advanced malware detection logic determines the object type (element 600). This determination may include an analysis of the content of the object and/or the format of the object. Where the content is a collection of raw “binary” data without identification of the object type, the advanced malware detection logic places the binary data in order of receipt into a single basic block (elements 610 and 620).


A sliding window (e.g., a first number “X” of bytes that define a boundary for the analysis) along with a window step size (e.g., a second number “Y” of bytes that is less than or equal to the first number of bytes) are selected (elements 630 and 640). Herein, a representation of a grouping of bytes (e.g., first X bytes of the ordered binary data) is determined, and thereafter, a representation of a second grouping of bytes (e.g., X+1st byte to 2X byte) is determination. The analysis creates representations of the X-byte subsets of binary data, which are used in the computation of the object fingerprint by setting features in the feature vector that correspond to the representations for these X-byte subsets (elements 650 and 660).


VI. ADVANCED MALWARE DETECTION

Referring to FIG. 7, an exemplary embodiment of an operational flow of the advanced malware detection logic deployed within a network device of FIG. 1A or FIG. 1B is shown, where the operational flow is directed to a determination as to whether an object under analysis is advanced malware. This determination may involve fingerprint comparisons. More specifically, the advanced malware detection logic has generated an object fingerprint as described above. The advanced malware detection logic compares the object fingerprint to fingerprints that are associated with a white list of benign fingerprints (element 700). If the level of correlation between the object fingerprint and any of the benign fingerprints exceeds a threshold, the object is benign. Hence, no further classification operations are needed, but the object fingerprint may be provided to a remote source for further analysis and placement in the knowledge database (element 710).


Otherwise, the advanced malware detection logic is provided access to malware family fingerprints (element 720). These malware family fingerprints may be stored locally in the malware family fingerprint data store 252 of FIG. 2 or accessed from a remote source. With access to content of the malware family fingerprints, the advanced malware detection logic, and in particular the classification logic 286 of FIG. 2, conducts a comparison between indicators of the object fingerprint and corresponding indicators for one or more of the malware family fingerprints (element 730). This comparison may involve determining whether the number of indicators of the object fingerprint that match indicators of a particular malware family fingerprint exceeds a prescribed threshold value. Alternatively, the comparison may involve a weighted determination in which a matching of indicators of the object fingerprint with certain indicators of a malware family fingerprint denotes a comparison.


If the level of correlation between the object fingerprint and any of the malware family fingerprints exceeds a threshold, the object represented by the object fingerprint is determined to be associated with a malicious attack (element 750). The object fingerprint and metadata associated with the object fingerprint (e.g., compared malware family, source, etc.) is further provided to the remote source for placement into the knowledge database, which may be used as one of the malware family fingerprints for subsequent analysis (element 760). Otherwise, the object fingerprint may undergo additional analysis at the network device (or remote source) as represented by dashed lines 770.


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 non-transitory storage medium having stored thereon instructions corresponding to malware detection logic including as part of a software agent operating within a network device, the malware detection logic being executable by one or more processors to perform operations comprising: receiving an object for analysis;extracting content from the object, the content includes a first plurality of instructions recovered from binary code of the object;arranging the extracted content into one or more basic blocks, each basic block of the one or more basic blocks including at least an instruction sequence corresponding to two or more instructions of the first plurality of instructions;generating, by the network device, an object fingerprint based on an analysis of the one or more basic blocks by at least (i) generating a representation of each instruction sequence of the one or more basic blocks, (ii) aggregating one or more representations associated with each instruction sequence of the one or more basic blocks, and (iii) comparing each of the one or more aggregated representations to a plurality of instruction sequences being monitored as being potentially malicious to produce a result, the result corresponding to the object fingerprint;analyzing, by the network device, the object fingerprint by at least comparing the object fingerprint to one or more malware family fingerprints to determine whether the object is potentially malicious and associated with an advanced malware; andgenerating information, based on the analyzing of the object fingerprint, for transmission from the network device to a second network device.
  • 2. The non-transitory storage medium of claim 1, wherein the generating of the information for transmission to the second network device includes comparing of the object fingerprint to the one or more malware family fingerprints and the second network devices corresponds to a security appliance that is configured to conduct a secondary malware analysis of the object.
  • 3. The non-transitory storage medium of claim 1, wherein each representation being a hash result generated from a corresponding instruction sequence.
  • 4. The non-transitory storage medium of claim 1, wherein the arranging the extracted content comprises arranging the first plurality of instructions in accordance with an operational flow of the object, the operational flow is determined from an analysis of an order of execution of the first plurality of instructions without execution of the first plurality of instructions; andsegmenting the first plurality of instructions arranged in accordance with the operational flow into the one or more basic blocks,wherein each instruction for each basic block of the one or more basic blocks completes operation without a change in control flow.
  • 5. The non-transitory storage medium of claim 1, wherein the arranging the extracted content comprises generating an object control graph including the one or more basic blocks.
  • 6. The non-transitory storage medium of claim 5, wherein the generating of the object control graph comprises arranging the first plurality of instructions in accordance with a determined order that is based, at least in part, on an order of execution of the first plurality of instructions without execution of the first plurality of instructions; andsegmenting the first plurality of instructions arranged in accordance with the determined order into the one or more basic blocks,wherein each instruction for each instruction sequence of the one or more basic blocks completes operation without a change in control flow.
  • 7. The non-transitory storage medium of claim 3, wherein each instruction of the instruction sequence completes operation without a change in control flow.
  • 8. The non-transitory storage medium of claim 1, wherein the generating of the representation of each instruction sequence of the one or more basic blocks comprises generating a first representation of a first instruction sequence that includes a selected number of instructions, the first instruction sequence included as a first block of the one or more basic blocks, the first representation corresponds to a hash result produced by performing a hash operation on the first instruction sequence.
  • 9. The non-transitory storage medium of claim 8, wherein the generating of the representation of each instruction sequence of the one or more basic blocks further comprises generating a first representation of a first subset of a second instruction sequence of a second basic block of the one or more basic blocks; andgenerating a second representation of a second subset of the second instruction sequence,wherein the first subset of the second instruction sequence differs from the second subset of the second instruction sequence and the first subset of the second instruction sequence sharing at least one instruction with the second subset of the second instruction sequence.
  • 10. The non-transitory storage medium of claim 9, wherein the first subset of the second instruction sequence and the second subset of the second instruction sequence are selected through a sliding analysis window having a width corresponding to the selected number of instructions.
  • 11. The non-transitory storage medium of claim 1, wherein the generating of the representation of each instruction sequence of the one or more basic blocks comprises generating a first representation of a first subset of a first instruction sequence of a first basic block of the one or more basic blocks; andgenerating a second representation of a second subset of the first instruction sequence,wherein the first subset of the first instruction sequence differs from the second subset of the first instruction sequence and the first subset of the first instruction sequence sharing at least one instruction with the second subset of the first instruction sequence.
  • 12. The non-transitory storage medium of claim 11, wherein the first subset of the first instruction sequence and the second subset of the first instruction sequence are selected through a sliding analysis window having a width corresponding to a selected number of instructions being lesser in number than a number of instructions forming the first basic block.
  • 13. The non-transitory storage medium of claim 1, wherein prior the generating of the object fingerprint, selecting a width of an analysis window to a selected number of instructions, the analysis window being used in the generating of the representation of each instruction sequence of the one or more basic blocks that includes at least the selected number of instructions.
  • 14. The non-transitory storage medium of claim 1, wherein the information for transmission includes a report based on the analyzing of the object fingerprint, the report includes one or more of (i) a source of the object, (ii) a probability of the object being malicious or benign, or (iii) a known malicious family to which the object pertains.
  • 15. The non-transitory storage medium of claim 1, wherein the information for transmission comprises includes an alert including one or more messages to warn of detection of the obj ect as a malicious object.
  • 16. A computerized method for detection of malware, comprising: receiving an object for analysis;extracting content from the object, the content includes a first plurality of instructions recovered from non-binary code of the object;arranging the extracted content into one or more basic blocks, each basic block including at least an instruction sequence corresponding to two or more instructions of the first plurality of instructions;generating an object fingerprint based on an analysis of the one or more basic blocks by malware detection logic, operating within a network device, at least (i) generating a representation of each instruction sequence of the one or more basic blocks, (ii) aggregating one or more representations associated with each instruction sequence of the one or more basic blocks, and (iii) comparing each of the one or more aggregated representations to a plurality of instruction sequences being monitored as being potentially malicious to produce a result, the result corresponding to the object fingerprint;analyzing the object fingerprint by at least comparing the object fingerprint to one or more malware family fingerprints to determine whether the object is potentially malicious and associated with an advanced malware; andgenerating information, based on the analyzing of the object fingerprint, for transmission from the network device to a second network device.
  • 17. The method of claim 16, wherein the generating of the information for transmission includes the comparing of the object fingerprint to the one or more malware family fingerprints, for transmission to the network device being a security appliance that is configured to conduct a secondary malware analysis of the object.
  • 18. The method of claim 16, wherein the content includes the first plurality of instructions disassembled from the binary code of the object.
  • 19. The method of claim 18, wherein the arranging the extracted content comprises arranging the first plurality of instructions in accordance with an operational flow of the object, the operational flow is determined from an analysis of an order of execution of the first plurality of instructions without execution of the first plurality of instructions; andsegmenting the first plurality of instructions arranged in accordance with the operational flow into the one or more basic blocks,wherein each instruction for each basic block of the one or more basic blocks completes operation without a change in control flow.
  • 20. The method of claim 18, wherein the arranging the extracted content comprises generating an object control graph including the one or more basic blocks.
  • 21. The method of claim 20, wherein the generating of the object control graph comprises arranging the first plurality of instructions in accordance with a determined order that is based, at least in part, on an order of execution of the first plurality of instructions without execution of the first plurality of instructions; andsegmenting the first plurality of instructions arranged in accordance with the determined order into the one or more basic blocks, each of the one or more basic blocks includes one or more instructions of the first plurality of instructions that correspond to an instruction sequence and each instruction of the instruction sequence completes operation without a change in control flow.
  • 22. The method of claim 18, wherein each instruction of the instruction sequence completes operation without a change in control flow.
  • 23. The method of claim 16, wherein the generating of the representation of each instruction sequence of the one or more basic blocks comprises generating a first representation of a first instruction sequence that includes a selected number of instructions, the first representation corresponds to a hash result produced by performing a hash operation on the first instruction sequence.
  • 24. The method of claim 23, wherein the generating of the representation of each instruction sequence of the one or more basic blocks that includes at least the selected number of instructions further comprises generating a first representation of a first subset of a second instruction sequence of a second basic block of the one or more basic blocks; andgenerating a second representation of a second subset of the second instruction sequence,wherein the first subset of the second instruction sequence differs from the second subset of the second instruction sequence and the first subset of the second instruction sequence sharing at least one instruction with the second subset of the second instruction sequence.
  • 25. The method of claim 24, wherein the first subset of the second instruction sequence and the second subset of the second instruction sequence are selected through a sliding analysis window having a width corresponding to the selected number of instructions.
  • 26. The method of claim 16, wherein the generating of the representation of each instruction sequence of the one or more basic comprises generating a first representation of a first subset of a first instruction sequence of a first basic block of the one or more basic blocks, wherein the first instruction sequence includes a selected number of instructions and the first basic block includes a number of instructions greater than the selected number of instructions; andgenerating a second representation of a second subset of the first instruction sequence,wherein the first subset of the first instruction sequence differs from the second subset of the first instruction sequence and the first subset of the first instruction sequence sharing at least one instruction with the second subset of the first instruction sequence.
  • 27. The method of claim 26, wherein the first subset of the first instruction sequence and the second subset of the first instruction sequence are selected through a sliding analysis window having a width corresponding to the selected number of instructions.
  • 28. The method of claim 16, wherein prior the generating of the object fingerprint, selecting a width of an analysis window to a selected number of instructions, the analysis window being used in the generating of the representation of each instruction sequence of the one or more basic blocks that includes at least the selected number of instructions.
  • 29. The method of claim 16, wherein the information for transmission includes a report based on the analyzing of the object fingerprint, the report includes one or more of (i) a source of the object, (ii) a probability of the object being malicious or benign, or (iii) a known malicious family to which the object pertains.
  • 30. The method of claim 16, wherein the information for transmission comprises includes an alert including one or more messages to warn of detection of the object as a malicious object.
  • 31. A network device, comprising: a transmission medium;one or more hardware processors coupled to the transmission medium;communication interface logic coupled to the transmission medium, the communication interface logic to receive an object for analysis; anda memory coupled to the transmission medium, the memory comprises disassembly logic that, when executed by the one or more hardware processors, extracts content from the object, the content includes a first plurality of instructions recovered from binary code of the object,aggregation logic that, when executed by the one or more hardware processors, arranges the extracted content into one or more basic blocks, each basic block including at least an instruction sequence corresponding to two or more instructions of the first plurality of instructions, andfingerprint generation logic that, when executed by the one or more hardware processors, generates an object fingerprint based on an analysis of the one or more basic blocks by at least (i) generating a representation of each instruction sequence of the one or more basic blocks, (ii) aggregating one or more representations associated with each instruction sequence of the one or more basic blocks, and (iii) comparing each of the one or more aggregated representations to a plurality of instruction sequences being monitored as being potentially malicious to produce a result, the result corresponding to the object fingerprint;classification logic that, when executed by the one or more hardware processors, analyzes the object fingerprint by at least comparing the object fingerprint to one or more malware family fingerprints to determine whether the object is potentially malicious; andlogic that, when executed by the one or more hardware processors, generates information resulting from analysis of the object fingerprint by the classification logic, for transmission from the network device to a second network device.
  • 32. The network device of claim 31, wherein the information for transmission includes a report based on the analyzing of the object fingerprint, the report includes one or more of (i) a source of the object, (ii) a probability of the object being malicious or benign, or (iii) a known malicious family to which the object pertains.
  • 33. The network device of claim 31, wherein the information for transmission comprises includes an alert including one or more messages to warn of detection of the object as a malicious object.
  • 34. The network device of claim 31, wherein the aggregation logic arranges the extracted content by at least arranging the first plurality of instructions in accordance with an operational flow of the object, the operational flow is determined from an analysis of an order of execution of the first plurality of instructions without execution of the first plurality of instructions; andsegmenting the first plurality of instructions arranged in accordance with the operational flow into the one or more basic blocks,wherein each instruction for each basic block of the one or more basic blocks completes operation without a change in control flow.
  • 35. The network device of claim 31, wherein the aggregation logic arranges the extracted content to at least generate an object control graph including the one or more basic blocks.
  • 36. The network device of claim 35, wherein the aggregation logic to generate the object control graph by at least arranging the first plurality of instructions in accordance with a determined order that is based, at least in part, on an order of execution of the first plurality of instructions without execution of the first plurality of instructions; andsegmenting the first plurality of instructions arranged in accordance with the determined order into the one or more basic blocks,wherein instruction for each instruction sequence of the one or more basic blocks completes operation without a change in control flow.
  • 37. The network device of claim 31, wherein each instruction of the instruction sequence completes operation without a change in control flow.
  • 38. The network device of claim 31, wherein the fingerprint generation logic to generate the representation of each instruction sequence of the one or more basic blocks by at least generating a first representation of a first instruction sequence that includes a selected number of instructions, the first instruction sequence included as a first block of the one or more basic blocks, the first representation corresponds to a hash result produced by performing a hash operation on the first instruction sequence.
  • 39. The network device of claim 31, wherein the fingerprint generation logic to further generate the representation of each instruction sequence of the one or more basic blocks by at least generating a first representation of a first subset of a second instruction sequence of a second basic block of the one or more basic blocks; andgenerating a second representation of a second subset of the second instruction sequence,wherein the first subset of the second instruction sequence differs from the second subset of the second instruction sequence and the first subset of the second instruction sequence sharing at least one instruction with the second subset of the second instruction sequence.
  • 40. The network device of claim 39, wherein the first subset of the second instruction sequence and the second subset of the second instruction sequence are selected through a sliding analysis window having a width corresponding to the selected number of instructions.
US Referenced Citations (723)
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
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
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
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 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 Shiffer 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
9824209 Ismael et al. Nov 2017 B1
9824211 Wilson Nov 2017 B2
9824216 Khalid et al. Nov 2017 B1
9825976 Gomez et al. 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
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 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 Cowbum 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
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
20090210364 Adi 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 et al. 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
20110047620 Mahaffey et al. Feb 2011 A1
20110055907 Narasimhan et al. Mar 2011 A1
20110078794 Manni 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
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
20120222121 Staniford et al. Aug 2012 A1
20120255015 Sahita et al. Oct 2012 A1
20120255017 Sallam Oct 2012 A1
20120260342 Dube et al. Oct 2012 A1
20120266244 Green et al. 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
20130282630 Attenberg Oct 2013 A1
20130290263 Beaverson 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
20140165203 Friedrichs 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
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
20150269495 Dalessandro Sep 2015 A1
20150286821 Ghose Oct 2015 A1
20150326585 Topan Nov 2015 A1
20150372980 Eyada Dec 2015 A1
20150381637 Raff Dec 2015 A1
20160004869 Ismael et al. Jan 2016 A1
20160006756 Ismael et al. Jan 2016 A1
20160044000 Cunningham Feb 2016 A1
20160127393 Aziz et al. May 2016 A1
20160191547 Zafar et al. Jun 2016 A1
20160191550 Ismael et al. Jun 2016 A1
20160261612 Mesdaq et al. Sep 2016 A1
20160285914 Singh et al. Sep 2016 A1
20160301703 Aziz Oct 2016 A1
20160335110 Paithane et al. Nov 2016 A1
20170076090 Horne Mar 2017 A1
20170083703 Abbasi et al. Mar 2017 A1
20170098074 Okano Apr 2017 A1
20170300691 Upchurch Oct 2017 A1
20180013770 Ismael Jan 2018 A1
20180013772 Schmidtler Jan 2018 A1
20180048660 Paithane et al. Feb 2018 A1
20180121316 Ismael et al. May 2018 A1
20180183815 Enfinger Jun 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 (57)
Entry
“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-d/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 Doom, 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).
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.