US 9,300,686 B2Grant

System and method for detecting malicious links in electronic messages

Issue Date:2016-03-29

•59 Claims

•8 Drawing Sheets

Abstract

According to one embodiment, in response to receiving a plurality of uniform resource locator (URL) links for malicious determination, any known URL links are removed from the URL links based on a list of known link signatures. For each of remaining URL links that are unknown, a link analysis is performed on the URL link based on link heuristics to determine whether the URL link is suspicious. For each of the suspicious URL links, a dynamic analysis is performed on a resource of the suspicious URL link. It is classified whether the suspicious URL link is a malicious link based on a behavior of the resource during the dynamic analysis.

Metadata

Assignee

FireEye, Inc.

Inventors

Vinay Pidathala
Henry Uyeno

Application Information

Application Number:US 13/945,394

Filing Date:2013-07-18

Priority Date:2013-06-28

Art Unit:2497

Classifications

IPC:

H04L29/06G06F21/56

Field of Search:

H04L 29/06585H04L 63/1433G06F 21/56G06F 21/64

Patent Drawings (8 sheets)

Description

Related Applications

[0001] This application claims the benefit of U.S. Provisional Patent Application No. 61/841,210, filed Jun. 28, 2013, which is incorporated by reference herein in its entirety.

Field of the Invention

[0002] Embodiments of the present invention relate generally to malware detection. More particularly, embodiments of the invention relate to detecting malicious links in electronic messages.

Background

[0003] Malicious software, or malware for short, may include any program or file that is harmful by design to a computer. Malware includes computer viruses, worms, Trojan horses, adware, spyware, and any programming that gathers information about a computer or its user or otherwise operates without permission. The owners of the computers are often unaware that these programs have been added to their computers and are often similarly unaware of their function.

[0004] Malicious network content is a type of malware distributed over a network via websites, e.g., servers operating on a network according to a hypertext transfer protocol (HTTP) standard or other well-known standard. Malicious network content distributed in this manner may be actively downloaded and installed on a computer, without the approval or knowledge of its user, simply by the computer accessing the web site hosting the malicious network content (the “malicious web site”). Malicious network content may be embedded within objects associated with web pages hosted by the malicious web site. Malicious network content may also enter a computer on receipt or opening of email. For example, email may contain an attachment, such as a PDF document, with embedded malicious executable programs. Furthermore, malicious content may exist in files contained in a computer memory or storage device, having infected those files through any of a variety of attack vectors.

[0005] Various processes and devices have been employed to prevent the problems associated with malicious content. For example, computers often run antivirus scanning software that scans a particular computer for viruses and other forms of malware. The scanning typically involves automatic detection of a match between content stored on the computer (or attached media) and a library or database of signatures of known malware. The scanning may be initiated manually or based on a schedule specified by a user or system administrator associated with the particular computer. Unfortunately, by the time malware is detected by the scanning software, some damage on the computer or loss of privacy may have already occurred, and the malware may have propagated from the infected computer to other computers. Additionally, it may take days or weeks for new signatures to be manually created, the scanning signature library updated and received for use by the scanning software, and the new signatures employed in new scans.

[0006] Moreover, anti-virus scanning utilities may have limited effectiveness to protect against all exploits by polymorphic malware. Polymorphic malware has the capability to mutate to defeat the signature match process while keeping its original malicious capabilities intact. Signatures generated to identify one form of a polymorphic virus may not match against a mutated form. Thus polymorphic malware is often referred to as a family of virus rather than a single virus, and improved anti-virus techniques to identify such malware families is desirable.

[0007] Another type of malware detection solution employs virtual environments to replay content within a sandbox established by virtual machines (VMs). Such solutions monitor the behavior of content during execution to detect anomalies that may signal the presence of malware. One such system offered by FireEye, Inc., the assignee of the present patent application, employs a two-phase malware detection approach to detect malware contained in network traffic monitored in real-time. In a first or “static” phase, a heuristic is applied to network traffic to identify and filter packets that appear suspicious in that they exhibit characteristics associated with malware. In a second or “dynamic” phase, the suspicious packets (and typically only the suspicious packets) are replayed within one or more virtual machines. For example, if a user is trying to download a file over a network, the file is extracted from the network traffic and analyzed in the virtual machine. The results of the analysis aids in determining whether the file is malicious. The two-phase malware detection solution may detect numerous types of malware and, even malware missed by other commercially available approaches. Through verification, the two-phase malware detection solution may also achieve a significant reduction of false positives relative to such other commercially available approaches. Dealing with false positives in malware detection may needlessly slow or interfere with download of network content or receipt of email, for example. This two-phase approach has even proven successful against many types of polymorphic malware and other forms of advanced persistent threats.

[0008] Network traffic can be in a variety of forms. One type of network traffic is in a form of emails, where an email may contain an attachment and/or a link such as a universal resource locator (URL) link. An email may or may not be malicious dependent upon whether a link embedded therein is associated with a remotely located malicious resource. There has been a lack of efficient ways for detecting whether a link is malicious.

Brief Description of the Drawings

[0009] Embodiments of the invention are illustrated by way of example and not limitation in the figures of the accompanying drawings in which like references indicate similar elements.

[0010] FIG. 1 is a block diagram illustrating a network system for malware detection according to one embodiment of the invention.

[0011] FIG. 2 is a flow diagram illustrating a method of detecting malicious links according to one embodiment of the invention.

[0012] FIG. 3 is a flow diagram illustrating a method of detecting malicious links according to another embodiment of the invention.

[0013] FIG. 4 is a flow diagram illustrating a method for detecting malicious links according to another embodiment of the invention.

[0014] FIG. 5 is a flow diagram illustrating a method for detecting malicious links according to another embodiment of the invention.

[0015] FIG. 6 is a block diagram of a computer network system deploying a malicious content detection system according to one embodiment of the invention.

[0016] FIG. 7 is a block diagram illustrating an example of a data processing system which may be used with one embodiment of the invention.

Detailed Description

[0017] Various embodiments and aspects of the inventions will be described with reference to details discussed below, and the accompanying drawings will illustrate the various embodiments. The following description and drawings are illustrative of the invention and are not to be construed as limiting the invention. Numerous specific details are described to provide a thorough understanding of various embodiments of the present invention. However, in certain instances, well-known or conventional details are not described in order to provide a concise discussion of embodiments of the present inventions.

[0018] Reference in the specification to “one embodiment” or “an embodiment” means that a particular feature, structure, or characteristic described in conjunction with the embodiment can be included in at least one embodiment of the invention. The appearances of the phrase “in one embodiment” in various places in the specification do not necessarily all refer to the same embodiment. Also, the term “email” generally denotes a communication message being digital data with a particular format such as one or more packet(s), frame(s), or any other series of bits having a prescribed format, which may include, but not limited or restricted to an electronic mail message, an instant message (IM), or another type of communication message.

[0019] According to some embodiments, one or more malware detection appliances, such as email malware detection systems, are deployed strategically to capture and detect emails that include a URL link. Each of the malware detection appliances is configured to monitor email traffic and to recognize a URL link within the emails. Once the malware detection appliance detects a URL link, the malware detection appliance extracts the URL link from an email and performs an analysis on the extracted link based on malicious link signatures maintained locally within the malware detection appliance. If it is determined that the extract URL link is considered as malicious in view of the malicious link signatures, malware detection appliance classifies the URL link as a malicious link and may alert an administrator or user accordingly. If the malware detection appliance cannot determine whether the URL link is malicious based on the locally maintained malicious link signatures, it sends the extracted URL link to a remote malware analysis system over a network such as the Internet (also referred to as a dedicated malware analysis system in the cloud). In one embodiment, the malware detection appliance only sends the URL link to the remote malware analysis system without sending the remaining content or any identifying information of the email since such information may be confidential. A malware detection appliance may constantly or periodically send the detected URL links to the malware analysis system(s) in the cloud, which may be implemented as a centralized or distributed malware analysis system.

[0020] In response to the URL links received from the malware detection appliances, according to one embodiment, the malware analysis system is configured to perform a link analysis, for example, within a dedicated analysis operating environment (e.g., a sandboxed environment or virtual machine), on the received URL links using link heuristics to determine whether the received URL link or links are likely malicious. If the malware analysis system determines that the received URL link or links are likely malicious based on the link heuristics, according to one embodiment, the malware analysis system generates one or more new malicious link signatures and distributes the new malicious link signatures back to the malware detection appliances for future local malicious link detection. Since the link analysis is performed at a dedicated malware analysis system remotely, a malware detection appliance does not have to interact with the links, which may expose the identities of the email recipients and increase workload of the malware detection appliance. Note that throughout this application, techniques have been described to detect malicious URL links within emails. However, the techniques described herein can also be applied to other types of links that may be embedded within other types of electronic documents such as word documents or portable document format (PDF) documents.

[0021] FIG. 1 is a block diagram illustrating a network system for malware detection according to one embodiment of the invention. Referring to FIG. 1, system 100 includes, but is not limited to, one or more malware detection appliances 102-103 communicatively coupled to malware analysis system 101 over network 104. Malware detection appliances 102-103 may be strategically deployed as appliances at various locations or LANs for malicious content detection. Malware detection appliances may be associated with the same or different organizations. Each of malware detection appliances 102-103 may include a malware detection system or module that can perform a static analysis or detection, a dynamic analysis or detection, or both, which may be described in details further below. Malware detection appliances 102-103 may offload at least a portion of the malware detection processes to a dedicated malware analysis system, such as malware analysis system 101. Network 104 may be any type of networks such as a local area network (LAN), a wide area network (WAN) such as the Internet, or a combination thereof.

[0022] According to one embodiment, any of malware detection appliances 102-103 may operate as an email malware detection (EMD) system for detecting malicious emails. For example, any of malware detection appliances 102-103 may be communicatively coupled to an email server to monitor the email traffic and perform a malicious content analysis on the emails to determine whether any of the emails are malicious emails. Whether an email should be considered as a malicious email may be determined based in part on content of the email, the attachment of the email, and/or a URL link embedded within the email. The attachment can be analyzed using the dynamic content detection techniques while the text or content of the email can be analyzed using static or heuristics content detection techniques. The combination of the static and dynamic detections on the emails may further improve the accuracy of the overall detection.

[0023] According to one embodiment, each of the malware detection appliances 102-103 includes a link extractor (e.g., link extractors 105-106) to recognize a URL link within an email and to analyze the extracted link in view of the malicious link signatures maintained locally (e.g., link signatures 107-108). Specifically, for the purpose of illustration, in response to an email received at malware detection appliance 102 for malware detection, link extractor 105 is configured to recognize a URL link within email and extract the link from the email. The URL link may be analyzed by link extractor 105 or by another analysis module (not shown) based on malicious link signatures 107 maintained locally. Link extractor 105 may match at least a portion of the URL characters against the malicious link signatures 107 to determine whether the URL link is similar or identical to the malicious links represented by malicious link signatures 107. If at least a portion of the URL link matches at least one of the malicious link signatures 107 (e.g., a domain name, uniform resource identifier or URI, or a particular character sequence or sequences), the URL link and/or the associated email may be classified as malicious and an alert may be issued to a user (e.g., administrator(s), email recipient(s)).

[0024] If link extractor 105 cannot determine whether the URL link is malicious based on malicious link signatures 107, according to one embodiment, link extractor 105 sends (e.g., via paths 121-122) the URL link to malware analysis system 101 over network 104, without sending any remaining content of the email to maintain the confidentiality of the email content. The links received from malware detection appliances 102-103 may be stored in link database 110. Malware analysis system 101 may periodically receive URL links from many malware detection appliances. The malware detection appliances may be deployed at various geographic locations and associated with different sites of the same corporate organization or different corporate organizations, while malware analysis system 101 provides malware analysis services to clients that employ the malware detection appliances.

[0025] According to one embodiment, in response to the URL links received from malware detection appliances 102-103 and stored in link database 110, link analysis module 109 is configured to perform a link analysis on each of the URL links using link heuristics 111. Link heuristics may be generated or compiled over a period of time based on the analysis of many different links. For each of links that has been determined by link analysis module 109 as a malicious link based on heuristics 111, link analysis module 109 generates a new malicious link signature as part of malicious signatures 112. Thereafter, malware analysis system 101 distributes (e.g., via paths 123-124) the new malicious link signatures to malware detection appliances 102-103 to be integrated into malicious link signatures 107-108 for subsequent local detections.

[0026] Since there may be many links received from malware detection appliances 102-103, according to one embodiment, link analysis module 109 is configured to initially apply a white list (e.g., a list of domain names that are known to be non-malicious) to screen out or filter any non-malicious links, which may reduce a number of links to be examined. For each of the remaining links, link analysis module 109 examines the link based on heuristics to determine whether the link should be considered as suspicious. This may be based on whether the link or portion thereof has one or more characteristics associated with malware at a probability satisfying a set threshold. While the probability may not be sufficient to declare the link as malicious, the probability may be sufficient to classify the link as suspicious and requiring further analysis. In one embodiment, if a URL link contains an Internet protocol (IP) address instead of a host name (e.g., http//203.x.x.x instead of http//WebSiteName.com), optionally in view of other considerations provided by link heuristics 111, the link may be considered as a possible suspicious link. For example, other heuristics may factor in the frequency of encountering a particular URL or domain name as compared with a user specified or machine set threshold. Other heuristics may also be used instead or in addition to the foregoing in finding a link “suspicious”.

[0027] Once a link is considered as a suspicious or a possibly malicious link, also referred to as a malicious link suspect, according to one embodiment, link analysis module 109 is configured to access the link in an attempt to further confirm that the link is more likely a malicious link. In one embodiment, link analysis module 109 may access the link to access a remote resource specified by the URI of the link. In the above example, the file of “invoice.zip,” and examines at least a portion of the resource to determine whether the resource likely contains malicious content. For example, link analysis module 109 may examine the size of the resource (e.g., whether the size of the file is unusual such as too small or too large), the type of the resource (e.g., whether it is an executable file), metadata of the resource (e.g., file header), and/or the URI itself (e.g., an unusual filename such as having double file extensions, multiple consecutive spaces in the name, etc.). Based on these characteristics of the URL links and in view of link heuristics 111, certain link suspects may be classified as malicious links.

[0028] Once a link is considered as a malicious link, link analysis module 109 generates a new malicious link signature which may be a part of malicious link signatures 112. Thereafter, link analysis module 109 distributes malicious link signatures 112 to malware detection appliances 102-103 via paths 123-124 as part of link signatures 107-108. Note that in addition to the malicious link detection, the malware detection appliances 102-103 may perform other types of malware detections. For example, a malware detection appliance may perform a dynamic content analysis on the attachment of an email or distribute the attachment to a dedicated malware analysis system for such a dynamic detection. Also note that a dedicated system (not shown) separated from malware analysis system 101 may be utilized to collect the links from malware detection appliances 102-103 and then transmit the collected links to malware analysis system 101 for link analysis.

[0029] FIG. 2 is a flow diagram illustrating a method of detecting malicious links according to one embodiment of the invention. Method 200 may be performed by processing logic which may be implemented in software, hardware, or a combination thereof. For example, method 200 may be performed by any of malware detection appliances 102-103 of FIG. 1. Referring to FIG. 2, at block 201, processing logic analyzes an email to identify a URL link within the email. At block 202, processing logic determines whether the URL link is possible malicious based on malicious link signatures maintained locally. If the URL link is considered as malicious, at block 203, the email and/or the URL link is classified as malicious and an alert may be generated to a user such as an administrator or an email recipient. If the URL link cannot be determined whether it is malicious based on the local malicious link signatures, at block 204, processing logic extracts the URL link from the email and transmits the URL link to a remote malware analysis system over a network for malicious link analysis, without transmitting the remaining content of the email. As described above, the malware analysis system is configured to perform a link analysis on the link and generate a new malicious link signature if the link is determined to be a malicious link using at least some of the techniques described above. At block 205, link classification information, such as malicious indication and/or malicious link signatures, is received from the remote malware analysis system, and at block 206, the local malicious link signatures are updated.

[0030] FIG. 3 is a flow diagram illustrating a method of detecting malicious links according to another embodiment of the invention. Method 300 may be performed by processing logic which may be implemented in software, hardware, or a combination thereof. For example, method 300 may be performed by any of malware analysis system 101 of FIG. 1. Referring to FIG. 3, at block 301, processing logic receives one or more links (e.g., URL links) from one or more malware detection appliances over a network. At least one of the malware detection appliances recognizes a link within an email, extracts the link from the email, and sends the link to a malware analysis system over the network without sending the remain content of the email. At block 302, processing logic performs a link analysis on each of the links received from the malware detection appliances based on link heuristics to determine whether the link is likely malicious. If it is determined that the link is likely malicious based on the analysis, at block 303, the link is classified as a non-malicious link. Otherwise, at block 304, the link is classified as a malicious link and an alert may be issued to a user (e.g., an administrator or the email's recipient). At block 305, a new malicious link signature(s) is generated based on the newly classified malicious link and at block 306, the new malicious link signature(s) may be distributed to the malware detection appliances over the network for subsequent local malicious link detection.

[0031] FIG. 4 is a flow diagram illustrating a method for detecting malicious links according to another embodiment of the invention. Method 400 may be performed by processing logic which may be implemented in software, hardware, or a combination thereof. For example, method 400 may be performed as part of operations involve in block 302 of FIG. 3. Referring to FIG. 4, at block 401, processing logic determines whether a particular domain name of a link occurs frequently (e.g., above a predetermined threshold) amongst the links received from the malware detection appliances. If so, at block 406, the link or links having that particular domain name may be considered suspicious. At block 403, processing logic determines whether a particular URI of a link occurs frequently (e.g., above a predetermined threshold) amongst the links received from the malware detection appliances. If so, at block 406, the link or links having that particular URI may be considered suspicious. At block 404, processing logic accesses a file or resource via a link and examines at least a portion of the file (e.g., file header, file extension, filename, and/or file size) to determine whether the file contains malicious content. If so, at block 402, the link or links referencing that resource may be classified as malicious links. Otherwise, at block 405, the link or links may be classified as non-malicious.

[0032] The configuration as shown in FIG. 1 is described for the illustration purpose only; other configurations or settings may also be applied. For example, according to another embodiment, malware analysis system 101 may include multiple analysis systems or stations, each performing a portion of the overall URL link analysis process, in sequence or in parallel, where the analysis systems may be deployed in the cloud.

[0033] According to one embodiment, a first system performs pre-filtering using whitelists and/or blacklists to pass only specimens requiring further analysis to the second system. The blacklists and whitelists can be updated to the first system aperiodically or periodically (e.g., hourly) from a central or cloud based station. Such a pre-filtering operation can significantly screen out any URL links that are known to be either non-malicious links or malicious links.

[0034] The remaining URL links (e.g., unknown links) may then be processed by a second system. The second system is configured to perform certain link heuristic analysis as described above, for example, across multiple malware detection systems, including those of any vector type (e.g., web, email and file) as well as across multiple ones of any of these. The multiple malware detection systems which may reside at different locations within an enterprise over the cloud. For example, if the same URL is encountered widely (above a threshold count), the URL is deemed suspicious and passed to the third level. In addition, if the URLs are nearly the same but have somewhat different domain names, it may be deemed suspicious, even if the second system finds these URLs within the same enterprise or at different enterprises.

[0035] If a URL link is determined to be suspicious based on the link heuristics, the link is then transmitted to a third system for further analysis. For example, as described above, the third system determines if the URL corresponds to a “live” website and analyzes metadata for the resource at the website (e.g., the size and type of the resource, etc.). If alive and the size of the resource is larger than a predetermined threshold, but is zipped (or otherwise encoded), the zip file may also be parsed to identify anomalies in the headers in determining whether it contains malware.

[0036] Subsequent to these three levels of email malware detection systems, the content/object at the URL (now deemed to be malicious) is processed in a virtual environment provided, e.g., by a web malware detection system (e.g., a fourth system in the cloud), to verify that it is indeed malicious. Verification may require the download of the webpage at the URL. If verified, a signature may be generated and distributed to all the malware detection systems, which signature may contain the URL. Note that a malware detection system may be dedicated to web content or may also be capable of processing emails and web downloads for malware detection.

[0037] FIG. 5 is a flow diagram illustrating a method for detecting malicious links according to another embodiment of the invention. Method 500 may be performed by processing logic which may be implemented in software, hardware, or a combination thereof. Referring to FIG. 5, at block 501, a first system performs a pre-filtering operation on the URL links that have been collected from multiple malware detection appliances, using a whitelist and/or a blacklist to screen out any known URL links (e.g., known malicious links or known non-malicious links). At block 502, the remaining URL links may be transmitted to a second system to perform a link analysis based on link heuristics to determine whether the URL links are suspicious. At block 503, the suspicious links are analyzed and accessed by a third system to determine whether the links are alive, as well as other metadata of the links (e.g., size and type of the associated resources). If a URL link is deemed to be alive, at block 504, the live link is processed at a fourth system to download the associated resource and a dynamic analysis is performed on the resource, for example, in a virtual operating environment, to verify that the URL link is indeed malicious. Thereafter, at block 505, the link signatures of the malicious links are generated and distributed to other systems. Note that some of the above operations may be merged and performed within a single system.

[0038] In an alternative embodiment, after the first system performs its pre-filtering, the activities described for the second system and third system are performed in a single malware detecting system, which determines whether the URL is malicious. Afterwards, malware verification may be performed either on the same malware detection system if equipped with a dynamic/virtual analyzer or on another system (e.g., in the cloud). In some implementations of this embodiment, some of the activity of the second system (as described in the preceding paragraph) cannot be performed, particularly those that require cross-enterprise analysis, which is normally performed remotely.

[0039] In view of the techniques described above, embodiments of the invention may use three filters: a first filter called pre-filtering; a second filter called heuristic filtering; and a third filter called object analysis. These three filters can be run in the order described above or in an overlapping/concurrent/parallel manner, though sequencing provides efficiencies. Each filter can be implemented in separate email detection systems, or combined in some fashion in a single or in two separate systems. After these three filtering steps, any detected malware is verified and reported. Verification may be performed in yet another system, a web detection system.

[0040] In a further embodiment, a single system or station may be employed. In this embodiment, a rule-based extractor within the single system is configured to extract one or more URLs from email bodies and attachments. The one or more URLs are extracted and matched against heuristic link signatures to filter the extracted ULR's to a manageable number for further analysis.

[0041] The “heuristic link signatures” used in this matching are generated through automatic and/or manual review of data collected at other network sites (e.g. beta sites) through machine learning techniques. “Machine learning” refers to a process or system that can learn from data, i.e., be trained to distinguish between malicious and non-malicious, and classify samples under test accordingly or develop indicators having a high correlation to those that are malicious. The core principals of machine learning deal with representation and generalization, that is, representation of data instances (e.g., reputation or anomaly information), and functions performed on those instances (e.g., weighting and scoring). The data used for weighting and/or scoring the likelihood of samples under test including malware may be updated from time to time, whether on an aperiodic or periodic basis. The heuristic link signatures are validated to determine what is malicious and what is not and the most popular patterns are converted into rules. For example, patterns that appear more often, i.e., greater than a predetermined threshold, in the previously determined suspicious/malicious links or non-malicious links may be converted into rules. Patterns may include certain characters or sequence of characters in a link, such as, for example, domain names or URIs, etc. These heuristic link signatures also filter out the “auto opt-in” and “auto opt-out” links contained within emails. The heuristic link signatures may be generated, for example, at a remote or central facility, coupled to the single system and possibly the other standalone malware detection systems for distribution (and updating) of the heuristic link signatures from time to time.

[0042] The heuristics represented by the heuristic link signatures may be the same as described hereinabove for the other embodiments of the invention. For example, if the frequency of encountering a link specifying a particular IP address or particular domain is above a set threshold, the heuristic may assign to the link a higher probability that the link is associated with malware, and should be classified as at least suspicious and requiring further analysis.

[0043] In the further analysis, called the “dynamic” phase, the suspicious link may be analyzed in a virtual machine to determine whether it is actually malicious. For this, the single system is provided with a network interface and network (e.g., Internet) access to permit retrieval (e.g., download) of the content of the web site referenced by the URL. The system may also configure the virtual machine with one or more computer programs or applications (e.g., PDF reader or media player) suitable for the particular type or types of content (e.g., PDF document or video file, respectively) retrieved from the website. The behavior of the content within the virtual machine during execution (e.g., loading and processing of the content within an application) is monitored and unexpected or anomalous behavior (spawning processes, attempted unauthorized communications, etc.) is evaluated. Based on the behavior, the content is classified or verified as malicious or non-malicious.

[0044] In one embodiment, if an email/attachment contains a suspicious URL, the system “delays” delivery of the email for a time period up to a maximum length of time (e.g., half a minute). This may require the system to pull the email from the wire, store the email, and effectively “resend” the email if no malware is found or send an alert to the recipient that a malicious email was detected and blocked. Additionally, besides matching against heuristic link signatures, the single system is configured to apply static analysis techniques to a header or other metadata of the email message to aid in determining whether the email or its attachments are malicious. For instance, according to one embodiment of the disclosure, the email (SMTP) header is extracted and is sent to one or more static analysis modules to detect whether information within the email header is malicious or not. As an example, known malicious email headers or other metadata are analyzed to determine if the malicious content includes a pattern. The pattern is converted to a software rule, where email headers that match any of these software rules will be classified as malicious. The email rules may specify that the content of certain fields of the header (e.g., FROM, TO, or SUBJECT are associated with malware.

[0045] The above process can be implemented in real time and may use adaptable filters (updated from time to time), e.g., with changeable thresholds, may employ intelligence in the cloud to update based on experience of other malware detection systems, and/or based on machine learning or experiential techniques. On the other hand, use of dependable heuristics permits local systems to perform most processing, thus avoiding delays/latency associated with communication into the cloud, and avoid sending sensitive information “off network” into the cloud. Other configurations may also be implemented.

[0046] FIG. 6 is a block diagram of an illustrative computer network system 800 having a malicious content detection system 850 in accordance with a further illustrative embodiment. The malicious content detection system 850 may represent any of the malicious content detection systems or malicious content analysis systems described above, such as, for example, systems 101-103 of FIG. 1. In one embodiment, the malicious content detection system 850 includes link analysis module 109 to detect and determine whether a particular URL link is malicious using some or all of the techniques described above.

[0047] The malicious content detection system 850 is illustrated with a server device 810 and a client device 830, each coupled for communication via a communication network 820. In various embodiments, there may be multiple server devices and multiple client devices sending and receiving data to/from each other, and the same device can serve as either a server or a client in separate communication sessions. Although FIG. 6 depicts data transmitted from the server device 810 to the client device 830, either device can transmit and receive data from the other.

[0048] Note that throughout this application, network content is utilized as an example of content for malicious content detection purposes; however, other types of content can also be applied. Network content may include any data transmitted over a network (i.e., network data). Network data may include text, software, images, audio, or other digital data. An example of network content includes web content, or any network data that may be transmitted using a Hypertext Transfer Protocol (HTTP), Hypertext Markup Language (HTML) protocol, or be transmitted in a manner suitable for display on a Web browser software application. Another example of network content includes email messages, which may be transmitted using an email protocol such as Simple Mail Transfer Protocol (SMTP), Post Office Protocol version 3 (POP3), or Internet Message Access Protocol (IMAP4). A further example of network content includes Instant Messages, which may be transmitted using an Instant Messaging protocol such as Session Initiation Protocol (SIP) or Extensible Messaging and Presence Protocol (XMPP). In addition, network content may include any network data that is transferred using other data transfer protocols, such as File Transfer Protocol (FTP).

[0049] The malicious network content detection system 850 may monitor exchanges of network content (e.g., Web content) in real-time rather than intercepting and holding the network content until such time as it can determine whether the network content includes malicious network content. The malicious network content detection system 850 may be configured to inspect exchanges of network content over the communication network 820, identify suspicious network content, and analyze the suspicious network content using a virtual machine to detect malicious network content. In this way, the malicious network content detection system 850 may be computationally efficient and scalable as data traffic volume and the number of computing devices communicating over the communication network 820 increase. Therefore, the malicious network content detection system 850 may not become a bottleneck in the computer network system 800.

[0050] The communication network 820 may include a public computer network such as the Internet, in which case a firewall 825 may be interposed between the communication network 820 and the client device 830. Alternatively, the communication network may be a private computer network such as a wireless telecommunication network, wide area network, or local area network, or a combination of networks. Though the communication network 820 may include any type of network and be used to communicate different types of data, communications of web data may be discussed below for purposes of example.

[0051] The malicious network content detection system 850 is shown as coupled with the network 820 by a network tap 840 (e.g., a data/packet capturing device). The network tap 840 may include a digital network tap configured to monitor network data and provide a copy of the network data to the malicious network content detection system 850. Network data may comprise signals and data that are transmitted over the communication network 820 including data flows from the server device 810 to the client device 830. In one example, the network tap 840 monitors and copies the network data without an appreciable decline in performance of the server device 810, the client device 830, or the communication network 820. The network tap 840 may copy any portion of the network data, for example, any number of data packets from the network data. In embodiments where the malicious content detection system 850 is implemented as an dedicated appliance or a dedicated computer system, the network tap 840 may include an assembly integrated into the appliance or computer system that includes network ports, network interface card and related logic (not shown) for connecting to the communication network 820 to non-disruptively “tap” traffic thereon and provide a copy of the traffic to the heuristic module 860. In other embodiments, the network tap 840 can be integrated into a firewall, router, switch or other network device (not shown) or can be a standalone component, such as an appropriate commercially available network tap. In virtual environments, a virtual tap (vTAP) can be used to copy traffic from virtual networks.

[0052] The network tap 840 may also capture metadata from the network data. The metadata may be associated with the server device 810 and/or the client device 830. For example, the metadata may identify the server device 810 and/or the client device 830. In some embodiments, the server device 810 transmits metadata which is captured by the tap 840. In other embodiments, a heuristic module 860 (described herein) may determine the server device 810 and the client device 830 by analyzing data packets within the network data in order to generate the metadata. The term, “content,” as used herein may be construed to include the intercepted network data and/or the metadata unless the context requires otherwise.

[0053] The malicious network content detection system 850 may include a heuristic module 860, a heuristics database 862, a scheduler 870, a virtual machine pool 880, an analysis engine 882 and a reporting module 884. In some embodiments, the network tap 840 may be contained within the malicious network content detection system 850.

[0054] The heuristic module 860 receives the copy of the network data from the network tap 840 and applies heuristics to the data to determine if the network data might contain suspicious network content. The heuristics applied by the heuristic module 860 may be based on data and/or rules stored in the heuristics database 862. The heuristic module 860 may examine the image of the captured content without executing or opening the captured content. For example, the heuristic module 860 may examine the metadata or attributes of the captured content and/or the code image (e.g., a binary image of an executable) to determine whether a certain portion of the captured content matches a predetermined pattern or signature that is associated with a particular type of malicious content. In one example, the heuristic module 860 flags network data as suspicious after applying a heuristic analysis. This detection process is also referred to as a static malicious content detection. The suspicious network data may then be provided to the scheduler 870. In some embodiments, the suspicious network data is provided directly to the scheduler 870 with or without buffering or organizing one or more data flows.

[0055] When a characteristic of the packet, such as a sequence of characters or keyword, is identified that meets the conditions of a heuristic, a suspicious characteristic of the network content is identified. The identified characteristic may be stored for reference and analysis. In some embodiments, the entire packet may be inspected (e.g., using deep packet inspection techniques) and multiple characteristics may be identified before proceeding to the next step. In some embodiments, the characteristic may be determined as a result of an analysis across multiple packets comprising the network content. A score related to a probability that the suspicious characteristic identified indicates malicious network content is determined.

[0056] The heuristic module 860 may also provide a priority level for the packet and/or the features present in the packet. The scheduler 870 may then load and configure a virtual machine from the virtual machine pool 880 in an order related to the priority level, and dispatch the virtual machine to the analysis engine 882 to process the suspicious network content.

[0057] The heuristic module 860 may provide the packet containing the suspicious network content to the scheduler 870, along with a list of the features present in the packet and the malicious probability scores associated with each of those features. Alternatively, the heuristic module 860 may provide a pointer to the packet containing the suspicious network content to the scheduler 870 such that the scheduler 870 may access the packet via a memory shared with the heuristic module 860. In another embodiment, the heuristic module 860 may provide identification information regarding the packet to the scheduler 870 such that the scheduler 870, or virtual machine may query the heuristic module 860 for data regarding the packet as needed.

[0058] The scheduler 870 may identify the client device 830 and retrieve a virtual machine associated with the client device 830. A virtual machine may itself be executable software that is configured to mimic the performance of a device (e.g., the client device 830). The virtual machine may be retrieved from the virtual machine pool 880. Furthermore, the scheduler 870 may identify, for example, a Web browser running on the client device 830, and retrieve a virtual machine associated with the web browser.

[0059] In some embodiments, the heuristic module 860 transmits the metadata identifying the client device 830 to the scheduler 870. In other embodiments, the scheduler 870 receives one or more data packets of the network data from the heuristic module 860 and analyzes the one or more data packets to identify the client device 830. In yet other embodiments, the metadata may be received from the network tap 840.

[0060] The scheduler 870 may retrieve and configure the virtual machine to mimic the pertinent performance characteristics of the client device 830. In one example, the scheduler 870 configures the characteristics of the virtual machine to mimic only those features of the client device 830 that are affected by the network data copied by the network tap 840. The scheduler 870 may determine the features of the client device 830 that are affected by the network data by receiving and analyzing the network data from the network tap 840. Such features of the client device 830 may include ports that are to receive the network data, select device drivers that are to respond to the network data, and any other devices coupled to or contained within the client device 830 that can respond to the network data. In other embodiments, the heuristic module 860 may determine the features of the client device 830 that are affected by the network data by receiving and analyzing the network data from the network tap 840. The heuristic module 860 may then transmit the features of the client device to the scheduler 870.

[0061] The virtual machine pool 880 may be configured to store one or more virtual machines. The virtual machine pool 880 may include software and/or a storage medium capable of storing software. In one example, the virtual machine pool 880 stores a single virtual machine that can be configured by the scheduler 870 to mimic the performance of any client device 830 on the communication network 820. The virtual machine pool 880 may store any number of distinct virtual machines that can be configured to simulate the performance of a wide variety of client devices 830.

[0062] The analysis engine 882 simulates the receipt and/or display of the network content from the server device 810 after the network content is received by the client device 110 to analyze the effects of the network content upon the client device 830. The analysis engine 882 may identify the effects of malware or malicious network content by analyzing the simulation of the effects of the network content upon the client device 830 that is carried out on the virtual machine. There may be multiple analysis engines 882 to simulate multiple streams of network content. The analysis engine 882 may be configured to monitor the virtual machine for indications that the suspicious network content is in fact malicious network content. Such indications may include unusual network transmissions, unusual changes in performance, and the like. This detection process is referred to as a dynamic malicious content detection.

[0063] The analysis engine 882 may flag the suspicious network content as malicious network content according to the observed behavior of the virtual machine. The reporting module 884 may issue alerts indicating the presence of malware, and using pointers and other reference information, identify the packets of the network content containing the malware. Additionally, the server device 810 may be added to a list of malicious network content providers, and future network transmissions originating from the server device 810 may be blocked from reaching their intended destinations, e.g., by firewall 825.

[0064] The computer network system 800 may also include a further communication network 890, which couples the malicious content detection system (MCDS) 850 with one or more other MCDS, of which MCDS 892 and MCDS 894 are shown, and a management system 896, which may be implemented as a Web server having a Web interface. The communication network 890 may, in some embodiments, be coupled for communication with or part of network 820. The management system 896 is responsible for managing the MCDS 850, 892, 894 and providing updates to their operation systems and software programs. Also, the management system 896 may cause malware signatures generated by any of the MCDS 850, 892, 894 to be shared with one or more of the other MCDS 850, 892, 894, for example, on a subscription basis. Moreover, the malicious content detection system as described in the foregoing embodiments may be incorporated into one or more of the MCDS 850, 892, 894, or into all of them, depending on the deployment. Also, the management system 896 itself or another dedicated computer station may incorporate the malicious content detection system in deployments where such detection is to be conducted at a centralized resource.

[0065] Further information regarding an embodiment of a malicious content detection system can be had with reference to U.S. Pat. No. 8,171,553, the disclosure of which being incorporated herein by reference in its entirety.

[0066] As described above, the detection or analysis performed by the heuristic module 860 may be referred to as static detection or static analysis, which may generate a first score (e.g., a static detection score) according to a first scoring scheme or algorithm. The detection or analysis performed by the analysis engine 882 is referred to as dynamic detection or dynamic analysis, which may generate a second score (e.g., a dynamic detection score) according to a second scoring scheme or algorithm. The first and second scores may be combined, according to a predetermined algorithm, to derive a final score indicating the probability that a malicious content suspect is indeed malicious.

[0067] Furthermore, detection systems 850 and 892-894 may deployed in a variety of distribution ways. For example, detection system 850 may be deployed as a detection appliance at a client site to detect any suspicious content, for example, at a local area network (LAN) of the client. In addition, any of MCDS 892 and MCDS 894 may also be deployed as dedicated data analysis systems. Systems 850 and 892-894 may be configured and managed by a management system 896 over network 890, which may be a LAN, a wide area network (WAN) such as the Internet, or a combination of both. Management system 896 may be implemented as a Web server having a Web interface to allow an administrator of a client (e.g., corporation entity) to log in to manage detection systems 850 and 892-894. For example, an administrator may able to activate or deactivate certain functionalities of malicious content detection systems 850 and 892-894 or alternatively, to distribute software updates such as malicious content definition files (e.g., malicious signatures or patterns) or rules, etc. Furthermore, a user can submit via a Web interface suspicious content to be analyzed, for example, by dedicated data analysis systems 892-894. As described above, malicious content detection includes static detection and dynamic detection. Such static and dynamic detections can be distributed amongst different systems over a network. For example, static detection may be performed by detection system 850 at a client site, while dynamic detection of the same content can be offloaded to the cloud, for example, by any of detection systems 892-894. Other configurations may exist.

[0068] FIG. 7 is a block diagram illustrating an example of a data processing system which may be used with one embodiment of the invention. For example, system 900 may represents any of data processing systems described above performing any of the processes or methods described above. System 900 may represent a desktop, a tablet, a server, a mobile phone, a media player, a personal digital assistant (PDA), a personal communicator, a gaming device, a network router or hub, a wireless access point (AP) or repeater, a set-top box, or a combination thereof.

[0069] Referring to FIG. 7, in one embodiment, system 900 includes processor 901 and peripheral interface 902, also referred to herein as a chipset, to couple various components to processor 901 including memory 903 and devices 905-908 via a bus or an interconnect. Processor 901 may represent a single processor or multiple processors with a single processor core or multiple processor cores included therein. Processor 901 may represent one or more general-purpose processors such as a microprocessor, a central processing unit (CPU), or the like. More particularly, processor 901 may be a complex instruction set computing (CISC) microprocessor, reduced instruction set computing (RISC) microprocessor, very long instruction word (VLIW) microprocessor, or processor implementing other instruction sets, or processors implementing a combination of instruction sets. Processor 901 may also be one or more special-purpose processors such as an application specific integrated circuit (ASIC), a field programmable gate array (FPGA), a digital signal processor (DSP), a network processor, a graphics processor, a network processor, a communications processor, a cryptographic processor, a co-processor, an embedded processor, or any other type of logic capable of processing instructions. Processor 901 is configured to execute instructions for performing the operations and steps discussed herein.

[0070] Peripheral interface 902 may include memory control hub (MCH) and input output control hub (ICH). Peripheral interface 902 may include a memory controller (not shown) that communicates with a memory 903. Peripheral interface 902 may also include a graphics interface that communicates with graphics subsystem 904, which may include a display controller and/or a display device. Peripheral interface 902 may communicate with graphics device 904 via an accelerated graphics port (AGP), a peripheral component interconnect (PCI) express bus, or other types of interconnects.

[0071] An MCH is sometimes referred to as a Northbridge and an ICH is sometimes referred to as a Southbridge. As used herein, the terms MCH, ICH, Northbridge and Southbridge are intended to be interpreted broadly to cover various chips who functions include passing interrupt signals toward a processor. In some embodiments, the MCH may be integrated with processor 901. In such a configuration, peripheral interface 902 operates as an interface chip performing some functions of the MCH and ICH. Furthermore, a graphics accelerator may be integrated within the MCH or processor 901.

[0072] Memory 903 may include one or more volatile storage (or memory) devices such as random access memory (RAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), static RAM (SRAM), or other types of storage devices. Memory 903 may store information including sequences of instructions that are executed by processor 901, or any other device. For example, executable code and/or data of a variety of operating systems, device drivers, firmware (e.g., input output basic system or BIOS), and/or applications can be loaded in memory 903 and executed by processor 901. An operating system can be any kind of operating systems, such as, for example, a WINDOWS® operating system, Mac OS®/iOS® operating systems, an Android® operating system, a LINUX® operating system, UNIX® operating system, or other real-time or embedded operating systems such as VXWORKS®.

[0073] Peripheral interface 902 may provide an interface to IO devices such as devices 905-908, including wireless transceiver(s) 905, input device(s) 906, audio IO device(s) 907, and other IO devices 908. Wireless transceiver 905 may be a WiFi transceiver, an infrared transceiver, a Bluetooth transceiver, a WiMax transceiver, a wireless cellular telephony transceiver, a satellite transceiver (e.g., a global positioning system (GPS) transceiver) or a combination thereof. Input device(s) 906 may include a mouse, a touch pad, a touch sensitive screen (which may be integrated with display device 904), a pointer device such as a stylus, and/or a keyboard (e.g., physical keyboard or a virtual keyboard displayed as part of a touch sensitive screen). For example, input device 906 may include a touch screen controller coupled to a touch screen. The touch screen and touch screen controller can, for example, detect contact and movement or break thereof using any of a plurality of touch sensitivity technologies, including but not limited to capacitive, resistive, infrared, and surface acoustic wave technologies, as well as other proximity sensor arrays or other elements for determining one or more points of contact with the touch screen.

[0074] Audio IO 907 may include a speaker and/or a microphone to facilitate voice-enabled functions, such as voice recognition, voice replication, digital recording, and/or telephony functions. Other optional devices 908 may include a storage device (e.g., a hard drive, a flash memory device), universal serial bus (USB) port(s), parallel port(s), serial port(s), a printer, a network interface, a bus bridge (e.g., a PCI-PCI bridge), sensor(s) (e.g., a motion sensor, a light sensor, a proximity sensor, etc.), or a combination thereof. Optional devices 908 may further include an imaging processing subsystem (e.g., a camera), which may include an optical sensor, such as a charged coupled device (CCD) or a complementary metal-oxide semiconductor (CMOS) optical sensor, utilized to facilitate camera functions, such as recording photographs and video clips.

[0075] Note that while FIG. 7 illustrates various components of a data processing system, it is not intended to represent any particular architecture or manner of interconnecting the components; as such details are not germane to embodiments of the present invention. It will also be appreciated that network computers, handheld computers, mobile phones, and other data processing systems which have fewer components or perhaps more components may also be used with embodiments of the invention.

[0076] Some portions of the preceding detailed descriptions have been presented in terms of algorithms and symbolic representations of operations on data bits within a computer memory. These algorithmic descriptions and representations are the ways used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. An algorithm is here, and generally, conceived to be a self-consistent sequence of operations leading to a desired result. The operations are those requiring physical manipulations of physical quantities.

[0077] It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise as apparent from the above discussion, it is appreciated that throughout the description, discussions utilizing terms such as those set forth in the claims below, refer to the action and processes of a computer system, or similar electronic computing device, that manipulates and transforms data represented as physical (electronic) quantities within the computer system's registers and memories into other data similarly represented as physical quantities within the computer system memories or registers or other such information storage, transmission or display devices.

[0078] The techniques shown in the figures can be implemented using code and data stored and executed on one or more electronic devices. Such electronic devices store and communicate (internally and/or with other electronic devices over a network) code and data using computer-readable media, such as non-transitory computer-readable storage media (e.g., magnetic disks; optical disks; random access memory; read only memory; flash memory devices; phase-change memory) and transitory computer-readable transmission media (e.g., electrical, optical, acoustical or other form of propagated signals—such as carrier waves, infrared signals, digital signals).

[0079] The processes or methods depicted in the preceding figures may be performed by processing logic that comprises hardware (e.g. circuitry, dedicated logic, etc.), firmware, software (e.g., embodied on a non-transitory computer readable medium), or a combination of both. Although the processes or methods are described above in terms of some sequential operations, it should be appreciated that some of the operations described may be performed in a different order. Moreover, some operations may be performed in parallel rather than sequentially.

[0080] In the foregoing specification, embodiments of the invention have been described with reference to specific exemplary embodiments thereof. It will be evident that various modifications may be made thereto without departing from the broader spirit and scope of the invention as set forth in the following claims. The specification and drawings are, accordingly, to be regarded in an illustrative sense rather than a restrictive sense.

Claims

What is claimed is:

1. A computer-implemented method for detecting malicious links in electronic messages by processing logic including circuitry implemented within a malware analysis system, comprising:

in response to receiving a plurality of uniform resource locator (URL) links for malicious determination, removing any known URL links from the plurality of URL links based on a list of known link signatures;

for each of remaining URL links that are unknown, performing a link analysis by the processing logic on a URL link of the remaining URL links based on link heuristics to determine whether the URL link is suspicious; and

responsive to determining the URL link is suspicious, performing a dynamic analysis in a virtual machine on a resource associated with the suspicious URL link and classifying whether the suspicious URL link is a malicious link based on a behavior of the resource during the dynamic analysis within the virtual machine.

2. The method of claim 1, wherein the plurality of URL links are received from one or more malware detection appliances over the Internet, and wherein the one or more malware detection appliances are deployed in one or more local area networks (LANs).

3. The method of claim 2, wherein each of the malware detection appliances comprises a hardware processor that is configured to

recognize a URL embedded within an email,

extract the URL from the email, and

transmit the extracted URL to the malware analysis system over the Internet as part of the plurality of URL links, without transmitting remaining content of the email.

4. The method of claim 2, wherein the performing of the link analysis comprises:

determining a domain name included in each of the plurality of URL links;

determining whether a number of occurrences of a first domain name in URL links of the plurality of URL links exceeds a predetermined threshold, the URL links include the URL link; and

designating each of the URL links, including the URL link, as suspicious when the number of occurrences of the first domain name in the URL links exceeds the predetermined threshold.

5. The method of claim 2, wherein the performing of the link analysis comprises:

determining whether a number of occurrences of a first uniform resource identifier (URI) in URL links of the plurality of URL links exceeds a predetermined threshold, the URL links include the URL link; and

designating each of the URL links that includes the first URI as suspicious, if the number of occurrences of the first URI in the URL links exceeds the predetermined threshold.

6. The method of claim 2, wherein the performing of the link analysis comprises:

accessing the resource from a remote resource location via the URL link; and

classifying whether the URL link is suspicious or malicious based on an analysis of information associated with the resource at the remote resource location.

7. The method of claim 6, wherein the URL link is classified as suspicious or malicious based on a combination of a type and a size of the resource identified in the information associated with the resource.

8. The method of claim 1, further comprising:

generating a link signature for each of the links that have been classified as malicious; and

transmitting link signatures of the classified malicious links to one or more malware detection appliances so that the malware detection appliances can detect subsequent malicious links locally based on the link signatures.

9. A non-transitory machine-readable medium having instructions stored therein, which when executed by a processor, cause the processor to perform operations for detecting malicious links in electronic messages, comprising:

in response to receiving a plurality of uniform resource locator (URL) links for malicious determination, removing any known URL links from the plurality of URL links by the processor based on a list of known link signatures;

for each of remaining URL links that are unknown, performing a link analysis by the processor on a URL link of the remaining URL links based on link heuristics to determine whether the URL link is suspicious; and

responsive to determining that the URL link is suspicious, performing a dynamic analysis in a virtual machine on a resource associated with the suspicious URL link and classifying whether the suspicious URL link is a malicious link based on a behavior of the resource during the dynamic analysis within the virtual machine.

10. The medium of claim 9, wherein the plurality of URL links are received from one or more malware detection appliances over the Internet, and wherein the one or more malware detection appliances are deployed in one or more local area networks (LANs).

11. The medium of claim 10, wherein each of the malware detection appliances is configured to

recognize a URL link embedded within an email,

extract the URL from the email, and

transmit the extracted URL to the malware analysis system over the Internet as part of the plurality of URL links, without transmitting remaining content of the email.

12. The medium of claim 10, wherein the performing of the link analysis comprises:

determining a domain name included in each of the plurality of URL links;

determining whether a number of occurrences of a first domain name in URL links of the remaining URL links exceeds a predetermined threshold, the URL links include the URL link; and

designating each of the URL links that includes the first domain name as suspicious, if the number of occurrences of the first domain name in the URL links exceeds the predetermined threshold.

13. The medium of claim 10, wherein the performing of the link analysis comprises:

determining whether a number of occurrences of a first uniform resource identifier (URI) in URL links of the remaining URL links exceeds a predetermined threshold; and

designating each of the URL links that includes the first URI as suspicious, if the number of occurrences of the first URI in the URL links exceeds the predetermined threshold.

14. The medium of claim 10, wherein the performing of the link analysis comprises:

accessing the resource of a remote resource location via the URL link; and

classifying whether the URL link is suspicious or malicious based on a response received from the remote resource location.

15. The medium of claim 14, wherein the URL link is classified as suspicious or malicious based on the response including information associated with a type of resource, metadata associated with the resource, and information associated with a size of the resource.

16. The medium of claim 9, wherein the operations further comprises:

generating a link signature for each of the remaining URL links that have been classified as malicious; and

transmitting link signatures of the classified malicious links to one or more malware detection appliances, the one or more malware detection appliances to detect subsequent malicious links locally based on the link signatures.

17. A computer-implemented method for detecting malicious links in electronic messages, comprising:

in response to receiving an email having a uniform resource locator (URL) link for malicious determination, extracting the URL link from the email;

determining whether the extracted URL link is a known URL link, the known link includes at least one of a known malicious link or a known non-malicious link;

responsive to determining that the extracted URL link is a URL link other than the known URL link, comparing at least a portion of the extracted URL link with a list of heuristic link signatures that represents a list of patterns to determine whether the extracted URL link is suspicious;

performing a dynamic analysis on the extracted URL link in a virtual machine when at least a portion of the extracted URL link matches at least one of the heuristic link signatures, including

accessing and downloading a resource from a remote site using the extracted URL link from the email,

executing the resource within the virtual machine using a software program that is associated with the resource, and

monitoring a behavior of the resource within the virtual machine; and

classifying whether the extracted URL link is a malicious link based on the behavior of the resource during the execution of the resource within the virtual machine.

18. The method of claim 17, wherein the heuristic link signatures are generated based on data previously collected from a plurality of malware detection systems using machine learning techniques.

19. The method of claim 18, wherein the heuristic link signatures are updated periodically based on data periodically collected from the plurality of malware detection systems.

20. The method of claim 18, wherein the heuristic link signatures represent patterns of likely malicious links based on previous malware detection operations.

21. The method of claim 17, further comprising performing a static analysis on metadata of the email to determine whether the email is a suspicious email, wherein the dynamic analysis is performed on the extracted URL link if the email is determined to be suspicious.

22. The method of claim 21, wherein the metadata of the email includes at least one of TO, FROM, and SUBJECT fields.

23. A non-transitory machine-readable medium having instructions stored therein, which when executed by a processor, cause the processor to perform operations for detecting malicious links in electronic messages, comprising:

in response to receiving an email having a uniform resource locator (URL) link for malicious determination, extracting by the processor the URL link from the email;

determining whether the extracted URL link is a known URL link, the known link includes at least one of a known malicious link or a known non-malicious link;

responsive to determining that the extracted URL link is a URL link other than the known URL link, comparing, by the processor, at least a portion of the extracted URL link with a list of heuristic link signatures that represents a list of patterns to determine whether the extracted URL link is suspicious;

performing, by the processor, a dynamic analysis on the extracted URL link in a virtual machine if at least a portion of the extracted URL link matches at least one of the heuristic link signatures, including

accessing and downloading a resource from a remote site using the extracted URL link,

executing the resource within the virtual machine using a software program that is associated with the resource, and

monitoring a behavior of the resource within the virtual machine; and

classifying whether the extracted URL link is a malicious link based on the behavior of the resource during the execution of the resource within the virtual machine.

24. The medium of claim 23, wherein the heuristic link signatures are generated based on data previously collected from a plurality of malware detection systems using machine learning techniques.

25. The medium of claim 24, wherein the heuristic link signatures are updated periodically based on data periodically collected from the malware detection systems.

26. The medium of claim 24, wherein the heuristic link signatures represent patterns of likely malicious links based on previous malware detection operations.

27. The medium of claim 23, wherein the method further comprises performing a static analysis on metadata of the email to determine whether the email is a suspicious email, wherein the dynamic analysis is performed on the extracted URL link if the email is determined to be suspicious.

28. A data processing system for detecting malicious links, comprising:

a processor; and

a memory coupled to the processor for storing instructions, which when executed from the memory by the processor, cause the processor to

in response to receiving an email having a uniform resource locator (URL) link for malicious determination, extract the URL link from the email,

determine whether the extracted URL link is a known URL link, the known link includes at least one of a known malicious link or a known non-malicious link;

responsive to determining that the extracted URL link is a URL link other than the known URL link, compare at least a portion of the extracted URL link with a list of heuristic link signatures that represents a list of patterns to determine whether the extracted URL link is suspicious,

perform a dynamic analysis on the extracted URL link in a virtual machine if at least a portion of the extracted URL link matches at least one of the heuristic link signatures, including

accessing and downloading a resource from a remote site via the extracted URL link,

executing the resource within the virtual machine using a software program that is associated with the resource, and

monitoring a behavior of the resource within the virtual machine; and

classify whether the extracted URL link is a malicious link based on the behavior of the resource during the execution of the resource within the virtual machine.

29. The data processing system of claim 28, wherein the heuristic link signatures are generated based on data previously collected from a plurality of malware detection systems using machine learning techniques.

30. The data processing system of claim 29, wherein the heuristic link signatures are updated periodically based on data periodically collected from the plurality of malware detection systems.

31. The data processing system of claim 29, wherein the heuristic link signatures represent patterns of likely malicious links based on previous malware detection operations.

32. The data processing system of claim 28, wherein the memory includes further instructions which, when executed by the processor, cause the processor to perform a static analysis on metadata of the email to determine whether the email is a suspicious email, wherein the dynamic analysis is performed on the extracted URL link if the email is determined to be suspicious.

33. The data processing system of claim 32, wherein the metadata of the email includes at least one of TO, FROM, and SUBJECT fields.

34. The method of claim 1, wherein the performing of the link analysis comprises determining whether a number of occurrences of a first domain name included as part of the plurality of URL links exceeds a predetermined threshold; and

designating the URL link including the first domain name as suspicious, if the number of occurrences of the first domain name included as part of the plurality of URL links exceeds the predetermined threshold.

35. The method of claim 1, wherein the performing of the link analysis comprises determining whether a number of occurrences of a first uniform resource identifier (URI) included as part of the plurality of URL links exceeds a predetermined threshold; and

designating the URL link including the first URI as suspicious, if the number of occurrences of the first URI included as part of the plurality of URL links exceeds the predetermined threshold.

36. The method of claim 1, wherein the resource is content retrieved from a website referenced by the URL link.

37. The method of claim 4 further comprising:

responsive to determining by the processing logic during the link analysis that the URL link is malicious, generating a link signature for the URL link.

38. The method of claim 37 further comprising:

responsive to generating the link signature for the URL link, transmitting the link signature to one or more malware detection appliances for use in local detection of malicious URL links.

39. The method of claim 1, wherein the known URL links include at least one of known malicious URL links or known non-malicious URL links.

40. The medium of claim 9, wherein the resource is content retrieved from a website referenced by the URL link.

41. The medium of claim 9 having instructions stored therein, which when executed by the processor, further cause the processor to perform operations comprising:

responsive to determining by the processor during the link analysis that the URL link is malicious, generating a link signature for the URL link.

42. The medium of claim 41 having instructions stored therein, which when executed by the processor, further cause the processor to perform operations comprising:

responsive to generating the link signature for the URL link, transmitting the link signature to one or more malware detection appliances for use in local detection of malicious URL links.

43. The medium of claim 9 having instructions stored therein, which when executed by a processor, cause the processor to remove any known URL links, wherein the known URL links include at least one of known malicious URL links or known non-malicious URL links.

44. A malware analysis system, comprising:

a processor; and

a memory coupled to the processor for storing instructions, which when executed by the processor, cause the processor to

remove any known URL links from a plurality of uniform resource locator (URL) links received for malicious determination,

for each of remaining URL links that are unknown, perform a link analysis on a URL link of the remaining URL links based on link heuristics to determine whether the URL link is suspicious, and

responsive to determining the URL link is suspicious, perform a dynamic analysis in a virtual machine on a resource associated with the suspicious URL link and classify whether the suspicious URL link is a malicious link based on a behavior of the resource during the dynamic analysis within the virtual machine.

45. The malware analysis system of claim 44, wherein the plurality of URL links are received from one or more malware detection appliances over the Internet, and wherein the one or more malware detection appliances are deployed in one or more local area networks (LANs).

46. The malware analysis system of claim 45, wherein each of the malware detection appliances comprises a hardware processor that is configured to

recognize a URL embedded within an email,

extract the URL from the email, and

transmit the extracted URL to the malware analysis system over the Internet as part of the plurality of URL links, without transmitting remaining content of the email.

47. The malware analysis system of claim 45, wherein the memory includes instructions which, when executed by the processor, cause the processor to perform the link analysis by at least:

determining whether a first domain name of the URL link occurs frequently amongst the remaining URL links; and

designating each of the URL links that includes the first domain name as suspicious, if the first domain name occurs frequently amongst the remaining URL links.

48. The malware analysis system of claim 45, wherein the memory includes instructions which, when executed by the processor, cause the processor to perform the link analysis by at least:

determining whether a first uniform resource identifier (URI) of the URL link occurs frequently amongst the remaining URL links; and

designating each of the URL links that includes the first URI as suspicious, if the first URI occurs frequently amongst the remaining URL links.

49. The malware analysis system of claim 45, wherein the memory includes instructions which, when executed by the processor, cause the processor to perform the link analysis by at least:

accessing the resource from a remote resource location via the URL link; and

classifying whether the URL link is suspicious or malicious based on an analysis of information associated with the resource at the remote resource location.

50. The malware analysis system of claim 49, wherein the memory includes instructions which, when executed by the processor, cause the processor to perform the link analysis by classifying the URL link as suspicious or malicious based on analysis of the information that includes one or more of (1) information that identifies a type of the resource, and (ii) information that identifies a size of the resource.

51. The malware analysis system of claim 49, wherein the memory includes instructions which, when executed by the processor, cause the processor to perform one or more operations responsive to determining that the URL link is suspicious, including:

generating a link signature for each of the remaining URL links that have been classified as malicious; and

transmitting link signatures of the classified malicious links to one or more malware detection appliances, such that the one or more malware detection appliances can detect subsequent malicious links locally based on the link signatures.

52. The malware analysis system of claim 44, wherein the resource is content retrieved from a website referenced by the URL link.

53. The malware analysis system of claim 44, wherein the memory includes instructions which, when executed by the processor, cause the processor to perform operations comprising:

responsive to determining by the processor during the link analysis that the URL link is malicious, generating a link signature for the URL link.

54. The malware analysis system of claim 53, wherein the memory includes instructions which, when executed by the processor, cause the processor to perform operations comprising:

responsive to generating the link signature for the URL link, transmitting the link signature to one or more malware detection appliances for use in local detection of malicious URL links.

55. The malware analysis system of claim 44, wherein the processor to remove any known URL links from the plurality of URL links by analysis of the plurality of URL links and a list of known link signatures.

56. The malware analysis system of claim 47, wherein the memory includes instructions that, when executed by the processor, further cause the processor to determine whether the first domain name of the URL link occurs frequently by determining whether a number of occurrences of the first domain name in the remaining URL links exceeds a predetermined threshold.

57. The malware analysis system of claim 48, wherein the memory includes instructions that, when executed by the processor, further cause the processor to determine whether the first URI of the URL link occurs frequently by determining whether a number of occurrences of the first URI in the remaining URL links exceeds a predetermined threshold.

58. The malware analysis system of claim 44, wherein the memory includes instructions which, when executed by the processor, cause the processor to perform the link analysis by at least:

determining whether a number of occurrences of a first domain name included as part of the remaining URL links exceeds a predetermined threshold; and

designating the URL link including the first domain name as suspicious, if the number of occurrences of the first domain name included as part of the remaining URL links exceeds the predetermined threshold.

59. The malware analysis system of claim 44, wherein the memory includes instructions which, when executed by the processor, cause the processor to perform the link analysis by at least:

determining whether a number of occurrences of a first uniform resource identifier (URI) included as part of the remaining URL links exceeds a predetermined threshold; and

designating the URL link including the first URI as suspicious, if the number of occurrences of the first URI included as part of the remaining URL links exceeds the predetermined threshold.

Patent Citations (508)

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	Sorhaug et al.	Applicant
US6442696(B1)	2002-08-01	Wray et al.	Applicant
US6484315(B1)	2002-11-01	Ziese	Applicant
US6487666(B1)	2002-11-01	Shanklin et al.	Applicant
US6493756(B1)	2002-12-01	O'Brien et al.	Applicant
US6550012(B1)	2003-04-01	Villa et al.	Applicant
US6700497(B2)	2004-03-01	Hibbs et al.	Applicant
US6775657(B1)	2004-08-01	Baker	Applicant
US6831893(B1)	2004-12-01	Ben Nun et al.	Applicant
US6832367(B1)	2004-12-01	Choi et al.	Applicant
US6895550(B2)	2005-05-01	Kanchirayappa et al.	Applicant
US6898632(B2)	2005-05-01	Gordy et al.	Applicant
US6907396(B1)	2005-06-01	Muttik et al.	Applicant
US6941348(B2)	2005-09-01	Petry et al.	Applicant
US6971097(B1)	2005-11-01	Wallman	Applicant
US6981279(B1)	2005-12-01	Arnold et al.	Applicant
US7007107(B1)	2006-02-01	Ivchenko et al.	Applicant
US7028179(B2)	2006-04-01	Anderson et al.	Applicant
US7043757(B2)	2006-05-01	Hoefelmeyer et al.	Applicant
US7069316(B1)	2006-06-01	Gryaznov	Applicant
US7080408(B1)	2006-07-01	Pak et al.	Applicant
US7093002(B2)	2006-08-01	Wolff et al.	Applicant
US7093239(B1)	2006-08-01	van der Made	Applicant
US7100201(B2)	2006-08-01	Izatt	Applicant
US7159149(B2)	2007-01-01	Spiegel et al.	Applicant
US7213260(B2)	2007-05-01	Judge	Applicant
US7231667(B2)	2007-06-01	Jordan	Applicant
US7240364(B1)	2007-07-01	Branscomb et al.	Applicant
US7240368(B1)	2007-07-01	Roesch et al.	Applicant
US7243371(B1)	2007-07-01	Kasper et al.	Applicant
US7249175(B1)	2007-07-01	Donaldson	Applicant
US7287278(B2)	2007-10-01	Liang	Applicant
US7308716(B2)	2007-12-01	Danford et al.	Applicant
US7328453(B2)	2008-02-01	Merkle, Jr. et al.	Applicant
US7346486(B2)	2008-03-01	Ivancic et al.	Applicant
US7356736(B2)	2008-04-01	Natvig	Applicant
US7386888(B2)	2008-06-01	Liang et al.	Applicant
US7392542(B2)	2008-06-01	Bucher	Applicant
US7418729(B2)	2008-08-01	Szor	Applicant
US7428300(B1)	2008-09-01	Drew et al.	Applicant
US7441272(B2)	2008-10-01	Durham et al.	Applicant
US7448084(B1)	2008-11-01	Apap et al.	Applicant
US7458098(B2)	2008-11-01	Judge et al.	Applicant
US7464404(B2)	2008-12-01	Carpenter et al.	Applicant
US7464407(B2)	2008-12-01	Nakae et al.	Applicant
US7467408(B1)	2008-12-01	O'Toole, Jr.	Applicant
US7478428(B1)	2009-01-01	Thomlinson	Applicant
US7480773(B1)	2009-01-01	Reed	Applicant
US7487543(B2)	2009-02-01	Arnold et al.	Applicant
US7496960(B1)	2009-02-01	Chen et al.	Applicant
US7496961(B2)	2009-02-01	Zimmer et al.	Applicant
US7519990(B1)	2009-04-01	Xie	Applicant
US7523493(B2)	2009-04-01	Liang et al.	Applicant
US7530104(B1)	2009-05-01	Thrower et al.	Applicant
US7540025(B2)	2009-05-01	Tzadikario	Applicant
US7565550(B2)	2009-07-01	Liang et al.	Applicant
US7568233(B1)	2009-07-01	Szor et al.	Applicant
US7584455(B2)	2009-09-01	Ball	Applicant
US7603715(B2)	2009-10-01	Costa et al.	Applicant
US7607171(B1)	2009-10-01	Marsden et al.	Applicant
US7639714(B2)	2009-12-01	Stolfo et al.	Applicant
US7644441(B2)	2010-01-01	Schmid et al.	Applicant
US7657419(B2)	2010-02-01	van der Made	Applicant
US7676841(B2)	2010-03-01	Sobchuk et al.	Applicant
US7698548(B2)	2010-04-01	Shelest et al.	Applicant
US7707633(B2)	2010-04-01	Danford et al.	Applicant
US7712136(B2)	2010-05-01	Sprosts et al.	Applicant
US7730011(B1)	2010-06-01	Deninger et al.	Applicant
US7739740(B1)	2010-06-01	Nachenberg et al.	Applicant
US7779463(B2)	2010-08-01	Stolfo et al.	Applicant
US7784097(B1)	2010-08-01	Stolfo et al.	Applicant
US7832008(B1)	2010-11-01	Kraemer	Applicant
US7836502(B1)	2010-11-01	Zhao et al.	Applicant
US7849506(B1)	2010-12-01	Dansey et al.	Applicant
US7854007(B2)	2010-12-01	Sprosts et al.	Applicant
US7869073(B2)	2011-01-01	Oshima	Applicant
US7877803(B2)	2011-01-01	Enstone et al.	Applicant
US7904959(B2)	2011-03-01	Sidiroglou et al.	Applicant
US7908660(B2)	2011-03-01	Bahl	Applicant
US7930738(B1)	2011-04-01	Petersen	Applicant
US7937761(B1)	2011-05-01	Benett	Applicant
US7949849(B2)	2011-05-01	Lowe et al.	Applicant
US7996556(B2)	2011-08-01	Raghavan et al.	Applicant
US7996836(B1)	2011-08-01	McCorkendale et al.	Applicant
US7996904(B1)	2011-08-01	Chiueh et al.	Applicant
US7996905(B2)	2011-08-01	Arnold et al.	Applicant
US8006305(B2)	2011-08-01	Aziz	Applicant
US8010667(B2)	2011-08-01	Zhang et al.	Applicant
US8020206(B2)	2011-09-01	Hubbard et al.	Applicant
US8028338(B1)	2011-09-01	Schneider et al.	Applicant
US8042184(B1)	2011-10-01	Batenin	Applicant
US8045094(B2)	2011-10-01	Teragawa	Applicant
US8045458(B2)	2011-10-01	Alperovitch et al.	Applicant
US8069484(B2)	2011-11-01	McMillan et al.	Applicant
US8087086(B1)	2011-12-01	Lai et al.	Applicant
US8171553(B2)	2012-05-01	Aziz et al.	Applicant
US8176049(B2)	2012-05-01	Deninger et al.	Applicant
US8176480(B1)	2012-05-01	Spertus	Applicant
US8201246(B1)	2012-06-01	Wu et al.	Applicant
US8204984(B1)	2012-06-01	Aziz et al.	Applicant
US8214905(B1)	2012-07-01	Doukhvalov et al.	Applicant
US8220055(B1)	2012-07-01	Kennedy	Applicant
US8225288(B2)	2012-07-01	Miller et al.	Applicant
US8225373(B2)	2012-07-01	Kraemer	Applicant
US8233882(B2)	2012-07-01	Rogel	Applicant
US8234640(B1)	2012-07-01	Fitzgerald et al.	Applicant
US8234709(B2)	2012-07-01	Viljoen et al.	Applicant
US8239944(B1)	2012-08-01	Nachenberg et al.	Applicant
US8260914(B1)	2012-09-01	Ranjan	Applicant
US8286251(B2)	2012-10-01	Eker et al.	Applicant
US8291499(B2)	2012-10-01	Aziz et al.	Applicant
US8307435(B1)	2012-11-01	Mann et al.	Applicant
US8307443(B2)	2012-11-01	Wang et al.	Applicant
US8312545(B2)	2012-11-01	Tuvell et al.	Applicant
US8321936(B1)	2012-11-01	Green et al.	Applicant
US8321941(B2)	2012-11-01	Tuvell et al.	Applicant
US8332571(B1)	2012-12-01	Edwards, Sr.	Applicant
US8365286(B2)	2013-01-01	Poston	Applicant
US8365297(B1)	2013-01-01	Parshin et al.	Applicant
US8370938(B1)	2013-02-01	Daswani et al.	Applicant
US8370939(B2)	2013-02-01	Zaitsev et al.	Applicant
US8375444(B2)	2013-02-01	Aziz et al.	Applicant
US8381299(B2)	2013-02-01	Stolfo et al.	Applicant
US8402529(B1)	2013-03-01	Green et al.	Applicant
US8464340(B2)	2013-06-01	Ahn et al.	Applicant
US8479174(B2)	2013-07-01	Chiriac	Applicant
US8479276(B1)	2013-07-01	Vaystikh et al.	Applicant
US8479291(B1)	2013-07-01	Bodke	Applicant
US8510827(B1)	2013-08-01	Leake et al.	Applicant
US8510828(B1)	2013-08-01	Guo et al.	Applicant
US8510842(B2)	2013-08-01	Amit et al.	Applicant
US8516478(B1)	2013-08-01	Edwards et al.	Applicant
US8516590(B1)	2013-08-01	Ranadive et al.	Applicant
US8516593(B2)	2013-08-01	Aziz	Applicant
US8522348(B2)	2013-08-01	Chen et al.	Applicant
US8528086(B1)	2013-09-01	Aziz	Applicant
US8533824(B2)	2013-09-01	Hutton et al.	Applicant
US8539582(B1)	2013-09-01	Aziz et al.	Applicant
US8549638(B2)	2013-10-01	Aziz	Applicant
US8555391(B1)	2013-10-01	Demir et al.	Applicant
US8561177(B1)	2013-10-01	Aziz et al.	Applicant
US8566946(B1)	2013-10-01	Aziz et al.	Applicant
US8584094(B2)	2013-11-01	Dahdia et al.	Applicant
US8584234(B1)	2013-11-01	Sobel et al.	Applicant
US8584239(B2)	2013-11-01	Aziz et al.	Applicant
US8595834(B2)	2013-11-01	Xie et al.	Applicant
US8627476(B1)	2014-01-01	Satish et al.	Applicant
US8635696(B1)	2014-01-01	Aziz	Applicant
US8682054(B2)	2014-03-01	Xue et al.	Applicant
US8682812(B1)	2014-03-01	Ranjan	Applicant
US8689333(B2)	2014-04-01	Aziz	Applicant
US8695096(B1)	2014-04-01	Zhang	Applicant
US8713631(B1)	2014-04-01	Pavlyushchik	Applicant
US8713681(B2)	2014-04-01	Silberman et al.	Applicant
US8726392(B1)	2014-05-01	McCorkendale et al.	Applicant
US8739280(B2)	2014-05-01	Chess et al.	Applicant
US8776229(B1)	2014-07-01	Aziz	Applicant
US8782792(B1)	2014-07-01	Bodke	Applicant
US8789172(B2)	2014-07-01	Stolfo et al.	Applicant
US8789178(B2)	2014-07-01	Kejriwal et al.	Applicant
US8793787(B2)	2014-07-01	Ismael et al.	Applicant
US8805947(B1)	2014-08-01	Kuzkin et al.	Applicant
US8806647(B1)	2014-08-01	Daswani et al.	Applicant
US8832829(B2)	2014-09-01	Manni et al.	Applicant
US8850570(B1)	2014-09-01	Ramzan	Applicant
US8850571(B2)	2014-09-01	Staniford et al.	Applicant
US8881234(B2)	2014-11-01	Narasimhan et al.	Applicant
US8881282(B1)	2014-11-01	Aziz et al.	Applicant
US8898788(B1)	2014-11-01	Aziz et al.	Applicant
US8935779(B2)	2015-01-01	Manni et al.	Applicant
US8984638(B1)	2015-03-01	Aziz et al.	Applicant
US8990939(B2)	2015-03-01	Staniford et al.	Applicant
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
US9106694(B2)	2015-08-01	Aziz 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, III	Applicant
US2002/0162015(A1)	2002-10-01	Tang	Applicant
US2002/0166063(A1)	2002-11-01	Lachman et al.	Applicant
US2002/0169952(A1)	2002-11-01	DiSanto et al.	Applicant
US2002/0184528(A1)	2002-12-01	Shevenell et al.	Applicant
US2002/0188887(A1)	2002-12-01	Largman et al.	Applicant
US2002/0194490(A1)	2002-12-01	Halperin et al.	Applicant
US2003/0074578(A1)	2003-04-01	Ford et al.	Applicant
US2003/0084318(A1)	2003-05-01	Schertz	Applicant
US2003/0101381(A1)	2003-05-01	Mateev et al.	Applicant
US2003/0115483(A1)	2003-06-01	Liang	Applicant
US2003/0188190(A1)	2003-10-01	Aaron et al.	Applicant
US2003/0191957(A1)	2003-10-01	Hypponen et al.	Applicant
US2003/0200460(A1)	2003-10-01	Morota et al.	Applicant
US2003/0212902(A1)	2003-11-01	Van der Made	Applicant
US2003/0229801(A1)	2003-12-01	Kouznetsov et al.	Applicant
US2003/0237000(A1)	2003-12-01	Denton et al.	Applicant
US2004/0003323(A1)	2004-01-01	Bennett et al.	Applicant
US2004/0015712(A1)	2004-01-01	Szor	Applicant
US2004/0019832(A1)	2004-01-01	Arnold et al.	Applicant
US2004/0047356(A1)	2004-03-01	Bauer	Applicant
US2004/0083408(A1)	2004-04-01	Spiegel et al.	Applicant
US2004/0088581(A1)	2004-05-01	Brawn et al.	Applicant
US2004/0093513(A1)	2004-05-01	Cantrell et al.	Applicant
US2004/0111531(A1)	2004-06-01	Staniford et al.	Applicant
US2004/0117478(A1)	2004-06-01	Triulzi et al.	Applicant
US2004/0117624(A1)	2004-06-01	Brandt et al.	Applicant
US2004/0128355(A1)	2004-07-01	Chao et al.	Applicant
US2004/0165588(A1)	2004-08-01	Pandya	Applicant
US2004/0236963(A1)	2004-11-01	Danford et al.	Applicant
US2004/0243349(A1)	2004-12-01	Greifeneder et al.	Applicant
US2004/0249911(A1)	2004-12-01	Alkhatib et al.	Applicant
US2004/0255161(A1)	2004-12-01	Cavanaugh	Applicant
US2004/0268147(A1)	2004-12-01	Wiederin et al.	Applicant
US2005/0005159(A1)	2005-01-01	Oliphant	Applicant
US2005/0021740(A1)	2005-01-01	Bar et al.	Applicant
US2005/0033960(A1)	2005-02-01	Vialen et al.	Applicant
US2005/0033989(A1)	2005-02-01	Poletto et al.	Applicant
US2005/0050148(A1)	2005-03-01	Mohammadioun et al.	Applicant
US2005/0086523(A1)	2005-04-01	Zimmer et al.	Applicant
US2005/0091513(A1)	2005-04-01	Mitomo et al.	Applicant
US2005/0091533(A1)	2005-04-01	Omote et al.	Applicant
US2005/0091652(A1)	2005-04-01	Ross et al.	Applicant
US2005/0108562(A1)	2005-05-01	Khazan et al.	Applicant
US2005/0114663(A1)	2005-05-01	Cornell et al.	Applicant
US2005/0125195(A1)	2005-06-01	Brendel	Applicant
US2005/0149726(A1)	2005-07-01	Joshi et al.	Applicant
US2005/0157662(A1)	2005-07-01	Bingham et al.	Applicant
US2005/0183143(A1)	2005-08-01	Anderholm et al.	Applicant
US2005/0201297(A1)	2005-09-01	Peikari	Applicant
US2005/0210533(A1)	2005-09-01	Copeland et al.	Applicant
US2005/0238005(A1)	2005-10-01	Chen et al.	Applicant
US2005/0240781(A1)	2005-10-01	Gassoway	Applicant
US2005/0262562(A1)	2005-11-01	Gassoway	Applicant
US2005/0265331(A1)	2005-12-01	Stolfo	Applicant
US2005/0283839(A1)	2005-12-01	Cowburn	Applicant
US2006/0010495(A1)	2006-01-01	Cohen et al.	Applicant
US2006/0015416(A1)	2006-01-01	Hoffman et al.	Applicant
US2006/0015715(A1)	2006-01-01	Anderson	Applicant
US2006/0015747(A1)	2006-01-01	Van de Ven	Applicant
US2006/0021029(A1)	2006-01-01	Brickell et al.	Applicant
US2006/0021054(A1)	2006-01-01	Costa et al.	Applicant
US2006/0031476(A1)	2006-02-01	Mathes et al.	Applicant
US2006/0047665(A1)	2006-03-01	Neil	Applicant
US2006/0070130(A1)	2006-03-01	Costea et al.	Applicant
US2006/0075496(A1)	2006-04-01	Carpenter et al.	Applicant
US2006/0095968(A1)	2006-05-01	Portolani et al.	Applicant
US2006/0101516(A1)	2006-05-01	Sudaharan et al.	Applicant
US2006/0101517(A1)	2006-05-01	Banzhof et al.	Applicant
US2006/0117385(A1)	2006-06-01	Mester et al.	Applicant
US2006/0123477(A1)	2006-06-01	Raghavan et al.	Applicant
US2006/0143709(A1)	2006-06-01	Brooks et al.	Applicant
US2006/0150249(A1)	2006-07-01	Gassen et al.	Applicant
US2006/0161983(A1)	2006-07-01	Cothrell et al.	Applicant
US2006/0161987(A1)	2006-07-01	Levy-Yurista	Applicant
US2006/0161989(A1)	2006-07-01	Reshef et al.	Applicant
US2006/0164199(A1)	2006-07-01	Gilde et al.	Applicant
US2006/0173992(A1)	2006-08-01	Weber et al.	Applicant
US2006/0179147(A1)	2006-08-01	Tran et al.	Applicant
US2006/0184632(A1)	2006-08-01	Marino et al.	Applicant
US2006/0191010(A1)	2006-08-01	Benjamin	Applicant
US2006/0221956(A1)	2006-10-01	Narayan et al.	Applicant
US2006/0236393(A1)	2006-10-01	Kramer et al.	Applicant
US2006/0242709(A1)	2006-10-01	Seinfeld et al.	Applicant
US2006/0248519(A1)	2006-11-01	Jaeger et al.	Applicant
US2006/0248582(A1)	2006-11-01	Panjwani et al.	Applicant
US2006/0251104(A1)	2006-11-01	Koga	Applicant
US2006/0288417(A1)	2006-12-01	Bookbinder et al.	Applicant
US2007/0006288(A1)	2007-01-01	Mayfield et al.	Applicant
US2007/0006313(A1)	2007-01-01	Porras et al.	Applicant
US2007/0011174(A1)	2007-01-01	Takaragi et al.	Applicant
US2007/0016951(A1)	2007-01-01	Piccard et al.	Applicant
US2007/0033645(A1)	2007-02-01	Jones	Applicant
US2007/0038943(A1)	2007-02-01	FitzGerald et al.	Applicant
US2007/0064689(A1)	2007-03-01	Shin et al.	Applicant
US2007/0074169(A1)	2007-03-01	Chess et al.	Applicant
US2007/0094730(A1)	2007-04-01	Bhikkaji et al.	Applicant
US2007/0101435(A1)	2007-05-01	Konanka et al.	Applicant
US2007/0128855(A1)	2007-06-01	Cho et al.	Applicant
US2007/0142030(A1)	2007-06-01	Sinha et al.	Applicant
US2007/0143827(A1)	2007-06-01	Nicodemus et al.	Applicant
US2007/0156895(A1)	2007-07-01	Vuong	Applicant
US2007/0157180(A1)	2007-07-01	Tillmann et al.	Applicant
US2007/0157306(A1)	2007-07-01	Elrod et al.	Applicant
US2007/0168988(A1)	2007-07-01	Eisner et al.	Applicant
US2007/0171824(A1)	2007-07-01	Ruello et al.	Applicant
US2007/0174915(A1)	2007-07-01	Gribble et al.	Examiner
US2007/0192500(A1)	2007-08-01	Lum	Applicant
US2007/0192858(A1)	2007-08-01	Lum	Applicant
US2007/0198275(A1)	2007-08-01	Malden et al.	Applicant
US2007/0208822(A1)	2007-09-01	Wang et al.	Applicant
US2007/0220607(A1)	2007-09-01	Sprosts et al.	Applicant
US2007/0240218(A1)	2007-10-01	Tuvell et al.	Applicant
US2007/0240219(A1)	2007-10-01	Tuvell et al.	Applicant
US2007/0240220(A1)	2007-10-01	Tuvell et al.	Applicant
US2007/0240222(A1)	2007-10-01	Tuvell et al.	Applicant
US2007/0250930(A1)	2007-10-01	Aziz et al.	Applicant
US2007/0256132(A2)	2007-11-01	Oliphant	Applicant
US2007/0271446(A1)	2007-11-01	Nakamura	Applicant
US2008/0005782(A1)	2008-01-01	Aziz	Applicant
US2008/0028463(A1)	2008-01-01	Dagon et al.	Applicant
US2008/0032556(A1)	2008-02-01	Schreier	Applicant
US2008/0040710(A1)	2008-02-01	Chiriac	Applicant
US2008/0046781(A1)	2008-02-01	Childs et al.	Applicant
US2008/0066179(A1)	2008-03-01	Liu	Applicant
US2008/0072326(A1)	2008-03-01	Danford et al.	Applicant
US2008/0077793(A1)	2008-03-01	Tan et al.	Applicant
US2008/0080518(A1)	2008-04-01	Hoeflin et al.	Applicant
US2008/0086720(A1)	2008-04-01	Lekel	Applicant
US2008/0098476(A1)	2008-04-01	Syversen	Applicant
US2008/0120722(A1)	2008-05-01	Sima et al.	Applicant
US2008/0134178(A1)	2008-06-01	Fitzgerald et al.	Applicant
US2008/0134334(A1)	2008-06-01	Kim et al.	Applicant
US2008/0141376(A1)	2008-06-01	Clausen et al.	Applicant
US2008/0184373(A1)	2008-07-01	Traut et al.	Applicant
US2008/0189787(A1)	2008-08-01	Arnold et al.	Applicant
US2008/0201778(A1)	2008-08-01	Guo et al.	Applicant
US2008/0209557(A1)	2008-08-01	Herley et al.	Applicant
US2008/0215742(A1)	2008-09-01	Goldszmidt et al.	Applicant
US2008/0222729(A1)	2008-09-01	Chen et al.	Applicant
US2008/0263665(A1)	2008-10-01	Ma et al.	Applicant
US2008/0295172(A1)	2008-11-01	Bohacek	Applicant
US2008/0301810(A1)	2008-12-01	Lehane et al.	Applicant
US2008/0307524(A1)	2008-12-01	Singh et al.	Applicant
US2008/0313738(A1)	2008-12-01	Enderby	Applicant
US2008/0320594(A1)	2008-12-01	Jiang	Applicant
US2009/0003317(A1)	2009-01-01	Kasralikar et al.	Applicant
US2009/0007100(A1)	2009-01-01	Field et al.	Applicant
US2009/0013408(A1)	2009-01-01	Schipka	Applicant
US2009/0031423(A1)	2009-01-01	Liu et al.	Applicant
US2009/0036111(A1)	2009-02-01	Danford et al.	Applicant
US2009/0037835(A1)	2009-02-01	Goldman	Applicant
US2009/0044024(A1)	2009-02-01	Oberheide et al.	Applicant
US2009/0044274(A1)	2009-02-01	Budko et al.	Applicant
US2009/0064332(A1)	2009-03-01	Porras et al.	Applicant
US2009/0077666(A1)	2009-03-01	Chen et al.	Applicant
US2009/0083369(A1)	2009-03-01	Marmor	Applicant
US2009/0083855(A1)	2009-03-01	Apap et al.	Applicant
US2009/0089879(A1)	2009-04-01	Wang et al.	Applicant
US2009/0094697(A1)	2009-04-01	Provos et al.	Applicant
US2009/0113425(A1)	2009-04-01	Ports et al.	Applicant
US2009/0125976(A1)	2009-05-01	Wassermann et al.	Applicant
US2009/0126015(A1)	2009-05-01	Monastyrsky et al.	Applicant
US2009/0126016(A1)	2009-05-01	Sobko et al.	Applicant
US2009/0133125(A1)	2009-05-01	Choi et al.	Applicant
US2009/0144823(A1)	2009-06-01	Lamastra et al.	Applicant
US2009/0158430(A1)	2009-06-01	Borders	Applicant
US2009/0172815(A1)	2009-07-01	Gu et al.	Applicant
US2009/0187992(A1)	2009-07-01	Poston	Applicant
US2009/0193293(A1)	2009-07-01	Stolfo et al.	Applicant
US2009/0199296(A1)	2009-08-01	Xie et al.	Applicant
US2009/0228233(A1)	2009-09-01	Anderson et al.	Applicant
US2009/0241187(A1)	2009-09-01	Troyansky	Applicant
US2009/0241190(A1)	2009-09-01	Todd et al.	Applicant
US2009/0265692(A1)	2009-10-01	Godefroid et al.	Applicant
US2009/0271867(A1)	2009-10-01	Zhang	Applicant
US2009/0300415(A1)	2009-12-01	Zhang et al.	Applicant
US2009/0300761(A1)	2009-12-01	Park et al.	Applicant
US2009/0328185(A1)	2009-12-01	Berg et al.	Applicant
US2009/0328221(A1)	2009-12-01	Blumfield et al.	Applicant
US2010/0005146(A1)	2010-01-01	Drako et al.	Applicant
US2010/0011205(A1)	2010-01-01	McKenna	Applicant
US2010/0017546(A1)	2010-01-01	Poo et al.	Applicant
US2010/0031353(A1)	2010-02-01	Thomas et al.	Applicant
US2010/0037314(A1)	2010-02-01	Perdisci et al.	Applicant
US2010/0043073(A1)	2010-02-01	Kuwamura	Applicant
US2010/0054278(A1)	2010-03-01	Stolfo et al.	Applicant
US2010/0058474(A1)	2010-03-01	Hicks	Applicant
US2010/0064044(A1)	2010-03-01	Nonoyama	Applicant
US2010/0077481(A1)	2010-03-01	Polyakov et al.	Applicant
US2010/0083376(A1)	2010-04-01	Pereira et al.	Applicant
US2010/0115621(A1)	2010-05-01	Staniford et al.	Applicant
US2010/0132038(A1)	2010-05-01	Zaitsev	Applicant
US2010/0154056(A1)	2010-06-01	Smith et al.	Applicant
US2010/0180344(A1)	2010-07-01	Malyshev et al.	Applicant
US2010/0192223(A1)	2010-07-01	Ismael et al.	Applicant
US2010/0220863(A1)	2010-09-01	Dupaquis et al.	Applicant
US2010/0235831(A1)	2010-09-01	Dittmer	Applicant
US2010/0251104(A1)	2010-09-01	Massand	Applicant
US2010/0281102(A1)	2010-11-01	Chinta et al.	Applicant
US2010/0281541(A1)	2010-11-01	Stolfo et al.	Applicant
US2010/0281542(A1)	2010-11-01	Stolfo et al.	Applicant
US2010/0287260(A1)	2010-11-01	Peterson et al.	Applicant
US2010/0299754(A1)	2010-11-01	Amit et al.	Applicant
US2010/0306173(A1)	2010-12-01	Frank	Applicant
US2011/0004737(A1)	2011-01-01	Greenebaum	Applicant
US2011/0025504(A1)	2011-02-01	Lyon et al.	Applicant
US2011/0041179(A1)	2011-02-01	Stahlberg	Applicant
US2011/0047594(A1)	2011-02-01	Mahaffey et al.	Applicant
US2011/0047620(A1)	2011-02-01	Mahaffey et al.	Applicant
US2011/0055907(A1)	2011-03-01	Narasimhan et al.	Applicant
US2011/0078794(A1)	2011-03-01	Manni et al.	Applicant
US2011/0093951(A1)	2011-04-01	Aziz	Applicant
US2011/0099620(A1)	2011-04-01	Stavrou et al.	Applicant
US2011/0099633(A1)	2011-04-01	Aziz	Applicant
US2011/0113231(A1)	2011-05-01	Kaminsky	Applicant
US2011/0145918(A1)	2011-06-01	Jung et al.	Applicant
US2011/0145920(A1)	2011-06-01	Mahaffey et al.	Applicant
US2011/0145934(A1)	2011-06-01	Abramovici et al.	Applicant
US2011/0167493(A1)	2011-07-01	Song et al.	Applicant
US2011/0167494(A1)	2011-07-01	Bowen et al.	Applicant
US2011/0173460(A1)	2011-07-01	Ito et al.	Applicant
US2011/0219449(A1)	2011-09-01	St. Neitzel et al.	Applicant
US2011/0219450(A1)	2011-09-01	McDougal et al.	Applicant
US2011/0225624(A1)	2011-09-01	Sawhney et al.	Applicant
US2011/0225655(A1)	2011-09-01	Niemela et al.	Applicant
US2011/0247072(A1)	2011-10-01	Staniford et al.	Applicant
US2011/0265182(A1)	2011-10-01	Peinado et al.	Applicant
US2011/0289582(A1)	2011-11-01	Kejriwal et al.	Applicant
US2011/0302587(A1)	2011-12-01	Nishikawa et al.	Applicant
US2011/0307954(A1)	2011-12-01	Melnik et al.	Applicant
US2011/0307955(A1)	2011-12-01	Kaplan et al.	Applicant
US2011/0307956(A1)	2011-12-01	Yermakov et al.	Applicant
US2011/0314546(A1)	2011-12-01	Aziz et al.	Examiner
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/0158626(A1)	2012-06-01	Zhu et al.	Examiner
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/0317642(A1)	2012-12-01	Royal et al.	Examiner
US2012/0330801(A1)	2012-12-01	McDougal et al.	Applicant
US2013/0014259(A1)	2013-01-01	Gribble et al.	Applicant
US2013/0031600(A1)	2013-01-01	Luna et al.	Examiner
US2013/0036472(A1)	2013-02-01	Aziz	Applicant
US2013/0047257(A1)	2013-02-01	Aziz	Applicant
US2013/0074185(A1)	2013-03-01	McDougal et al.	Applicant
US2013/0086684(A1)	2013-04-01	Mohler	Applicant
US2013/0097699(A1)	2013-04-01	Balupari et al.	Applicant
US2013/0097706(A1)	2013-04-01	Titonis et al.	Applicant
US2013/0111587(A1)	2013-05-01	Goel et al.	Applicant
US2013/0117852(A1)	2013-05-01	Stute	Applicant
US2013/0117855(A1)	2013-05-01	Kim et al.	Applicant
US2013/0139264(A1)	2013-05-01	Brinkley et al.	Applicant
US2013/0160125(A1)	2013-06-01	Likhachev et al.	Applicant
US2013/0160127(A1)	2013-06-01	Jeong et al.	Applicant
US2013/0160130(A1)	2013-06-01	Mendelev et al.	Applicant
US2013/0160131(A1)	2013-06-01	Madou et al.	Applicant
US2013/0167236(A1)	2013-06-01	Sick	Applicant
US2013/0174214(A1)	2013-07-01	Duncan	Applicant
US2013/0185789(A1)	2013-07-01	Hagiwara et al.	Applicant
US2013/0185795(A1)	2013-07-01	Winn et al.	Applicant
US2013/0185798(A1)	2013-07-01	Saunders et al.	Applicant
US2013/0191915(A1)	2013-07-01	Antonakakis et al.	Applicant
US2013/0196649(A1)	2013-08-01	Paddon et al.	Applicant
US2013/0227691(A1)	2013-08-01	Aziz et al.	Applicant
US2013/0246370(A1)	2013-09-01	Bartram et al.	Applicant
US2013/0263260(A1)	2013-10-01	Mahaffey et al.	Applicant
US2013/0291109(A1)	2013-10-01	Staniford et al.	Applicant
US2013/0298243(A1)	2013-11-01	Kumar et al.	Applicant
US2014/0053260(A1)	2014-02-01	Gupta et al.	Applicant
US2014/0053261(A1)	2014-02-01	Gupta et al.	Applicant
US2014/0130158(A1)	2014-05-01	Wang et al.	Applicant
US2014/0137180(A1)	2014-05-01	Lukacs et al.	Applicant
US2014/0169762(A1)	2014-06-01	Ryu	Applicant
US2014/0179360(A1)	2014-06-01	Jackson et al.	Applicant
US2014/0328204(A1)	2014-11-01	Klotsche et al.	Applicant
US2014/0337836(A1)	2014-11-01	Ismael	Applicant
US2014/0351935(A1)	2014-11-01	Shao et al.	Applicant
US2015/0096025(A1)	2015-04-01	Ismael	Applicant
GB2439806	2008-01-01		Applicant
GB2490431(A)	2012-10-01		Applicant
WO-02/06928	2002-01-01		Applicant
WO-02/23805	2002-03-01		Applicant
WO-2007-117636	2007-10-01		Applicant
WO-2008/041950	2008-04-01		Applicant
WO-2011/084431	2011-07-01		Applicant
WO2011/112348(A1)	2011-09-01		Applicant
WO2012/075336(A1)	2012-06-01		Applicant
WO-2012145066	2012-10-01		Applicant

Non-Patent Literature (55)

Thuraisingham, Bhavani; “Data Mining for Malicious Code Detection and Security Applications”; Web Intelligence and Intelligent Agent Technologies, 2009. WI-IAT '09. IEEE/WIC/ACM International Joint Conferences on Year: 2009, vol. 1 pp. 6-7.Examiner
Ke-Wei Su; et al; “Suspicious URL Filtering Based on Logistic Regression with Multi-viewAnalysis”; Information Security (Asia JCIS), 2013 Eighth Asia Joint Conference on Year: 2013 pp. 77-84.Examiner
IEEE Xplore Digital Library Sear Results for “detection of unknown computer worms”. Http//ieeexplore.ieee.org/searchresult.jsp?SortField=Score&SortOrder=desc&ResultC . . . , (Accessed on Aug. 28, 2009).Applicant
AltaVista Advanced Search Results. “Event Orchestrator”. Http://www.altavista.com/web/results!Itag=ody&pg=aq&aqmode=aqa=Event+Orchesrator . . . , (Accessed on Sep. 3, 2009).Applicant
AltaVista Advanced Search Results. “attack vector identifier”. Http://www.altavista.com/web/results?Itag=ody&pg=aq&aqmode=aqa=Event+Orchestrator . . . , (Accessed on Sep. 15, 2009).Applicant
Cisco, Configuring the Catalyst Switched Port Analyzer(SPAN) (“Cisco”), (1992-2003), 2002.Applicant
Reiner Sailer, Enriquillo Valdez, Trent Jaeger, Roonald Perez, Leendert van Doorn, John Linwood Griffin, Stefan Berger., sHype: Secure Hypervisor Appraoch to Trusted Virtualized Systems(Feb. 2, 2005) (“Sailer”).Applicant
Excerpt regarding First Printing Date for Merike Kaeo, Designing Network Security(“Kaeo”), (2005).Applicant
The Sniffers's Guide to Raw Traffic available at: yuba.stanford.edu/˜casado/pcap/section1.html, (Jan. 6, 2014).Applicant
“Packet”, Microsoft Computer Dictionary, Microsoft Press, (Mar. 2002), 1 page.Applicant
“When Virtual is Better Than Real”, IEEEXplore Digital Library, available at, http://ieeexplore.ieee.org/xpl/articleDetails.jsp?reload=true&arnumber=990073, (Dec. 7, 2013).Applicant
Abdullah, et al., Visualizing Network Data for Intrusion Detection, 2005 IEEE Workshop on Information Assurance and Security, pp. 100-108.Applicant
Adetoye, Adedayo , et al., “Network Intrusion Detection & Response System”, (“Adetoye”), (Sep. 2003).Applicant
Aura, Tuomas, “Scanning electronic documents for personally identifiable information”, Proceedings of the 5th ACM workshop on Privacy in electronic society. ACM, 2006.Applicant
Baecher, “The Nepenthes Platform: An Efficient Approach to collect Malware”, Springer-verlag Berlin Heidelberg, (2006), pp. 165-184.Applicant
Bayer, et al., “Dynamic Analysis of Malicious Code”, J Comput Virol, Springer-Verlag, France., (2006), pp. 67-77.Applicant
Boubalos, Chris , “extracting syslog data out of raw pcap dumps, seclists.org, Honeypots mailing list archives”, available at http://seclists.org/honeypots/2003/q2/319 (“Boubalos”), (Jun. 5, 2003).Applicant
Chaudet, C. , et al., “Optimal Positioning of Active and Passive Monitoring Devices”, International Conference on Emerging Networking Experiments and Technologies, Proceedings of the 2005 ACM Conference on Emerging Network Experiment and Technology, CoNEXT '05, Toulousse, France, (Oct. 2005), pp. 71-82.Applicant
Cohen, M.I. , “PyFlag—An advanced network forensic framework”, Digital investigation 5, Elsevier, (2008), pp. S112-S120.Applicant
Costa, M. , et al., “Vigilante: End-to-End Containment of Internet Worms”, SOSP '05, Association for Computing Machinery, Inc., Brighton U.K., (Oct. 23-26, 2005).Applicant
Crandall, J.R. , et al., “Minos:Control Data Attack Prevention Orthogonal to Memory Model”, 37th International Symposium on Microarchitecture, Portland, Oregon, (Dec. 2004).Applicant
Deutsch, P. , “Zlib compressed data format specification version 3.3” RFC 1950, (1996).Applicant
Distler, “Malware Analysis: An Introduction”, SANS Institute, InfoSec Reading Room, SANS Institute, (2007).Applicant
Dunlap, George W. , et al., “ReVirt: Enabling Intrusion Analysis through Virtual-Machine Logging and Replay”, Proceeding of the 5th Symposium on Operating Systems Design and Implementation, USENIX Association, (“Dunlap”), (Dec. 9, 2002).Applicant
Filiol, Eric , et al., “Combinatorial Optimisation of Worm Propagation on an Unknown Network”, International Journal of Computer Science 2.2 (2007).Applicant
Goel, et al., Reconstructing System State for Intrusion Analysis, Apr. 2008 SIGOPS Operating Systems Review, vol. 42 Issue 3, pp. 21-28.Applicant
Hjelmvik, Erik , “Passive Network Security Analysis with NetworkMiner”, (In)Secure, Issue 18, (Oct. 2008), pp. 1-100.Applicant
Kaeo, Merike , “Designing Network Security”, (“Kaeo”), (Nov. 2003).Applicant
Kim, H. , et al., “Autograph: Toward Automated, Distributed Worm Signature Detection”, Proceedings of the 13th Usenix Security Symposium (Security 2004), San Diego, (Aug. 2004), pp. 271-286.Applicant
King, Samuel T., et al., “Operating System Support for Virtual Machines”, (“King”), 2003.Applicant
Krasnyansky, Max , et al., Universal TUN/TAP driver, available at https://www.kernel.org/doc/Documentation/networking/tuntap.txt (2002) (“Krasnyanasky”).Applicant
Kreibich, C. , et al., “Honeycomb-Creating Intrusion Detection Signatures Using Honeypots”, 2nd Workshop on Hot Topics in Networks(HotNets-11), Boston, USA, (2003).Applicant
Kristoff, J. , “Botnets, Detection and Mitigation: DNS-Based Techniques”, NU Security Day, (2005), 23 pages.Applicant
Liljenstam, Michael , et al., “Simulating Realistic Network Traffic for Worm Warning System Design and Testing”, Institute for Security Technology studies, Dartmouth College, (“Liljenstam”), (Oct. 27, 2003).Applicant
Marchette, David J., “Computer Intrusion Detection and Network Monitoring: A Statistical Viewpoint”, (“Marchette”), (2001).Applicant
Margolis, P.E. , “Random House Webster's ‘Computer & Internet Dictionary 3rd Edition’”, ISBN 0375703519, (Dec. 1998).Applicant
Moore, D. , et al., “Internet Quarantine: Requirements for Containing Self-Propagating Code”, INFOCOM, vol. 3, (Mar. 30-Apr. 3, 2003), pp. 1901-1910.Applicant
Morales, Jose A., et al., “Analyzing and exploiting network behaviors of malware.”, Security and Privacy in Communication Networks. Springer Berlin Heidelberg, 2010. 20-34.Applicant
Natvig, Kurt , “SandboxII: Internet”, Virus Bulletin Conference, (“Natvig”), (Sep. 2002).Applicant
NetBIOS Working Group. Protocol Standard for a NetBIOS Service on a TCP/UDP transport: Concepts and Methods. STD 19, RFC 1001, Mar. 1987.Applicant
Newsome, J. , et al., “Dynamic Taint Analysis for Automatic Detection, Analysis, and Signature Generation of Exploits on Commodity Software”, In Proceedings of the 12th Annual Network and Distributed System Security, Symposium (NDSS '05), (Feb. 2005).Applicant
Newsome, J. , et al., “Polygraph: Automatically Generating Signatures for Polymorphic Worms”, In Proceedings of the IEEE Symposium on Security and Privacy, (May 2005).Applicant
Nojiri, D. , et al., “Cooperation Response Strategies for Large Scale Attack Mitigation”, DARPA Information Survivability Conference and Exposition, vol. 1, (Apr. 22-24, 2003), pp. 293-302.Applicant
Peter M. Chen, and Brian D. Noble , “When Virtual is Better than Real, Department of Electrical Engineering and Computer Science”, University of Michigan (“Chen”), May 2001.Applicant
Silicon Defense, “Worm Containment in the Internal Network”, (Mar. 2003), pp. 1-25.Applicant
Singh, S. , et al., “Automated Worm Fingerprinting”, Proceedings of the ACM/USENIX Symposium on Operating System Design and Implementation, San Francisco, California, (Dec. 2004).Applicant
Spitzner, Lance , “Honeypots: Tracking Hackers”, (“Spizner”), (Sep. 17, 2002).Applicant
Thomas H. Ptacek, and Timothy N. Newsham “Insertion, Evasion, and Denial of Service: Eluding Network Intrusion Detection”, Secure Networks, (“Ptacek”), (Jan. 1998).Applicant
Venezia, Paul , “NetDetector Captures Intrusions”, InfoWorld Issue 27, (“Venezia”), (Jul. 14, 2003).Applicant
Whyte, et al., “DNS-Based Detection of Scanning Works in an Enterprise Network”, Proceedings of the 12th Annual Network and Distributed System Security Symposium, (Feb. 2005), 15 pages.Applicant
Williamson, Matthew “Throttling Viruses: Restricting Propagation to Defeat Malicious Mobile Code”, ACSAC Conference, Las Vegas, NV, USA, (Dec. 2002), pp. 1-9.Applicant
“Network Security: NetDetector—Network Intrusion Forensic System (NIFS) Whitepaper”, (“NetDetector Whitepaper”), (2003).Applicant
“When Virtual is Better Than Real”, IEEEXplore Digital Library, available at, http://ieeexplore.ieee.org/xpl/articleDetails.jsp?reload=true&arnumbe- r=990073, (Dec. 7, 2013).Applicant
Cisco “Intrusion Prevention for the Cisco ASA 5500-x Series” Data Sheet (2012).Applicant
PCT/US2014/043724 filed Jun. 23, 2014 International Search Report and Written Opinion dated Oct. 31, 2014.Applicant

Abstract