US 9,912,691 B2Grant
Fuzzy hash of behavioral results
Issue Date:2018-03-06
•20 Claims
•10 Drawing Sheets
Abstract
A computerized method for classifying objects in a malware system is described. The method includes detecting behaviors of an object for classification after processing of the object has begun. Data associated with the detected behaviors is collected, and a fuzzy hash for the received object is generated. The generation of the fuzzy hash may include (i) removing a portion of the data associated with the detected behaviors, and (ii) performing a hash operation on a remaining portion of the data associated with the detected behaviors. Thereafter, the fuzzy hash for the received object is compared to a fuzzy hash of an object in a preexisting cluster to generate a similarity measure. The received object is associated with the preexisting cluster in response to determining that the similarity measure is above a predefined threshold value. Thereafter, the results are reported.
Metadata
Assignee
- FireEye, Inc.
Inventors
- Ali Mesdaq
- Paul L. Westin, III
Application Information
Application Number:US 15/076,322
Filing Date:2016-03-21
Priority Date:2013-09-30
Art Unit:2433
Classifications
IPC:
G06F11/00G06F12/14G06F12/16G08B23/00H04L29/06G06F21/56
Field of Search:
G06F 21/56G06F 21/562G06F 21/564H04L 63/14H04L 63/1408H04L 63/1416
Patent Drawings (10 sheets)
Description
CROSS-REFERENCE OF RELATED APPLICATIONS
[0001] This application is a continuation of U.S. patent application Ser. No. 14/042,454 filed on Sep. 30, 2013, now U.S. Pat. No. 9,294,501 issued Mar. 22, 2016. The entire contents of U.S. patent application Ser. No. 14/042,454 are incorporated by reference herein.
FIELD
[0002] Embodiments of the disclosure relate to the field of network security. More specifically, one embodiment of the disclosure relates to a system, apparatus, and method for classifying a suspect object in a malware system using a fuzzy hash of behaviors of the suspect object and clusters of previously classified objects.
GENERAL BACKGROUND
[0003] Over the last decade, malicious software (malware) has become a pervasive problem for Internet users. In some situations, malware is a program, file, or digital data object that is embedded within downloadable content and designed to adversely influence (i.e., attack) normal operations of a computer. Examples of different types of malware may include bots, computer viruses, worms, Trojan horses, spyware, adware, or any other programming that operates within the computer without permission.
[0004] For instance, content may be embedded with objects associated with a web page hosted by a malicious web site. By downloading this content, malware causing another web page to be requested from a malicious web site may be unknowingly installed on the computer. Similarly, malware may also be installed on a computer upon receipt or opening of an electronic mail (email) message. For example, an email message may contain an attachment, such as a Portable Document Format (PDF) document, with embedded executable malware. Also, malware may exist in files infected through any of a variety of attack vectors, which are uploaded from the infected computer onto a networked storage device such as a file share.
[0005] As development of malware has progressed, hackers have developed malware that share similarities with other malware objects, but maintain some dissimilarities. Accordingly, these “similar” malware objects may be in the same malware family, but traditional malware and anti-virus protection systems may fail to properly classify each object in the family as malware based on these differences. For example, traditional malware detection and classification techniques may employ a direct comparison of a suspect object with known malware objects in an attempt to reveal an exact match. However, if the suspected malware object has not been previously detected and analyzed (e.g., zero-day malware threats), these direct comparison techniques will fail to classify the object as malware even if “similar” objects have been previously classified as malware. Accordingly, traditional malware classification and analysis techniques may prove inaccurate and inefficient as these techniques do not accommodate for small difference between malware objects within a family of malware.
BRIEF DESCRIPTION OF THE DRAWINGS
[0006] 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:
[0007] FIG. 1 is an exemplary block diagram of a communication system deploying a plurality of malicious content detection (MCD) systems according to one embodiment of the invention.
[0008] FIG. 2 is an exemplary block diagram of a MCD system according to one embodiment of the invention.
[0009] FIG. 3 is a diagram of a method for classifying objects using fuzzy hashes of previously classified objects according to one embodiment of the invention.
[0010] FIG. 4A shows an example user interface for entering information for a suspect object according to one embodiment of the invention.
[0011] FIG. 4B shows the example user interface of FIG. 4A after a warning message has been returned to a user according to one embodiment of the invention.
[0012] FIG. 5 is a diagram of a set of objects assigned to a set of clusters according to one embodiment of the invention.
[0013] FIG. 6 is a diagram of a set of objects known as malware, known as non-malware, or with an unknown status and assigned to a set of clusters according to one embodiment of the invention.
[0014] FIG. 7A is a diagram of a suspect object being added to a preexisting cluster according to one embodiment of the invention.
[0015] FIG. 7B is a diagram of a suspect object being added to a new cluster according to one embodiment of the invention.
DETAILED DESCRIPTION
I. Overview
[0016] In one embodiment of the invention, a communication system is provided that includes a plurality of malicious content detection (MCD) systems communicatively coupled to a management system via a network. Each of the MCD systems may detonate, execute, open, or otherwise process a suspected malware object such that the suspect object conducts/performs a set of behaviors. These behaviors are collected and recorded such that further analysis with objects previously analyzed and assigned to clusters may be performed. In one embodiment, the recorded behavior data for the suspect object may be used to generate a fuzzy hash. A fuzzy hash allows the comparison of objects to determine similarity of the objects instead of necessarily a direct match. In comparison, traditional hashing techniques only allow a comparison of objects to determine an exact match. By allowing the determination of “similar” objects, fuzzy hashes afford a greater leniency in classification and categorization of objects that might be slightly different but otherwise share important characteristics.
[0017] As alluded to above, the fuzzy hash of the suspect object is compared against fuzzy hashes of one or more objects in one or more clusters. In one embodiment, machine learning may be utilized to determine a “similar” object in a cluster. Upon detection of a “similar” object, the suspect object may be associated with the cluster and classified based on information attached to the cluster. For example, the suspect object may be classified as malware, non-malware, or with an unknown status based on the classification of objects within the cluster. In some embodiments, the suspect object may be assigned a malware family name associated with the cluster.
[0018] As described above, fuzzy hash techniques may be used to group “similar” objects in clusters for further analysis and classification. This similarity matching provides 1) greater flexibility in analyzing potential malware objects, which may share multiple characteristics and behaviors but are also slightly different from previously classified objects, 2) a more efficient technique for classifying/assigning attributes to objects (e.g., malware family names), and 3) increase accuracy in identifying malware.
II. Terminology
[0019] In the following description, certain terminology is used to describe features of the invention. For example, in certain situations, the terms “logic” and “engine” are representative of hardware, firmware or software that is configured to perform one or more functions. As hardware, logic may include circuitry such as processing circuitry (e.g., a microprocessor, one or more processor cores, a programmable gate array, a microcontroller, an application specific integrated circuit, etc.), wireless receiver, transmitter and/or transceiver circuitry, semiconductor memory, combinatorial logic, or other types of electronic components.
[0020] As software, logic 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 is 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.
[0021] The term “content” generally refers to information transmitted over a network as one or more messages, namely a grouping of information that comprises a header and a payload, such as any of the following: a packet; a frame; a stream being a sequence of packets or frames; an Asynchronous Transfer Mode “ATM” cell; or any other series of bits having a prescribed format. An “object” may be construed as a portion of the content, namely information within one or more of the messages. The “payload” is generally defined as including the data associated with the message such as text, executable software, an image, audio, video, a Uniform Resource Locator (URL), or other types of digital data. The “header” is generally defined as a part of the message that includes control information. However, the specific types of control information depend on the content/object type.
[0022] For network traffic, such as data transmitted in accordance with a Hypertext Transfer Protocol (HTTP), HyperText Markup Language (HTML) protocol, the header may include source and destination Internet Protocol (IP) addresses (e.g., IPv4 or IPv6 addressing) and/or source and destination port information.
[0023] Another example of content or objects includes email, 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). A further example of content or objects includes an Instant Message, which may be transmitted using Session Initiation Protocol (SIP) or Extensible Messaging and Presence Protocol (XMPP) for example. Yet another example of content or objects 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. Where the content or object is email, Instant Message or a file, the header may include the sender/recipient address, the sender/recipient phone number, or a targeted network location of the file, respectively.
[0024] The term “malware” is directed to software that produces an undesirable behavior upon execution, where the behavior is deemed to be “undesirable” 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. This undesired behavior may include a communication-based anomaly or an execution-based anomaly that (1) alters the functionality of an electronic device executing that application software in a malicious manner; (2) alters the functionality of an electronic device executing that application software without any malicious intent; and/or (3) provides an unwanted functionality which is generally acceptable in other context.
[0025] 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 router). 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.
[0026] The term “computerized” generally represents that any corresponding operations are conducted by hardware in combination with software and/or firmware.
[0027] 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.
[0028] 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
[0029] Referring to FIG. 1 , an exemplary block diagram of a communication system 100 deploying a plurality of malicious 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 one or more clusters of objects, each of which comprise information representative of prior detected and classified objects, to be shared among some or all of the MCD systems 1101-110N for use in malware checks. Such sharing may be conducted automatically or manually uploaded by an administrator. Also, such sharing may be conducted freely among the MCD systems 1101-110N or subject to a subscription basis.
[0030] Herein, according to the embodiment illustrated in FIG. 1 , a first MCD system 1101 is an electronic device that is adapted to analyze information associated with network traffic routed over a communication network 130 between at least one server device 140 and at least one client device 150.
[0031] 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 the client device 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.
[0032] 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 “tap” or “network tap”) that is configured to receive network traffic propagating to/from the client device 150 and provide content from the network traffic to the first MCD system 1101.
[0033] In general, the network interface 160 receives and duplicates the content that is received from and provided to client device 150 normally without an appreciable decline in performance by the server device 140, the client device 150, or the communication network 130. The network interface 160 may duplicate any portion of the content, for example, one or more files or objects that are part of a data flow or part of the payload contained within certain data packets, or the like.
[0034] In some embodiments, the network interface 160 may capture metadata from network traffic intended for the client device 150. This metadata may be used, at least in part, to deconstruct a corresponding file. For instance, the metadata may include keys that can be used to de-obfuscate a file or object.
[0035] 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, a network interface card and related logic (not shown) for connecting to the communication network 130 to non-disruptively “tap” network traffic propagating through firewall 155 and provide a copy of the network traffic to the dynamic analysis engine 190. 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 duplicate files from virtual networks.
[0036] Referring still to FIG. 1 , first MCD system 1101 may include a scheduler 180, a storage device 185, a dynamic analysis engine 190, and a clustering and reporting module 195. In some embodiments, the network interface 160 may be contained within the first MCD system 1101. Also, the dynamic analysis engine 190 and the clustering and reporting module 195 may be software modules executed by a processor that receives content and performs a dynamic scan analysis on objects within the content, which may involve accessing one or more non-transitory storage mediums operating as the storage device 185. In some embodiments, the dynamic analysis engine 190 may be one or more software modules, where such software modules are executed by a processor within the MCD system 1101. The clustering and reporting module 195 may be one or more software modules executed by the same or a different processor, where these different processors are possibly located at geographically remote locations, located within the same processor package (e.g. different processor cores) and/or communicatively coupled for example via a network.
[0037] Herein, in one embodiment, the static analysis engine 175 may serve as a filter to permit subsequent malware analysis of one or more objects that may represent only on a portion of incoming content, which effectively conserves system resources and provides faster response time in determining the presence of malware within the analyzed content. As shown in FIG. 1 , the static analysis engine 175 receives the copy of incoming content from the network interface 160 and applies heuristics to determine if any object(s) of the content are “suspicious”. The heuristics applied by the static analysis engine 175 may be based on data and/or rules stored in a database (not shown). Also, the static analysis engine 175 may examine the image of the captured content without executing or opening the captured content.
[0038] For example, the static analysis engine 175 may examine objects such as metadata or certain attributes of the captured content to determine whether a certain portion of the captured object matches (e.g., a high level of correlation with) a predetermined pattern of attributes that is associated with a malicious attack. According to one embodiment of the disclosure, the static analysis engine 175 flags objects from one or more data flows as suspicious after applying this heuristic analysis.
[0039] Thereafter, according to one embodiment of the invention, the static analysis engine 175 may be adapted to transmit at least an object of the suspicious content to the dynamic analysis engine 190. The portion of the object(s), such as some metadata for example, may identify attributes of the runtime environment in which the suspicious content should be processed and, on occasion, of the client device(s) 150 to which the suspicious content was being sent. Such metadata or attributes are used to identify a configuration of a virtual machine (VM) needed for subsequent malware analysis. In another embodiment of the disclosure, the dynamic analysis engine 190 may be adapted to receive one or more messages (e.g., data packets) from the static analysis engine 175 and analyze the message(s) to identify the software profile information associated with the needed VM.
[0040] For instance, as an illustrative example, the suspicious object(s) under test may include a portion of an email message that was generated, under control of Windows® 7 Operating System, using a Windows® Outlook 2010, version 1. Upon determining that the object includes suspicious content, such as an attachment for example, static analysis engine 175 provides software profile information to scheduler 180 to identify a particular configuration of VM needed to conduct dynamic analysis of the suspicious object. According to this illustrative example, the software profile information would include (1) Windows® 7 Operating System (OS); (2) Windows® Outlook 2010, version 1; and perhaps (3) an Adobe® reader if the attachment is a Portable Document Format (PDF) document.
[0041] The static analysis engine 175 supplies the software profile information to the scheduler 180, which determines whether any of the VM disk files within storage device 185 feature a software profile supporting the above-identified configuration of OS and one or more applications or a suitable alternative.
[0042] The dynamic analysis engine 190 is adapted to execute multiple VMs, to simulate the receipt and processing of different types of “suspicious” objects as well as different operating environments. Furthermore, the dynamic analysis engine 190 monitors and analyzes the activities and other behaviors of such objects during processing in the VM. The behaviors may include those expected and/or not expected during processing of that type of object. Unexpected behaviors can be considered anomalous behaviors. Examples of anomalous behaviors may include unusual network transmissions, opening certain ports to retrieve data, unusual changes in performance, and the like. This detection process is referred to as a dynamic malicious content detection.
[0043] The dynamic analysis engine 190 may flag the suspicious object as malware according to the observed behavior of the VM. In response to detecting anomalous behaviors, the dynamic analysis engine 190 may provide information to the cluster and reporting module 195 to conduct further analysis with objects previously analyzed and assigned to clusters, as described below.
[0044] Referring now to FIG. 2 , an exemplary block diagram of logic associated with MCD system 1101 is shown. MCD system 1101 comprises one or more processors 200 that are coupled to communication interface logic 210 via a first transmission medium 220. Communication interface logic 210 enables communications with other MCD systems 1102-110N, management system 120 and/or cloud computing services 135 of FIG. 1 . According to one embodiment of the disclosure, communication interface logic 210 may be implemented as a physical interface including one or more ports for wired connectors. Additionally, or in the alternative, communication interface logic 210 may be implemented with one or more radio units for supporting wireless communications with other electronic devices.
[0045] Processor(s) 200 is(are) further coupled to persistent storage 230 via transmission medium 225. According to one embodiment of the disclosure, persistent storage 230 may include static analysis engine 175, dynamic analysis engine 190, graphical user interface (GUI) logic 271, configuration logic 273, and clustering and reporting module 195, which comprises behavior analysis logic 231, sanitization logic 233, fuzzy hashing logic 235, comparison logic 237, and malware score logic 239. Of course, when implemented as hardware, engine 190 and logic 231, 233, 235, 237, 239, 271, and 273 would be implemented separately from persistent storage 230.
[0046] Turning now to FIG. 3 , a method for classifying objects 300 will now be described. Each operation of the method 300 may be performed by one or more components of the MCD system 1101. For example, the operation of method 300 may be performed by the dynamic analysis engine 190 in conjunction with the clustering and reporting module 195 of the MCD system 1101. In other embodiments, the operations of method 300 may be performed in full or in part by other components of the communication system 100.
[0047] The method 300 may commence at operation 301 with receipt of a suspect object to be classified. The suspect object may be intercepted by the network interface 160 and passed to the MCD system 1101 for analysis. In another embodiment, an anti-malware system running on the client device 150 may periodically and without direct provocation by the user intercept and transmit objects to the MCD system 1101 for processing and analysis. This independent interception and analysis of objects allows the client device 150 to maintain an automatic examination of potential malware objects received without direct interaction by a user.
[0048] In another embodiment, a user of the client device 150 may submit a suspect object through a user interface. The interface may be generated by GUI logic 271 and served to the client device 150 by configuration logic 273 of the MCD system 1101. In this fashion, the MCD system 1101 may operate as a web-server to deliver data and a user interface to the client device 150.
[0049] FIG. 4A shows a web-interface 400 for submitting a suspect object to the MCD system 1101 for analysis according to one embodiment. In this example interface 400, a user may direct a web browser running on the client device 150 to view the web-interface 400. The user may thereinafter enter the address/location of a suspect object into the web-interface 400 using the address input field 401 and the “BROWSE” button 403. The entered address indicates the location of the suspect object in storage on the client device 150 or on a remote device (e.g., stored on a website). After selection of a suspect object, the user may submit the suspect object for analysis by selecting the “SCAN” button 405 in the web-interface 400. The suspect object may be transmitted from the client device 150 such that it is received by the MCD 1101 for processing as described above at operation 301.
[0050] In one embodiment, a suspect object may be any digital data structure. For example, a suspect object may be a file (e.g., PDF document), a component of a file, a component of a web page, an image, a series of captured network/web traffic that is capable of being replayed, etc. As described above, a user of the client device 150 may manually determine that an object is suspected to be malware or the client device 150 may automatically classify the object as potential/suspected malware and transmit the suspect object to the MCD system 1101.
[0051] Referring back to FIG. 3 , although described in relation to receiving a single suspect object, in other embodiments, the method 300 may be used in relation to multiple suspect objects received simultaneously or in rapid succession. For example, the method 300 may be used to analyze multiple suspect objects received from the client device 150 or other devices on the network 130. The suspect objects may be processed by the method 300 separately to determine whether each received suspect object is malware based on comparisons with previously generated clusters of objects using fuzzy hashes as described in greater detail below.
[0052] Following receipt of a suspect object, operation 303 determines behaviors of the suspect object using the behavior analysis logic 231. The determined behaviors characterize the suspect object such that a comparison can be performed with other previously classified objects in one or more object clusters as will be described in further detail below.
[0053] In one embodiment, the behaviors may be determined/detected at operation 303 after the suspect object has been detonated, namely processed (e.g. executed, opened or otherwise activated), by the dynamic analysis engine 190. For example, dynamic analysis engine 190 may detonate the suspect object such that operations associated with the suspect object are performed. For instance, in one embodiment the suspect object may be a PDF file. In this embodiment, the dynamic analysis engine 190 may detonate the PDF file by opening the file using an Adobe® Reader or other appropriate document reader.
[0054] In one embodiment, one or more virtual machines with various profiles that simulate the client device 150 may be used during detonation of the suspect object. These profiles may be software to be run by a virtual machine to process a suspect object. For example, the profiles may include an operating system and one or more suitable computer applications that are associated with the client device 150. For instance, an Adobe® Reader may be included in a virtual machine such that a suspect object, which is a PDF file, may be detonated by the virtual machine. Use of virtual machines ensures that detonation of the suspect object is controlled and will not result in infection of the client device 150 while still simulating the computing environment of the client device 150 to generate behavior data that describes the suspect object.
[0055] As noted above, detonation of the suspect object produces behavior data that describes the suspect object such that a comparison may later be performed with other objects. This behavior data may be detected and collected at operation 303 using the behavior analysis logic 231. The behavior data may include, for example, details regarding data generated by the suspect object during detonation, data accessed by the suspect object (both locally and from remote systems) during detonation, known exploits in the suspect object, etc.
[0056] In one embodiment, operation 305 may scrub the behavior data detected and collected at operation 303 to remove data that does not identify the suspect object. This scrubbing operation may be performed using the sanitization logic 233. In one embodiment, scrubbing the behavior data includes removing a subset of process identifiers of processes called by the suspect object during detonation, values written to, deleted from, or modified to a registry by the suspect object during detonation such that only the path of these operations is retained, and names of files generated, modified, and/or deleted by the suspect object during detonation such that only a path in an associated file system is retained. This removed/scrubbed data may be discarded at operation 305 as it does not identify the suspect object in relation to other objects and may be considered superfluous.
[0057] After the behavior data has been scrubbed at operation 305 to generate scrubbed behavior data, the method 300 may perform two analyses: 1) an analysis to associate the suspect object with a cluster of previously stored/analyzed objects and 2) an analysis to generate a malware score, which describes the probability that the suspect object is malware. The analyses may be run concurrently or asynchronously. In one embodiment, the results of the first analysis (i.e., cluster association) may be used to modify the malware score generated by the second analysis. Each of these analyses will be described in greater detail below.
[0058] Beginning with the first analysis of the suspect object, at operation 307 a fuzzy hash for the suspect object may be generated based on the scrubbed behavior data using the fuzzy hashing logic 235. A fuzzy hash allows the comparison of objects to determine similarity of the objects instead of necessarily a direct match. In comparison, traditional hashing techniques only allow a comparison of objects to determine an exact match. By allowing the determination of “similar” objects, fuzzy hashes afford a greater leniency in classification and categorization of objects that might be slightly different but otherwise share important characteristics. Through the utilization of a fuzzy hash, similar objects may be determined through a comparison of hash values within the fuzzy hash as will be described in greater detail below.
[0059] In one embodiment, a fuzzy hash is constructed by running a hashing algorithm over blocks of the scrubbed behavior data for an object. In one embodiment, an MD5 hash may be performed on successive blocks of scrubbed behavior data to produce a plurality or a stream of hash values. For example, the scrubbed behavior data may be separated into N equal sized blocks, where N is greater than or equal to two (e.g., 1024 byte blocks). A hash value is produced for each of the N blocks to generate exactly N hash values. In one embodiment, the scrubbed behavior data may be separated into blocks corresponding to segments of data that represent discrete behaviors detected at operation 303. Accordingly, in this embodiment, each block represents a single detected behavior associated with the suspect object.
[0060] Although described in relation to use of an MD5 hash for generation of the fuzzy hash, in other embodiments other hashing techniques/methods may be used. For example, in other embodiments a SHA, SWIFFT, and/or HAVAL hash may be used to generate the fuzzy hash for the suspect object at operation 307.
[0061] Following the generation of a fuzzy hash for the suspect object at operation 307, operation 309 may compare the fuzzy hash for the suspect object with one or more fuzzy hashes of other previously stored/classified objects associated with clusters. This comparison may be performed using the comparison logic 237 of the MCD system 1101. In one embodiment, the previously stored clusters of objects are stored locally on the MCD system 1101 in the storage device 185 or a separate data store (e.g. part of persistent storage 230 of FIG. 2 ). In other embodiments, the previously stored clusters of objects may be stored in cloud computing services 135 or the management system 120. In these embodiments, the management system 120 may distribute clusters of objects to MCD systems 1101-1103 as needed or the MCD systems 1101-1103 may directly access the clusters of objects over the network 125 for analysis of other objects received by these MCD systems 1101-1103.
[0062] As shown in FIG. 5 , each previously stored object 501 may be associated with one or more behaviors. Similar to the behaviors of the suspect object, the behaviors of the previously stored objects 501 characterize the dynamic actions, operations, and activities of the objects 501 during detonation. A fuzzy hash may be associated with each object 501 based on these behaviors in a similar fashion as described above in relation to operation 307. Each of the previously stored objects 501 may be associated with a cluster 503 based on a similarity of fuzzy hashes for each respective object 501. For example, as shown in FIG. 5 , objects 5011 and 5012 are associated with the cluster 5031. This association indicates that the fuzzy hashes of objects 5011 and 5012 are “similar” and may be considered in the same family. In one embodiment, similarity may be described in terms of the number of matching hash values between the respective fuzzy hashes of objects 5011 and 5012. For example, the fuzzy hashes of two objects may be compared to determine a similarity measure. The similarity measure may describe the percentage or number of matching hash values between the two fuzzy hashes. In one embodiment, a similarity measure above a predefined similarity threshold indicates that the objects are similar. Since the objects 5011 and 5012 are in the same cluster 5031, the comparison of fuzzy hashes for objects 5011 and 5012 would yield a similarity measure above the predefined similarity threshold. In contrast, the comparison of fuzzy hashes for objects 5011 and 5013 would yield a similarity measure below the predefined similarity threshold since these objects 5011 and 5013 are associated with different clusters (e.g., clusters 5031 and 5032 respectively).
[0063] Referring back to FIG. 3 and returning to operation 309, the fuzzy hash of the suspect object is compared with one or more fuzzy hashes of previously stored objects associated with clusters. Using the example set of objects 601 in FIG. 6 , the fuzzy hash of the suspect object may be compared against the fuzzy hashes of one or more of the objects 6011-60115. In one embodiment, operation 309 compares the fuzzy hash of the suspect object with the fuzzy hash of at least one object 601 in each cluster 603. Each comparison yields a separate similarity measure that describes the similarity of the suspect object and each respective comparison object 601.
[0064] In one embodiment, operation 309 may utilize statistical and machine learning to determine whether the suspect object is similar to an object in a cluster. Machine learning refers to a process or system that can learn from data, i.e., be trained to distinguish between “good” and “bad”, or in this case, between similar objects and non-similar objects. The core of machine learning deals with representation and generalization, that is, representation of data objects (e.g., the anomalies and other analytical results, which can be collectively represented by features/behaviors of the objects), and functions performed on those objects (e.g., weighting and probability formulas). Generalization is the property that the process or system uses to apply what it learns on a learning set of known (or “labeled”) data objects to unknown (or “unlabeled”) examples. To do this, the process or system must extract learning from the labeled set that allows it to make useful predictions in new and unlabeled cases.
[0065] For machine learning, the MCD system 1101 may operate in a training mode and in an operational mode. In a training mode, the MCD system 1101 employs threat heuristics training logic to subject known samples (e.g., labeled samples) of similar objects and known samples of non-similar objects to calibrate threat heuristics logic for probability scoring and/or decision making of objects. To accomplish this, the threat heuristics training logic may submit similar and non-similar objects to analyzers. In some embodiments, the threat heuristics training logic may employ a special forensics system. In alternative embodiments, the threat heuristics training logic may test the similar and non-similar objects each time it processes a different suspect object, or it may store the results of prior tests for use for future processing of objects. The threat heuristics training logic may assign a probability score (e.g., a similarity measure) to each of the possible patterns resulting from testing the similar and non-similar objects. These probability scores and classification labels are indicative of whether a set of objects are similar. In one embodiment, the machine learning routines and operations described above may be performed by the learning module 187 shown in FIG. 1 based on inputs from the storage device 185 and/or the clustering and reporting module 195.
[0066] Referring back again to FIGS. 2-3 , at operation 311, the set of similarity measures generated at operation 309 may be compared against the predefined similarity threshold to determine whether the suspect object is “similar” to a previously stored object in a preexisting cluster. This comparison may be performed by the comparison logic 237 and reveals whether the suspect object is within the same family as objects within a cluster. As noted above, if a similarity measure is above the predefined similarity threshold, the suspect object is “similar” to the corresponding object. However, if the similarity measure is below the predefined similarity threshold, the suspect object is not “similar” to the corresponding object. In one embodiment, the predefined similarity threshold may be set by an analyst, network administrator, and/or subscriber.
[0067] Upon determining that a similarity measure is above the predefined similarity threshold, the method moves to operation 313. At operation 313, the suspect object is associated with the cluster of the object with which the generated similarity measure exceeded the predefined similarity threshold. For example, as shown in FIG. 7A , the fuzzy hash of the suspect object may be added to cluster 6032. In this example, the similarity measure between the suspect object and one or more of the objects 6015-6018 is above the predefined similarity threshold.
[0068] In one embodiment, association with a cluster may be used to further describe the suspect object. For example, association with a cluster may be used to 1) determine a malware family name for the suspect object and/or 2) determine whether the suspect object is malware, non-malware, or has an unknown status.
[0069] As shown in FIG. 7A , the objects 6011-6014 in the cluster 6031 were determined to be non-malware (indicated by the lack of shading for these objects 6011-6014). This classification determination may be based on a previous dynamic or static analysis of the objects 6011-6014. In this case, if the suspect object had been associated with the cluster 6031, the suspect object would be classified as non-malware.
[0070] In comparison, the objects 6015-6018 in the cluster 6032 were determined to be malware (indicated by shading of these objects 6015-6018) and associated with the malware family name “MalBot”. Again, this classification determination may be based on a previous dynamic or static analysis of the objects 6015-6018 using both comparisons with locally stored objects and objects stored remotely. Since the suspect object has been associated with the cluster 6032 in the example provided above, the suspect object is classified malware and associated with the malware family name “MalBot”.
[0071] In some instances, a status of a set of objects in a cluster may not yet be known. For example, in the cluster 6034 shown in FIG. 7A the status of these objects 60112-60116 cannot yet be determined as malware or non-malware (indicated by dashed border for these objects 60112-60116). Accordingly, if the suspect object had been associated with the cluster 6034, the suspect object would be classified with an unknown status. Grouping objects with unknown status may later be useful when a classification and/or malware family name may be assigned to these objects.
[0072] In some embodiments, association of an object with a cluster may only be informative and not provide classification information. For example, the cluster 6033 may include several objects 6019-60111 that have been classified as malware and associated with the malware family name “DataStealer”. However, association with cluster 6033 may only yield an association with a malware family name associated with the cluster 6033 (e.g., “DataStealer”) instead of also a classification for the newly added object. This failure to yield classification information for new objects may be based on a number of false positive malware classifications associated with the cluster 6033 or another threshold that indicates an unreliable classification.
[0073] In one embodiment, operations 309 and 311 may be first performed in relation to clusters of objects stored locally on the MCD system 1101 (i.e., in the storage device 185). Following a failure to locate a locally stored cluster with a “similar” object to the suspect object, the operations 309 and 311 may be performed for clusters of objects stored on other devices. For example, the operations 309 and 311 may be performed on clusters of objects stored on a cloud server located in the cloud computing services 135 in response to a failure to locate a local cluster with a “similar” object.
[0074] Returning to operation 311 of FIG. 3 , upon determining that similarity measures generated for the suspect object at operation 309 are not above the predefined similarity threshold for any local or remote clusters of objects, the method 300 moves to operation 315 to create a new cluster for the suspect object. For example, FIG. 7B , shows the suspect object added to new cluster 6035. In this example, the suspect object is not similar to any of the objects 6011-60116 based on compared fuzzy hashes and accordingly is not part of these families of objects. Instead, the suspect object is the first member of a new family defined by the cluster 6035.
[0075] Following generation of a new cluster for the suspect object at operation 315, operation 317 may transmit the new cluster to the MCD systems 1102 and 1103 and/or the management system 120. In one embodiment, the management system 120 may receive the new cluster from the MCD system 1101 and propagate this new cluster to the MCD systems 1102 and 1103 using the network 125. The MCD systems 1102 and 1103 may utilize this new cluster for future analysis of other objects intercepted or otherwise received from the client device 150 or other devices on the network 130.
[0076] As described above, objects intercepted or otherwise received from the client device 150 may be compared using fuzzy hashes to determine similarity. Upon determination of similarity, the received/suspect object may be associated with a corresponding cluster and inherit attributes of the cluster. These attributes may include 1) classification as malware, non-malware, or an unknown status and/or 2) a malware family name. By utilizing fuzzy hash comparisons with previously stored and classified objects, the method 300 provides an efficient technique for classifying newly received objects based on familial similarities.
[0077] In one embodiment, the results of the method 300 may be transmitted from the clustering and reporting module 195 to the dynamic analysis engine 190. In this embodiment, the results of the method 300 may be used to supplement the analysis results produced by the dynamic analysis engine 190 to increase the accuracy in identifying suspicious objects as malware.
[0078] As noted above, the method 300 may conduct a separate analysis following operation 305 to generate a preliminary malware score, which describes the probability that the suspect object is malware. For example, the preliminary malware score may fall between 0.0 and 1.0. In one embodiment, operation 319 compares the scrubbed behavior data of the suspect object with known malware behaviors using the malware score logic 239 shown in FIG. 2 . These known malware behaviors may be cultivated after dynamic analysis of known malware objects by the MCD 1101, another device on the network 125 (e.g., the MCDs 1102 and 1103 or the management system 120), and/or a remote device (e.g., device located within the cloud computing services). In one embodiment, the known malware behaviors are stored in the storage device 185 and describe unexpected, anomalous, and/or malicious actions that are characteristic of malware. Examples of anomalous behaviors may include unusual network transmissions, opening certain ports to retrieve data, unusual changes in performance, and the like.
[0079] The comparison at operation 319 yields a preliminary malware score based on the number of similarities between the scrubbed behavior data and the known malware behavior. For example, when multiple behaviors described in the scrubbed behavior data match behaviors in the known malware behaviors, operation 319 may yield a high preliminary malware score (e.g., 0.9), which indicates a high probability the suspect object is malware. In contrast, when few behaviors described in the scrubbed behavior data match behaviors in the known malware behaviors, operation 319 may yield a low preliminary malware score (e.g., 0.1), which indicates a low probability the suspect object is malware. In one embodiment, this comparison at operation 319 may be performed using machine learning and statistical analysis similar to that described above in relation to operation 309.
[0080] In one embodiment, the preliminary malware score may be used at operation 321 to generate a final malware score based on the suspect object's association with a cluster at operations 313 or 315. For example, when the suspect object is associated with a cluster that classifies the suspect object as malware, the preliminary malware score from operation 319 may be increased to generate a final malware score that is greater that the preliminary malware score from operation 319. This increase indicates a higher probability that the suspect object is malware than originally computed at operation 319. Conversely, when the suspect object is associated with a cluster that classifies the suspect object as non-malware or with an unknown status, the preliminary malware score from operation 319 may be decreased to generate the final malware score. This decrease indicates a lower probability that the suspect object is malware than originally computed at operation 319. By generating a final malware score that reflects the probability that a suspect object is malware based on both a comparison with known malware behaviors and clusters of classified objects, operation 321 creates a more robust determination of the likelihood that the suspect object is malware.
[0081] At operation 323, the final malware score generated at operation 321 may be transmitted along with the classification and naming information assigned to the suspect object at operations 313 or 315 to a user of the client device, a subscriber of a malware detection service, a network administrator, or another entity. The transmission may be made using an email message, a popup message, or any other message transmission technique. For example, the user interface 400 may be updated to reflect the classification of the suspect object as shown in FIG. 4B .
[0082] As described above, the method for classifying objects 300 may utilize fuzzy hash techniques to group “similar” objects in clusters for future analysis. This similarity matching allows greater flexibility in analyzing potential malware objects, which may share multiple characteristics and behaviors but are also slightly different from previously classified objects. These clusters of objects may be continually updated and shared between the MCD systems 1101-110N as new objects are processed by the method 300 such that a robust set of object clusters are maintained for future detection and remediation of families of malware threats.
Claims
What is claimed is:
1. A computerized method for classifying objects in a system configured to detect malicious content within one or more objects analyzed by the system, comprising:
detecting, by the system, behaviors of an object for classification after processing of the received object has started;
collecting data associated with the detected behaviors;
generating a fuzzy hash for the received object based on the data associated with the detected behaviors, the generating of the fuzzy hash includes:
(i) removing a portion of the data associated with the detected behaviors to produce a remaining portion of the data associated with the detected behaviors, and
(ii) performing a hash operation on the remaining portion of the data associated with the detected behaviors;
comparing the fuzzy hash for the received object with a fuzzy hash of an object in a preexisting cluster to generate a similarity measure;
associating the received object with the preexisting cluster in response to determining that the similarity measure is above a predefined threshold value; and
reporting, by the system via a communications interface, whether the received object is associated with the preexisting cluster.
2. The computerized method of claim 1, further comprising:
creating a new cluster for the received object in response to determining that the similarity measure is below the predefined threshold value.
3. The computerized method of claim 1, wherein the received object is at least one of a file, a uniform resource locator, a web object, a capture of network traffic for a user over time, and an email message.
4. The computerized method of claim 1, wherein the changes performed by the received object include (1) network calls, (2) modifications to a registry, (3) modifications to a file system, or (4) an application program interface call.
5. The computerized method of claim 1, further comprising:
generating a preliminary malware score for the received object based on a comparison of the detected behaviors with known malware behaviors, wherein the preliminary malware score indicates the probability the received object is malware; and
generating a final malware score for the received object based on the cluster the received object is associated, wherein the final malware score is greater than the preliminary malware score when the received object is associated with a cluster of objects classified as malware and the final malware score is less than the preliminary malware score when the received object is associated with a cluster of objects classified as non-malware.
6. The computerized method of claim 1, wherein the removing of the portion of the data associated the detected behaviors comprises removing data that does not identify the received object.
7. The computerized method of claim 6, wherein the removing of the portion of the data associated the detected behaviors includes at least one of: (i) a process identifier of a process called by the received object, or (ii) a value written to a registry by the received object, or (iii) names of objects generated, modified, or deleted by the received object.
8. The computerized method of claim 2, further comprising:
transmitting, by the system, the new cluster or the preexisting cluster with the newly associated received object to another system configured to detect malicious content within one or more objects.
9. The computerized method of claim 1, further comprising:
classifying the received object as malware, non-malware, or with an unknown status to match a classification of the preexisting cluster, when the received object is assigned to the preexisting cluster.
10. The computerized method of claim 1, further comprising:
assigning a malware family name to the received object to match a malware family name of the preexisting cluster, when the received object is assigned to the preexisting cluster.
11. The computerized method of claim 1, wherein the removing of the data associated with the detected behaviors includes removing values written to a registry or modified registry values.
12. The method of claim 1, wherein the behaviors of the object including the system processing a suspected malware object by detonating, executing or opening the suspected malware object to cause the suspected malware object to perform the behaviors.
13. The method of claim 1, wherein the pre-existing cluster is retrieved from cloud computing services.
14. The method of claim 1, wherein the received object is provided from a client device remotely located from the system.
15. A system comprising:
one or more hardware processors;
a memory including one or more software modules that, when executed by the one or more hardware processors:
detect behaviors of a received object for classification after processing of the received object has started;
collect data associated with the detected behaviors;
generate a fuzzy hash for the received object based on the data associated with the detected behaviors, the fuzzy hash being generated by at least:
(i) removing a portion of the data associated with the detected behaviors to produce a remaining portion of the data associated with the detected behaviors, and
(ii) performing a hash operation on the removed portion of the data associated with the detected behaviors;
compare the fuzzy hash for the received object with a fuzzy hash of an object in a preexisting cluster to generate a similarity measure;
associate the received object with the preexisting cluster in response to determining that the similarity measure is above a predefined threshold value; and
report whether the received object is associated with the preexisting cluster.
16. The system of claim 15, wherein the one or more software modules, when executed by the one or more hardware processors, are further configured to:
create a new cluster for the received object in response to determining that the similarity measure is below the predefined threshold value.
17. The system of claim 15, wherein the removing the data associated with the detected behaviors includes removing data associated with the detected behaviors that does not identify the received object, wherein the fuzzy hash is generated using the detected behaviors.
18. The system of claim 15, wherein the one or more software modules, when executed by the one or more hardware processors, are further configured to:
classify the received object as malware, non-malware, or with an unknown status to match a classification of the preexisting cluster, when the received object is assigned to the preexisting cluster.
19. The system of claim 15, wherein the one or more software modules, when executed by the one or more hardware processors, are further configured to:
assign a malware family name to the received object to match a malware family name of the preexisting cluster, when the received object is assigned to the preexisting cluster.
20. The system of claim 15 being in communication with a client device remotely located from the system to receive the received object.
Patent Citations (541)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4292580(A) | 1981-09-01 | Ott et al. | Applicant |
| US5175732(A) | 1992-12-01 | Hendel et al. | Applicant |
| US5440723(A) | 1995-08-01 | Arnold et al. | Applicant |
| US5490249(A) | 1996-02-01 | Miller | Applicant |
| US5657473(A) | 1997-08-01 | Killean et al. | Applicant |
| US5842002(A) | 1998-11-01 | Schnurer et al. | Applicant |
| US5978917(A) | 1999-11-01 | Chi | Applicant |
| US6088803(A) | 2000-07-01 | Tso et al. | Applicant |
| US6094677(A) | 2000-07-01 | Capek et al. | Applicant |
| US6108799(A) | 2000-08-01 | Boulay et al. | Applicant |
| US6118382(A) | 2000-09-01 | Hibbs et al. | Applicant |
| US6269330(B1) | 2001-07-01 | Cidon et al. | Applicant |
| US6272641(B1) | 2001-08-01 | Ji | Applicant |
| US6279113(B1) | 2001-08-01 | Vaidya | Applicant |
| US6298445(B1) | 2001-10-01 | Shostack et al. | Applicant |
| US6357008(B1) | 2002-03-01 | Nachenberg | Applicant |
| US6417774(B1) | 2002-07-01 | Hibbs et al. | Applicant |
| US6424627(B1) | 2002-07-01 | Sørhaug et al. | Applicant |
| US6442696(B1) | 2002-08-01 | Wray et al. | Applicant |
| US6484315(B1) | 2002-11-01 | Ziese | Applicant |
| US6487666(B1) | 2002-11-01 | Shanklin et al. | Applicant |
| US6493756(B1) | 2002-12-01 | O'Brien et al. | Applicant |
| US6550012(B1) | 2003-04-01 | Villa et al. | Applicant |
| US6700497(B2) | 2004-03-01 | Hibbs et al. | Applicant |
| US6775657(B1) | 2004-08-01 | Baker | Applicant |
| US6831893(B1) | 2004-12-01 | Ben Nun et al. | Applicant |
| US6832367(B1) | 2004-12-01 | Choi et al. | Applicant |
| US6895550(B2) | 2005-05-01 | Kanchirayappa et al. | Applicant |
| US6898632(B2) | 2005-05-01 | Gordy et al. | Applicant |
| US6907396(B1) | 2005-06-01 | Muttik et al. | Applicant |
| US6941348(B2) | 2005-09-01 | Petry et al. | Applicant |
| US6971097(B1) | 2005-11-01 | Wallman | Applicant |
| US6981279(B1) | 2005-12-01 | Arnold et al. | Applicant |
| US6995665(B2) | 2006-02-01 | Appelt et al. | Applicant |
| US7007107(B1) | 2006-02-01 | Ivchenko et al. | Applicant |
| US7028179(B2) | 2006-04-01 | Anderson et al. | Applicant |
| US7043757(B2) | 2006-05-01 | Hoefelmeyer et al. | Applicant |
| US7069316(B1) | 2006-06-01 | Gryaznov | Applicant |
| US7080407(B1) | 2006-07-01 | Zhao et al. | Applicant |
| US7080408(B1) | 2006-07-01 | Pak et al. | Applicant |
| US7093002(B2) | 2006-08-01 | Wolff et al. | Applicant |
| US7093239(B1) | 2006-08-01 | van der Made | Applicant |
| US7096498(B2) | 2006-08-01 | Judge | Applicant |
| US7100201(B2) | 2006-08-01 | Izatt | Applicant |
| US7107617(B2) | 2006-09-01 | Hursey et al. | Applicant |
| US7159149(B2) | 2007-01-01 | Spiegel et al. | Applicant |
| US7213260(B2) | 2007-05-01 | Judge | Applicant |
| US7231667(B2) | 2007-06-01 | Jordan | Applicant |
| US7240364(B1) | 2007-07-01 | Branscomb et al. | Applicant |
| US7240368(B1) | 2007-07-01 | Roesch et al. | Applicant |
| US7243371(B1) | 2007-07-01 | Kasper et al. | Applicant |
| US7249175(B1) | 2007-07-01 | Donaldson | Applicant |
| US7287278(B2) | 2007-10-01 | Liang | Applicant |
| US7308716(B2) | 2007-12-01 | Danford et al. | Applicant |
| US7328453(B2) | 2008-02-01 | Merkle, Jr. et al. | Applicant |
| US7346486(B2) | 2008-03-01 | Ivancic et al. | Applicant |
| US7356736(B2) | 2008-04-01 | Natvig | Applicant |
| US7386888(B2) | 2008-06-01 | Liang et al. | Applicant |
| US7392542(B2) | 2008-06-01 | Bucher | Applicant |
| US7418729(B2) | 2008-08-01 | Szor | Applicant |
| US7428300(B1) | 2008-09-01 | Drew et al. | Applicant |
| US7441272(B2) | 2008-10-01 | Durham et al. | Applicant |
| US7448084(B1) | 2008-11-01 | Apap et al. | Applicant |
| US7458098(B2) | 2008-11-01 | Judge et al. | Applicant |
| US7464404(B2) | 2008-12-01 | Carpenter et al. | Applicant |
| US7464407(B2) | 2008-12-01 | Nakae et al. | Applicant |
| US7467408(B1) | 2008-12-01 | O'Toole, Jr. | Applicant |
| US7478428(B1) | 2009-01-01 | Thomlinson | Applicant |
| US7480773(B1) | 2009-01-01 | Reed | Applicant |
| US7487543(B2) | 2009-02-01 | Arnold et al. | Applicant |
| US7496960(B1) | 2009-02-01 | Chen et al. | Applicant |
| US7496961(B2) | 2009-02-01 | Zimmer et al. | Applicant |
| US7519990(B1) | 2009-04-01 | Xie | Applicant |
| US7523493(B2) | 2009-04-01 | Liang et al. | Applicant |
| US7530104(B1) | 2009-05-01 | Thrower et al. | Applicant |
| US7540025(B2) | 2009-05-01 | Tzadikario | Applicant |
| US7546638(B2) | 2009-06-01 | Anderson et al. | Applicant |
| US7565550(B2) | 2009-07-01 | Liang et al. | Applicant |
| US7568233(B1) | 2009-07-01 | Szor et al. | Applicant |
| US7584455(B2) | 2009-09-01 | Ball | Applicant |
| US7603715(B2) | 2009-10-01 | Costa et al. | Applicant |
| US7607171(B1) | 2009-10-01 | Marsden et al. | Applicant |
| US7639714(B2) | 2009-12-01 | Stolfo et al. | Applicant |
| US7644441(B2) | 2010-01-01 | Schmid et al. | Applicant |
| US7657419(B2) | 2010-02-01 | van der Made | Applicant |
| US7676841(B2) | 2010-03-01 | Sobchuk et al. | Applicant |
| US7698548(B2) | 2010-04-01 | Shelest et al. | Applicant |
| US7707633(B2) | 2010-04-01 | Danford et al. | Applicant |
| US7712136(B2) | 2010-05-01 | Sprosts et al. | Applicant |
| US7730011(B1) | 2010-06-01 | Deninger et al. | Applicant |
| US7739740(B1) | 2010-06-01 | Nachenberg et al. | Applicant |
| US7779463(B2) | 2010-08-01 | Stolfo et al. | Applicant |
| US7784097(B1) | 2010-08-01 | Stolfo et al. | Applicant |
| US7832008(B1) | 2010-11-01 | Kraemer | Applicant |
| US7836502(B1) | 2010-11-01 | Zhao et al. | Applicant |
| US7849506(B1) | 2010-12-01 | Dansey et al. | Applicant |
| US7854007(B2) | 2010-12-01 | Sprosts et al. | Applicant |
| US7869073(B2) | 2011-01-01 | Oshima | Applicant |
| US7877803(B2) | 2011-01-01 | Enstone et al. | Applicant |
| US7904959(B2) | 2011-03-01 | Sidiroglou et al. | Applicant |
| US7908660(B2) | 2011-03-01 | Bahl | Applicant |
| US7930738(B1) | 2011-04-01 | Petersen | Applicant |
| US7937761(B1) | 2011-05-01 | Bennett | Applicant |
| US7949849(B2) | 2011-05-01 | Lowe et al. | Applicant |
| US7996556(B2) | 2011-08-01 | Raghavan et al. | Applicant |
| US7996836(B1) | 2011-08-01 | McCorkendale et al. | Applicant |
| US7996904(B1) | 2011-08-01 | Chiueh et al. | Applicant |
| US7996905(B2) | 2011-08-01 | Arnold et al. | Applicant |
| US8006305(B2) | 2011-08-01 | Aziz | Applicant |
| US8010667(B2) | 2011-08-01 | Zhang et al. | Applicant |
| US8020206(B2) | 2011-09-01 | Hubbard et al. | Applicant |
| US8028338(B1) | 2011-09-01 | Schneider et al. | Applicant |
| US8042184(B1) | 2011-10-01 | Batenin | Applicant |
| US8045094(B2) | 2011-10-01 | Teragawa | Applicant |
| US8045458(B2) | 2011-10-01 | Alperovitch et al. | Applicant |
| US8069484(B2) | 2011-11-01 | McMillan et al. | Applicant |
| US8087086(B1) | 2011-12-01 | Lai et al. | Applicant |
| US8171553(B2) | 2012-05-01 | Aziz et al. | Applicant |
| US8176049(B2) | 2012-05-01 | Deninger et al. | Applicant |
| US8176480(B1) | 2012-05-01 | Spertus | Applicant |
| US8201246(B1) | 2012-06-01 | Wu et al. | Applicant |
| US8204984(B1) | 2012-06-01 | Aziz et al. | Applicant |
| US8214905(B1) | 2012-07-01 | Doukhvalov et al. | Applicant |
| US8220055(B1) | 2012-07-01 | Kennedy | Applicant |
| US8225288(B2) | 2012-07-01 | Miller et al. | Applicant |
| US8225373(B2) | 2012-07-01 | Kraemer | Applicant |
| US8233882(B2) | 2012-07-01 | Rogel | Applicant |
| US8234640(B1) | 2012-07-01 | Fitzgerald et al. | Applicant |
| US8234709(B2) | 2012-07-01 | Viljoen et al. | Applicant |
| US8239944(B1) | 2012-08-01 | Nachenberg et al. | Applicant |
| US8260914(B1) | 2012-09-01 | Ranjan | Applicant |
| US8266091(B1) | 2012-09-01 | Gubin et al. | Applicant |
| US8286251(B2) | 2012-10-01 | Eker et al. | Applicant |
| US8291499(B2) | 2012-10-01 | Aziz et al. | Applicant |
| US8307435(B1) | 2012-11-01 | Mann et al. | Applicant |
| US8307443(B2) | 2012-11-01 | Wang et al. | Applicant |
| US8312545(B2) | 2012-11-01 | Tuvell et al. | Applicant |
| US8321936(B1) | 2012-11-01 | Green et al. | Applicant |
| US8321941(B2) | 2012-11-01 | Tuvell et al. | Applicant |
| US8332571(B1) | 2012-12-01 | Edwards, Sr. | Applicant |
| US8365286(B2) | 2013-01-01 | Poston | Applicant |
| US8365297(B1) | 2013-01-01 | Parshin et al. | Applicant |
| US8370938(B1) | 2013-02-01 | Daswani et al. | Applicant |
| US8370939(B2) | 2013-02-01 | Zaitsev et al. | Applicant |
| US8375444(B2) | 2013-02-01 | Aziz et al. | Applicant |
| US8381299(B2) | 2013-02-01 | Stolfo et al. | Applicant |
| US8402529(B1) | 2013-03-01 | Green et al. | Applicant |
| US8464340(B2) | 2013-06-01 | Ahn et al. | Applicant |
| US8479174(B2) | 2013-07-01 | Chiriac | Applicant |
| US8479276(B1) | 2013-07-01 | Vaystikh et al. | Applicant |
| US8479291(B1) | 2013-07-01 | Bodke | Applicant |
| US8510827(B1) | 2013-08-01 | Leake et al. | Applicant |
| US8510828(B1) | 2013-08-01 | Guo et al. | Applicant |
| US8510842(B2) | 2013-08-01 | Amit et al. | Applicant |
| US8516478(B1) | 2013-08-01 | Edwards et al. | Applicant |
| US8516590(B1) | 2013-08-01 | Ranadive et al. | Applicant |
| US8516593(B2) | 2013-08-01 | Aziz | Applicant |
| US8522348(B2) | 2013-08-01 | Chen et al. | Applicant |
| US8528086(B1) | 2013-09-01 | Aziz | Applicant |
| US8533824(B2) | 2013-09-01 | Hutton et al. | Applicant |
| US8539582(B1) | 2013-09-01 | Aziz et al. | Applicant |
| US8549638(B2) | 2013-10-01 | Aziz | Applicant |
| US8555391(B1) | 2013-10-01 | Demir et al. | Applicant |
| US8561177(B1) | 2013-10-01 | Aziz et al. | Applicant |
| US8566946(B1) | 2013-10-01 | Aziz et al. | Applicant |
| US8584094(B2) | 2013-11-01 | Dadhia et al. | Applicant |
| US8584234(B1) | 2013-11-01 | Sobel et al. | Applicant |
| US8584239(B2) | 2013-11-01 | Aziz et al. | Applicant |
| US8595834(B2) | 2013-11-01 | Xie et al. | Applicant |
| US8627476(B1) | 2014-01-01 | Satish et al. | Applicant |
| US8635696(B1) | 2014-01-01 | Aziz | Applicant |
| US8682054(B2) | 2014-03-01 | Xue et al. | Applicant |
| US8682812(B1) | 2014-03-01 | Ranjan | Applicant |
| US8689333(B2) | 2014-04-01 | Aziz | Applicant |
| US8695096(B1) | 2014-04-01 | Zhang | Applicant |
| US8713631(B1) | 2014-04-01 | Pavlyushchik | Applicant |
| US8713681(B2) | 2014-04-01 | Silberman et al. | Applicant |
| US8726392(B1) | 2014-05-01 | McCorkendale et al. | Applicant |
| US8739280(B2) | 2014-05-01 | Chess et al. | Applicant |
| US8776229(B1) | 2014-07-01 | Aziz | Applicant |
| US8782792(B1) | 2014-07-01 | Bodke | Applicant |
| US8789172(B2) | 2014-07-01 | Stolfo et al. | Applicant |
| US8789178(B2) | 2014-07-01 | Kejriwal et al. | Applicant |
| US8793787(B2) | 2014-07-01 | Ismael et al. | Applicant |
| US8805947(B1) | 2014-08-01 | Kuzkin et al. | Applicant |
| US8806647(B1) | 2014-08-01 | Daswani et al. | Applicant |
| US8832829(B2) | 2014-09-01 | Manni et al. | Applicant |
| US8850570(B1) | 2014-09-01 | Ramzan | Applicant |
| US8850571(B2) | 2014-09-01 | Staniford et al. | Applicant |
| US8881234(B2) | 2014-11-01 | Narasimhan et al. | Applicant |
| US8881282(B1) | 2014-11-01 | Aziz et al. | Applicant |
| US8898788(B1) | 2014-11-01 | Aziz et al. | Applicant |
| US8935779(B2) | 2015-01-01 | Manni et al. | Applicant |
| US8984638(B1) | 2015-03-01 | Aziz et al. | Applicant |
| US8990939(B2) | 2015-03-01 | Staniford et al. | Applicant |
| US8990944(B1) | 2015-03-01 | Singh et al. | Applicant |
| US8997219(B2) | 2015-03-01 | Staniford et al. | Applicant |
| US9009822(B1) | 2015-04-01 | Ismael et al. | Applicant |
| US9009823(B1) | 2015-04-01 | Ismael et al. | Applicant |
| US9027135(B1) | 2015-05-01 | Aziz | Applicant |
| US9071638(B1) | 2015-06-01 | Aziz et al. | Applicant |
| US9104867(B1) | 2015-08-01 | Thioux et al. | Applicant |
| US9106694(B2) | 2015-08-01 | Aziz et al. | Applicant |
| US9118715(B2) | 2015-08-01 | Staniford et al. | Applicant |
| 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 |
| US9197664(B1) | 2015-11-01 | Aziz 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 | Applicant |
| US9262635(B2) | 2016-02-01 | Paithane et al. | Applicant |
| US9282109(B1) | 2016-03-01 | Aziz 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 |
| US2001/0005889(A1) | 2001-06-01 | Albrecht | Applicant |
| US2001/0047326(A1) | 2001-11-01 | Broadbent et al. | Applicant |
| US2002/0018903(A1) | 2002-02-01 | Kokubo et al. | Applicant |
| US2002/0038430(A1) | 2002-03-01 | Edwards et al. | Applicant |
| US2002/0091819(A1) | 2002-07-01 | Melchione et al. | Applicant |
| US2002/0095607(A1) | 2002-07-01 | Lin-Hendel | Applicant |
| US2002/0116627(A1) | 2002-08-01 | Tarbotton et al. | Applicant |
| US2002/0144156(A1) | 2002-10-01 | Copeland | Applicant |
| US2002/0162015(A1) | 2002-10-01 | Tang | Applicant |
| US2002/0166063(A1) | 2002-11-01 | Lachman et al. | Applicant |
| US2002/0169952(A1) | 2002-11-01 | DiSanto et al. | Applicant |
| US2002/0184528(A1) | 2002-12-01 | Shevenell et al. | Applicant |
| US2002/0188887(A1) | 2002-12-01 | Largman et al. | Applicant |
| US2002/0194490(A1) | 2002-12-01 | Halperin et al. | Applicant |
| US2003/0021728(A1) | 2003-01-01 | Shame et al. | Applicant |
| US2003/0074578(A1) | 2003-04-01 | Ford et al. | Applicant |
| US2003/0084318(A1) | 2003-05-01 | Schertz | Applicant |
| US2003/0101381(A1) | 2003-05-01 | Mateev et al. | Applicant |
| US2003/0115483(A1) | 2003-06-01 | Liang | Applicant |
| US2003/0188190(A1) | 2003-10-01 | Aaron et al. | Applicant |
| US2003/0191957(A1) | 2003-10-01 | Hypponen et al. | Applicant |
| US2003/0200460(A1) | 2003-10-01 | Morota et al. | Applicant |
| US2003/0212902(A1) | 2003-11-01 | van der Made | Applicant |
| US2003/0229801(A1) | 2003-12-01 | Kouznetsov et al. | Applicant |
| US2003/0237000(A1) | 2003-12-01 | Denton et al. | Applicant |
| US2004/0003323(A1) | 2004-01-01 | Bennett et al. | Applicant |
| US2004/0006473(A1) | 2004-01-01 | Mills et al. | Applicant |
| US2004/0015712(A1) | 2004-01-01 | Szor | Applicant |
| US2004/0019832(A1) | 2004-01-01 | Arnold et al. | Applicant |
| US2004/0047356(A1) | 2004-03-01 | Bauer | Applicant |
| US2004/0083408(A1) | 2004-04-01 | Spiegel et al. | Applicant |
| US2004/0088581(A1) | 2004-05-01 | Brawn et al. | Applicant |
| US2004/0093513(A1) | 2004-05-01 | Cantrell et al. | Applicant |
| US2004/0111531(A1) | 2004-06-01 | Staniford et al. | Applicant |
| US2004/0117478(A1) | 2004-06-01 | Triulzi et al. | Applicant |
| US2004/0117624(A1) | 2004-06-01 | Brandt et al. | Applicant |
| US2004/0128355(A1) | 2004-07-01 | Chao et al. | Applicant |
| US2004/0165588(A1) | 2004-08-01 | Pandya | Applicant |
| US2004/0236963(A1) | 2004-11-01 | Danford et al. | Applicant |
| US2004/0243349(A1) | 2004-12-01 | Greifeneder et al. | Applicant |
| US2004/0249911(A1) | 2004-12-01 | Alkhatib et al. | Applicant |
| US2004/0255161(A1) | 2004-12-01 | Cavanaugh | Applicant |
| US2004/0268147(A1) | 2004-12-01 | Wiederin et al. | Applicant |
| US2005/0005159(A1) | 2005-01-01 | Oliphant | Applicant |
| US2005/0021740(A1) | 2005-01-01 | Bar et al. | Applicant |
| US2005/0033960(A1) | 2005-02-01 | Vialen et al. | Applicant |
| US2005/0033989(A1) | 2005-02-01 | Poletto et al. | Applicant |
| US2005/0050148(A1) | 2005-03-01 | Mohammadioun et al. | Applicant |
| US2005/0086523(A1) | 2005-04-01 | Zimmer et al. | Applicant |
| US2005/0091513(A1) | 2005-04-01 | Mitomo et al. | Applicant |
| US2005/0091533(A1) | 2005-04-01 | Omote et al. | Applicant |
| US2005/0091652(A1) | 2005-04-01 | Ross et al. | Applicant |
| US2005/0108562(A1) | 2005-05-01 | Khazan et al. | Applicant |
| US2005/0114663(A1) | 2005-05-01 | Cornell et al. | Applicant |
| US2005/0125195(A1) | 2005-06-01 | Brendel | Applicant |
| US2005/0149726(A1) | 2005-07-01 | Joshi et al. | Applicant |
| US2005/0157662(A1) | 2005-07-01 | Bingham et al. | Applicant |
| US2005/0183143(A1) | 2005-08-01 | Anderholm et al. | Applicant |
| US2005/0201297(A1) | 2005-09-01 | Peikari | Applicant |
| US2005/0210533(A1) | 2005-09-01 | Copeland et al. | Applicant |
| US2005/0229254(A1) | 2005-10-01 | Singh | Examiner |
| US2005/0238005(A1) | 2005-10-01 | Chen et al. | Applicant |
| US2005/0240781(A1) | 2005-10-01 | Gassoway | Applicant |
| US2005/0262562(A1) | 2005-11-01 | Gassoway | Applicant |
| US2005/0265331(A1) | 2005-12-01 | Stolfo | Applicant |
| US2005/0283839(A1) | 2005-12-01 | Cowburn | Applicant |
| US2006/0010495(A1) | 2006-01-01 | Cohen et al. | Applicant |
| US2006/0015416(A1) | 2006-01-01 | Hoffman et al. | Applicant |
| US2006/0015715(A1) | 2006-01-01 | Anderson | Applicant |
| US2006/0015747(A1) | 2006-01-01 | Van de Ven | Applicant |
| US2006/0021029(A1) | 2006-01-01 | Brickell et al. | Applicant |
| US2006/0021054(A1) | 2006-01-01 | Costa et al. | Applicant |
| US2006/0031476(A1) | 2006-02-01 | Mathes et al. | Applicant |
| US2006/0047665(A1) | 2006-03-01 | Neil | Applicant |
| US2006/0070130(A1) | 2006-03-01 | Costea et al. | Applicant |
| US2006/0075496(A1) | 2006-04-01 | Carpenter et al. | Applicant |
| US2006/0095968(A1) | 2006-05-01 | Portolani et al. | Applicant |
| US2006/0101516(A1) | 2006-05-01 | Sudaharan et al. | Applicant |
| US2006/0101517(A1) | 2006-05-01 | Banzhof et al. | Applicant |
| US2006/0117385(A1) | 2006-06-01 | Mester et al. | Applicant |
| US2006/0123477(A1) | 2006-06-01 | Raghavan et al. | Applicant |
| US2006/0143709(A1) | 2006-06-01 | Brooks et al. | Applicant |
| US2006/0150249(A1) | 2006-07-01 | Gassen et al. | Applicant |
| US2006/0161983(A1) | 2006-07-01 | Cothrell et al. | Applicant |
| US2006/0161987(A1) | 2006-07-01 | Levy-Yurista | Applicant |
| US2006/0161989(A1) | 2006-07-01 | Reshef et al. | Applicant |
| US2006/0164199(A1) | 2006-07-01 | Gilde et al. | Applicant |
| US2006/0173992(A1) | 2006-08-01 | Weber et al. | Applicant |
| US2006/0179147(A1) | 2006-08-01 | Tran et al. | Applicant |
| US2006/0184632(A1) | 2006-08-01 | Marino et al. | Applicant |
| US2006/0191010(A1) | 2006-08-01 | Benjamin | Applicant |
| US2006/0221956(A1) | 2006-10-01 | Narayan et al. | Applicant |
| US2006/0236393(A1) | 2006-10-01 | Kramer et al. | Applicant |
| US2006/0242709(A1) | 2006-10-01 | Seinfeld et al. | Applicant |
| US2006/0248519(A1) | 2006-11-01 | Jaeger et al. | Applicant |
| US2006/0248582(A1) | 2006-11-01 | Panjwani et al. | Applicant |
| US2006/0251104(A1) | 2006-11-01 | Koga | Applicant |
| US2006/0288417(A1) | 2006-12-01 | Bookbinder et al. | Applicant |
| US2007/0006288(A1) | 2007-01-01 | Mayfield et al. | Applicant |
| US2007/0006313(A1) | 2007-01-01 | Porras et al. | Applicant |
| US2007/0011174(A1) | 2007-01-01 | Takaragi et al. | Applicant |
| US2007/0016951(A1) | 2007-01-01 | Piccard et al. | Applicant |
| US2007/0019286(A1) | 2007-01-01 | Kikuchi | Applicant |
| US2007/0033645(A1) | 2007-02-01 | Jones | Applicant |
| US2007/0038943(A1) | 2007-02-01 | FitzGerald et al. | Applicant |
| US2007/0064689(A1) | 2007-03-01 | Shin et al. | Applicant |
| US2007/0074169(A1) | 2007-03-01 | Chess et al. | Applicant |
| US2007/0094730(A1) | 2007-04-01 | Bhikkaji et al. | Applicant |
| US2007/0101435(A1) | 2007-05-01 | Konanka et al. | Applicant |
| US2007/0128855(A1) | 2007-06-01 | Cho et al. | Applicant |
| US2007/0142030(A1) | 2007-06-01 | Sinha et al. | Applicant |
| US2007/0143827(A1) | 2007-06-01 | Nicodemus et al. | Applicant |
| US2007/0156895(A1) | 2007-07-01 | Vuong | Applicant |
| US2007/0157180(A1) | 2007-07-01 | Tillmann et al. | Applicant |
| US2007/0157306(A1) | 2007-07-01 | Elrod et al. | Applicant |
| US2007/0168988(A1) | 2007-07-01 | Eisner et al. | Applicant |
| US2007/0171824(A1) | 2007-07-01 | Ruello et al. | Applicant |
| US2007/0174915(A1) | 2007-07-01 | Gribble et al. | Applicant |
| US2007/0192500(A1) | 2007-08-01 | Lum | Applicant |
| US2007/0192858(A1) | 2007-08-01 | Lum | Applicant |
| US2007/0198275(A1) | 2007-08-01 | Malden et al. | Applicant |
| US2007/0208822(A1) | 2007-09-01 | Wang et al. | Applicant |
| US2007/0220607(A1) | 2007-09-01 | Sprosts et al. | Applicant |
| US2007/0240218(A1) | 2007-10-01 | Tuvell et al. | Applicant |
| US2007/0240219(A1) | 2007-10-01 | Tuvell et al. | Applicant |
| US2007/0240220(A1) | 2007-10-01 | Tuvell et al. | Applicant |
| US2007/0240222(A1) | 2007-10-01 | Tuvell et al. | Applicant |
| US2007/0250930(A1) | 2007-10-01 | Aziz et al. | Applicant |
| US2007/0256132(A2) | 2007-11-01 | Oliphant | Applicant |
| US2007/0271446(A1) | 2007-11-01 | Nakamura | Applicant |
| US2008/0005782(A1) | 2008-01-01 | Aziz | Applicant |
| US2008/0018122(A1) | 2008-01-01 | Zierler et al. | Applicant |
| US2008/0028463(A1) | 2008-01-01 | Dagon et al. | Applicant |
| US2008/0032556(A1) | 2008-02-01 | Schreier | Applicant |
| US2008/0040710(A1) | 2008-02-01 | Chiriac | Applicant |
| US2008/0046781(A1) | 2008-02-01 | Childs et al. | Applicant |
| US2008/0066179(A1) | 2008-03-01 | Liu | Applicant |
| US2008/0072326(A1) | 2008-03-01 | Danford et al. | Applicant |
| US2008/0077793(A1) | 2008-03-01 | Tan | Examiner |
| US2008/0080518(A1) | 2008-04-01 | Hoeflin et al. | Applicant |
| US2008/0086720(A1) | 2008-04-01 | Lekel | Applicant |
| US2008/0098476(A1) | 2008-04-01 | Syversen | Applicant |
| US2008/0120722(A1) | 2008-05-01 | Sima et al. | Applicant |
| US2008/0134178(A1) | 2008-06-01 | Fitzgerald et al. | Applicant |
| US2008/0134334(A1) | 2008-06-01 | Kim et al. | Applicant |
| US2008/0141376(A1) | 2008-06-01 | Clausen et al. | Applicant |
| US2008/0181227(A1) | 2008-07-01 | Todd | Applicant |
| US2008/0184373(A1) | 2008-07-01 | Traut et al. | Applicant |
| US2008/0189787(A1) | 2008-08-01 | Arnold et al. | Applicant |
| US2008/0201778(A1) | 2008-08-01 | Guo et al. | Applicant |
| US2008/0209557(A1) | 2008-08-01 | Herley et al. | Applicant |
| US2008/0215742(A1) | 2008-09-01 | Goldszmidt et al. | Applicant |
| US2008/0222729(A1) | 2008-09-01 | Chen et al. | Applicant |
| US2008/0263665(A1) | 2008-10-01 | Ma et al. | Applicant |
| US2008/0295172(A1) | 2008-11-01 | Bohacek | Applicant |
| US2008/0301810(A1) | 2008-12-01 | Lehane et al. | Applicant |
| US2008/0307524(A1) | 2008-12-01 | Singh et al. | Applicant |
| US2008/0313738(A1) | 2008-12-01 | Enderby | Applicant |
| US2008/0320594(A1) | 2008-12-01 | Jiang | Applicant |
| US2009/0003317(A1) | 2009-01-01 | Kasralikar et al. | Applicant |
| US2009/0007100(A1) | 2009-01-01 | Field et al. | Applicant |
| US2009/0013408(A1) | 2009-01-01 | Schipka | Applicant |
| US2009/0031423(A1) | 2009-01-01 | Liu et al. | Applicant |
| US2009/0036111(A1) | 2009-02-01 | Danford et al. | Applicant |
| US2009/0037835(A1) | 2009-02-01 | Goldman | Applicant |
| US2009/0044024(A1) | 2009-02-01 | Oberheide et al. | Applicant |
| US2009/0044274(A1) | 2009-02-01 | Budko et al. | Applicant |
| US2009/0064332(A1) | 2009-03-01 | Porras et al. | Applicant |
| US2009/0077666(A1) | 2009-03-01 | Chen et al. | Applicant |
| US2009/0083369(A1) | 2009-03-01 | Marmor | Applicant |
| US2009/0083855(A1) | 2009-03-01 | Apap et al. | Applicant |
| US2009/0089879(A1) | 2009-04-01 | Wang et al. | Applicant |
| US2009/0094697(A1) | 2009-04-01 | Provos et al. | Applicant |
| US2009/0113425(A1) | 2009-04-01 | Ports et al. | Applicant |
| US2009/0125976(A1) | 2009-05-01 | Wassermann et al. | Applicant |
| US2009/0126015(A1) | 2009-05-01 | Monastyrsky et al. | Applicant |
| US2009/0126016(A1) | 2009-05-01 | Sobko et al. | Applicant |
| US2009/0133125(A1) | 2009-05-01 | Choi et al. | Applicant |
| US2009/0144823(A1) | 2009-06-01 | Lamastra et al. | Applicant |
| US2009/0158430(A1) | 2009-06-01 | Borders | Applicant |
| US2009/0172815(A1) | 2009-07-01 | Gu et al. | Applicant |
| US2009/0187992(A1) | 2009-07-01 | Poston | Applicant |
| US2009/0193293(A1) | 2009-07-01 | Stolfo et al. | Applicant |
| US2009/0199296(A1) | 2009-08-01 | Xie et al. | Applicant |
| US2009/0228233(A1) | 2009-09-01 | Anderson et al. | Applicant |
| US2009/0241187(A1) | 2009-09-01 | Troyansky | Applicant |
| US2009/0241190(A1) | 2009-09-01 | Todd et al. | Applicant |
| US2009/0265692(A1) | 2009-10-01 | Godefroid et al. | Applicant |
| US2009/0271867(A1) | 2009-10-01 | Zhang | Applicant |
| US2009/0300415(A1) | 2009-12-01 | Zhang et al. | Applicant |
| US2009/0300761(A1) | 2009-12-01 | Park et al. | Applicant |
| US2009/0328185(A1) | 2009-12-01 | Berg et al. | Applicant |
| US2009/0328221(A1) | 2009-12-01 | Blumfield et al. | Applicant |
| US2010/0005146(A1) | 2010-01-01 | Drako et al. | Applicant |
| US2010/0011205(A1) | 2010-01-01 | McKenna | Applicant |
| US2010/0017546(A1) | 2010-01-01 | Poo et al. | Applicant |
| US2010/0031353(A1) | 2010-02-01 | Thomas | Examiner |
| US2010/0037314(A1) | 2010-02-01 | Perdisci et al. | Applicant |
| US2010/0043073(A1) | 2010-02-01 | Kuwamura | Applicant |
| US2010/0054278(A1) | 2010-03-01 | Stolfo et al. | Applicant |
| US2010/0058474(A1) | 2010-03-01 | Hicks | Applicant |
| US2010/0064044(A1) | 2010-03-01 | Nonoyama | Applicant |
| US2010/0077481(A1) | 2010-03-01 | Polyakov et al. | Applicant |
| US2010/0083376(A1) | 2010-04-01 | Pereira et al. | Applicant |
| US2010/0115621(A1) | 2010-05-01 | Staniford et al. | Applicant |
| US2010/0132038(A1) | 2010-05-01 | Zaitsev | Applicant |
| US2010/0154056(A1) | 2010-06-01 | Smith et al. | Applicant |
| US2010/0180344(A1) | 2010-07-01 | Malyshev et al. | Applicant |
| US2010/0192223(A1) | 2010-07-01 | Ismael et al. | Applicant |
| US2010/0220863(A1) | 2010-09-01 | Dupaquis et al. | Applicant |
| US2010/0235831(A1) | 2010-09-01 | Dittmer | Applicant |
| US2010/0251104(A1) | 2010-09-01 | Massand | Applicant |
| US2010/0281102(A1) | 2010-11-01 | Chinta et al. | Applicant |
| US2010/0281541(A1) | 2010-11-01 | Stolfo et al. | Applicant |
| US2010/0281542(A1) | 2010-11-01 | Stolfo et al. | Applicant |
| US2010/0287260(A1) | 2010-11-01 | Peterson et al. | Applicant |
| US2010/0299754(A1) | 2010-11-01 | Amit et al. | Applicant |
| US2010/0306173(A1) | 2010-12-01 | Frank | Applicant |
| US2011/0004737(A1) | 2011-01-01 | Greenebaum | Applicant |
| US2011/0025504(A1) | 2011-02-01 | Lyon et al. | Applicant |
| US2011/0041179(A1) | 2011-02-01 | St. Hlberg | Applicant |
| US2011/0047594(A1) | 2011-02-01 | Mahaffey et al. | Applicant |
| US2011/0047620(A1) | 2011-02-01 | Mahaffey et al. | Applicant |
| US2011/0055907(A1) | 2011-03-01 | Narasimhan et al. | Applicant |
| US2011/0078794(A1) | 2011-03-01 | Manni et al. | Applicant |
| US2011/0093951(A1) | 2011-04-01 | Aziz | Applicant |
| US2011/0099620(A1) | 2011-04-01 | Stavrou et al. | Applicant |
| US2011/0099633(A1) | 2011-04-01 | Aziz | Applicant |
| US2011/0113231(A1) | 2011-05-01 | Kaminsky | Applicant |
| US2011/0145918(A1) | 2011-06-01 | Jung et al. | Applicant |
| US2011/0145920(A1) | 2011-06-01 | Mahaffey et al. | Applicant |
| US2011/0145934(A1) | 2011-06-01 | Abramovici et al. | Applicant |
| US2011/0167493(A1) | 2011-07-01 | Song et al. | Applicant |
| US2011/0167494(A1) | 2011-07-01 | Bowen et al. | Applicant |
| US2011/0173460(A1) | 2011-07-01 | Ito et al. | Applicant |
| US2011/0219449(A1) | 2011-09-01 | St. Neitzel et al. | Applicant |
| US2011/0219450(A1) | 2011-09-01 | McDougal et al. | Applicant |
| US2011/0225624(A1) | 2011-09-01 | Sawhney et al. | Applicant |
| US2011/0225655(A1) | 2011-09-01 | Niemela et al. | Applicant |
| US2011/0247072(A1) | 2011-10-01 | Staniford et al. | Applicant |
| US2011/0265182(A1) | 2011-10-01 | Peinado et al. | Applicant |
| US2011/0289582(A1) | 2011-11-01 | Kejriwal et al. | Applicant |
| US2011/0302587(A1) | 2011-12-01 | Nishikawa et al. | Applicant |
| US2011/0307954(A1) | 2011-12-01 | Melnik et al. | Applicant |
| US2011/0307955(A1) | 2011-12-01 | Kaplan et al. | Applicant |
| US2011/0307956(A1) | 2011-12-01 | Yermakov et al. | Applicant |
| US2011/0314546(A1) | 2011-12-01 | Aziz et al. | Applicant |
| US2012/0023593(A1) | 2012-01-01 | Puder et al. | Applicant |
| US2012/0054869(A1) | 2012-03-01 | Yen et al. | Applicant |
| US2012/0066698(A1) | 2012-03-01 | Yanoo | Applicant |
| US2012/0079596(A1) | 2012-03-01 | Thomas et al. | Applicant |
| US2012/0084859(A1) | 2012-04-01 | Radinsky et al. | Applicant |
| US2012/0110667(A1) | 2012-05-01 | Zubrilin et al. | Applicant |
| US2012/0117652(A1) | 2012-05-01 | Manni et al. | Applicant |
| US2012/0121154(A1) | 2012-05-01 | Xue et al. | Applicant |
| US2012/0124426(A1) | 2012-05-01 | Maybee et al. | Applicant |
| US2012/0174186(A1) | 2012-07-01 | Aziz et al. | Applicant |
| US2012/0174196(A1) | 2012-07-01 | Bhogavilli et al. | Applicant |
| US2012/0174218(A1) | 2012-07-01 | McCoy et al. | Applicant |
| US2012/0198279(A1) | 2012-08-01 | Schroeder | Applicant |
| US2012/0210423(A1) | 2012-08-01 | Friedrichs et al. | Applicant |
| US2012/0222121(A1) | 2012-08-01 | Staniford et al. | Applicant |
| US2012/0255015(A1) | 2012-10-01 | Sahita et al. | Applicant |
| US2012/0255017(A1) | 2012-10-01 | Sallam | Applicant |
| US2012/0260342(A1) | 2012-10-01 | Dube et al. | Applicant |
| US2012/0266244(A1) | 2012-10-01 | Green et al. | Applicant |
| US2012/0278886(A1) | 2012-11-01 | Luna | Applicant |
| US2012/0297489(A1) | 2012-11-01 | Dequevy | Applicant |
| US2012/0330801(A1) | 2012-12-01 | McDougal et al. | Applicant |
| US2013/0014259(A1) | 2013-01-01 | Gribble et al. | Applicant |
| US2013/0036472(A1) | 2013-02-01 | Aziz | Applicant |
| US2013/0047257(A1) | 2013-02-01 | Aziz | Applicant |
| US2013/0074185(A1) | 2013-03-01 | McDougal et al. | Applicant |
| US2013/0086684(A1) | 2013-04-01 | Mohler | Applicant |
| US2013/0097699(A1) | 2013-04-01 | Balupari et al. | Applicant |
| US2013/0097706(A1) | 2013-04-01 | Titonis et al. | Applicant |
| US2013/0111587(A1) | 2013-05-01 | Goel et al. | Applicant |
| US2013/0111591(A1) | 2013-05-01 | Topan | Examiner |
| US2013/0117852(A1) | 2013-05-01 | Stute | Applicant |
| US2013/0117855(A1) | 2013-05-01 | Kim et al. | Applicant |
| US2013/0139264(A1) | 2013-05-01 | Brinkley et al. | Applicant |
| US2013/0160125(A1) | 2013-06-01 | Likhachev et al. | Applicant |
| US2013/0160127(A1) | 2013-06-01 | Jeong et al. | Applicant |
| US2013/0160130(A1) | 2013-06-01 | Mendelev et al. | Applicant |
| US2013/0160131(A1) | 2013-06-01 | Madou et al. | Applicant |
| US2013/0167236(A1) | 2013-06-01 | Sick | Applicant |
| US2013/0174214(A1) | 2013-07-01 | Duncan | Applicant |
| US2013/0185789(A1) | 2013-07-01 | Hagiwara et al. | Applicant |
| US2013/0185795(A1) | 2013-07-01 | Winn et al. | Applicant |
| US2013/0185798(A1) | 2013-07-01 | Saunders et al. | Applicant |
| US2013/0191915(A1) | 2013-07-01 | Antonakakis et al. | Applicant |
| US2013/0196649(A1) | 2013-08-01 | Paddon et al. | Applicant |
| US2013/0227691(A1) | 2013-08-01 | Aziz et al. | Applicant |
| US2013/0246370(A1) | 2013-09-01 | Bartram et al. | Applicant |
| US2013/0263260(A1) | 2013-10-01 | Mahaffey et al. | Applicant |
| US2013/0291109(A1) | 2013-10-01 | Staniford et al. | Applicant |
| US2013/0298243(A1) | 2013-11-01 | Kumar et al. | Applicant |
| US2014/0053260(A1) | 2014-02-01 | Gupta et al. | Applicant |
| US2014/0053261(A1) | 2014-02-01 | Gupta et al. | Applicant |
| US2014/0130158(A1) | 2014-05-01 | Wang et al. | Applicant |
| US2014/0137180(A1) | 2014-05-01 | Lukacs et al. | Applicant |
| US2014/0165203(A1) | 2014-06-01 | Friedrichs | Examiner |
| US2014/0169762(A1) | 2014-06-01 | Ryu | Applicant |
| US2014/0179360(A1) | 2014-06-01 | Jackson et al. | Applicant |
| US2014/0328204(A1) | 2014-11-01 | Klotsche et al. | Applicant |
| US2014/0337836(A1) | 2014-11-01 | Ismael | Applicant |
| US2014/0351935(A1) | 2014-11-01 | Shao et al. | Applicant |
| US2015/0096025(A1) | 2015-04-01 | Ismael | Applicant |
| GB2439806(A) | 2008-01-01 | Applicant | |
| GB2490431(A) | 2012-10-01 | Applicant | |
| WO2/23805(A2) | 2002-03-01 | Applicant | |
| WO2/006928(A2) | 2003-08-01 | Applicant | |
| WO206928 | 2003-11-01 | Applicant | |
| WO2007117636(A2) | 2007-10-01 | Applicant | |
| WO2008041950(A2) | 2008-04-01 | Applicant | |
| WO2011084431(A2) | 2011-07-01 | Applicant | |
| WO2011/112348(A1) | 2011-09-01 | Applicant | |
| WO2012/075336(A1) | 2012-06-01 | Applicant | |
| WO2012145066(A1) | 2012-10-01 | Applicant | |
| WO2013/067505(A1) | 2013-05-01 | Applicant |
Non-Patent Literature (82)
- Lok Kwong et al: “DroidScope: Seamlessly Reconstructing the OS and Dalvik Semantic Views for Dynamic Android Malware Analysis”, Aug. 10, 2012, XP055158513, Retrieved from the Internet: URL:https://www.usenix.org/system/files/conference/usenixsecurity12/sec12- -final107.pdf [retrieved on Dec. 15, 2014].Applicant
- 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
- Mori, Detecting Unknown Computer Viruses, 2004, Springer-Verlag Berlin Heidelberg.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
- Oberheide et al., CloudAV.sub.—N-Version Antivirus in the Network Cloud, 17th USENIX Security Symposium USENIX Security '08 Jul. 28-Aug. 1, 2008 San Jose, CA.Applicant
- PCT/US14/55958 filed Sep. 16, 2014 International Search Report and Written Opinion, dated May 1, 2015.Applicant
- 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”).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
- The Sniffers's Guide to Raw Traffic available at: yuba.stanford.edu/.about.casado/pcap/section1.html, (Jan. 6, 2014).Applicant
- Thomas H. Ptacek, and Timothy N. Newsham , “Insertion, Evasion, and Denial of Service: Eluding Network Intrusion Detection”, Secure Networks, (“Ptacek”), (Jan. 1998).Applicant
- U.S. Appl. No. 14/042,454, filed Sep. 30, 2013 Non-Final Office Action dated Jun. 22, 2015.Applicant
- U.S. Appl. No. 14/042,454, filed Sep. 30, 2013 Notice of Allowance dated Dec. 21, 2015.Applicant
- U.S. Appl. No. 14/222,524, filed Mar. 21, 2014 Non-Final Office Action dated Oct. 8, 2015.Applicant
- U.S. Pat. No. 8,171,553, filed Apr. 20, 2006, Inter Parties Review Decision dated Jul. 10, 2015.Applicant
- U.S. Pat. No. 8,291,499, filed Mar. 16, 2012, Inter Parties Review Decision dated Jul. 10, 2015.Applicant
- Venezia, Paul , “NetDetector Captures Intrusions”, InfoWorld Issue 27, (“Venezia”), (Jul. 14, 2003).Applicant
- Wahid et al., Characterising the Evolution in Scanning Activity of Suspicious Hosts, Oct. 2009, Third International Conference on Network and System Security, pp. 344-350.Applicant
- 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
- Yuhei Kawakoya et al: “Memory behavior-based automatic malware unpacking in stealth debugging environment”, Malicious and Unwanted Software (Malware), 2010 5th International Conference on, IEEE, Piscataway, NJ, USA, Oct. 19, 2010, pp. 39-46, XP031833827, ISBN:978-1-4244-8-9353-1.Applicant
- Zhang et al., The Effects of Threading, Infection Time, and Multiple-Attacker Collaboration on Malware Propagation, Sep. 2009, IEEE 28th International Symposium on Reliable Distributed Systems, pp. 73-82.Applicant
- “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.isp?reload=true&arnumbe- r=990073, (Dec. 7, 2013).Applicant
- “White Paper Advanced Threat Protection 1-16 Solution”, URL:http://cdn2.hubspot.net/hub/237610/file-232929750-pdf /White—Papers/WP-—Seculert—Solution.pdf, dated Jul. 28, 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
- AltaVista Advanced Search Results. “attack vector identifier”. Http://www.altavista.com/web/results?Itag=ody&pg=aq&aqmode=aqa=Event+Orch- estrator . . . , (Accessed on Sep. 15, 2009).Applicant
- AltaVista Advanced Search Results. “Event Orchestrator”. Http://www.altavista.com/web/results?Itag=ody&pg=aq&aqmode=aqa=Event+Orch- esrator . . . , (Accessed on Sep. 3, 2009).Applicant
- Apostolopoulos, George; hassapis, Constantinos; “V-eM: A cluster of Virtual Machines for Robust, Detailed, and High-Performance Network Emulation”, 14th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, Sep. 11-14, 2006, pp. 117-126.Applicant
- 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
- Baldi, Mario; Risso, Fulvio; “A Framework for Rapid Development and Portable Execution of Packet-Handling Applications”, 5th IEEE International Symposium Processing and Information Technology, Dec. 21, 2005, pp. 233-238.Applicant
- Bayer, et al., “Dynamic Analysis of Malicious Code”, J Comput Viral, 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
- 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).Applicant
- Cisco “Intrusion Prevention for the Cisco ASA 5500-x Series” Data Sheet (2012).Applicant
- Cisco, Configuring the Catalyst Switched Port Analyzer (SPAN) (“Cisco”), (1992-2003).Applicant
- Clark, John, Sylvian Leblanc,and Scott Knight. “Risks associated with usb hardware trojan devices used by insiders.” Systems Conference (SysCon), 2011 IEEE International. IEEE, 2011.Applicant
- Cohen, M.I. , “PyFlag—an advanced network forensic framework”, Digital investigation 5, Elsevier, (2008), pp. S112-S120.Applicant
- Costa, M. , et al., “Vigilante: End-to-End Containment of Internet Worms”, SOSP '05, Association for Computing Machinery, Inc., Brighton U.K., (Oct. 23-26, 2005).Applicant
- Crandall, J.R. , et al., “Minos:Control Data Attack Prevention Orthogonal to Memory Model”, 37th International Symposium on Microarchitecture, Portland, Oregon, (Dec. 2004).Applicant
- Deutsch, P. , “Zlib compressed data format specification version 3.3” RFC 1950, (1996).Applicant
- Distler, “Malware Analysis: An Introduction”, SANS Institute InfoSec Reading Room, SANS Institute, (2007).Applicant
- Dunlap, George W. , et al., “ReVirt: Enabling Intrusion Analysis through Virtual-Machine Logging and Replay”, Proceeding of the 5th Symposium on Operating Systems Design and Implementation, USENIX Association, (“Dunlap”), (Dec. 9, 2002).Applicant
- Excerpt regarding First Printing Date for Merike Kaeo, Designing Network Security (“Kaeo”), (2005).Applicant
- Filiol, Eric , et al., “Combinatorial Optimisation of Worm Propagation on an Unknown Network”, International Journal of Computer Science 2.2 (2007).Applicant
- FireEye Malware Analysis & Exchange Network, Malware Protection System, FireEye Inc., 2010.Applicant
- FireEye Malware Analysis, Modern Malware Forensics, FireEye Inc., 2010.Applicant
- FireEye v.6.0 Security Target, pp. 1-35, Version 1.1, FireEye Inc., May 2011.Applicant
- Gibler, Clint, et al. AndroidLeaks: automatically detecting potential privacy leaks in android applications on a large scale. Springer Berlin Heidelberg, 2012.Applicant
- Goel, et al., Reconstructing System State for Intrusion Analysis, Apr. 2008 SIGOPS Operating Systems Review, vol. 42 Issue 3, pp. 21-28.Applicant
- Gregg Keizer: “Microsoft's HoneyMonkeys Show Patching Windows Works”, Aug. 8, 2005, XP055143386, Retrieved from the Internet: URL:https://web.archive.org/web/20121022220617/http://www.informationweek- .com/microsofts-honeymonkeys-show-patching-wi/167600716 [retrieved on Sep. 29, 2014].Applicant
- Heng Yin et al, Panorama: Capturing System-Wide Information Flow for Malware Detection and Analysis, Research Showcase @ CMU, Carnegie Mellon University, 2007.Applicant
- Hjelmvik, Erik , “Passive Network Security Analysis with NetworkMiner”, (IN)Secure, Issue 18, (Oct. 2008), pp. 1-100.Applicant
- Idika et al., A-Survey-of-Malware-Detection-Techniques, Feb. 2, 2007, Department of Computer Science, Purdue University.Applicant
- IEEE Xplore Digital Library Sear Results for “detection of unknown computer worms”. Http//ieeexplore.ieee.org/searchresult.jsp?SortField=Score&SortOrder=desc- &ResultC . . . , (Accessed on Aug. 28, 2009).Applicant
- Isohara, Takamasa, Keisuke Takemori, and Ayumu Kubota. “Kernel-based behavior analysis for android malware Detection.” Computational intelligence and Security (CIS), 2011 Seventh International Conference on. IEEE, 2011.Applicant
- Jiyong Jang et al. “BitShred” Computer and Communications Security, ACM, dated (p. 309-320) Oct. 17, 2011.Applicant
- Kaeo, Merike , “Designing Network Security”, (“Kaeo”), (Nov. 2003).Applicant
- Kevin A Roundy et al: “Hybrid Analysis and Control of Malware”, Sep. 15, 2010, Recent Advances in Intrusion Detection, Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 317-338, XP019150454 ISBN:978-3-642-15511-6.Applicant
- Kim, H. , et al., “Autograph: Toward Automated, Distributed Worm Signature Detection”, Proceedings of the 13th Usenix Security Symposium (Security 2004), San Diego, (Aug. 2004), pp. 271-286.Applicant
- King, Samuel T., et al., “Operating System Support for Virtual Machines”, (“King”) (2003).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
- Leading Colleges Select FireEye to Stop Malware-Related Data Breaches, FireEye Inc., 2009.Applicant
- Li et al., A VMM-Based System Call Interposition Framework for Program Monitoring, Dec. 2010, IEEE 16th International Conference on Parallel and Distributed Systems, pp. 706-711.Applicant
- 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
- Lindorfer, Martina, Clemens Kolbitsch, and Paolo Milani Comparetti. “Detecting environment-sensitive malware.” Recent Advances in Intrusion Detection. Springer Berlin Heidelberg, 2011.Applicant
- EP 14781743.1 filed Apr. 27, 2016 Office Action dated Aug. 29, 2017.Applicant
- Konrad Rieck et al: “Automatic Analysis of Malware Behavior using Machine Learning”, Journal of Computer Security, Amsterdam, NL vol. 19, No. 4 Jan. 1, 2009 (Jan. 1, 2009), pp. 639-668, XP002699268, ISSN: 0926-227X, DOI: 10.3233/JCS-2010-0410 URL:http://honeyblog.org/junkyard/paper/malheur-TR-2009.pdf.Applicant