System and method for supporting cross-platform data verification

Information

  • Patent Grant
  • 11392700
  • Patent Number
    11,392,700
  • Date Filed
    Friday, June 28, 2019
    5 years ago
  • Date Issued
    Tuesday, July 19, 2022
    2 years ago
Abstract
A trust verification system for automatically verify an integrity of an object across multiple operating system (OS) platforms. The trust verification system features package verification logic, catalog verification logic, and component verification logic. The package verification logic recovers, from an incoming package, (i) an object, (ii) a catalog including identifiers associated with software component(s) forming the object and representation(s) associated with each of the software component(s), and (iii) a representation of the catalog. The catalog verification logic is configured to verify an integrity of the catalog while the component verification logic is configured to verify an integrity of software component(s) associated with the object. Thereafter, the package verification logic verifies an integrity of the object associated with the incoming package in response to the catalog verification logic verifying the integrity of the catalog and the component verification logic verifying the integrity of the software component(s).
Description
FIELD

Embodiments of the disclosure relate to data integrity verification. More particularly, embodiments of the disclosure relate to a system and method directed toward verifying the integrity of data across multiple platforms.


GENERAL BACKGROUND

Over the last decade, network devices that access the Internet or other publicly accessible networks have been increasingly targeted for malicious attack. These malicious attacks may involve tampering with or substitution of information prior to installation onto an endpoint device associated with a targeted victim. This information may be an executable (e.g., instructions operating as software code in the form of a plug-in, an application, a program, a script, etc.) which, when downloaded and upon execution, perpetuates a cybersecurity attack (hereinafter, “cyberattack”). In these situations, the victim may be unaware that the executable has been tampered with during or after download, but prior to installation and launching within the network device.


Various processes and devices have been employed by network devices to combat cyberattacks and other security threats. As an illustrative example, daemon software operating in the background of an endpoint device, referred to as a “cybersecurity agent,” has been installed on a network device to conduct certain operations to detect cyberattacks. These operations may include, but are not limited or restricted to, conducting a signature-based analysis on newly received information, such as a plug-in for subsequent storage or installation on the endpoint device for example, for comparison with signatures associated with previously uncovered malicious plug-ins associated with a cyberattack. The operations are designed to detect and/or prevent attempted cyberattacks against the endpoint device.


Currently, cybersecurity agents may be configured to launch subordinate processes (e.g., plug-ins) to further the capabilities of these cybersecurity agents. As an example, plug-ins may be created to augment the functionality of a cybersecurity agent through an additional set of new features (capabilities). Given that plug-ins (e.g., extensions or other code adding further functionality of another software component) have been determined to be part of a cybersecurity threat vector, it is critical to ensure that the integrity of the plug-ins is preserved (i.e., the plug-ins are “legitimate”).


In the past, many cybersecurity vendors ensured the legitimacy of their software by building monolithic executables, such as monolithic cybersecurity agents for example, and conducting a hash operation on each of the cybersecurity agents to generate a corresponding hash value for users to verify agent authenticity. However, given an evolving threat landscape, continuous updating and reverification of a cybersecurity agent is needed, thereby imposing significant delays in providing needed updates to combat an ever-changing threat landscape.


With modular plug-in architectures, a mechanism to determine the legitimacy of a plug-in (e.g., confirming the integrity of the plug-in has been retained during installation), has been challenging to implement across many different operating system (OS) platforms. Often the applications and their plug-ins will be updated on different schedules. Also, each type of OS platform may rely on its own specific (and distinct) mechanism to confirm the integrity of plug-ins before installation, thereby failing to take advantage of efficiencies that would be realized with a trust verification system that supports multiple platforms (i.e., cross-platform).





BRIEF DESCRIPTION OF THE DRAWINGS

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



FIG. 1 is an exemplary block diagram of a communication system including a network device deploying a cross-platform trust verification system to analyze the integrity of software before installation and/or launch.



FIG. 2 is an exemplary block diagram of a logical representation of the network device of FIG. 1 employing the trust verification system.



FIG. 3A is an exemplary block diagram of the interoperability of a trust verification system deployed within a host application to verify integrity of one or more plug-ins prior to OS registration.



FIG. 3B is an exemplary block diagram of the interoperability of a trust verification system deployed separate from host application to verify integrity of one or more plug-ins prior to OS registration.



FIG. 4 is an exemplary block diagram of a logical representation of the trust verification system of FIGS. 1-3B.



FIG. 5 is a logical representation of an operational flow conducted by the trust verification system of FIG. 4 to verify the integrity of an object encapsulated as part of a package.



FIG. 6 is a more detailed logical representation of an operational flow conducted by the trust verification system of FIG. 4 to verify the integrity of a plug-in encapsulated as part of the package.





DETAILED DESCRIPTION

To verify the integrity of software installed within a network device, such as plug-ins to be launched by an application or cybersecurity agent for example, a trust verification system has been implemented to verify the integrity of such software. The verification of the integrity of software components forming an object (e.g., plug-in) may be conducted on and across multiple operating system (OS) platforms. This cross-platform software architecture reduces the scale of software development required in analyze the integrity of one or more software components operability as or as part of a cybersecurity agent. Stated differently, changes in operability of the cybersecurity agent does not have to be conducted for each version of the cybersecurity agent that is coded to support a particular OS platform (i.e., software development is more efficient).


Herein, the trust verification system is configured to conduct a “dual-stage” verification on information (e.g., software such as plug-ins) submitted for verification in order to confirm that the integrity of such software has been preserved. According to one embodiment of the disclosure, the trust verification system includes verification logic, which may include package verification logic, catalog verification logic and/or component verification logic. The verification logic may operate as a component of a host application (e.g., cybersecurity agent) or some or all of the verification logic may operate separately from the host application. While operations of the trust verification system are discussed in connection with a specific deployment, namely a deployment including a cybersecurity agent and its plug-in architecture for example, the inventive aspects are not limited to this specific deployment.


As described below in greater detail, the trust verification system receives a message, including a “package,” to be verified and stored (for later use). Herein, according to one embodiment of the disclosure, a “package” includes (i) software whose integrity is to be verified (e.g., new or updated plug-in, etc.), (ii) a catalog that generally corresponds to information to verify the integrity of components forming the software (e.g., a collection of software components (or identifiers each associated with a particular software component) that form at least a portion of the software and/or a corresponding representation for that particular software component), and (iii) a representation of the catalog (e.g., a value resulting from conversion of content forming the catalog such as a hash value of the catalog, a checksum, a concatenated value, etc.). For instance, where the software is a new or updated plug-in for example, the “catalog” may include an identifier for each plug-in component forming a specific portion of the new (or updated) plug-in along with its corresponding representation (e.g., hash value for each corresponding plug-in component). According to one embodiment, each plug-in component identifier is associated with a new or updated plug in and the representation for the plug-in (e.g., hash value, checksum, concatenation, etc.). According to another embodiment of the disclosure, the catalog may simply include an identifier of the plug-in along with its representation (e.g., hash value) for the plug-in.


More specifically, according to one embodiment of the disclosure, the package verification logic is configured to receive and parse an incoming package in order to separate the plug-in under analysis, the catalog and a hash value of the catalog (representation). During runtime, if a plug-in is to be initialized and launched by the cybersecurity agent, the catalog verification logic accesses and analyzes the catalog by at least conducting a hash operation on the catalog to produce a hash value (hereinafter, “generated catalog hash value”) and authenticating the catalog using the hash value of the catalog provided in the package (hereinafter, “packaged catalog hash value”). Based on a successful comparison between the generated catalog hash value and the packaged catalog hash value, the integrity of the catalog has been confirmed. Otherwise, the catalog verification, and hence the verification of the plug-in itself, has failed.


Thereafter, the integrity of the plug-in (or even separate plug-in software components of the plug-in) may be similarly verified. In particular, for each software component of the plug-in, the component verification logic analyzes that plug-in component by at least conducting a hash operation on the plug-in component to produce a corresponding hash value (hereinafter, “generated component hash value”) and authenticating the plug-in component using the hash value of the plug-in component included as part of the catalog (hereinafter, “cataloged component hash value”). Based on a successful comparison between the generated component hash value and the cataloged component hash value, the integrity of the plug-in component may be confirmed. This is an iterative process in which the integrity of the entire plug-in (all plug-in components) or a portion of the plug-in (certain specific plug-in components in which other components are trusted) is verified.


In the event that the integrity of all of the software plug-in components have been verified, the plug-in may be initialized and/or launched. This dual-stage verification process is platform-agnostic to ensure that the same hash value can be used across all operating system (OS) platforms of interest.


Herein, according to one embodiment of the disclosure, the trust verification system operates on a network device that is responsible for executing the cybersecurity agent (i.e., host application) and cybersecurity plug-ins, where the network device may be an endpoint device. By so operating, the trust verification system may enable rapid development of trusted plug-ins for a plurality of environments.


I. Terminology

In the following description, certain terminology is used to describe various features of the invention. For example, the terms “logic” and “component” are representative of hardware, firmware or software that is configured to perform one or more functions. As hardware, logic (or component) may include circuitry having data processing or storage functionality. Examples of such circuitry may include, but are not limited or restricted to a hardware processor (e.g., microprocessor with one or more processor cores, a digital signal processor, a programmable gate array, a microcontroller, an application specific integrated circuit “ASIC”, etc.), a semiconductor memory, or combinatorial elements.


Logic (or component) may be software such as compiled, executable code or may include one or more subroutines, scripts, applets, servlets or routines, source code, object code, shared library/dynamic link library (dll), or even one or more instructions. This software may be stored in any type of a suitable non-transitory storage medium, or transitory storage medium (e.g., electrical, optical, acoustical or other form of propagated signals such as carrier waves, infrared signals, or digital signals). Examples of non-transitory storage medium may include, but are not limited or restricted to a programmable circuit; non-persistent storage such as volatile memory (e.g., any type of random access memory “RAM”); or persistent storage such as non-volatile memory (e.g., read-only memory “ROM”, power-backed RAM, flash memory, phase-change memory, etc.), a solid-state drive, hard disk drive, an optical disc drive, or a portable memory device. As firmware, the logic (or component) may be stored in persistent storage.


The term “network device” should be generally construed as physical logic (electronics) or virtualized logic with data processing capability and/or a capability of connecting to any type of network, such as a public network (e.g., Internet), a private network (e.g., any type of local area network), a public cloud network (e.g., Amazon Web Service (AWS®), Microsoft Azure®, Google Cloud®, etc.), or a private cloud network. Examples of a network device may include, but are not limited or restricted to, any of the following: a server; a mainframe; a firewall; a data transfer device (e.g., intermediary communication device, router, repeater, portable mobile hotspot, etc.); an endpoint device (e.g., a laptop, a smartphone, a tablet, a desktop computer, a netbook, gaming console, etc.); or a virtual device being software that supports data capture, preliminary analysis of meta-information associated with cybersecurity intelligence.


The term “message” generally refers to signaling (wired or wireless) as either information placed in a prescribed format and transmitted in accordance with a suitable delivery protocol or information made accessible through a logical data structure such as an API. Examples of the delivery protocol include, but are not limited or restricted to HTTP (Hypertext Transfer Protocol); HTTPS (HTTP Secure); Simple Mail Transfer Protocol (SMTP); File Transfer Protocol (FTP); iMESSAGE; Instant Message Access Protocol (IMAP); or the like. Hence, each message may be in the form of one or more packets, frames, or any other series of bits having the prescribed, structured format.


The term “interconnect” may be construed as a physical or logical communication path between two or more network devices or between different logic (or components). For instance, a physical communication path may include wired or wireless transmission mediums. Examples of wired transmission mediums and wireless transmission mediums may include electrical wiring, optical fiber, cable, bus trace, a radio unit that supports radio frequency (RF) signaling, or any other wired/wireless signal transfer mechanism. A logical communication path may include an inter-process communication (IPC) mechanism that allows for the exchange of content between different logic.


The term “computerized” generally represents that any corresponding operations are conducted by hardware in combination with software or firmware.


The term “plug-in” may be broadly construed as software that adds a specific capability or capabilities to another computer program, which is intended to include add-ins, add-ons, or extensions as well. In other words, the operation of particular software can be altered or customized by establishing communicative couplings between the particular software and one or more plug-ins. Various types of plug-ins, for example, are available for use in popular web browsers to add features such as search-engines, virus scanners, or the ability to open a previously unsupported file type.


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


II. General System Architecture

Referring to FIG. 1, an exemplary block diagram of a communication system 100 including a first network device 110 and a second network device 120 is shown. Herein, the first network device 110 includes a cross-platform trust verification system 130, which is configured to analyze the integrity of an object 140 before installation and/or launch. As shown, the trust verification system 130 may be deployed as logic within the first network device 110, such as logic implemented as part of a host application 150 running as an application in the foreground or background (e.g., daemon application). Alternatively, it is contemplated that the trust verification system 130 may be deployed separate from the host application 150.


As shown in FIG. 1, the trust verification system 130 receives the object 140, which may be software to extend the functionality or usability of the host application 150. As an illustrative example, the object 140 may correspond a new or updated plug-in, namely software that extends the functionality or usability of the host application 150. For instance, the plug-in may be software configured to interact with the host application. Alternatively, the plug-in may be software configured to function on the host application 150 (i.e., similar to an “add-on”) in lieu of interacting with the host application 150.


Herein, the object 140 may be encapsulated into and as part of a package 160. The package 160 may include (i) the object 140 whose integrity is to be verified (e.g., plug-in 140), (ii) a catalog 170, and (iii) a representation 180 of the catalog 170. The representation 180 may include information having a prescribed length (e.g., bitwise, bytewise, etc.) resulting from conversion of content within the catalog 170. Examples of the representation may include a hash value (e.g., 2x-bit hash value, where x≥7), although other type of representations may be used (e.g., checksum, concatenation of content within the catalog 170, etc.). Where the object 140 is a new or updated plug-in for example, the catalog 170 includes at least one or more plug-in component identifiers and their associated representations (e.g., hash values for the plug-in components), as described below.


Referring now to FIG. 2, an exemplary block diagram of a logical representation of the first network device 110 (e.g., endpoint device) is shown. Herein, the first network device 110 comprises one or more hardware processors (referred to as “processor”) 200, a memory 210, one or more network interfaces (referred to as “network interface”) 220, all of which are connected by one or more interconnects 230. The interconnects 230 may include one or more physical communication paths, such as wired or wireless transmission mediums (e.g., electrical wiring, optical fibers, cables, bus traces, a radio unit that supports radio frequency (RF) signaling) for example, and/or one or more logical communication paths may include an inter-process communication (IPC) mechanism that allows for the exchange of content between different logic. According to one embodiment, the processor 200, memory 210 and network interface 220 may be at least partially encased in a housing 235, which is made entirely or partially of a rigid material (e.g., hardened plastic, metal, glass, composite, or any combination thereof) that protects these components from environmental conditions.


The processor 200 is a multi-purpose, programmable component that accepts digital data as input, processes the input data according to stored instructions, and provides results as output. One example of a processor may include an Intel® x86 central processing unit (CPU) with an instruction set architecture. Alternatively, the processor 200 may include another type of CPU, a digital signal processor (DSP), an Application Specific Integrated Circuit (ASIC), a field-programmable gate array (FPGA), or the like. The applications 240 and operating system (OS) 250 within the memory 210 operate as resources that may perform and/or control operability of the first network device 110.


The memory 210 operates as system memory, provided by non-persistent storage or persistent storage. From a logical perspective, the memory 210 includes a plurality of locations that are addressable by at least the processor 200 for storing logic, including the host application (e.g., cybersecurity agent) 150 that features the trust verification system 130. The memory 210 further includes one or more plug-ins 1401-140N (N≥1) and a plug-in framework 260 that registers the plug-ins 1401-140N with the operating system 250 and/or controls the loading of packages 160, which may be inclusive of plug-in 1401-140N along with their corresponding catalogs in 1701-170N and catalog representations 1801-180N (e.g., pre-stored catalog hash values). The general operability of the trust verification system 130 is described below in FIGS. 3A-3B.


Referring to FIG. 3A, an exemplary block diagram of the interoperability of the trust verification system 130 deployed within the host application 150 to verify integrity of one or more plug-ins 1401-140N prior to OS registration is shown. Herein, after receipt of a plug-in 1401 to alter and/or enhance functionality of the host application (e.g., cybersecurity agent) 150, a plug-in manager 300 of the plug-in framework 260 is configured to verify the integrity of the plug-in 1401 prior to registering the plug-in 1401 with the operating system. More specifically, the plug-in manager 300 initiate a request to the trust verification system 130 to verify the integrity of the plug-in 1401, namely that the content of the plug-in 1401 has not been unknowingly modified. Also, the plug-in manager 300 may be configured to information (e.g., meta information, etc.) that identifies the software components that constitute the plug-in 1401 without reliance on the catalog 1701 in defining the logical components forming the plug-in 1401.


The verification of the integrity of the plug-in 1401 involves a dual-stage authentication scheme in which a loader 310 of the plug-in manager 300 provides one or more requests, which may include plug-in 1401 to the trust verification system 130 along with the catalog 1701 and the catalog representation 1801 corresponding to the plug-in 1401. Herein, according to one embodiment of the disclosure, the catalog 1701 includes one or more identifiers 320 of software components forming the plug-in 1401 along with representations 330 (e.g., hash values) for these software components associated with identifiers 320. Each identifier 320 may correspond to any data that may be used to identify and distinguish the software component from other software components, such as a series (two or more) alphanumeric characters (e.g., numbers, symbols and/or alphabetical characters, etc.).


The first stage of the authentication scheme involves confirming that the integrity of the catalog 1701 has been preserved using the catalog representation 1801. If the integrity of the catalog 1701 cannot be confirmed, the plug-in 1401 cannot be verified, which may result in the plug-in manager 300 precluding registration of the plug-in 1401 with the operating system (not shown) of the network device. The plug-in manager 300 may further issue a warning 340 of the failed plug-in verification (e.g., generate a message to an administrator, generate a displayable message on a display associated with the network device, etc.).


However, if the catalog 1701 is verified, the trust verification system 130 conducts the second stage of authentication, which involves confirming that the integrity of each of the software components 320 has been preserved using the representations 330. As before, if the integrity of each of the software components 320 cannot be confirmed, then the plug-in 1401 cannot be verified. As a result, the plug-in manager 300 may preclude registration of the plug-in 1401 with the operating system (not shown) and issue the warning 340 of the failed plug-in verification, as described above. If each of the software components 320 is verified, the plug-in manager 300 may register the plug-in 1401 with the operating system (not shown) to allow the plug-in 1401 to launch and enhance/alter operability or usability of the cybersecurity agent 150.


Referring now to FIG. 3B, an exemplary block diagram of the interoperability of the trust verification system 130 deployed separate from the host application 150 to verify the integrity of one or more plug-ins 1401-140N prior to registration is shown. Herein, a secure communication interconnect 350 is established between the operating system 250 and the host application 150 (e.g., cybersecurity agent). After receipt of a plug-in 140N to alter and/or enhance functionality of the host application (e.g., cybersecurity agent) 150 for example, a loader 360 is configured to issue a request 365 to the trust verification system 130 to verify the integrity of the plug-in 140N prior to OS registration. The request 365 includes information for the trust verification system 130 to verify the integrity of the plug-in 140N, such as the content of the plug-in 140N has not been unknowingly modified.


The verification of the integrity of the plug-in 140N involves the dual-stage authentication scheme as described above, where the loader 360 provides the plug-in 140N to the trust verification system 130 within the OS 250 along with the catalog 170N and the catalog representation 180N (e.g., catalog hash value) corresponding to the plug-in 140N. Herein, according to one embodiment of the disclosure, the catalog 170N includes one or more identifiers 370 of software components forming the plug-in 140N along with representations 380 (e.g., hash values) for these software components 370.


For this embodiment, the first stage of the authentication scheme involves confirming that the integrity of the catalog 170N has been preserved, which involves a comparison between the catalog representation 180N and a generated representation (e.g., hash value) of the catalog 170N itself. If the integrity of the catalog 170N cannot be confirmed, the plug-in 140N cannot be verified, which may result in prohibiting registration of the plug-in 140N with the OS 250. The OS 250 may further issue a warning 390 of the failed plug-in verification (e.g., generate a message to an administrator via a network interface, generate a displayable message on a display associated with the network device, etc.).


However, if the plug-in 140N is verified, the trust verification system 130 within the OS 250 conducts the second stage of authentication, which involves confirming that the integrity of one or more of the software components 370 being part of the plug-in 140N using the representations 380. The loader 360 may be configured to select which of the software components 370 to be confirmed based on whether the plug-in 140N is newly added (e.g., all software components) or is an update (e.g., all, only modified software components to reduce processing workload, etc.).


As before, responsive to the integrity of each of the software components 370 cannot be confirmed, the trust verification system 130 returns signaling of the failed plug-in verification to certain logic within the OS 250 or other software logic, which precludes registration of the plug-in 140N with the OS 250 and may cause issuance of the warning 390. If each of the software components 370 is verified, the plug-in 140N is registered with the OS 250 and the plug-in 140N is processed and operates in cooperation with the cybersecurity agent 150.


III. Architecture of the Trust Verification System

As shown in FIG. 4, an exemplary block diagram of a logical representation of the trust verification system 130 of FIGS. 1-3B is shown. Herein, the trust verification system 130 includes verification logic 400, namely package verification logic 420, catalog verification logic 440, and component verification logic 460. In particular, in response to receipt of the package 160 from a requestor (source) 480, the package verification logic 420 parses the package 160 to separate elements of the package 160, namely (i) the object 1401 whose integrity is requested to be verified (e.g., new or updated plug-in, etc.), (ii) the catalog 1701 including identifiers associated with one or more of the software components forming the object 1401 and (iii) the representation 1801 of the catalog 1701 (e.g., a value resulting from conversion of content within the catalog 1701 such as a hash value of the catalog 1701). Where the object 1401 is a new or updated plug-in for example, the catalog 1701 includes at least one or more plug-in identifiers and their associated plug-in representations (e.g., plug-in hash values).


During runtime, prior to the plug-in 1401 being initialized and launched by the cybersecurity agent, the catalog verification logic 440 analyzes the catalog 1701 by conducting a hash operation on the catalog 1701 to produce a hash value (hereinafter, “generated catalog hash value”), which is compared to the corresponding hash value of the catalog 1701 (hereinafter, “packaged catalog hash value 1801”). Based on a comparison between the generated catalog hash value and the packaged catalog hash value 1801, the integrity of the catalog 1701 has been confirmed. Thereafter, at least the plug-in 1401 and the category 1701 is provided to the component verification logic 460.


Within the component verification logic 460, the integrity of each plug-in component forming the plug-in 1401 is verified. In particular, for each plug-in component, the component verification logic 460 conducts a series of analytics on that plug-in component to confirm its integrity. According to one embodiment, the analytic involves at least conducting a hash operation on the plug-in component to produce a corresponding hash value (hereinafter, “generated component hash value”) and authenticating the plug-in component based on a comparison between the generated component hash value and the hash value of the plug-in component included as part of the catalog 1701 (hereinafter, “cataloged component hash value”). Based on a successful comparison between the generated component hash value and the cataloged component hash value, the integrity of the plug-in component may be confirmed. This series of analytics is repeated for each plug-in component to confirm the integrity of the entire plug-in (all plug-in components) or for selected plug-in components in the case where specific plug-in components forming the plug-in have been verified.


Referring now to FIG. 5, a logical representation of an operational flow conducted by the trust verification system 130 of FIG. 4 to verify the integrity of the object 1401 encapsulated as part of the package 160 is shown. Herein, the requestor 480 issues a verify package message 500 to the trust verification system 130 to verify the integrity of the package 160 (operation 505). The package verification logic 420 receives the package 160, parses the catalog and its representation from the package 160, and provides the catalog and its representation to the catalog verification logic 440 (operation 510). Thereafter, the catalog verification logic 440 commences a first stage of the object authentication process.


In the first stage of the object authentication process, as shown in operations 515-520, the catalog verification logic 440 verifies the catalog to generate a representation (e.g., hash value) therefrom. Thereafter, the catalog verification logic 440 authenticates the catalog by loading/generating a representation of the catalog (e.g., generated catalog hash value) and conducting a comparison between the generated catalog hash value to the catalog representation included as part of the package (packaged catalog hash value). Upon the catalog verification logic 440 determining a lack of comparison between the generated catalog hash value and the packaged catalog hash value, a catalog verification failed message is provided to the package verification logic (operation 525). Thereafter, the package verification logic notifies the requestor 480 that the verification of the object within the package has failed (operation 530). However, upon the catalog verification logic 440 determining a successful comparison between the generated catalog hash value and the packaged catalog has value, a catalog verification succeeded message is provided to the package verification logic 420 (operation 535).


In response to receipt of the catalog verification succeeded message, the package verification logic 420 commences the second stage of the authentication process. In particular the second stage of the authentication process involves a series of analytics to confirm that the integrity of each of the software components collectively forming the object 1401 has been preserved. One technique for confirming the integrity of the software components include generating a hash value associated with one or more software components at least partially forming the plug-in and comparing each of the generated component hash values with packaged component hash values maintained within the catalog (operation 545). If the integrity of each of the software components cannot be confirmed by the component verification logic 460, then the object cannot be verified. As a result, the package verification logic 420 sends an object verification failed message to the requestor 480 to identify that the integrity of the object is suspect (operations 550 and 555). However, if the integrity of each of the software components has been confirmed by the component verification logic 460, the package verification logic 420 sends an object verification succeeded message to the requestor 480 to identify that the integrity of the object has been preserved (operations 550 and 560). As a result, the object may be installed and/or launched.


Referring to FIG. 6, a more detailed logical representation of an operational flow conducted by the trust verification system 130 of FIG. 4 to verify the integrity of the plug-in 1401 encapsulated as part of the package 160. Herein, the requestor 480 issues a verify plug-in message 600 to the trust verification system 130 to verify the integrity of the plug-in 1401 (operation 605). The package verification logic 420 receives the package 160, parses the catalog and its representation from the package 160, and provides the catalog and its representation to the catalog verification logic 440 (operation 610). Thereafter, the catalog verification logic 440 commences a first stage of the plug-in authentication process.


In the first stage of the plug-in authentication process, as shown in operations 615-620, the catalog verification logic 440 verifies the catalog to generate a representation (e.g., hash value) therefrom. Thereafter, the catalog verification logic 440 authenticates the signed catalog through signature verification scheme by recovery of the packaged catalog hash value from the signed catalog and comparing the generated catalog hash value to the packaged catalog hash value. Upon the catalog verification logic 440 determining a lack of comparison between the generated catalog hash value and the packaged catalog hash value, a catalog verification failed message is provided to the package verification logic (operation 625). Thereafter, the package verification logic 420 notifies the requestor 480 that the verification of the plug-in within the package has failed (operation 630). However, upon the catalog verification logic 440 determining a successful comparison between the generated catalog hash value and the packaged catalog has value, a catalog verification succeeded message is provided to the package verification logic 420 (operation 635).


In response to receipt of the catalog verification succeeded message, the package verification logic 420 commences the second stage of the authentication process. In particular the second stage of the authentication process involves a series of analytics to confirm that the integrity of each of the software components collectively forming the plug-in has been preserved. One technique for confirming the integrity of the software components include generating a hash value associated with one or more (R≥1) software components at least partially forming the plug-in and comparing each of the generated component hash values with the packaged component hash values maintained within the catalog (operations 640, 650). This comparison may be conducted in parallel or in serial. If the integrity of each of the software components cannot be confirmed by the component verification logic 460, then the plug-in cannot be verified. As a result, the package verification logic 420 sends a plug-in verification failed message to the requestor 480 to identify that the integrity of the plug-in is suspect (operations 645, 655, 660). However, if the integrity of each of the software components has been confirmed by the component verification logic 460, the package verification logic 420 sends a plug-in verification succeeded message to the requestor 480 to identify that the integrity of the plug-in has been preserved (operations 645, 655, 665). As a result, the plug-in may be installed and/or launched.


Herein, in the foregoing description, the invention is described with reference to specific exemplary embodiments thereof. It will, however, be evident that various modifications and changes may be made thereto without departing from the broader spirit and scope of the invention as set forth in the appended claims. For instance, as an alternative embodiment, where verification is to be conducted on an updated object, it is contemplated that the verification may be conducted by determining a difference between the prior object and the updated object (e.g., different content between different versions of a plug-in or a script) and the catalog may include content for use in verifying the differences in content between the prior object and the updated object.

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