US 9,536,091 B2Grant
System and method for detecting time-bomb malware
Issue Date:2017-01-03
•20 Claims
•8 Drawing Sheets
Abstract
According to one embodiment, a system comprises one or more counters; comparison logic; and one or more hardware processors communicatively coupled to the one or more counters and the comparison logic. The one or more hardware processors are configured to instantiate one or more virtual machines that are adapted to analyze received content, where the one or more virtual machines are configured to monitor a delay caused by one or more events conducted during processing of the content and identify the content as including malware if the delay exceed a first time period.
Metadata
Assignee
- FireEye, Inc.
Inventors
- Sushant Paithane
- Michael Vincent
- Sai Vashisht
- Darien Kindlund
Application Information
Application Number:US 13/925,737
Filing Date:2013-06-24
Priority Date:2013-06-24
Art Unit:2435
Classifications
IPC:
G06F21/55G06F21/56H04L29/06
Field of Search:
G06F 21/566G06F 21/56G06F 21/53G06F 21/554H04L 63/145H04L 63/1416
Patent Drawings (8 sheets)
Description
Field
[0001] Embodiments of the disclosure relate to the field of data security. More specifically, one embodiment of the disclosure relates to a system, apparatus and method that enhances detection of time-bomb malware, namely malware with delayed activation.
General Background
[0002] Over the last decade, malicious software (malware) attacks have become a pervasive problem for Internet users and enterprise network administrators. In most situations, malware is a program or file that is embedded within downloadable content and designed to adversely influence or attack normal operations of an electronic device (e.g. computer, tablet, smartphone, server, router, wearable technology, or other types of products with data processing capability). 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 the user or a system administrator.
[0003] Over the past few years, various types of security appliances have been deployed within an enterprise network in order to detect behaviors that signal the presence of malware. Some of these security appliances conduct dynamic analysis on suspicious content within a sandbox environment in order to determine if malware is present. As a result, some malware is now being coded to evade analysis within a sandbox environment.
[0004] Currently, there are various techniques that malware is using to evade sandboxed malware analysis. They can be broadly categorized as:
- [0005] [1] Environment checking: Malware checks for several environmental facts to identify whether it is being run in a sandbox. In response, the malware may halt its execution to avoid detection upon sandbox detection. This may be accomplished by the malware querying for a CPUID string;
- [0006] [2] User Interaction: Malware will not perform any malicious activity until some user interaction is provided, contrary to capabilities of most sandbox environments.
- [0007] [3] Presence of AV/Detection tool: Malware checks for specific artifacts that indicate an anti-virus or sandboxed detection is in effect (e.g. if certain system APIs are hooked); and
- [0008] [4] Stalling: Malware delays execution for substantial time such that the malicious activity is not performed within run-time of sandbox.
[0009] As a result, mechanisms are necessary to detect all types of malware, even malware that is specifically configured to evade detection within a sandbox environment such as a virtual machine (VM) based environment.
Brief Description of the Drawings
[0010] 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:
[0011] FIG. 1 is a first exemplary block diagram of a malware content detection (MCD) system with for multiple VMs deployed within a communication network.
[0012] FIG. 2 is a detailed exemplary embodiment of the MCD system of FIG. 1 .
[0013] FIG. 3 is a second exemplary block diagram of the MCD system of FIG. 1 .
[0014] FIG. 4 is a detailed exemplary block diagram of components within the hardware architecture of the MCD system of FIG. 1 .
[0015] FIG. 5 is an exemplary embodiment of a flowchart illustrating operations for monitoring sleep operations conducted within the VM-based analysis environment of FIG. 2 .
[0016] FIG. 6 is an exemplary embodiment of a flowchart illustrating operations in monitoring call operations conducted within the VM-based analysis environment of FIG. 2 .
[0017] FIG. 7 is an exemplary embodiment of a flowchart illustrating operations in monitoring an instruction profile associated with operation conducted within the VM-based analysis environment of FIG. 2 .
Detailed Description
[0018] Various embodiments of the disclosure relate to a system, apparatus and method for enhancing detection of malware that is configured to avoid detection within a sandbox environment, such as a virtual machine based (VM-based) analysis environment for example, through delayed activation. Such malware is commonly referred to as a “time-bomb malware”. This enhanced detection may be conducted by tracking call site time delays and access frequency, which may be captured inside a VM in user-mode or kernel mode, inside of the virtual (execution) environment, or even external to the VM environment (e.g., frequency based threshold detection logic) and utilized to evade automated analysis environments.
[0019] One embodiment of the disclosure is directed to logic that is configured to monitor one or more operations within a VM-based analysis environment and, where applicable, adjusts one or more parameters associated with such operations. These operating parameters may involve requests and/or calls that delay further processing of content loaded into the VM-based analysis environment. For example, the operating parameter may include, but are not limited or restricted to (i) the number of Sleep request messages; (ii) an amount of time requested for a particular Sleep request message; (iii) the cumulative amount of Sleep time requested over a predetermined run time; (iv) the number of function calls from a particular call site to an API (e.g., addressed function such as a specific Application Programming Interface “API”); (v) the total frequency of the instruction pointer remaining within a particular address range; (vi) processor utilization level; or the like.
[0020] Hence, according to one embodiment of the disclosure, one or more counters may be deployed for monitoring the number of Sleep request messages initiated by the content under analysis. The content is determined to be associated with time-bomb malware if the number of Sleep request messages initiated by content under analysis exceeds a first threshold value (e.g. predetermined time value). Similarly, one or more counters may be deployed for monitoring whether the cumulative Sleep time for multiple Sleep request messages initiated by the content under analysis exceeds a second threshold value. If so, the content is determined to be associated with time-bomb malware.
[0021] Also, in the alternative or in combination with the sleep counter(s), one or more counters may be deployed for monitoring the total number of function calls initiated by the content under analysis. The content is determined to be associated with time-bomb malware if the total number of function calls exceeds a third threshold value. Similarly, one or more counters may be deployed for monitoring the number of function calls directed from a particular call site to an API by the content under analysis, where the content is determined to be associated with time-bomb malware if the number of function calls to the particular API exceed a fourth threshold.
[0022] According to a further embodiment of the disclosure, logic may be deployed to work in concert with each VM to monitor whether the content under analysis is repeatedly executing instructions located at a specific address or address range, which denotes a programming “loop” operation. If so, the content is determined to be associated with time-bomb malware.
[0023] In summary, multiple APIs and certain assembly instructions may be utilized by time-bomb malware to get OS time information. Also, the API access patterns for time delay purposes may vary from one malicious sample to another. For instance, the time-bomb malware may be a tightly loop execution, repeatedly performing GetLocalTime, Compare and/or Sleep calls, where detonation of the time-bomb malware occurs upon reaching a desired date. Other time-bomb malware may be a mixture of Sleep calls, Floating-Point Math calls, and/or subroutines that also stall and sleep. Yet another time-bomb malware may involve a tight execution loop of GetLocalTime, Compare, Sleep, and/or Cut-and-Paste operations, which identifies the importance of identifying the accessed call-site of the delay-execution code, so that proper threshold based statistics logic may be applied to multiple variants.
[0024] Herein, the disclosure describes different embodiments for addressing certain types of stall technique such as Sleep calls or the like. It is contemplated that the scope of the invention is directed to a mechanism that detects time-bomb malware associated with not only repeated Sleep calls but with any event or call variant adapted to stall malware execution to evade a sandbox environment.
[0025] I. Terminology
[0026] In the following description, certain terminology is used to describe features of the invention. For example, in certain situations, both terms “logic” and “engine” are representative of hardware, firmware and/or software that is configured to perform one or more functions. As hardware, logic (or engine) may include circuitry having data processing or storage functionality. Examples of such circuitry may include, but 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.
[0027] Logic (or engine) 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 such as carrier waves, infrared signals, or digital signals). Examples of non-transitory storage medium may include, but are not limited or restricted to a programmable circuit; a semiconductor memory; non-persistent storage such as volatile memory (e.g., any type of random access memory “RAM”); persistent storage such as non-volatile memory (e.g., read-only memory “ROM”, power-backed RAM, flash memory, phase-change memory, etc.), a solid-state drive, hard disk drive, an optical disc drive, or a portable memory device. As firmware, the executable code is stored in persistent storage.
[0028] The term “content” generally refers to information, such as text, software, images, audio, metadata and/or other digital data for example, that is transmitted as one or more messages. Each message(s) may be in the form of a packet, a frame, an Asynchronous Transfer Mode “ATM” cell, or any other series of bits having a prescribed format. The content may be received as a data flow, namely a group of related messages, being part of ingress data traffic.
[0029] One illustrative example of content includes web content, namely data traffic that may be transmitted using a Hypertext Transfer Protocol (HTTP), Hypertext Markup Language (HTML) protocol, or any other manner suitable for display on a Web browser software application. Another example of content includes one or more electronic mail (email) messages, which may be transmitted using an email protocol such as Simple Mail Transfer Protocol (SMTP), Post Office Protocol version 3 (POP3), or Internet Message Access Protocol (IMAP4). Yet another example of content includes an Instant Message, which may be transmitted using Session Initiation Protocol (SIP) or Extensible Messaging and Presence Protocol (XMPP) for example. A final example of content includes one or more files that are transferred using a data transfer protocol such as File Transfer Protocol (FTP) for subsequent storage on a file share.
[0030] The term “time-bomb malware” is software that includes at least one exploit, namely a particular portion of software that, after intentional delayed execution, takes advantage of one or more vulnerabilities within system software and produces an undesired behavior. The behavior is deemed to be “undesired” based on customer-specific rules, manufacturer-based rules, or any other type of rules formulated by public opinion or a particular governmental or commercial entity. Examples of an undesired behavior may include a communication-based anomaly or an execution-based anomaly that (i) alters the functionality of an electronic device and/or (ii) provides an unwanted functionality which may be generally acceptable in other context.
[0031] The term “transmission medium” is a communication path between two or more systems (e.g. any electronic devices with data processing functionality such as, for example, a security appliance, server, mainframe, computer, netbook, tablet, smart phone, router, switch, bridge or brouter). 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.
[0032] In general, a “virtual machine” (VM) is a simulation of an electronic device (abstract or real) that is usually different from the electronic device conducting the simulation. VMs may be based on specifications of a hypothetical electronic device or emulate the architecture and functions of a real world computer. A VM can be one of many different types such as, for example, hardware emulation, full virtualization, para-virtualization, and/or operating system-level virtualization virtual machines.
[0033] A “software profile” is information that is used for virtualization of an operating environment (e.g. instantiation of a VM) that is adapted to receive content for malware analysis. The software profile may identify a guest operating system “OS” type; a particular version of the guest OS; one or more different application types; particular version(s) of the application type(s); virtual device(s); or the like.
[0034] 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.
[0035] 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.
[0036] II. Time-Bomb Malware Detection Architecture
[0037] Referring to FIG. 1 , an exemplary block diagram of a communication system 100 deploying a plurality of malware content detection (MCD) systems 1101-110N (N>1, e.g. N=3) communicatively coupled to a management system 120 via a network 125 is shown. In general, management system 120 is adapted to manage MCD systems 1101-110N. For instance, management system 120 may be adapted to cause malware signatures generated as a result of time-bomb malware detection by any of MCD systems 1101-110N (e.g. MCD system 1102) to be shared with one or more of the other MCD systems 1101-110N (e.g. MCD system 1101) including where such sharing is conducted on a subscription basis.
[0038] Herein, according to this embodiment of the disclosure, first MCD system 1101 is an electronic device that is adapted to (i) intercept data traffic routed over a communication network 130 between at least one server device 140 and at least one client device 150 and (ii) monitor, in real-time, content within the data traffic. More specifically, first MCD system 1101 may be configured to inspect content received via communication network 130 and identify “suspicious” content. The incoming content is identified as “suspicious” when it is assessed, with a certain level of likelihood, that at least one characteristic identified during inspection of the content indicates the presence of an exploit.
[0039] Herein, according to one embodiment of the disclosure, the first MCD system 1101 is a web-based security appliance configured to inspect ingress data traffic and identify whether content associated with the data traffic includes time-bomb malware. The communication network 130 may include a public computer network such as the Internet, in which case an optional firewall 155 (represented by dashed lines) may be interposed between communication network 130 and client device(s) 150. Alternatively, the communication network 130 may be a private computer network such as a wireless telecommunication network, wide area network, or local area network, or a combination of networks.
[0040] The first MCD system 1101 is shown as being coupled with the communication network 130 (behind the firewall 155) via a network interface 160. The network interface 160 operates as a data capturing device (referred to as a “network tap”) that is configured to receive data traffic propagating to/from the client device(s) 150 and provide some or all of the content associated with the data traffic (e.g. objects) to the first MCD system 1101.
[0041] In general, the network interface 160 receives and copies the content that is received from and provided to client device 150. Alternatively, the network interface 160 may copy only a portion of the content, for example, a particular number of objects associated with the content. For instance, in some embodiments, the network interface 160 may capture metadata from data traffic intended for client device 150, where the metadata is used to determine (i) whether content within the data traffic includes any exploits and/or (ii) the software profile used instantiating the VM(s) for exploit detection on the content.
[0042] It is contemplated that, for any embodiments where the first MCD system 1101 is implemented as an dedicated appliance or a dedicated computer system, the network interface 160 may include an assembly integrated into the appliance or computer system that includes network ports, network interface card and related logic (not shown) for connecting to the communication network 130 to non-disruptively “tap” data traffic propagating therethrough and provide a copy of the data traffic to the heuristic engine 170 of MCD system 1101. In other embodiments, the network interface 160 can be integrated into an intermediary device in the communication path (e.g. firewall 155, router, switch or other network device) or can be a standalone component, such as an appropriate commercially available network tap. In virtual environments, a virtual tap (vTAP) can be used to copy traffic from virtual networks.
[0043] Referring to both FIGS. 1 and 2 , first MCD system 1101 comprises a heuristic engine 170, a heuristics database 175, an analysis engine 180, a scheduler 185, a storage device 190, and a reporting module 195. In some embodiments, the network interface 160 may be contained within the first MCD system 1101. Also, heuristic engine 170, analysis engine 180 and/or scheduler 185 may be hardware logic implemented with a processor or other types of circuitry. Alternatively, this logic may be configured as software modules executed by the same or different processors. As an example, the heuristic engine 170 may be one or more software modules executed by a first hardware processor implemented within the first MCD system 1101, while the analysis engine 180 and/or scheduler 185 may be executed by a second hardware processor. These processors may be located at geographically remote locations and communicatively coupled via a network.
[0044] In general, the heuristic engine 170 serves as a filter to permit subsequent malware analysis on portion(s) of incoming content that may have time-bomb malware. As an ancillary benefit, by analyzing only the portion of the incoming content that may have such malware, various system resources may be conserved and a faster response time may be provided in determining the presence of malware within analyzed content.
[0045] As still shown in FIG. 1 , the heuristic engine 170 receives the incoming content from the network interface 160 and applies heuristics to determine if any of the content is “suspicious”. The heuristics applied by the heuristic engine 170 may be based on data and/or rules stored in the heuristics database 175. Also, the heuristic engine 170 may examine the image of the captured content without executing or opening the captured content.
[0046] For example, the heuristic engine 170 may examine the metadata or attributes of the captured content and/or the code image (e.g., a binary image of an executable) to determine whether the captured content matches or has a high correlation with a predetermined pattern of attributes that is associated with a malicious attack, especially time-bomb malware attacks. According to one embodiment of the disclosure, the heuristic engine 170 flags content from one or more data flows as suspicious after applying this heuristic analysis.
[0047] It is contemplated that the heuristic engine 170 may comprise a static analysis tool 175 that is configured to parse malware binaries and specifically identify delay hotspots. A “delay hotspot” could be an API call or Sleep request with large timeout values or it could be a loop with high repeat counter. Such analysis can complement dynamic analysis technique and lead to more definitive detection of time-bomb malwares.
[0048] Thereafter, according to one embodiment of the disclosure, the heuristic engine 170 may be adapted to transmit at least a portion of the metadata or attributes of the suspicious content 172, which may identify attributes of the client device 150, to a control logic 182 implemented within analysis engine 180. Such metadata or attributes are used to identify software profile information used to instantiate at least one VM for subsequent malware analysis. In another embodiment of the disclosure, the control logic 182 may be adapted to receive one or more messages (e.g. data packets) from the heuristic engine 170 and analyze the message(s) to identify the software profile information for instantiating the VM(s) subsequently used for malware analysis.
[0049] Control logic 182 is adapted to control formation of one or more VM-based analysis environments 2001-200M as shown in FIG. 2 . As shown herein, at least one analysis environment 2001 comprises a VM 2101 with corresponding sleep analysis logic 220 (e.g., one or more sleep counters, etc.) and call analysis logic 230 (e.g., one or more call counters, etc.), comparison logic 240 (e.g. one or more comparators, etc.) along with instruction pointer analysis logic (profiler) 250 and processor (CPU) statistic monitoring logic 260.
[0050] For instance, as an illustrative example, the suspicious content under analysis may include an email message that was generated, under control of Windows® 7 Operating System, using a Windows® Outlook 2007, version 12. The email message further includes a Portable Document Format (PDF) attachment in accordance with Adobe® Acrobat®, version 9.0. Upon determining that the email message includes suspicious content, heuristic engine 170 and/or control logic 182 may be adapted to provide software profile information to scheduler 185 in order to identify a particular type of VM needed to conduct dynamic analysis of the suspicious content. According to this illustrative example, the software profile information would identify the VM software as (1) Windows® 7 Operating System (OS); (2) Windows® Outlook 2007, version 12; and (3) Adobe® Acrobat® PDF reader that allows viewing of the above-identified PDF document.
[0051] The control logic 182 supplies the software profile information to the scheduler 185, which conducts a search of information within storage device 190 to determine if a VM image 192 identified by the software profile information resides within storage device 190. The VM image 192 supports the appropriate OS (e.g. Windows® 7 OS) and one or more applications (e.g., Windows® Outlook 2007, version 12; and Adobe® Acrobat® PDF reader). If so, the scheduler 185 uses that the VM image 192 to instantiate a VM within analysis environment 2001 in order to analyze the suspicious content and determine if such content is associated with time-bomb malware.
[0052] Of course, it is contemplated that if the storage device 190 does not feature a software profile supporting the above-identified OS/application(s), the scheduler 185 may simply ignore the VM request from control logic 182 or may obtain an VM image directed to similar software. For example, the scheduler 185 may be adapted to obtain a VM image based on the same OS but a different version(s) of the targeted application(s). Alternatively, the scheduler 185 may be adapted to obtain the same OS (e.g. Windows® OS 7) along with an application different from the targeted application but having similar functionality. As another alternative, the scheduler 185 may receive a different OS image that supports similar functionality.
[0053] In another embodiment of the disclosure, the heuristic engine 170 may determine the software profile information from the data traffic by receiving and analyzing the content from the network interface 160. For instance, according to one embodiment of the disclosure, it is contemplated that the heuristic engine 170 may be adapted to transmit the metadata identifying the client device 150 to the analysis engine 180, where such metadata is used to identify a desired software profile. The heuristic engine 170 may then transmit the software profile information to a scheduler 185 in lieu of such information being provided from control logic 182 within the analysis engine 180.
[0054] Alternatively, the control logic 182 may be adapted to receive one or more data packets of a data flow from the heuristic engine 170 and analyze the one or more data packets to identify the software profile without pre-processing by heuristic engine 170. In yet other embodiment of the disclosure, the scheduler 185 may be adapted to receive software profile information, in the form of metadata or data packets, from the network interface 160 or from the heuristic engine 170 directly.
[0055] The storage device 190 may be configured to store one or more VM disk files forming a VM profile database 194, where each VM disk file is directed to a different software profile for a VM. In one example, the VM profile database 194 may store a plurality of VM disk files having VM images for multiple software profiles in order to provide the collective capability for simulating the performance of a wide variety of client device(s) 150.
[0056] The analysis engine 180 is adapted to execute multiple VMs concurrently to support different VM operating environments that simulate the receipt and/or processing of different data flows of “suspicious” content by different network devices. Furthermore, the analysis engine 180 analyzes the effects of such content during processing. The analysis engine 180 may identify exploits by detecting undesired behavior caused by simulated processing of the suspicious content as carried out by the VM. This undesired behavior may include numerous repeated functions calls, repeated Sleep calls, and other behavior to stall or delay execution of code associated with the incoming content.
[0057] The analysis engine 180 may flag the suspicious content as malware according to observed undesired behavior of the VM. Different types of behaviors may be weighted based on the likelihood of system compromise, where suspicious content is determined when the weighted value exceeds a certain threshold.
[0058] Of course, it is contemplated that, for deeper analysis to detect exploits, such operations may be conducted within the cloud 165 in lieu of or in addition to operations performed within analysis engine 180.
[0059] The reporting module 195 may issue alert messages indicating the presence of one or more exploits to one or more hardware processors executing outside the VM environments, and may use pointers and other reference information to identify what message(s) (e.g. packet(s)) of the suspicious content may contain the exploit(s). Additionally, the server device(s) 140 may be added to a list of malicious network content providers, and future network transmissions originating from the server device(s) 140 may be blocked from reaching their intended destinations, e.g., by firewall 155.
[0060] Referring now to FIG. 3 , a second exemplary embodiment of MCD system 1101 set forth in FIG. 1 is shown, where the software profile for VM instantiation is not determined through analysis of suspicious content (e.g. metadata, data packets, binary, etc.) by the network interface 160, heuristic engine 170, or analysis engine 180. Rather, this software profile directed to software under test is uploaded by the user and/or network administrator.
[0061] More specifically, a user interface 310 allows the user or network administrator (hereinafter referred to as “user/administrator”) to introduce objects 300 of the suspicious content in accordance with one or more prescribed software profiles 320. The prescribed software profile(s) 320 may be preloaded or selected by the user/administrator in order to instantiate one or more VMs based on operations of the scheduler 185 and storage device 190 as described above. The VMs perform dynamic analysis of the objects 300 to monitor for undesired behavior during virtual processing of these objects 300 within the VMs.
[0062] Referring now to FIG. 4 , an exemplary block diagram of logic that is implemented within MCD system 1101 is shown. MCD system 1101 comprises one or more processors 400 that are coupled to communication interface logic 410 via a first transmission medium 420. Communication interface logic 410 enables communications with MCD systems 1102-110N of FIG. 1 as well as other electronic devices over private and/or public networks. According to one embodiment of the disclosure, communication interface logic 410 may be implemented as a physical interface including one or more ports for wired connectors. Additionally, or in the alternative, communication interface logic 410 may be implemented with one or more radio units for supporting wireless communications with other electronic devices.
[0063] Processor 400 is further coupled to persistent storage 430 via transmission medium 425. According to one embodiment of the disclosure, persistent storage 430 may include stalled processing analysis logic 440 and a data store 475. In general, stalled processing analysis logic 440 is configured to monitor and alter operating parameters for one or more VM-based analysis environments in order to improve reliability in detecting time-bomb malware. The results of the analysis are stored within data store 475.
[0064] More specifically, stalled processing analysis logic 440 comprises sleep analysis logic 220, call analysis logic 230, comparison logic 240, time adjustment logic 450, instruction pointer analysis logic 250, and processor statistic monitoring logic 260. Herein, both sleep analysis logic 220 and call analysis logic 230 are configured to address an event where a series of successive Sleep function calls are used to stall processing of the incoming content. As an example, sleep analysis logic 220 may be configured to monitor the number of Sleep calls, the Sleep intervals and the cumulative Sleep time. The call analysis logic 230 may be configured to perform the same general functionality in monitoring the number of function calls made globally or to a particular call site as well as the cumulative delay incurred by initiation of function calls.
[0065] Optionally working in concert with sleep analysis logic 220 and call analysis logic 230, the time adjustment logic 450 is configured to alter the time interval returned back to the content running in the VM-based analysis environment (e.g., environment 2001). This alteration is performed in order to accelerate the time-bomb malware activity such that “suspicious” behavior can be detected. This is achieved through a shortened time interval while executing successive Sleep calls and/or other types of calls used when processing the content.
[0066] More specifically, sleep analysis logic 220 is configured with one or more counters that are used to count the number of Sleep request messages initiated by the content under analysis for subsequent comparison, using comparison logic 240 (e.g. one or more comparators) of the count value with a first threshold value stored in data store 475.
[0067] Additionally, the sleep analysis logic 220 may be further configured with one or more counters that are used to compute the cumulative amount of time (e.g. in units of time, clock cycles, etc.) in which the content under analysis would have placed a targeted electronic device into a Sleep state. The cumulative amount of time is subsequently compared, using comparison logic 240, to a second threshold value that is different than the first threshold value. The second threshold value may be set to a time value less than the average amount of time permitted for analysis of the content within a VM-based analysis environment 2101. The content under analysis is considered to be associated with time-bomb malware if the first and/or second thresholds are exceeded.
[0068] Call analysis logic 230 is configured with one or more counters that are used to count the number of function calls initiated by the content under analysis, which is subsequently compared with a third threshold value stored in data store 475 using comparison logic 240. The number of function calls may be based on either (i) a global basis (e.g., total number of function calls) or (ii) a per call site basis (e.g. per each caller address). It is contemplated that the third threshold value may differ from the first and second threshold values, and the value may be based at least in part on the type of function call. For instance, the GetLocalTime function call may be analyzed with greater scrutiny as this API function call tends to be a common choice for repetitive call type of evasion. Other such APIs may include SystemTimeToFileTime, GetSystemTime, Process32First, NtYieldExecution, NtDelayExecution, SleepEx, and different Wait variants (e.g., MsgWaitForMultipleObjects, WaitForSingleObject, etc.).
[0069] Call analysis logic 230 may be further configured with one or more counters that are used to monitor the cumulative amount of time that the called functions would need for execution of the called function. Using comparison logic 240, the cumulative amount of time is subsequently compared to a fourth threshold value stored in data store 475. The content under analysis is associated with time-bomb malware if the third and/or fourth thresholds are exceeded.
[0070] Call analysis logic 230 also has the ability to report the calling module name (EXE/DLL) based on call site addresses. This allows the reporting module (195) to assign weights intelligently (e.g. less weight when a call site is from system module and higher weight when a call site is from the content under analysis).
[0071] As further shown in FIG. 4 , time adjustment logic 450 is configured to operate in concert with sleep analysis logic 220 and/or call analysis logic 230 in order to compute a shortened time to be used in Sleep so that malware is forced to perform malicious activity within the VM analysis time duration.
[0072] The instruction pointer analysis logic 250 is configured to periodically check, during processing of the content under analysis, whether the instruction pointer has remained within one or more prescribed address range(s) over a prolonged period of time. This check is conducted in order to determine if the content includes time-bomb malware adapted to perform an instruction-based loop to evade analysis within the VM-based environment. If the instruction pointer analysis logic 250 determines that the instruction pointer continues to remain within a particular address range, the processor utilization measured by processor statistic monitoring logic 260 is greater than a prescribed value, and no other exploits have been detected, the instruction pointer analysis logic 250 determines that the content under analysis is associated with time-bomb malware.
[0073] According to one embodiment of the disclosure, at least the sleep analysis logic 220, call analysis logic 230 and time adjustment logic 450 are implemented as part of the VM. The comparison logic 240, instruction pointer analysis logic 250 and processor statistic monitoring logic 260 may be placed within the VM or outside the VM.
[0074] As additional counter measures to time-bomb malware, persistent storage 430 may include dynamic threshold generation logic 480 and/or call site management logic 490. Dynamic threshold generation logic 480 comprises logic that dynamically alters the threshold values utilized by the sleep analysis logic 220 and call analysis logic 230. The dynamic nature of the threshold values prevents malware writers from altering malware to circumvent established thresholds, if such thresholds are discovered.
[0075] Another optional logic implemented within MCD system 1101 is the call site management logic 490. The call site management logic 490 is configured to maintain a finite number of call sites as part of a table. If the table is full and a request for a new call site is made, the call site management logic 490 determines if the new call site is associated with a larger processing time requirement than another call site within the table. If so, the new call site is substituted for that call site. If not, the new call site is not placed within the table. However, cumulative threshold is updated accordingly.
[0076] III. Time-Bomb Malware Detection Operations
[0077] Referring to FIG. 5 , a first exemplary flowchart outlining the operations for time-bomb malware detection is shown. Upon receiving content, a determination is made as to whether the content is “suspicious,” namely whether analysis of the content indicates the presence of an exploit (blocks 500 and 510). Where the content is determined to be “suspicious,” the attributes of the content may be used to determine one or more software profiles (block 520). VMs within the analysis environment are based on these software profile(s).
[0078] Thereafter, the VM(s) perform operations on the suspicious content and analyzes the results of these operations to determine if any exploits are present (block 530). These operations may include Sleep analysis, Call analysis and profiling (e.g. processor utilization, addressing analysis, etc.) as described above. If no exploits are detected, no further time-bomb analysis is needed (block 540).
[0079] Otherwise, according to one embodiment of the disclosure, one or more counters are initiated during run-time of the content under analysis. The counter(s) may monitor (i) the number of Sleep request messages, (ii) the Sleep interval requested and/or (iii) the cumulative Sleep time (herein generally referred to as “Sleep activity”). Where the Sleep activity exceeds a prescribe threshold, a determination is made that the content under analysis includes time-bomb malware (blocks 550 and 560). As a result, the sleep analysis logic is adapted to emulate compliance with requested Sleep calls, where actual duration of the request Sleep time(s) is shortened by the time adjustment logic, in some cases significantly shortened 80%, 90% or more for the allocated sleep time (block 570). Such shortening of the Sleep time, which is unbeknownst to the content under analysis, alters the processing time frame for the VM environment and allows the VM to monitor and report the particulars behind the time-bomb malware attack. If the Sleep activity remains below the prescribed threshold, the VM continues to operate as normal (block 580).
[0080] Referring now to FIG. 6 , a second exemplary flowchart outlining the operations for time-bomb malware detection is shown. Similarly, upon receiving content, a determination is made as to whether the content is “suspicious” based on a potential presence of an exploit (blocks 600 and 610). Where the content is determined to be “suspicious,” the attributes of the content may be used to determine one or more software profiles, where the VMs within the analysis environment are based on these software profile(s) (block 620).
[0081] Thereafter, the VM(s) perform operations on the suspicious content and analyzes the results of these operations to determine if any exploits are present (block 630). If no exploits are detected, no further time-bomb analysis is needed (block 640).
[0082] Otherwise, according to one embodiment of the disclosure, one or more counters are initiated during run-time of the content under analysis. The counter(s) may monitor the number of repeated function calls to a particular API. Where the number of function calls exceeds a prescribe threshold, a determination is made that the content under analysis includes time-bomb malware (blocks 650 and 660). As a result, the call analysis logic is adapted to emulate compliance with requested function calls by responding to these function calls, sometimes with a shortened call response wait time (block 670). Such shortened response time, which is unbeknownst to the content under analysis, alters the processing time frame for the VM environment to allow the VM to monitor and report the particulars behind the time-bomb malware attack. If the number of function calls to a particular API does not exceed a prescribed threshold, the VM will continue to operate as normal (block 680).
[0083] Referring to FIG. 7 , a third exemplary flowchart outlining the operations for time-bomb malware detection is shown. Upon receiving content, a determination is made as to whether the content is “suspicious” based on a potential presence of an exploit (blocks 700 and 710). Where the content is determined to be “suspicious,” the attributes of the content may be used to determine one or more software profiles, where the VMs within the analysis environment are based on these software profile(s) (block 720).
[0084] Thereafter, the VM(s) perform operations on the suspicious content and analyzes the results of these operations to determine if any exploits are present (block 730). If no exploits are detected, no further time-bomb analysis is needed (block 740).
[0085] Otherwise, according to one embodiment of the disclosure, the instruction pointer analysis logic (profiler) undergoes operations to determine if the instruction pointer utilized during processing of the content under analysis is frequently located into the same memory address or a particular range of memory addresses (block 750). If not, no time-bomb malware is detected by the VM operating within the analysis environment of the analysis engine.
[0086] In the event that the profiler detects continued presence of the instruction pointer as described above, a determination is made by the processor statistics monitoring logic profile if processor utilization is greater than a prescribed operating threshold (blocks 760-770). If so, and no other malicious activity is detected, a determination is made that the content under analysis includes time-bomb malware (block 780). If the processor utilization is below the prescribed threshold or other malicious activity is seen, then no time-bomb malware is detected. Hence, the VM will continue to operate as normal (block 790).
[0087] In the foregoing description, the invention is described with reference to specific exemplary embodiments thereof. It will, however, be evident that various modifications and changes may be made thereto without departing from the broader spirit and scope of the invention as set forth in the appended claims.
Claims
What is claimed is:
1. A system comprising:
an addressable memory; and
one or more hardware processors communicatively coupled to the addressable memory, the one or more hardware processors being configured to instantiate one or more virtual machines that are adapted to analyze received content that has been identified as suspicious by the content having a level of likelihood that at least one characteristic identified during inspection of the content indicates a potential presence of malware, the one or more virtual machines being configured to (i) monitor a delay caused by one or more events including, during processing of the suspicious content, an instruction pointer remaining at a specific address in the addressable memory or within a specific address range in the addressable memory that is less than an entire address range-and (ii) determine the suspicious content includes malware when the delay corresponding to the instruction pointer remaining at the specific address or within the specific address range exceeds a first time period.
2. The system of claim 1, wherein the one or more virtual machines being configured to further monitor time intervals for one or more Sleep request messages initiated during processing of the suspicious content and identifying the suspicious content as including malware if a combined delay for the one or more Sleep request messages exceeds the first time period.
3. The system of claim 1, wherein the one or more virtual machines being configured to further monitor time intervals for one or more Sleep request messages initiated during processing of the suspicious content and identifying the suspicious content as including malware if one of the time intervals exceeds the first time period.
4. The system of claim 1, wherein the one or more virtual machines being configured to further monitor the one or more events being a number of function calls initiated during processing of the suspicious content represented by a value contained in one or more counters accessible to the one or more virtual machines and identifying the suspicious content as including malware if the number of function calls exceeds a threshold value in response to a comparison conducted by comparison logic being processed by the one or more hardware processors.
5. A system comprising:
an addressable memory; and
one or more hardware processors communicatively coupled to the addressable memory, the one or more hardware processors being configured to instantiate one or more virtual machines that are adapted to analyze received content, the one or more virtual machines being configured to (i) monitor a delay caused by one or more events including, during processing of the content, an instruction pointer remaining at a specific address in the addressable memory or within a specific address range in the addressable memory that is less than an entire address range-and (ii) determine the content includes malware when the delay corresponding to the instruction pointer remaining at the specific address or within the specific address range exceeds a first time period and a level of utilization for the one or more hardware processors is greater than a prescribed operating threshold.
6. The system of claim 1, wherein the one or more virtual machines being configured to further maintain and monitor values of time intervals for Sleep calls per call site, initiated during processing of the suspicious content and identifying the suspicious content as including malware if one of the time intervals exceeds a predetermined time period.
7. The system of claim 1, wherein the one or more virtual machines being configured to further maintain and monitor values of call counters for certain functions per call site, initiated during processing of the suspicious content, and identifying the suspicious content as including malware if one of the call counters exceeds the a predetermined count threshold.
8. The system of claim 1 further comprising a reporting module being configured to differentiate call sites based on module names and assign weights accordingly and identifying the suspicious content as including malware if a higher count is associated with a call site residing in the suspicious content under analysis.
9. The system of claim 1 further comprising a heuristic engine being configured to identify delay hotspots and identifying the suspicious content as including malware if one of a plurality of time intervals associated with the delay exceeds a predetermined time period.
10. The system of claim 1, wherein the one or more hardware processors being further configured to process a reporting module that issues an alert message indicating the presence of malware within the suspicious content.
11. The system of claim 1, wherein the one or more virtual machines being configured to determine the content includes malware when the delay corresponding to the instruction pointer remaining at the specific address or within the specific address range exceeds the first time period and no other malicious activity associated with the suspicious content has been detected by the one or more virtual machines.
12. The system of claim 5, wherein the first time period has a duration that is dynamically set.
13. The system of claim 5, wherein the one or more virtual machines being configured to determine the content includes malware when the delay corresponding to the instruction pointer remaining at the specific address or within the specific address range exceeds the first time period, the level of utilization for the one or more hardware processors is greater than the prescribed operating threshold, and no other malicious activity associated with the suspicious content has been detected by the one or more virtual machines.
14. A system comprising:
one or more hardware processors;
a memory communicatively coupled to the one or more hardware processors, wherein the one or more hardware processors being configured to instantiate one or more virtual machines that are adapted to analyze received content that has been identified as suspicious by having a level of likelihood that at least one characteristic identified during prior inspection of the content indicates a potential presence of malware and the one or more virtual machines determine if the content includes time-bomb malware by monitoring, during processing of the received content within the one or more virtual machines, whether an instruction pointer is being repeatedly directed to a specific address or a specific address range that is less than an entire address space, and identifying the content as including malware when the instruction pointer is repeatedly directed to the specific address or the specific address range.
15. The system of claim 14, wherein the one or more virtual machines being configured to monitor time intervals for one type of event being one or more Sleep request messages initiated during processing of the received content and identifying the content as including malware if a total delay requested by the one or more Sleep request messages exceeds the second threshold being a first predetermined time period.
16. The system of claim 14, wherein the one or more virtual machines being configured to monitor time intervals for one type of event being one or more Sleep request messages initiated during processing of the content and identifying the content as including malware if one of the time intervals exceeds a first predetermined time period.
17. The system of claim 14, wherein the one or more virtual machines being configured to further monitor the number of events being a number of function calls initiated during processing of the content and identifying the content as including malware if the number of function calls exceeds the first threshold.
18. The system of claim 14, wherein the second threshold has a duration that is dynamically set.
19. The system of claim 14, wherein the one or more virtual machines being configured to maintain and monitor time intervals for Sleep calls per call site, initiated during processing of the content and identifying the content as including malware if one of the time intervals exceeds a predetermined time period.
20. The system of claim 14, wherein the memory further comprises a reporting module being configured to differentiate call sites based on module names and assign weights accordingly and identifying the content.
Patent Citations (395)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4292580(A) | 1981-09-01 | Ott et al. | Applicant |
| US5175732(A) | 1992-12-01 | Hendel et al. | Applicant |
| US5440723(A) | 1995-08-01 | Arnold et al. | Applicant |
| US5657473(A) | 1997-08-01 | Killean et al. | Applicant |
| US5842002(A) | 1998-11-01 | Schnurer et al. | Applicant |
| US5978917(A) | 1999-11-01 | Chi | Applicant |
| US6067644(A) | 2000-05-01 | Levine | Examiner |
| US6088803(A) | 2000-07-01 | Tso et al. | Applicant |
| US6094677(A) | 2000-07-01 | Capek et al. | Applicant |
| US6269330(B1) | 2001-07-01 | Cidon et al. | Applicant |
| US6279113(B1) | 2001-08-01 | Vaidya | Applicant |
| US6298445(B1) | 2001-10-01 | Shostack | Applicant |
| US6357008(B1) | 2002-03-01 | Nachenberg | Examiner |
| US6424627(B1) | 2002-07-01 | Sorhaug et al. | Applicant |
| US6484315(B1) | 2002-11-01 | Ziese | Applicant |
| US6487666(B1) | 2002-11-01 | Shanklin et al. | Applicant |
| US6493756(B1) | 2002-12-01 | O'Brien et al. | Applicant |
| US6550012(B1) | 2003-04-01 | Villa et al. | Applicant |
| US6775657(B1) | 2004-08-01 | Baker | Applicant |
| US6832367(B1) | 2004-12-01 | Choi et al. | Applicant |
| US6895550(B2) | 2005-05-01 | Kanchirayappa et al. | Applicant |
| US6898632(B2) | 2005-05-01 | Gordy et al. | Applicant |
| US6907396(B1) | 2005-06-01 | Muttik et al. | Applicant |
| US6981279(B1) | 2005-12-01 | Arnold et al. | Applicant |
| US7007107(B1) | 2006-02-01 | Ivchenko et al. | Applicant |
| US7028179(B2) | 2006-04-01 | Anderson et al. | Applicant |
| US7043757(B2) | 2006-05-01 | Hoefelmeyer et al. | Applicant |
| US7069316(B1) | 2006-06-01 | Gryaznov | Applicant |
| US7080408(B1) | 2006-07-01 | Pak et al. | Applicant |
| US7093002(B2) | 2006-08-01 | Wolff et al. | Applicant |
| US7093239(B1) | 2006-08-01 | van der Made | Examiner |
| US7100201(B2) | 2006-08-01 | Izatt | Applicant |
| US7159149(B2) | 2007-01-01 | Spiegel et al. | Applicant |
| US7231667(B2) | 2007-06-01 | Jordan | Applicant |
| US7240364(B1) | 2007-07-01 | Branscomb et al. | Applicant |
| US7240368(B1) | 2007-07-01 | Roesch et al. | Applicant |
| US7287278(B2) | 2007-10-01 | Liang | Applicant |
| US7308716(B2) | 2007-12-01 | Danford et al. | Applicant |
| US7356736(B2) | 2008-04-01 | Natvig | Applicant |
| US7376970(B2) | 2008-05-01 | Marinescu | Examiner |
| US7386888(B2) | 2008-06-01 | Liang et al. | Applicant |
| US7392542(B2) | 2008-06-01 | Bucher | Applicant |
| US7418729(B2) | 2008-08-01 | Szor | Applicant |
| US7428300(B1) | 2008-09-01 | Drew et al. | Applicant |
| US7441272(B2) | 2008-10-01 | Durham et al. | Applicant |
| US7448084(B1) | 2008-11-01 | Apap et al. | Applicant |
| US7458098(B2) | 2008-11-01 | Judge et al. | Applicant |
| US7461403(B1) | 2008-12-01 | Libenzi | Examiner |
| US7464404(B2) | 2008-12-01 | Carpenter et al. | Applicant |
| US7464407(B2) | 2008-12-01 | Nakae et al. | Applicant |
| US7467408(B1) | 2008-12-01 | O'Toole, Jr. | Applicant |
| US7480773(B1) | 2009-01-01 | Reed | Applicant |
| US7487543(B2) | 2009-02-01 | Arnold et al. | Applicant |
| US7490353(B2) | 2009-02-01 | Kohavi | Examiner |
| US7496960(B1) | 2009-02-01 | Chen et al. | Applicant |
| US7496961(B2) | 2009-02-01 | Zimmer et al. | Applicant |
| US7519990(B1) | 2009-04-01 | Xie | Applicant |
| US7523493(B2) | 2009-04-01 | Liang et al. | Applicant |
| US7530104(B1) | 2009-05-01 | Thrower et al. | Applicant |
| US7530106(B1) | 2009-05-01 | Zaitsev et al. | Examiner |
| US7540025(B2) | 2009-05-01 | Tzadikario | Applicant |
| US7555777(B2) | 2009-06-01 | Swimmer et al. | Examiner |
| US7565550(B2) | 2009-07-01 | Liang et al. | Applicant |
| US7603715(B2) | 2009-10-01 | Costa et al. | Applicant |
| US7607171(B1) | 2009-10-01 | Marsden et al. | Applicant |
| US7639714(B2) | 2009-12-01 | Stolfo et al. | Applicant |
| US7644441(B2) | 2010-01-01 | Schmid et al. | Applicant |
| US7676841(B2) | 2010-03-01 | Sobchuk et al. | Applicant |
| US7698548(B2) | 2010-04-01 | Shelest et al. | Applicant |
| US7707633(B2) | 2010-04-01 | Danford et al. | Applicant |
| US7779463(B2) | 2010-08-01 | Stolfo et al. | Applicant |
| US7784097(B1) | 2010-08-01 | Stolfo et al. | Applicant |
| US7832008(B1) | 2010-11-01 | Kraemer | Applicant |
| US7849506(B1) | 2010-12-01 | Dansey et al. | Applicant |
| US7869073(B2) | 2011-01-01 | Oshima | Applicant |
| US7877803(B2) | 2011-01-01 | Enstone et al. | Applicant |
| US7904959(B2) | 2011-03-01 | Sidiroglou et al. | Applicant |
| US7908660(B2) | 2011-03-01 | Bahl | Applicant |
| US7930738(B1) | 2011-04-01 | Petersen | Applicant |
| US7937761(B1) | 2011-05-01 | Bennett | Applicant |
| US7996556(B2) | 2011-08-01 | Raghavan et al. | Applicant |
| US7996836(B1) | 2011-08-01 | McCorkendale et al. | Applicant |
| US7996905(B2) | 2011-08-01 | Arnold et al. | Applicant |
| US8006305(B2) | 2011-08-01 | Aziz | Applicant |
| US8010667(B2) | 2011-08-01 | Zhang et al. | Applicant |
| US8020206(B2) | 2011-09-01 | Hubbard et al. | Applicant |
| US8028338(B1) | 2011-09-01 | Schneider et al. | Applicant |
| US8045094(B2) | 2011-10-01 | Teragawa | Applicant |
| US8045458(B2) | 2011-10-01 | Alperovitch et al. | Applicant |
| US8069484(B2) | 2011-11-01 | McMillan et al. | Applicant |
| US8087086(B1) | 2011-12-01 | Lai et al. | Applicant |
| US8112483(B1) | 2012-02-01 | Emigh et al. | Examiner |
| US8171553(B2) | 2012-05-01 | Aziz et al. | Applicant |
| US8201246(B1) | 2012-06-01 | Wu et al. | Applicant |
| US8204984(B1) | 2012-06-01 | Aziz et al. | Applicant |
| US8220055(B1) | 2012-07-01 | Kennedy | Applicant |
| US8225288(B2) | 2012-07-01 | Miller et al. | Applicant |
| US8225373(B2) | 2012-07-01 | Kraemer | Applicant |
| US8233882(B2) | 2012-07-01 | Rogel | Applicant |
| US8234709(B2) | 2012-07-01 | Viljoen et al. | Applicant |
| US8239944(B1) | 2012-08-01 | Nachenberg et al. | Applicant |
| US8286251(B2) | 2012-10-01 | Eker et al. | Applicant |
| US8291499(B2) | 2012-10-01 | Aziz et al. | Applicant |
| US8307435(B1) | 2012-11-01 | Mann et al. | Applicant |
| US8307443(B2) | 2012-11-01 | Wang et al. | Applicant |
| US8312545(B2) | 2012-11-01 | Tuvell et al. | Applicant |
| US8321936(B1) | 2012-11-01 | Green et al. | Applicant |
| US8321941(B2) | 2012-11-01 | Tuvell et al. | Applicant |
| US8365286(B2) | 2013-01-01 | Poston | Applicant |
| US8370938(B1) | 2013-02-01 | Daswani et al. | Applicant |
| US8370939(B2) | 2013-02-01 | Zaitsev et al. | Applicant |
| US8375444(B2) | 2013-02-01 | Aziz et al. | Applicant |
| US8381299(B2) | 2013-02-01 | Stolfo et al. | Applicant |
| US8402529(B1) | 2013-03-01 | Green et al. | Applicant |
| US8510827(B1) | 2013-08-01 | Leake et al. | Applicant |
| US8510842(B2) | 2013-08-01 | Amit et al. | Applicant |
| US8516593(B2) | 2013-08-01 | Aziz | Applicant |
| US8528086(B1) | 2013-09-01 | Aziz | Applicant |
| US8539582(B1) | 2013-09-01 | Aziz et al. | Applicant |
| US8549638(B2) | 2013-10-01 | Aziz | Applicant |
| US8561177(B1) | 2013-10-01 | Aziz et al. | Applicant |
| US8566946(B1) | 2013-10-01 | Aziz et al. | Applicant |
| US8584094(B2) | 2013-11-01 | Dadhia et al. | Applicant |
| US8584234(B1) | 2013-11-01 | Sobel et al. | Applicant |
| US8584239(B2) | 2013-11-01 | Aziz et al. | Applicant |
| US8595834(B2) | 2013-11-01 | Xie et al. | Applicant |
| US8627476(B1) | 2014-01-01 | Satish et al. | Applicant |
| US8635696(B1) | 2014-01-01 | Aziz | Applicant |
| US8689333(B2) | 2014-04-01 | Aziz | Applicant |
| US8713681(B2) | 2014-04-01 | Silberman et al. | Applicant |
| US8763125(B1) | 2014-06-01 | Feng | Examiner |
| US8776229(B1) | 2014-07-01 | Aziz | Applicant |
| US8793787(B2) | 2014-07-01 | Ismael et al. | Applicant |
| US8832829(B2) | 2014-09-01 | Manni et al. | Applicant |
| US8850571(B2) | 2014-09-01 | Staniford et al. | Applicant |
| US8881282(B1) | 2014-11-01 | Aziz et al. | Applicant |
| US8898788(B1) | 2014-11-01 | Aziz et al. | Applicant |
| US8935779(B2) | 2015-01-01 | Manni et al. | Applicant |
| US8984638(B1) | 2015-03-01 | Aziz et al. | Applicant |
| US8990939(B2) | 2015-03-01 | Staniford et al. | Applicant |
| US8990944(B1) | 2015-03-01 | Singh et al. | Applicant |
| US8997219(B2) | 2015-03-01 | Staniford et al. | Applicant |
| US9009822(B1) | 2015-04-01 | Ismael et al. | Applicant |
| US9009823(B1) | 2015-04-01 | Ismael et al. | Applicant |
| US9027135(B1) | 2015-05-01 | Aziz | Applicant |
| US9071638(B1) | 2015-06-01 | Aziz et al. | Applicant |
| US9104867(B1) | 2015-08-01 | Thioux et al. | Applicant |
| US9106694(B2) | 2015-08-01 | Aziz et al. | Applicant |
| US9118715(B2) | 2015-08-01 | Staniford et al. | Applicant |
| US9159035(B1) | 2015-10-01 | Ismael et al. | Applicant |
| US9171160(B2) | 2015-10-01 | Vincent et al. | Applicant |
| US9176843(B1) | 2015-11-01 | Ismael et al. | Applicant |
| US9189627(B1) | 2015-11-01 | Islam | Applicant |
| US9195829(B1) | 2015-11-01 | Goradia et al. | Applicant |
| US9223972(B1) | 2015-12-01 | Vincent et al. | Applicant |
| US9225740(B1) | 2015-12-01 | Ismael et al. | Applicant |
| US9241010(B1) | 2016-01-01 | Bennett et al. | Applicant |
| US9251343(B1) | 2016-02-01 | Vincent et al. | Applicant |
| US9262635(B2) | 2016-02-01 | Paithane et al. | Applicant |
| US9282109(B1) | 2016-03-01 | Aziz et al. | Applicant |
| US9292686(B2) | 2016-03-01 | Ismael et al. | Applicant |
| US9294501(B2) | 2016-03-01 | Mesdaq et al. | Applicant |
| US9300686(B2) | 2016-03-01 | Pidathala et al. | Applicant |
| US9306960(B1) | 2016-04-01 | Aziz | Applicant |
| US9306974(B1) | 2016-04-01 | Aziz et al. | Applicant |
| US9311479(B1) | 2016-04-01 | Manni et al. | Applicant |
| US9355247(B1) | 2016-05-01 | Thioux et al. | Applicant |
| US9356944(B1) | 2016-05-01 | Aziz | Applicant |
| US9363280(B1) | 2016-06-01 | Rivlin et al. | Applicant |
| US9367681(B1) | 2016-06-01 | Ismael et al. | Applicant |
| US9398028(B1) | 2016-07-01 | Karandikar et al. | Applicant |
| US2001/0005889(A1) | 2001-06-01 | Albrecht | Applicant |
| US2001/0047326(A1) | 2001-11-01 | Broadbent et al. | Applicant |
| US2002/0018903(A1) | 2002-02-01 | Kokubo et al. | Applicant |
| US2002/0038430(A1) | 2002-03-01 | Edwards et al. | Applicant |
| US2002/0091819(A1) | 2002-07-01 | Melchione et al. | Applicant |
| US2002/0144156(A1) | 2002-10-01 | Copeland, III | Applicant |
| US2002/0162015(A1) | 2002-10-01 | Tang | Applicant |
| US2002/0166063(A1) | 2002-11-01 | Lachman et al. | Applicant |
| US2002/0184528(A1) | 2002-12-01 | Shevenell et al. | Applicant |
| US2002/0188887(A1) | 2002-12-01 | Largman et al. | Applicant |
| US2002/0194490(A1) | 2002-12-01 | Halperin et al. | Applicant |
| US2003/0074578(A1) | 2003-04-01 | Ford et al. | Applicant |
| US2003/0084318(A1) | 2003-05-01 | Schertz | Applicant |
| US2003/0115483(A1) | 2003-06-01 | Liang | Applicant |
| US2003/0188190(A1) | 2003-10-01 | Aaron et al. | Applicant |
| US2003/0200460(A1) | 2003-10-01 | Morota et al. | Applicant |
| US2003/0212902(A1) | 2003-11-01 | Van Der Made | Applicant |
| US2003/0237000(A1) | 2003-12-01 | Denton et al. | Applicant |
| US2004/0003323(A1) | 2004-01-01 | Bennett et al. | Applicant |
| US2004/0015712(A1) | 2004-01-01 | Szor | Applicant |
| US2004/0019832(A1) | 2004-01-01 | Arnold et al. | Applicant |
| US2004/0047356(A1) | 2004-03-01 | Bauer | Applicant |
| US2004/0083408(A1) | 2004-04-01 | Spiegel et al. | Applicant |
| US2004/0093513(A1) | 2004-05-01 | Cantrell et al. | Applicant |
| US2004/0111531(A1) | 2004-06-01 | Staniford et al. | Applicant |
| US2004/0165588(A1) | 2004-08-01 | Pandya | Applicant |
| US2004/0236963(A1) | 2004-11-01 | Danford et al. | Applicant |
| US2004/0243349(A1) | 2004-12-01 | Greifeneder et al. | Applicant |
| US2004/0249911(A1) | 2004-12-01 | Alkhatib et al. | Applicant |
| US2004/0255161(A1) | 2004-12-01 | Cavanaugh | Applicant |
| US2004/0268147(A1) | 2004-12-01 | Wiederin et al. | Applicant |
| US2005/0021740(A1) | 2005-01-01 | Bar et al. | Applicant |
| US2005/0033960(A1) | 2005-02-01 | Vialen et al. | Applicant |
| US2005/0033989(A1) | 2005-02-01 | Poletto et al. | Applicant |
| US2005/0050148(A1) | 2005-03-01 | Mohammadioun et al. | Applicant |
| US2005/0086523(A1) | 2005-04-01 | Zimmer et al. | Applicant |
| US2005/0091513(A1) | 2005-04-01 | Mitomo et al. | Applicant |
| US2005/0091533(A1) | 2005-04-01 | Omote et al. | Applicant |
| US2005/0114663(A1) | 2005-05-01 | Cornell et al. | Applicant |
| US2005/0125195(A1) | 2005-06-01 | Brendel | Applicant |
| US2005/0157662(A1) | 2005-07-01 | Bingham et al. | Applicant |
| US2005/0183143(A1) | 2005-08-01 | Anderholm et al. | Applicant |
| US2005/0201297(A1) | 2005-09-01 | Peikari | Applicant |
| US2005/0210533(A1) | 2005-09-01 | Copeland et al. | Applicant |
| US2005/0238005(A1) | 2005-10-01 | Chen et al. | Applicant |
| US2005/0265331(A1) | 2005-12-01 | Stolfo | Applicant |
| US2006/0010495(A1) | 2006-01-01 | Cohen et al. | Applicant |
| US2006/0015715(A1) | 2006-01-01 | Anderson | Applicant |
| US2006/0021054(A1) | 2006-01-01 | Costa et al. | Applicant |
| US2006/0031476(A1) | 2006-02-01 | Mathes et al. | Applicant |
| US2006/0047665(A1) | 2006-03-01 | Neil | Applicant |
| US2006/0070130(A1) | 2006-03-01 | Costea et al. | Applicant |
| US2006/0075496(A1) | 2006-04-01 | Carpenter et al. | Applicant |
| US2006/0095968(A1) | 2006-05-01 | Portolani et al. | Applicant |
| US2006/0101516(A1) | 2006-05-01 | Sudaharan et al. | Applicant |
| US2006/0101517(A1) | 2006-05-01 | Banzhof et al. | Applicant |
| US2006/0117385(A1) | 2006-06-01 | Mester et al. | Applicant |
| US2006/0123477(A1) | 2006-06-01 | Raghavan et al. | Applicant |
| US2006/0143709(A1) | 2006-06-01 | Brooks et al. | Applicant |
| US2006/0150249(A1) | 2006-07-01 | Gassen et al. | Applicant |
| US2006/0161983(A1) | 2006-07-01 | Cothrell et al. | Applicant |
| US2006/0161987(A1) | 2006-07-01 | Levy-Yurista | Applicant |
| US2006/0161989(A1) | 2006-07-01 | Reshef et al. | Applicant |
| US2006/0164199(A1) | 2006-07-01 | Gilde et al. | Applicant |
| US2006/0173992(A1) | 2006-08-01 | Weber et al. | Applicant |
| US2006/0179147(A1) | 2006-08-01 | Tran et al. | Applicant |
| US2006/0184632(A1) | 2006-08-01 | Marino et al. | Applicant |
| US2006/0191010(A1) | 2006-08-01 | Benjamin | Applicant |
| US2006/0221956(A1) | 2006-10-01 | Narayan et al. | Applicant |
| US2006/0236393(A1) | 2006-10-01 | Kramer et al. | Applicant |
| US2006/0242709(A1) | 2006-10-01 | Seinfeld et al. | Applicant |
| US2006/0251104(A1) | 2006-11-01 | Koga | Applicant |
| US2006/0288417(A1) | 2006-12-01 | Bookbinder et al. | Applicant |
| US2007/0006288(A1) | 2007-01-01 | Mayfield et al. | Applicant |
| US2007/0006313(A1) | 2007-01-01 | Porras et al. | Applicant |
| US2007/0011174(A1) | 2007-01-01 | Takaragi et al. | Applicant |
| US2007/0016951(A1) | 2007-01-01 | Piccard et al. | Applicant |
| US2007/0033645(A1) | 2007-02-01 | Jones | Applicant |
| US2007/0038943(A1) | 2007-02-01 | FitzGerald et al. | Applicant |
| US2007/0064689(A1) | 2007-03-01 | Shin et al. | Applicant |
| US2007/0094730(A1) | 2007-04-01 | Bhikkaji et al. | Applicant |
| US2007/0143827(A1) | 2007-06-01 | Nicodemus et al. | Applicant |
| US2007/0156895(A1) | 2007-07-01 | Vuong | Applicant |
| US2007/0157180(A1) | 2007-07-01 | Tillmann et al. | Applicant |
| US2007/0157306(A1) | 2007-07-01 | Elrod et al. | Applicant |
| US2007/0171824(A1) | 2007-07-01 | Ruello et al. | Applicant |
| US2007/0174915(A1) | 2007-07-01 | Gribble | Examiner |
| US2007/0192500(A1) | 2007-08-01 | Lum | Applicant |
| US2007/0192858(A1) | 2007-08-01 | Lum | Applicant |
| US2007/0198275(A1) | 2007-08-01 | Malden et al. | Applicant |
| US2007/0240218(A1) | 2007-10-01 | Tuvell et al. | Applicant |
| US2007/0240219(A1) | 2007-10-01 | Tuvell et al. | Applicant |
| US2007/0240220(A1) | 2007-10-01 | Tuvell et al. | Applicant |
| US2007/0240222(A1) | 2007-10-01 | Tuvell et al. | Applicant |
| US2007/0250927(A1) | 2007-10-01 | Naik | Examiner |
| US2007/0250930(A1) | 2007-10-01 | Aziz et al. | Applicant |
| US2007/0271446(A1) | 2007-11-01 | Nakamura | Applicant |
| US2008/0005782(A1) | 2008-01-01 | Aziz | Applicant |
| US2008/0016339(A1) | 2008-01-01 | Shukla | Examiner |
| US2008/0040710(A1) | 2008-02-01 | Chiriac | Applicant |
| US2008/0072326(A1) | 2008-03-01 | Danford et al. | Applicant |
| US2008/0077793(A1) | 2008-03-01 | Tan et al. | Applicant |
| US2008/0080518(A1) | 2008-04-01 | Hoeflin et al. | Applicant |
| US2008/0098476(A1) | 2008-04-01 | Syversen | Applicant |
| US2008/0120722(A1) | 2008-05-01 | Sima et al. | Applicant |
| US2008/0134178(A1) | 2008-06-01 | Fitzgerald et al. | Applicant |
| US2008/0134334(A1) | 2008-06-01 | Kim et al. | Applicant |
| US2008/0141376(A1) | 2008-06-01 | Clausen et al. | Applicant |
| US2008/0181227(A1) | 2008-07-01 | Todd | Examiner |
| US2008/0184373(A1) | 2008-07-01 | Traut et al. | Applicant |
| US2008/0189787(A1) | 2008-08-01 | Arnold et al. | Applicant |
| US2008/0215742(A1) | 2008-09-01 | Goldszmidt et al. | Applicant |
| US2008/0222729(A1) | 2008-09-01 | Chen et al. | Applicant |
| US2008/0263665(A1) | 2008-10-01 | Ma et al. | Applicant |
| US2008/0295172(A1) | 2008-11-01 | Bohacek | Applicant |
| US2008/0301810(A1) | 2008-12-01 | Lehane et al. | Applicant |
| US2008/0307524(A1) | 2008-12-01 | Singh et al. | Applicant |
| US2008/0320594(A1) | 2008-12-01 | Jiang | Applicant |
| US2009/0007100(A1) | 2009-01-01 | Field et al. | Applicant |
| US2009/0013408(A1) | 2009-01-01 | Schipka | Applicant |
| US2009/0031423(A1) | 2009-01-01 | Liu et al. | Applicant |
| US2009/0036111(A1) | 2009-02-01 | Danford et al. | Applicant |
| US2009/0044024(A1) | 2009-02-01 | Oberheide et al. | Applicant |
| US2009/0044274(A1) | 2009-02-01 | Budko et al. | Applicant |
| US2009/0083369(A1) | 2009-03-01 | Marmor | Applicant |
| US2009/0083855(A1) | 2009-03-01 | Apap et al. | Applicant |
| US2009/0089879(A1) | 2009-04-01 | Wang et al. | Applicant |
| US2009/0094697(A1) | 2009-04-01 | Provos et al. | Applicant |
| US2009/0125976(A1) | 2009-05-01 | Wassermann et al. | Applicant |
| US2009/0126015(A1) | 2009-05-01 | Monastyrsky et al. | Applicant |
| US2009/0126016(A1) | 2009-05-01 | Sobko et al. | Applicant |
| US2009/0133125(A1) | 2009-05-01 | Choi et al. | Applicant |
| US2009/0158430(A1) | 2009-06-01 | Borders | Applicant |
| US2009/0187992(A1) | 2009-07-01 | Poston | Applicant |
| US2009/0193293(A1) | 2009-07-01 | Stolfo et al. | Applicant |
| US2009/0199296(A1) | 2009-08-01 | Xie et al. | Applicant |
| US2009/0228233(A1) | 2009-09-01 | Anderson et al. | Applicant |
| US2009/0241187(A1) | 2009-09-01 | Troyansky | Applicant |
| US2009/0241190(A1) | 2009-09-01 | Todd et al. | Applicant |
| US2009/0265692(A1) | 2009-10-01 | Godefroid et al. | Applicant |
| US2009/0271867(A1) | 2009-10-01 | Zhang | Applicant |
| US2009/0300761(A1) | 2009-12-01 | Park et al. | Applicant |
| US2009/0320011(A1) | 2009-12-01 | Chow | Examiner |
| US2009/0328185(A1) | 2009-12-01 | Berg et al. | Applicant |
| US2009/0328221(A1) | 2009-12-01 | Blumfield et al. | Applicant |
| US2010/0017546(A1) | 2010-01-01 | Poo et al. | Applicant |
| US2010/0043073(A1) | 2010-02-01 | Kuwamura | Applicant |
| US2010/0054278(A1) | 2010-03-01 | Stolfo et al. | Applicant |
| US2010/0058474(A1) | 2010-03-01 | Hicks | Applicant |
| US2010/0064044(A1) | 2010-03-01 | Nonoyama | Applicant |
| US2010/0077481(A1) | 2010-03-01 | Polyakov et al. | Applicant |
| US2010/0083376(A1) | 2010-04-01 | Pereira et al. | Applicant |
| US2010/0115621(A1) | 2010-05-01 | Staniford et al. | Applicant |
| US2010/0132038(A1) | 2010-05-01 | Zaitsev | Applicant |
| US2010/0154056(A1) | 2010-06-01 | Smith et al. | Applicant |
| US2010/0192223(A1) | 2010-07-01 | Ismael et al. | Applicant |
| US2010/0251104(A1) | 2010-09-01 | Massand | Applicant |
| US2010/0281102(A1) | 2010-11-01 | Chinta et al. | Applicant |
| US2010/0281541(A1) | 2010-11-01 | Stolfo et al. | Applicant |
| US2010/0281542(A1) | 2010-11-01 | Stolfo et al. | Applicant |
| US2010/0287260(A1) | 2010-11-01 | Peterson et al. | Applicant |
| US2011/0025504(A1) | 2011-02-01 | Lyon et al. | Applicant |
| US2011/0041179(A1) | 2011-02-01 | Stahlberg | Applicant |
| US2011/0047594(A1) | 2011-02-01 | Mahaffey et al. | Applicant |
| US2011/0047620(A1) | 2011-02-01 | Mahaffey et al. | Applicant |
| US2011/0078794(A1) | 2011-03-01 | Manni et al. | Applicant |
| US2011/0093951(A1) | 2011-04-01 | Aziz | Applicant |
| US2011/0099633(A1) | 2011-04-01 | Aziz | Applicant |
| US2011/0113231(A1) | 2011-05-01 | Kaminsky | Applicant |
| US2011/0145920(A1) | 2011-06-01 | Mahaffey et al. | Applicant |
| US2011/0167494(A1) | 2011-07-01 | Bowen et al. | Applicant |
| US2011/0225651(A1) | 2011-09-01 | Villasenor | Examiner |
| US2011/0247072(A1) | 2011-10-01 | Staniford | Examiner |
| US2011/0265182(A1) | 2011-10-01 | Peinado et al. | Applicant |
| US2011/0307954(A1) | 2011-12-01 | Melnik et al. | Applicant |
| US2011/0307955(A1) | 2011-12-01 | Kaplan et al. | Applicant |
| US2011/0307956(A1) | 2011-12-01 | Yermakov et al. | Applicant |
| US2011/0314546(A1) | 2011-12-01 | Aziz et al. | Applicant |
| US2012/0079596(A1) | 2012-03-01 | Thomas et al. | Applicant |
| US2012/0084859(A1) | 2012-04-01 | Radinsky et al. | Applicant |
| US2012/0117652(A1) | 2012-05-01 | Manni et al. | Applicant |
| US2012/0174186(A1) | 2012-07-01 | Aziz et al. | Applicant |
| US2012/0174218(A1) | 2012-07-01 | McCoy et al. | Applicant |
| US2012/0198279(A1) | 2012-08-01 | Schroeder | Applicant |
| US2012/0210423(A1) | 2012-08-01 | Friedrichs et al. | Applicant |
| US2012/0222121(A1) | 2012-08-01 | Staniford et al. | Applicant |
| US2012/0255012(A1) | 2012-10-01 | Sallam | Examiner |
| US2012/0265976(A1) | 2012-10-01 | Spiers et al. | Examiner |
| US2012/0278886(A1) | 2012-11-01 | Luna | Applicant |
| US2012/0291131(A1) | 2012-11-01 | Turkulainen et al. | Examiner |
| US2012/0297489(A1) | 2012-11-01 | Dequevy | Applicant |
| US2012/0304244(A1) | 2012-11-01 | Xie | Examiner |
| US2012/0330801(A1) | 2012-12-01 | McDougal et al. | Applicant |
| US2012/0331553(A1) | 2012-12-01 | Aziz | Examiner |
| US2013/0036472(A1) | 2013-02-01 | Aziz | Applicant |
| US2013/0047257(A1) | 2013-02-01 | Aziz | Applicant |
| US2013/0067577(A1) | 2013-03-01 | Turbin | Examiner |
| US2013/0086684(A1) | 2013-04-01 | Mohler | Examiner |
| US2013/0097699(A1) | 2013-04-01 | Balupari | Examiner |
| US2013/0097706(A1) | 2013-04-01 | Titonis | Examiner |
| US2013/0117741(A1) | 2013-05-01 | Prabhakaran et al. | Examiner |
| US2013/0139265(A1) | 2013-05-01 | Romanenko | Examiner |
| US2013/0145463(A1) | 2013-06-01 | Ghosh | Examiner |
| US2013/0160130(A1) | 2013-06-01 | Mendelev et al. | Applicant |
| US2013/0160131(A1) | 2013-06-01 | Madou et al. | Applicant |
| US2013/0227691(A1) | 2013-08-01 | Aziz et al. | Applicant |
| US2013/0246370(A1) | 2013-09-01 | Bartram et al. | Applicant |
| US2013/0263260(A1) | 2013-10-01 | Mahaffey et al. | Applicant |
| US2013/0291051(A1) | 2013-10-01 | Balinsky | Examiner |
| US2013/0291109(A1) | 2013-10-01 | Staniford et al. | Applicant |
| US2013/0298243(A1) | 2013-11-01 | Kumar | Examiner |
| US2013/0312098(A1) | 2013-11-01 | Kapoor | Examiner |
| US2013/0312099(A1) | 2013-11-01 | Edwards | Examiner |
| US2014/0007228(A1) | 2014-01-01 | Ngair | Examiner |
| US2014/0053260(A1) | 2014-02-01 | Gupta et al. | Applicant |
| US2014/0053261(A1) | 2014-02-01 | Gupta et al. | Applicant |
| GB2439806 | 2008-01-01 | Applicant | |
| GB2490431(A) | 2012-10-01 | Examiner | |
| WO-02/06928 | 2002-01-01 | Applicant | |
| WO-02/23805 | 2002-03-01 | Applicant | |
| WO-2007-117636 | 2007-10-01 | Applicant | |
| WO-2008/041950 | 2008-04-01 | Applicant | |
| WO-2011/084431 | 2011-07-01 | Applicant | |
| WO-2012145066 | 2012-10-01 | Applicant |
Non-Patent Literature (56)
- Hewlett-Packard, “QuickSpecs—HP Proliant DL360 Generation (G6)”, Apr. 28, 2010, Hewlett-Packard, Version 29, pp. 4.Examiner
- D. Levinthal, “Performance Analysis Guide for Intel Core i7 Processor and Intel Xeon 5500 processors”, 2009, Intel Corp, Version 1.0, pp. 12.Examiner
- C. Kolbitsch et al., “The Power of Procrastination: Detection and Mitigation of Execution-Stalling Malicious Code” in Proceedings of the 18th ACM Conference on Computer and Communications Security, 2011, ACM, pp. 1-12.Examiner
- J. Crandall et al., “Temperal Search: Detecting Hidden Timebombs with Virtual Machines” in Proceedings of 9th International Conference on Architectural Support for Programming Languages and Operating Systems, 2006, ACM, pp. 25-36.Examiner
- Lastline Labs, The Threat of Evasive Malware, Feb. 25, 2013, Lastline Labs, pp. 1-8.Examiner
- 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.Examiner
- Lindorfer et al., Detecting environment-sensitive malware, 2011, Springer-Verlag Berlin, RAID'11 Proceedings of the 14th international conference on Recent Advances in Intrusion Detection, pp. 1-20.Examiner
- IEEE Xplore Digital Library Sear Results for “detection of unknown computer worms”. Http//ieeexplore.ieee.org/searchresult.jsp?SortField=Score&SortOrder=desc&ResultC . . . , (Accessed on Aug. 28, 2009).Applicant
- AltaVista Advanced Search Results. “Event Orchestrator”. Http://www.altavista.com/web/results?Itag=ody&pg=aq&aqmode=aqa=Event+Orchesrator . . . , (Accessed on Sep. 3, 2009).Applicant
- AltaVista Advanced Search Results. “attack vector identifier”. Http://www.altavista.com/web/results?Itag=ody&pg=aq&aqmode=aqa=Event+Orchestrator . . . , (Accessed on Sep. 15, 2009).Applicant
- Cisco, Configuring the Catalyst Switched Port Analyzer (SPAN) (“Cisco”),(1992-2003).Applicant
- Reiner Sailer, Enriquillo Valdez, Trent Jaeger, Roonald Perez, Leendert van Doorn, John Linwood Griffin, Stefan Berger., sHype: Secure Hypervisor Appraoch to Trusted Virtualized Systems (Feb. 2, 2005) (“Sailer”).Applicant
- Excerpt regarding First Printing Date for Merike Kaeo, Designing Network Security (“Kaeo”), (2005).Applicant
- The Sniffers's Guide to Raw Traffic available at: yuba.stanford.edu/˜casado/pcap/section1.html, (Jan. 6, 2014).Applicant
- “Network Security: NetDetector—Network Intrusion Forensic System (NIFS) Whitepaper”, (“NetDetector Whitepaper”), (2003).Applicant
- “Packet”, Microsoft Computer Dictionary, Microsoft Press, (Mar. 2002), 1 page.Applicant
- “When Virtual is Better Than Real”, IEEEXplore Digital Library, available at, http://ieeexplore.ieee.org/xpl/articleDetails.jsp?reload=true&arnumber=990073, (Dec. 7, 2013).Applicant
- Abdullah, et al., Visualizing Network Data for Intrusion Detection, 2005 IEEE Workshop on Information Assurance and Security, pp. 100-108.Applicant
- Adetoye, Adedayo , et al., “Network Intrusion Detection & Response System”, (“Adetoye”), (Sep. 2003).Applicant
- Aura, Tuomas, “Scanning electronic documents for personally identifiable information”, Proceedings of the 5th ACM workshop on Privacy in electronic society. ACM, 2006.Applicant
- Baecher, “The Nepenthes Platform: An Efficient Approach to collect Malware”, Springer-verlag Berlin Heidelberg, (2006), pp. 165-184.Applicant
- Bayer, et al., “Dynamic Analysis of Malicious Code”, J Comput Virol, Springer-Verlag, France., (2006), pp. 67-77.Applicant
- Boubalos, Chris , “Extracting syslog data out of raw pcap dumps, seclists.org, Honeypots mailing list archives”, available at http://seclists.org/honeypots/2003/q2/319 (“Boubalos”), (Jun. 5, 2003).Applicant
- Chaudet, C. , et al., “Optimal Positioning of Active and Passive Monitoring Devices”, International Conference on Emerging Networking Experiments and Technologies, Proceedings of the 2005 ACM Conference on Emerging Network Experiment and Technology, CoNEXT '05, Toulousse, France, (Oct. 2005), pp. 71-82.Applicant
- Cohen, M.I. , “PyFlag—An advanced network forensic framework”, Digital investigation 5, Elsevier, (2008), pp. S112-S120.Applicant
- Costa, M. , et al., “Vigilante: End-to-End Containment of Internet Worms”, SOSP '05, Association for Computing Machinery, Inc., Brighton (Oct. 23-26, 2005).Applicant
- Crandall, J.R. , et al., “Minos:Control Data Attack Prevention Orthogonal to Memory Model”, 37th International Symposium on Microarchitecture, Portland, Oregon, (Dec. 2004).Applicant
- Deutsch, P. , ““Zlib compressed data format specification version 3.3” RFC 1950, (1996)”.Applicant
- Distler, “Malware Analysis:An Introduction”, SANS Institute InfoSec Reading Room, SANS Institute, (2007).Applicant
- Dunlap, George W. , et al., “ReVirt: Enabling Intrusion Analysis through Virtual-Machine Logging and Replay”, Proceeding of the 5th Symposium on Operating Systems Design and Implementation, USENIX Association, (“Dunlap”), (Dec. 9, 2002).Applicant
- Filiol, Eric , et al., “Combinatorial Optimisation of Worm Propagation on an Unknown Network”, International Journal of Computer Science 2.2 (2007).Applicant
- Goel, et al., Reconstructing System State for Intrusion Analysis, Apr. 2008 SIGOPS Operating Systems Review, vol. 42 Issue 3, pp. 21-28.Applicant
- Hjelmvik, Erik , “Passive Network Security Analysis with NetworkMiner”, (IN)SECURE, Issue 18, (Oct. 2008), pp. 1-100.Applicant
- Kaeo, Merike , “Designing Network Security”, (“Kaeo”), (Nov. 2003).Applicant
- Kim, H. , et al., “Autograph: Toward Automated, Distributed Worm Signature Detection”, Proceedings of the 13th Usenix Security Symposium (Security 2004), San Diego, (Aug. 2004), pp. 271-286.Applicant
- Krasnyansky, Max , et al., Universal TUN/TAP driver, available at https://www.kernel.org/doc/Documentation/networking/tuntap.txt (2002) (“Krasnyansky”).Applicant
- Kreibich, C. , et al., “Honeycomb-Creating Intrusion Detection Signatures Using Honeypots”, 2nd Workshop on Hot Topics in Networks (HotNets-11), Boston, USA, (2003).Applicant
- Kristoff, J. , “Botnets, Detection and Mitigation: DNS-Based Techniques”, NU Security Day, (2005), 23 pages.Applicant
- Liljenstam, Michael , et al., “Simulating Realistic Network Traffic for Worm Warning System Design and Testing”, Institute for Security Technology studies, Dartmouth College, (“Liljenstam”), (Oct. 27, 2003).Applicant
- Marchette, David J., “Computer Intrusion Detection and Network Monitoring: A Statistical Viewpoint”, (“Marchette”), (2001).Applicant
- Margolis, P.E. , “Random House Webster's ‘Computer & Internet Dictionary 3rd Edition’”, ISBN 0375703519, (Dec. 1998).Applicant
- Moore, D. , et al., “Internet Quarantine: Requirements for Containing Self-Propagating Code”, INFOCOM, vol. 3, (Mar. 30-Apr. 3, 2003), pp. 1901-1910.Applicant
- Morales, Jose A., et al., “Analyzing and exploiting network behaviors of malware.”, Security and Privacy in Communication Networks. Springer Berlin Heidelberg, 2010. 20-34.Applicant
- Natvig, Kurt , “SandboxII: Internet”, Virus Bulletin Conference, (“Natvig”) (Sep. 2002).Applicant
- NetBIOS Working Group. Protocol Standard for a NetBIOS Service on a TCP/UDP transport: Concepts and Methods. STD 19, RFC 1001, Mar. 1987.Applicant
- Newsome, J. , et al., “Dynamic Taint Analysis for Automatic Detection, Analysis, and Signature Generation of Exploits on Commodity Software”, In Proceedings of the 12th Annual Network and Distributed System Security, Symposium (NDSS '05), (Feb. 2005).Applicant
- Newsome, J. , et al., “Polygraph: Automatically Generating Signatures for Polymorphic Worms”, In Proceedings of the IEEE Symposium on Security and Privacy, (May 2005).Applicant
- Nojiri, D. , et al., “Cooperation Response Strategies for Large Scale Attack Mitigation”, DARPA Information Survivability Conference and Exposition, vol. 1, (Apr. 22-24, 2003), pp. 293-302.Applicant
- Silicon Defense, “Worm Containment in the Internal Network”, (Mar. 2003), pp. 1-25.Applicant
- Singh, S. , et al., “Automated Worm Fingerprinting”, Proceedings of the ACM/USENIX Symposium on Operating System Design and Implementation, San Francisco, California, (Dec. 2004).Applicant
- Spitzner, Lance , “Honeypots: Tracking Hackers”, (“Spizner”), (Sep. 17, 2002).Applicant
- Thomas H. Ptacek, and Timothy N. Newsham , “Insertion, Evasion, and Denial of Service: Eluding Network Intrusion Detection”, Secure Networks, (“Ptacek”), (Jan. 1998).Applicant
- Venezia, Paul , “NetDetector Captures Intrusions”, InfoWorld Issue 27, (“Venezia”), (Jul. 14, 2003).Applicant
- Whyte, et al., “DNS-Based Detection of Scanning Works in an Enterprise Network”, Proceedings of the 12th Annual Network and Distributed System Security Symposium, (Feb. 2005), 15 pages.Applicant
- Williamson, Matthew M., “Throttling Viruses: Restricting Propagation to Defeat Malicious Mobile Code”, ACSAC Conference, Las Vegas, NV, USA, (Dec. 2002), pp. 1-9.Applicant
- International Search Report from corresponding PCT/US2014/043727 application dated Sep. 25, 2014, from European Patent Office Officer Marc Meis.Applicant