This specification relates in general to the field of network security, and more particularly, to a system and method for redirected firewall discovery in a network environment.
The field of network security has become increasingly important in today's society. The Internet has enabled interconnection of different computer networks all over the world. However, the Internet has also presented many opportunities for malicious operators to exploit these networks. Certain types of malicious software (e.g., bots) can be configured to receive commands from a remote operator once the software has infected a host computer. The software can be instructed to perform any number of malicious actions, such as sending out spam or malicious emails from the host computer, stealing sensitive information from a business or individual associated with the host computer, propagating to other host computers, and/or assisting with distributed denial of service attacks. In addition, the malicious operator can sell or otherwise give access to other malicious operators, thereby escalating the exploitation of the host computers. Thus, the ability to effectively protect and maintain stable computers and systems continues to present significant challenges for component manufacturers, system designers, and network operators.
To provide a more complete understanding of the present disclosure and features and advantages thereof, reference is made to the following description, taken in conjunction with the accompanying figures, wherein like reference numerals represent like parts, in which:
A method is provided in one example embodiment that includes receiving metadata from a host over a metadata channel. The metadata may be correlated with a network flow and a network policy may be applied to the flow.
In other embodiments, a network flow may be received from a host without metadata associated with the flow, and a discovery redirect may be sent to the host. Metadata may then be received and correlated with the flow to identify a network policy action to apply to the flow.
Turning to
Each of the elements of
For purposes of illustrating the techniques for providing network security in example embodiments, it is important to understand the activities occurring within a given network. The following foundational information may be viewed as a basis from which the present disclosure may be properly explained. Such information is offered earnestly for purposes of explanation only and, accordingly, should not be construed in any way to limit the broad scope of the present disclosure and its potential applications.
Typical network environments used in organizations and by individuals include the ability to communicate electronically with other networks using the Internet, for example, to access web pages hosted on servers connected to the Internet, to send or receive electronic mail (i.e., email) messages, or to exchange files. However, malicious users continue to develop new tactics for using the Internet to spread malware and to gain access to confidential information. Malware generally includes any software designed to access and/or control a computer without the informed consent of the computer owner, and is most commonly used as a label for any hostile, intrusive, or annoying software such as a computer virus, bot, spyware, adware, etc. Once compromised, malware may subvert a host and use it for malicious activity, such as spamming or information theft. Malware also typically includes one or more propagation vectors that enable it to spread within an organization's network or across other networks to other organizations or individuals. Common propagation vectors include exploiting known vulnerabilities on hosts within the local network and sending emails having a malicious program attached or providing malicious links within the emails.
One way in which malware may operate is to deceive a user by using a different network protocol exchange than the user expects. The malware may be packaged so as to convince the user to allow access to run it in some innocuous way, thus allowing it access to the network, which often may require passing through a firewall or other security measure. The malware may then exploit the access to engage in alternative or additional activities not contemplated by the user. For example, a game may send email messages or a word processor may open a web connection. At the same time, the malware may also use standard protocols to deceive the firewall into permitting the malware to establish remote connections.
Botnets, for example, use malware and are an increasing threat to computer security. In many cases they employ sophisticated attack schemes that include a combination of well-known and new vulnerabilities. Botnets generally use a client-server architecture where a type of malicious software (i.e., a bot) is placed on a host computer and communicates with a command and control (C&C) server, which may be controlled by a malicious user (e.g., a botnet operator). Usually, a botnet is composed of a large number of bots that are controlled by the operator using a C&C protocol through various channels, including Internet Relay Chat (IRC) and peer-to-peer (P2P) communication. The bot may receive commands from the C&C server to perform particular malicious activities and, accordingly, may execute such commands. The bot may also send any results or pilfered information back to the C&C server.
A bot is often designed to initiate communication with the C&C server and to masquerade as normal web browser traffic. For example, a bot may use a port typically used to communicate with a web server. Such bots, therefore, may not be detected by existing technologies without performing more detailed packet inspection of the web traffic. Moreover, once a bot is discovered, the botnet operator may simply find another way to masquerade network traffic by the bot to continue to present as normal web traffic. More recently, botnet operators have crafted bots to use encryption protocols such as, for example, secure socket layer (SSL), thereby encrypting malicious network traffic. Such encrypted traffic may use a Hypertext Transfer Protocol Secure (HTTPS) port so that only the endpoints involved in the encrypted session can decrypt the data. Thus, existing firewalls and other network intrusion prevention technologies may be unable to perform any meaningful inspection of the web traffic, and bots may continue to infect host computers within networks.
Other software security technology focused on preventing unauthorized program files from executing on a host computer may have undesirable side effects for end users or employees of a business or other organizational entity. Network or Information Technology (IT) administrators may be charged with crafting extensive policies relevant to all facets of the business entity to enable employees to obtain software and other electronic data from desirable and trusted network resources. Without extensive policies in place, employees may be prevented from downloading software and other electronic data from network resources that are not specifically authorized, even if such software and other data facilitate legitimate and necessary business activities. Such systems may be so restrictive that if unauthorized software is found on a host computer, any host computer activities may be suspended pending network administrator intervention. Moreover, at the network level there may simply be too many applications to effectively track and incorporate into policies. Large whitelists or blacklists can be difficult to maintain and may degrade network performance, and some applications may not be susceptible to easy identification.
Information may be shared between a host and a firewall to collectively and mutually achieve better security, though. For example, a host may understand an application as an executable file that is running a process with specific authentication, while the firewall may understand the application as a protocol in a TCP connection, which may also be correlated to a particular user authentication. The host may share session descriptors and other metadata with the firewall, and the firewall may share network policy with the host as needed to correlate application activities with expected network behavior. Network policy may include elements of security policy as well as other network specific parameters, such as quality of service (QoS) and routing. A host may also be associated with a universally unique identifier (UUID), which can be used to correlate connections and activities originating behind network address translators.
A host may also notify the firewall of additional network connections to the host. If a host has both wireless and wired connections active simultaneously, for example, there may be a risk of data received on one connection being transmitted on the other, so it may be desirable to restrict access to sensitive data. A host may also notify the firewall if the connection is associated with a virtual machine, or if the host has mountable read/write media, such as a USB stick attached.
In some embodiments of network environment 10, a host may include multiple attachment points, causing it to have multiple IP addresses. In other embodiments, a host may use the IP version 6 (IPv6), perhaps including Privacy Extensions (RFC4941), causing it to have one or more registered and known IPv6 addresses and one or more hidden or private IPv6 addresses. In these embodiments, an interlocked firewall may readily use dynamic information sharing to discover the user-to-host mapping for all the addresses on a host.
This dynamic information sharing between an interlocked host and firewall in network environment 10 may provide several benefits over conventional architectures. For example, by coordinating firewall policy with a host, a firewall can manage routes differently, such as by allowing or denying traffic depending on which of multiple users on a host may be attempting to establish a connection. Moreover, only applications that may need to be granularly controlled need to be controlled by the firewall. Thus, the firewall may control arbitrary or evasive applications, provide higher effective throughput, and control mobile-user traffic. In addition, traffic that does not need to be completely allowed or denied can be rate-limited. Arbitrary or evasive applications can also be rate-limited with process information available on a firewall, and differentiated services can be provided for managed and unmanaged hosts.
Many hosts may only use a single firewall for all routes. An agent running on a host may maintain a firewall cache that can identify this firewall. In a more complex scenario, a host may use more than one firewall, in which case it is important that the host understand which firewall will process a given flow. The firewall cache can provide routes through more than one firewall by mapping a given network route to a particular firewall. Routes are generally managed or unmanaged. A “managed route” generally refers to a route through a firewall that may be configured to accept metadata for network flows, while an “unmanaged route” is a route through a firewall that may not accept metadata. A firewall cache may associate a network (e.g., identified by a network destination and network mask) with a firewall designated for managing flows to the network, for example, or may associate an unmanaged route to a null value. The firewall cache may be initialized or configured by an administrator, providing separate configurations for each named network and/or default configurations for the first time a network is used. Some configurations may define one firewall for Internet addresses, initially based on an assumption that all global IP addresses are on the Internet.
Session descriptors generally include information about a host and an application associated with a given network session. For example, a session descriptor may include a UUID associated with the host and the user credentials of a process owner. Since a user can run separate processes with different user credentials, such information may be particularly advantageous for Citrix and terminal services. A session descriptor may additionally include a filename, pathname or other unique identifier of an application file (e.g., C:\ . . . \WINWORD.EXE) that is running the process attempting to establish a network connection. For example, in some embodiments the application may be identified by a hash function of the application's executable file, so as to make it more difficult for a malicious user to spoof the application name. A firewall may correlate this information with an application identifier or protocol to ensure that the application is performing as expected. A session descriptor may also contain information about the host environment, such as software installed on the host and the current configuration and state of the software, permitting the firewall to act as a network access control device. For example, a session descriptor may indicate whether the local anti-virus system is up to date and running. If Host-based Data Loss Prevention (HDLP) software is available, a session descriptor may also include file-typing information for file transfer. HDLP normally determines the type of file being transmitted out of the network (e.g., PDF, Word, etc.). The firewall may have additional policies about certain file types being transmitted over particular protocols, which may not be visible directly to an HDLP program.
Session descriptors and other metadata may be exchanged over an out-of-band communication channel (a “metadata channel”) in some embodiments of network environment 10, which may be implemented with a protocol that provides authentication and/or encryption for communication privacy. In more particular embodiments, a Datagram Transport Layer Security (DTLS) protocol may be used to provide a metadata channel with communication privacy, and a host and a firewall may use certificates based on a common certificate authority. A policy server may distribute certificates to a host and firewall in some embodiments, while an external certificate authority may be used in other embodiments. Some protocols, including DTLS, may also be used to establish a back channel from a firewall to a host, which may be used for error messages and diagnostics, for example.
A host can send metadata to a firewall before opening a new network flow such that, in general, metadata arrives at the firewall before the first packet of a new flow. More particularly, a firewall agent on the host may intercept the first packet of a new flow and send a session descriptor and other metadata associated with the flow, such as source IP address and port, destination IP address and port, and protocol. The firewall may maintain a metadata cache and correlate a network flow with metadata if the firewall agent releases the flow. More particularly, the firewall may correlate metadata with network flow data, which broadly refers to information that associates a given network flow with a source node (i.e., a node sending or attempting to send a packet) and a destination node (i.e., a node to which a packet is addressed) or destination nodes (e.g., broadcast or multicast address). Flow data may also include other information about the flow, such as a protocol family or protocol, for example.
For example, TCP generally opens a new flow (generally referred to as a “connection” in the context of a TCP flow) with a handshake—a host sends a first packet with one of the TCP flag bits (i.e., the SYN bit) set to indicate that a three-way handshake is in progress. Thus, an agent on a source node may intercept a new TCP connection by detecting an application on the source node sending a SYN packet (i.e., a packet with the SYN bit set) and holding the SYN packet. The agent may be able to identify a firewall for managing the route to a destination node associated with the new connection, such as by locating the route and its associated firewall in a firewall cache, and send metadata to the firewall (which the firewall can cache) over a secure metadata channel. The connection request may then be released by sending the SYN packet to the firewall, and the firewall may correlate the source IP, destination IP, protocol, etc.
Flows are not limited to communications using a reliable protocol such as TCP; a flow may also include communications using an unreliable protocol such as UDP or IP. In other embodiments, an agent may track flows that use an unreliable protocol and intercept a new flow by holding the first packet of a flow while it transmits metadata. The agent may also be able to retransmit the metadata by caching a hash of the first packet of a flow and comparing the hash to the hash of subsequent packets to determine if the first packet is being retransmitted by an application. In yet other embodiments, a firewall may track flows and cache the first packet until metadata arrives. In still yet other embodiments, metadata may be sent with every packet in a flow using an unreliable protocol, or never sent. Caches of first packet data can be very short-lived (e.g. less than one second to five seconds).
However, a host may not always be able to identify or locate such a firewall. For example, a host may move from one network to another (e.g., a laptop moving from a home network to a corporate network), may have a misconfigured routing table, a stale table entry, or a missing table entry, which may cause the host to send metadata to the incorrect firewall (or send no metadata at all). If a host cannot determine the location of a firewall, an additional mechanism is needed.
In accordance with embodiments disclosed herein, network environment 10 may provide a system and method for redirection-based discovery of an interlocked firewall. A firewall can maintain a list of managed hosts, which may be identified within a given subnet range or identified explicitly by IP address or hostname, for example. In some embodiments, a policy server may provide the list to a firewall. The firewall may cache or drop the initial connection packet (e.g., a SYN packet) and send a firewall-host discovery redirect to any managed host that attempts to open a connection without sending appropriate metadata. In more particular embodiments, network environment 10 can decrease redirect traffic volume by not sending discovery redirects for local link or local broadcasts (e.g., netbios probes on port 137).
Managed hosts and firewalls may also maintain a shared secret (e.g., a password, key, etc.) for authentication of redirect packets. The shared secret may be distributed by a policy server or manually configured, for example, and a firewall may share the same secret with more than one host, including all hosts within a site. In certain embodiments, the shared secret may be a function of time. In yet other embodiments, managed hosts and firewalls may use asymmetric key cryptography (i.e., public key cryptography) to secure redirect packets.
In more particular embodiments, a discovery redirect may be implemented in an Internet Control Message Protocol (ICMP) packet, such as an ICMP Destination Unreachable (DU) packet for administratively prohibited communications (i.e., ICMP type 3, code 13). An ICMP DU packet may include the IP header and TCP (or UDP) headers of the original packet, and may further include a magic number and a hash-based message authentication code (HMAC). In such an embodiment, the magic number may be a 32-bit identifier (e.g., 0x46484131 or “FHA1”), which may also act as a protocol version number. In general, an HMAC is a message authentication code (MAC) involving a cryptographic hash function in combination with a shared secret (e.g., a secret key). A MAC (and an HMAC) may be used to simultaneously verify both the data integrity and the authenticity of a message. An HMAC may include, for example, the host-firewall shared secret, source IP address, destination IP address, IP identification, firewall IP address, and TCP initial sequence number.
In other embodiments, a firewall may have a public/private key pair that it can use to establish a metadata channel (e.g., a DTLS connection). The firewall's private key may be used to encrypt a hash of the discovery redirect packet (using RSA for example). The encrypted hash can be inserted into the discovery redirect, and a host can validate the discovery redirect by decrypting the hash using the firewall's public key. For example, an ICMP DU packet may be used as described above, but replacing the HMAC with the encrypted hash.
While a host may ignore most of these types of ICMP DU packets, the host can take appropriate action when it receives a discovery redirect packet with an HMAC or encrypted hash. For example, a host may calculate an HMAC using its shared key and authenticate the message by comparing the calculated HMAC to the HMAC received in the discovery redirect packet. If the message is authentic, a host may update its firewall cache to reflect the firewall information in the discovery redirect packet and send metadata to the firewall for the given connection.
Turning to
In one example implementation, user hosts 20a-20b, firewall 25, and/or policy server 30 are network elements, which are meant to encompass network appliances, servers, routers, switches, gateways, bridges, loadbalancers, processors, modules, or any other suitable device, component, element, or object operable to exchange information in a network environment. Network elements may include any suitable hardware, software, components, modules, or objects that facilitate the operations thereof, as well as suitable interfaces for receiving, transmitting, and/or otherwise communicating data or information in a network environment. This may be inclusive of appropriate algorithms and communication protocols that allow for the effective exchange of data or information. However, user hosts 20a-20b may be distinguished from other network elements, as they tend to serve as a terminal point for a network connection, in contrast to a gateway or router that tends to serve as an intermediate point in a network connection. User hosts 20a-20b may also be representative of wireless network nodes, such as an i-Phone, i-Pad, Android phone, or other similar telecommunications devices.
In regards to the internal structure associated with network environment 10, each of user hosts 20a-20b, firewall 25, and/or policy server 30 can include memory elements for storing information to be used in the operations outlined herein. Each of user hosts 20a-20b, firewall 25, and/or policy server 30 may keep information in any suitable memory element (e.g., random access memory (RAM), read-only memory (ROM), erasable programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), application specific integrated circuit (ASIC), etc.), software, hardware, or in any other suitable component, device, element, or object where appropriate and based on particular needs. Any of the memory items discussed herein (e.g., memory elements 55a-55b) should be construed as being encompassed within the broad term ‘memory element.’ The information being used, tracked, sent, or received by user hosts 20a-20b, firewall 25, and/or policy server 30 could be provided in any database, register, queue, table, cache, control list, or other storage structure, all of which can be referenced at any suitable timeframe. Any such storage options may be included within the broad term ‘memory element’ as used herein.
In certain example implementations, the functions outlined herein may be implemented by logic encoded in one or more tangible media (e.g., embedded logic provided in an ASIC, digital signal processor (DSP) instructions, software (potentially inclusive of object code and source code) to be executed by a processor, or other similar machine, etc.), which may be inclusive of non-transitory media. In some of these instances, memory elements (as shown in
In one example implementation, user hosts 20a-20b, firewall 25, and/or policy server 30 may include software modules (e.g., firewall agent 75 and/or host manager 80) to achieve, or to foster, operations as outlined herein. In other embodiments, such operations may be carried out by hardware, implemented externally to these elements, or included in some other network device to achieve the intended functionality. Alternatively, these elements may include software (or reciprocating software) that can coordinate in order to achieve the operations, as outlined herein. In still other embodiments, one or all of these devices may include any suitable algorithms, hardware, software, components, modules, interfaces, or objects that facilitate the operations thereof.
Additionally, each of user hosts 20a-20b, firewall 25, and/or policy server 30 may include a processor that can execute software or an algorithm to perform activities as discussed herein. A processor can execute any type of instructions associated with the data to achieve the operations detailed herein. In one example, the processors (as shown in
An application such as application 60 may attempt to open a new TCP connection at 305, with a server such as server 45, for example. Firewall agent 75 may intercept and hold the new connection, consulting firewall cache 77 (which may be initialized from configuration) at 310 to identify a firewall associated with the route to server 45. In the particular example of
An application such as application 60 may attempt to open a new flow at 405, with a server such as server 45, for example. Firewall agent 75 may intercept and hold the new flow, and consult firewall cache 77 (which may be initialized from configuration) at 410 to identify a firewall associated with the route to server 45. In the particular example of
Policy module 85 may log the event (i.e., releasing a new flow without metadata) and notify host manager 80 at 455a. Host manager 80 may send a discovery redirect to firewall agent 75 at 455b, which may include an HMAC based on a shared secret. Firewall agent 75 can receive the discovery redirect, and may also authenticate the discovery redirect based on the HMAC, for example, and update firewall cache 77 accordingly at 460. Firewall agent 75 may also open a connection (e.g., a DTLS connection) to host manager 80 and send metadata at 465. Host manager 80 may store in the metadata in metadata cache 95 at 470. The metadata can be audited along with the flow, which is already passing through the firewall associated with host manager 80.
An application such as application 60 may attempt to open a new TCP connection at 505, with a server such as server 45, for example. Firewall agent 75 may intercept and hold the new connection, and consult firewall cache 77 at 510 to identify a firewall associated with the route to server 45. In the particular example of
Policy module 85 may log the event (i.e., dropping the initial connection packet because no metadata was received) and notify host manager 80 at 540a. Host manager 80 may send a discovery redirect to firewall agent 75 at 540b. Firewall agent 75 can receive the discovery redirect, and may also authenticate the discovery redirect based on an HMAC, for example, and update firewall cache 77 accordingly at 545. In the general case, application 60 retransmits its connection request at 550 if the firewall drops the initial connection packet (without resetting the connection) and application 60 does not receive an acknowledgement (e.g., an ACK packet) from server 45. Firewall agent 75 may again intercept and hold the connection, and consult firewall cache 77 at 555 to identify a firewall associated with the route to server 45. Updated firewall cache 77 may then identify a firewall associated with host manager 80 (e.g., firewall 25). Firewall agent 75 may also open a connection (e.g., a DTLS connection) to host manager 80 at 560 and add the new connection to firewall cache 77 at 565 for future connections. Firewall 75 may send metadata at 570a, which host manager 80 may store in metadata cache 95 at 570b.
Firewall agent 75 may release the connection at 575a, allowing data from application 60 to flow to host manager 80. Host manager 80 may send connection data to policy module 85 at 575b, and policy module 85 may correlate the connection data with metadata from metadata cache 95 at 580 to apply appropriate network policy at 585. In the example of
In another embodiment, host manager 80 may cache the initial connection packet for a brief period, enabling a connection to proceed when metadata is received at 570b without waiting for application 60 to retransmit the initial connection packet, which can make traffic flow faster. In yet another embodiment, firewall agent 75 can cache the initial connection packet and retransmit it when it receives a discovery redirect.
In various other scenarios, a firewall agent may have no information on a firewall (not even configuration information). In some embodiments, the firewall agent may allow a new flow through to a firewall without sending metadata. If the firewall receives the new flow without metadata, the flow may be processed substantially similarly to receiving a flow from a firewall agent having a stale firewall cache entry, such as described above with reference to
A host agent may also send a PING message to a preconfigured address to force discovery for a particular path, such as by sending a PING message to a public Internet address to force discovery for the Internet path. A host agent may also send such a PING message on initial connection to a new network device.
As illustrated in various example embodiments above, a firewall cache may be updated in response to a discovery redirect, such as at 460 and 545. In more particular embodiments, a firewall agent may update its firewall cache by adding the subnet associated with the redirect message (e.g., a /24 entry for IPv4, /64 for IPv6). Alternatively, a firewall agent may search the firewall cache for the longest prefix matching the target address and add a new entry associating the firewall/port identified in the discovery redirect with the target address masked by eight bits (i.e., target/8=firewall:port) for IPv4 or by sixteen bits (i.e., target/16=firewall:port) for IPv6.
If a matching entry is found in the firewall cache, the firewall agent may compare the entry to the firewall/port identified in the discovery redirect. If the firewall/port from the discovery redirect does not match the firewall/port in the applicable firewall cache entry, the firewall cache may be updated by adding a new entry for the discovery target with a mask length incrementally modified (i.e., splitting the entry by incrementally increasing or decreasing the granularity of the entry for the discovery target) over the matching entry.
For example, the mask length of an entry may be increased by eight bits and the resulting network identifier associated with the discovery target. If the entry cannot be split further (i.e., the mask length is already 32 bits for an IPv4 address), the entry may be replaced such that the entry associates the discovery target with the firewall/port in the discovery redirect (i.e., replace the entry with target/32=redirect firewall:port).
In another example, a firewall cache entry may be split by adding a more specific entry (e.g., /24 for IPv4 or /64 for IPv6) and then generalized if overlapping discovery redirects are received. A firewall's routing knowledge may also be used to determine granularity or subnets associated with an exempt zone may be conveyed to a firewall agent in some embodiments.
Network environment 10 may also operate seamlessly with unmanaged routes. For example, a firewall agent may intercept a new connection from an application to a server and determine from a firewall cache that the route is unmanaged. The firewall agent may release the connection and the connection with the server may be established with no additional packet overhead.
Network environment 10 may provide significant advantages, some of which have already been discussed. For example, network environment 10 can provide security of host/firewall interlock data with low protocol overhead. Network environment 10 may be readily adapted to reuse standard code packages, leveraging configuration data, protocols such as DTLS, and timers in TCP and application layer protocols.
In the examples provided above, as well as numerous other potential examples, interaction may be described in terms of two, three, or four network elements. However, the number of network elements has been limited for purposes of clarity and example only. In certain cases, it may be easier to describe one or more of the functionalities of a given set of operations by only referencing a limited number of network elements. It should be appreciated that network environment 10 is readily scalable and can accommodate a large number of components, as well as more complicated/sophisticated arrangements and configurations. Accordingly, the examples provided should not limit the scope or inhibit the broad teachings of network environment 10 as potentially applied to a myriad of other architectures. Additionally, although described with reference to particular scenarios, where a particular module, such as policy module 85, is provided within a network element, these modules can be provided externally, or consolidated and/or combined in any suitable fashion. In certain instances, such modules may be provided in a single proprietary unit.
It is also important to note that the steps in the appended diagrams illustrate only some of the possible scenarios and patterns that may be executed by, or within, network environment 10. Some of these steps may be deleted or removed where appropriate, or these steps may be modified or changed considerably without departing from the scope of teachings provided herein. In addition, a number of these operations have been described as being executed concurrently with, or in parallel to, one or more additional operations. However, the timing of these operations may be altered considerably. The preceding operational flows have been offered for purposes of example and discussion. Substantial flexibility is provided by network environment 10 in that any suitable arrangements, chronologies, configurations, and timing mechanisms may be provided without departing from the teachings provided herein.
Numerous other changes, substitutions, variations, alterations, and modifications may be ascertained to one skilled in the art and it is intended that the present disclosure encompass all such changes, substitutions, variations, alterations, and modifications as falling within the scope of the appended claims. In order to assist the United States Patent and Trademark Office (USPTO) and, additionally, any readers of any patent issued on this application in interpreting the claims appended hereto, Applicant wishes to note that the Applicant: (a) does not intend any of the appended claims to invoke paragraph six (6) of 35 U.S.C. section 112 as it exists on the date of the filing hereof unless the words “means for” or “step for” are specifically used in the particular claims; and (b) does not intend, by any statement in the specification, to limit this disclosure in any way that is not otherwise reflected in the appended claims.
Number | Name | Date | Kind |
---|---|---|---|
4688169 | Joshi | Aug 1987 | A |
4982430 | Frezza et al. | Jan 1991 | A |
5155847 | Kirouac et al. | Oct 1992 | A |
5222134 | Waite et al. | Jun 1993 | A |
5390314 | Swanson | Feb 1995 | A |
5521849 | Adelson et al. | May 1996 | A |
5560008 | Johnson et al. | Sep 1996 | A |
5699513 | Feigen et al. | Dec 1997 | A |
5778226 | Adams et al. | Jul 1998 | A |
5778349 | Okonogi | Jul 1998 | A |
5787427 | Benantar et al. | Jul 1998 | A |
5842017 | Hookway et al. | Nov 1998 | A |
5907709 | Cantey et al. | May 1999 | A |
5907860 | Garibay et al. | May 1999 | A |
5926832 | Wing et al. | Jul 1999 | A |
5944839 | Isenberg | Aug 1999 | A |
5974149 | Leppek | Oct 1999 | A |
5987610 | Franczek et al. | Nov 1999 | A |
5987611 | Freund | Nov 1999 | A |
5991881 | Conklin et al. | Nov 1999 | A |
6064815 | Hohensee et al. | May 2000 | A |
6073142 | Geiger et al. | Jun 2000 | A |
6141698 | Krishnan et al. | Oct 2000 | A |
6192401 | Modiri et al. | Feb 2001 | B1 |
6192475 | Wallace | Feb 2001 | B1 |
6256773 | Bowman-Amuah | Jul 2001 | B1 |
6275938 | Bond et al. | Aug 2001 | B1 |
6321267 | Donaldson | Nov 2001 | B1 |
6338149 | Ciccone, Jr. et al. | Jan 2002 | B1 |
6356957 | Sanchez, II et al. | Mar 2002 | B2 |
6393465 | Leeds | May 2002 | B2 |
6442686 | McArdle et al. | Aug 2002 | B1 |
6449040 | Fujita | Sep 2002 | B1 |
6453468 | D'Souza | Sep 2002 | B1 |
6460050 | Pace et al. | Oct 2002 | B1 |
6496477 | Perkins et al. | Dec 2002 | B1 |
6587877 | Douglis et al. | Jul 2003 | B1 |
6611925 | Spear | Aug 2003 | B1 |
6658645 | Akuta et al. | Dec 2003 | B1 |
6662219 | Nishanov et al. | Dec 2003 | B1 |
6748534 | Gryaznov et al. | Jun 2004 | B1 |
6769008 | Kumar et al. | Jul 2004 | B1 |
6769115 | Oldman | Jul 2004 | B1 |
6795966 | Lim et al. | Sep 2004 | B1 |
6832227 | Seki et al. | Dec 2004 | B2 |
6834301 | Hanchett | Dec 2004 | B1 |
6847993 | Novaes et al. | Jan 2005 | B1 |
6907600 | Neiger et al. | Jun 2005 | B2 |
6918110 | Hundt et al. | Jul 2005 | B2 |
6930985 | Rathi et al. | Aug 2005 | B1 |
6934755 | Saulpaugh et al. | Aug 2005 | B1 |
6988101 | Ham et al. | Jan 2006 | B2 |
6988124 | Douceur et al. | Jan 2006 | B2 |
7007302 | Jagger et al. | Feb 2006 | B1 |
7010796 | Strom et al. | Mar 2006 | B1 |
7024548 | O'Toole, Jr. | Apr 2006 | B1 |
7039949 | Cartmell et al. | May 2006 | B2 |
7054930 | Cheriton | May 2006 | B1 |
7065767 | Kambhammettu et al. | Jun 2006 | B2 |
7069330 | McArdle et al. | Jun 2006 | B1 |
7082456 | Mani-Meitav et al. | Jul 2006 | B2 |
7093239 | van der Made | Aug 2006 | B1 |
7124409 | Davis et al. | Oct 2006 | B2 |
7139916 | Billingsley et al. | Nov 2006 | B2 |
7152148 | Williams et al. | Dec 2006 | B2 |
7159036 | Hinchliffe et al. | Jan 2007 | B2 |
7177267 | Oliver et al. | Feb 2007 | B2 |
7203864 | Goin et al. | Apr 2007 | B2 |
7251655 | Kaler et al. | Jul 2007 | B2 |
7290266 | Gladstone et al. | Oct 2007 | B2 |
7302558 | Campbell et al. | Nov 2007 | B2 |
7330849 | Gerasoulis et al. | Feb 2008 | B2 |
7340684 | Ramamoorthy et al. | Mar 2008 | B2 |
7346781 | Cowie et al. | Mar 2008 | B2 |
7349931 | Horne | Mar 2008 | B2 |
7350204 | Lambert et al. | Mar 2008 | B2 |
7353501 | Tang et al. | Apr 2008 | B2 |
7363022 | Whelan et al. | Apr 2008 | B2 |
7370360 | van der Made | May 2008 | B2 |
7385938 | Beckett et al. | Jun 2008 | B1 |
7406517 | Hunt et al. | Jul 2008 | B2 |
7441265 | Staamann et al. | Oct 2008 | B2 |
7464408 | Shah et al. | Dec 2008 | B1 |
7506155 | Stewart et al. | Mar 2009 | B1 |
7506170 | Finnegan | Mar 2009 | B2 |
7506364 | Vayman | Mar 2009 | B2 |
7546333 | Alon et al. | Jun 2009 | B2 |
7546594 | McGuire et al. | Jun 2009 | B2 |
7552479 | Conover et al. | Jun 2009 | B1 |
7577995 | Chebolu et al. | Aug 2009 | B2 |
7603552 | Sebes et al. | Oct 2009 | B1 |
7607170 | Chesla | Oct 2009 | B2 |
7657599 | Smith | Feb 2010 | B2 |
7669195 | Qumei | Feb 2010 | B1 |
7685635 | Vega et al. | Mar 2010 | B2 |
7698744 | Fanton et al. | Apr 2010 | B2 |
7703090 | Napier et al. | Apr 2010 | B2 |
7739497 | Fink et al. | Jun 2010 | B1 |
7757269 | Roy-Chowdhury et al. | Jul 2010 | B1 |
7765538 | Zweifel et al. | Jul 2010 | B2 |
7783735 | Sebes et al. | Aug 2010 | B1 |
7809704 | Surendran et al. | Oct 2010 | B2 |
7818377 | Whitney et al. | Oct 2010 | B2 |
7823148 | Deshpande et al. | Oct 2010 | B2 |
7836504 | Ray et al. | Nov 2010 | B2 |
7840968 | Sharma et al. | Nov 2010 | B1 |
7849507 | Bloch et al. | Dec 2010 | B1 |
7853643 | Martinez et al. | Dec 2010 | B1 |
7856661 | Sebes et al. | Dec 2010 | B1 |
7865931 | Stone et al. | Jan 2011 | B1 |
7870387 | Bhargava et al. | Jan 2011 | B1 |
7873955 | Sebes | Jan 2011 | B1 |
7895573 | Bhargava et al. | Feb 2011 | B1 |
7908653 | Brickell et al. | Mar 2011 | B2 |
7937455 | Saha et al. | May 2011 | B2 |
7950056 | Satish et al. | May 2011 | B1 |
7966659 | Wilkinson et al. | Jun 2011 | B1 |
7996836 | McCorkendale et al. | Aug 2011 | B1 |
8015388 | Rihan et al. | Sep 2011 | B1 |
8015563 | Araujo et al. | Sep 2011 | B2 |
8028340 | Sebes et al. | Sep 2011 | B2 |
8195931 | Sharma et al. | Jun 2012 | B1 |
8205188 | Ramamoorthy et al. | Jun 2012 | B2 |
8234713 | Roy-Chowdhury et al. | Jul 2012 | B2 |
8307437 | Sebes et al. | Nov 2012 | B2 |
8321932 | Bhargava et al. | Nov 2012 | B2 |
8332929 | Bhargava et al. | Dec 2012 | B1 |
8352930 | Sebes et al. | Jan 2013 | B1 |
8381284 | Dang et al. | Feb 2013 | B2 |
8515075 | Saraf et al. | Aug 2013 | B1 |
8539063 | Sharma et al. | Sep 2013 | B1 |
8544003 | Sawhney et al. | Sep 2013 | B1 |
8549003 | Bhargava et al. | Oct 2013 | B1 |
8549546 | Sharma et al. | Oct 2013 | B2 |
8555404 | Sebes et al. | Oct 2013 | B1 |
8561051 | Sebes et al. | Oct 2013 | B2 |
8561082 | Sharma et al. | Oct 2013 | B2 |
20020056076 | van der Made | May 2002 | A1 |
20020069367 | Tindal et al. | Jun 2002 | A1 |
20020083175 | Afek et al. | Jun 2002 | A1 |
20020099671 | Mastin Crosbie et al. | Jul 2002 | A1 |
20020114319 | Liu et al. | Aug 2002 | A1 |
20030014667 | Kolichtchak | Jan 2003 | A1 |
20030023736 | Abkemeier | Jan 2003 | A1 |
20030033510 | Dice | Feb 2003 | A1 |
20030065945 | Lingafelt et al. | Apr 2003 | A1 |
20030073894 | Chiang et al. | Apr 2003 | A1 |
20030074552 | Olkin et al. | Apr 2003 | A1 |
20030115222 | Oashi et al. | Jun 2003 | A1 |
20030120601 | Ouye et al. | Jun 2003 | A1 |
20030120811 | Hanson et al. | Jun 2003 | A1 |
20030120935 | Teal et al. | Jun 2003 | A1 |
20030145232 | Poletto et al. | Jul 2003 | A1 |
20030163718 | Johnson et al. | Aug 2003 | A1 |
20030167292 | Ross | Sep 2003 | A1 |
20030167399 | Audebert et al. | Sep 2003 | A1 |
20030200332 | Gupta et al. | Oct 2003 | A1 |
20030212902 | van der Made | Nov 2003 | A1 |
20030220944 | Schottland et al. | Nov 2003 | A1 |
20030221190 | Deshpande et al. | Nov 2003 | A1 |
20040003258 | Billingsley et al. | Jan 2004 | A1 |
20040015554 | Wilson | Jan 2004 | A1 |
20040051736 | Daniell | Mar 2004 | A1 |
20040054928 | Hall | Mar 2004 | A1 |
20040088398 | Barlow | May 2004 | A1 |
20040139206 | Claudatos et al. | Jul 2004 | A1 |
20040143749 | Tajalli et al. | Jul 2004 | A1 |
20040167906 | Smith et al. | Aug 2004 | A1 |
20040172551 | Fielding et al. | Sep 2004 | A1 |
20040230963 | Rothman et al. | Nov 2004 | A1 |
20040243678 | Smith | Dec 2004 | A1 |
20040255161 | Cavanaugh | Dec 2004 | A1 |
20040268149 | Aaron | Dec 2004 | A1 |
20050005006 | Chauffour et al. | Jan 2005 | A1 |
20050018651 | Yan et al. | Jan 2005 | A1 |
20050086047 | Uchimoto et al. | Apr 2005 | A1 |
20050091321 | Daniell et al. | Apr 2005 | A1 |
20050108516 | Balzer et al. | May 2005 | A1 |
20050108562 | Khazan et al. | May 2005 | A1 |
20050114672 | Duncan et al. | May 2005 | A1 |
20050132346 | Tsantilis | Jun 2005 | A1 |
20050198519 | Tamura et al. | Sep 2005 | A1 |
20050228990 | Kato et al. | Oct 2005 | A1 |
20050235360 | Pearson | Oct 2005 | A1 |
20050257207 | Blumfield et al. | Nov 2005 | A1 |
20050257265 | Cook et al. | Nov 2005 | A1 |
20050260996 | Groenendaal | Nov 2005 | A1 |
20050262558 | Usov | Nov 2005 | A1 |
20050273858 | Zadok et al. | Dec 2005 | A1 |
20050283823 | Okajo et al. | Dec 2005 | A1 |
20050289538 | Black-Ziegelbein et al. | Dec 2005 | A1 |
20060004875 | Baron et al. | Jan 2006 | A1 |
20060015501 | Sanamrad et al. | Jan 2006 | A1 |
20060037016 | Saha et al. | Feb 2006 | A1 |
20060072451 | Ross | Apr 2006 | A1 |
20060075478 | Hyndman et al. | Apr 2006 | A1 |
20060080656 | Cain et al. | Apr 2006 | A1 |
20060085785 | Garrett | Apr 2006 | A1 |
20060101277 | Meenan et al. | May 2006 | A1 |
20060133223 | Nakamura et al. | Jun 2006 | A1 |
20060136910 | Brickell et al. | Jun 2006 | A1 |
20060136911 | Robinson et al. | Jun 2006 | A1 |
20060143713 | Challener et al. | Jun 2006 | A1 |
20060195906 | Jin et al. | Aug 2006 | A1 |
20060200863 | Ray et al. | Sep 2006 | A1 |
20060230314 | Sanjar et al. | Oct 2006 | A1 |
20060236398 | Trakic et al. | Oct 2006 | A1 |
20060259734 | Sheu et al. | Nov 2006 | A1 |
20060277603 | Kelso et al. | Dec 2006 | A1 |
20070011746 | Malpani et al. | Jan 2007 | A1 |
20070028303 | Brennan | Feb 2007 | A1 |
20070033645 | Jones | Feb 2007 | A1 |
20070039049 | Kupferman et al. | Feb 2007 | A1 |
20070050579 | Hall et al. | Mar 2007 | A1 |
20070050764 | Traut | Mar 2007 | A1 |
20070074199 | Schoenberg | Mar 2007 | A1 |
20070083522 | Nord et al. | Apr 2007 | A1 |
20070101435 | Konanka et al. | May 2007 | A1 |
20070136579 | Levy et al. | Jun 2007 | A1 |
20070143851 | Nicodemus et al. | Jun 2007 | A1 |
20070157303 | Pankratov | Jul 2007 | A1 |
20070169079 | Keller et al. | Jul 2007 | A1 |
20070192329 | Croft et al. | Aug 2007 | A1 |
20070220061 | Tirosh et al. | Sep 2007 | A1 |
20070220507 | Back et al. | Sep 2007 | A1 |
20070253430 | Minami et al. | Nov 2007 | A1 |
20070256138 | Gadea et al. | Nov 2007 | A1 |
20070271561 | Winner et al. | Nov 2007 | A1 |
20070300215 | Bardsley | Dec 2007 | A1 |
20080005737 | Saha et al. | Jan 2008 | A1 |
20080005798 | Ross | Jan 2008 | A1 |
20080010304 | Vempala et al. | Jan 2008 | A1 |
20080022384 | Yee et al. | Jan 2008 | A1 |
20080034416 | Kumar et al. | Feb 2008 | A1 |
20080034418 | Venkatraman et al. | Feb 2008 | A1 |
20080052468 | Speirs et al. | Feb 2008 | A1 |
20080082977 | Araujo et al. | Apr 2008 | A1 |
20080120499 | Zimmer et al. | May 2008 | A1 |
20080141371 | Bradicich et al. | Jun 2008 | A1 |
20080163207 | Reumann et al. | Jul 2008 | A1 |
20080163210 | Bowman et al. | Jul 2008 | A1 |
20080165952 | Smith et al. | Jul 2008 | A1 |
20080184373 | Traut et al. | Jul 2008 | A1 |
20080235534 | Schunter et al. | Sep 2008 | A1 |
20080282080 | Hyndman et al. | Nov 2008 | A1 |
20080294703 | Craft et al. | Nov 2008 | A1 |
20080301770 | Kinder | Dec 2008 | A1 |
20090007100 | Field et al. | Jan 2009 | A1 |
20090038017 | Durham et al. | Feb 2009 | A1 |
20090043993 | Ford et al. | Feb 2009 | A1 |
20090055693 | Budko et al. | Feb 2009 | A1 |
20090063665 | Bagepalli et al. | Mar 2009 | A1 |
20090113110 | Chen et al. | Apr 2009 | A1 |
20090144300 | Chatley et al. | Jun 2009 | A1 |
20090150639 | Ohata | Jun 2009 | A1 |
20090249053 | Zimmer et al. | Oct 2009 | A1 |
20090249438 | Litvin et al. | Oct 2009 | A1 |
20090320140 | Sebes et al. | Dec 2009 | A1 |
20090328144 | Sherlock et al. | Dec 2009 | A1 |
20090328185 | van den Berg et al. | Dec 2009 | A1 |
20100049973 | Chen | Feb 2010 | A1 |
20100071035 | Budko et al. | Mar 2010 | A1 |
20100100970 | Chowdhury et al. | Apr 2010 | A1 |
20100114825 | Siddegowda | May 2010 | A1 |
20100138430 | Gotou | Jun 2010 | A1 |
20100188976 | Rahman et al. | Jul 2010 | A1 |
20100250895 | Adams et al. | Sep 2010 | A1 |
20100281133 | Brendel | Nov 2010 | A1 |
20100293225 | Sebes et al. | Nov 2010 | A1 |
20100332910 | Ali et al. | Dec 2010 | A1 |
20110029772 | Fanton et al. | Feb 2011 | A1 |
20110035423 | Kobayashi et al. | Feb 2011 | A1 |
20110047542 | Dang et al. | Feb 2011 | A1 |
20110047543 | Mohinder | Feb 2011 | A1 |
20110077948 | Sharma et al. | Mar 2011 | A1 |
20110078550 | Nabutovsky | Mar 2011 | A1 |
20110093842 | Sebes | Apr 2011 | A1 |
20110093950 | Bhargava et al. | Apr 2011 | A1 |
20110113467 | Agarwal et al. | May 2011 | A1 |
20110119760 | Sebes et al. | May 2011 | A1 |
20110138461 | Bhargava et al. | Jun 2011 | A1 |
20110302647 | Bhattacharya et al. | Dec 2011 | A1 |
20120030731 | Bhargava et al. | Feb 2012 | A1 |
20120030750 | Bhargava et al. | Feb 2012 | A1 |
20120216271 | Cooper et al. | Aug 2012 | A1 |
20120278853 | Chowdhury et al. | Nov 2012 | A1 |
20120290827 | Bhargava et al. | Nov 2012 | A1 |
20120290828 | Bhargava et al. | Nov 2012 | A1 |
20120297176 | Bhargava et al. | Nov 2012 | A1 |
20130024934 | Sebes et al. | Jan 2013 | A1 |
20130091318 | Bhattacharjee et al. | Apr 2013 | A1 |
20130097355 | Dang et al. | Apr 2013 | A1 |
20130097356 | Dang et al. | Apr 2013 | A1 |
20130097692 | Cooper et al. | Apr 2013 | A1 |
20130117823 | Dang et al. | May 2013 | A1 |
20130246044 | Sharma et al. | Sep 2013 | A1 |
20130246393 | Saraf et al. | Sep 2013 | A1 |
20130246423 | Bhargava et al. | Sep 2013 | A1 |
20130246685 | Bhargava et al. | Sep 2013 | A1 |
20130247016 | Sharma et al. | Sep 2013 | A1 |
20130247027 | Shah et al. | Sep 2013 | A1 |
20130247032 | Bhargava et al. | Sep 2013 | A1 |
20130247181 | Saraf et al. | Sep 2013 | A1 |
20130247192 | Krasser et al. | Sep 2013 | A1 |
20130247226 | Sebes et al. | Sep 2013 | A1 |
Number | Date | Country |
---|---|---|
1383295 | Dec 2002 | CN |
103283202 | Sep 2013 | CN |
1 482 394 | Dec 2004 | EP |
2 037 657 | Mar 2009 | EP |
2599026 | Jun 2013 | EP |
2599276 | Jun 2013 | EP |
2004524598 | Aug 2004 | JP |
WO 9844404 | Oct 1998 | WO |
WO 0184285 | Nov 2001 | WO |
WO 2006012197 | Feb 2006 | WO |
WO 2006124832 | Nov 2006 | WO |
WO 2008054997 | May 2008 | WO |
WO 2011059877 | May 2011 | WO |
WO 2012015485 | Feb 2012 | WO |
WO 2012015489 | Feb 2012 | WO |
2012116098 | Aug 2012 | WO |
2013058940 | Apr 2013 | WO |
2013058944 | Apr 2013 | WO |
Entry |
---|
Rescorla et al., RFC 4347—Datagram Transport Layer Security, Apr. 2006, retrieved from http://tools.ietf.org/html/rfc4347. |
Narten et al., RFC 4861—Neighbor Discovery for IP version 6 (IPv6), Sep. 2007, retrieved from http://tools.ietf.org/html/rfc4861. |
USPTO Dec. 24, 2012 Nonfinal Office Action from U.S. Appl. No. 13/032,851. |
International Search Report and Written Opinion, International Application No. PCT/US2012/057153, mailed Dec. 26, 2012, 8 pages. |
International Search Report and Written Opinion, International Application No. PCT/U52012/057312, mailed Jan. 31, 2013, 10 pages. |
International Search Report and Written Opinion, International Application No. PCT/US2012/026169, mailed Jun. 18, 2012, 11 pages. |
U.S. Appl. No. 13/437,900, filed Apr. 2, 2012, entitled “System and Method for Interlocking a Host and a Gateway,” Inventors: Geoffrey Howard Cooper, et al. |
Datagram Transport Layer Security Request for Comments 4347, E. Rescorla, et al., Stanford University, Apr. 2006, retrieved and printed on Oct. 17, 2011 from http://tools.ietf.org/pdf/rfc4347.pdf, 26 pages. |
Internet Control Message Protocol Request for Comments 792, J. Postel, ISI, Sep. 1981, retrieved and printed on Oct. 17, 2011 from http://tools.ietf.org/html/rfc792, 22 pages. |
Mathew J. Schwartz, “Palo Alto Introduces Security for Cloud, Mobile Users,” retrieved Feb. 9, 2011 from http://www.informationweek.com/news/security/perimeter/showArticle.jhtml?articleID-22, 4 pages. |
Requirements for IV Version 4 Routers Request for Comments 1812, F. Baker, Cisco Systems, Jun. 1995, retrieved and printed on Oct. 17, 2011 from http://tools.ietf.org/pdf/rfc1812.pdf, 176 pages. |
The Keyed-Hash Message Authentication Code (HMAC), FIPS PUB 198, Issued Mar. 6, 2002, Federal Information Processing Standards Publication, retrieved and printed on Oct. 17, 2011 from http://csrc.nist.gov/publications/fips/fips198/fips-198a.pdf, 20 pages. |
U.S. Appl. No. 13/032,851, filed Feb. 23, 2011, entitled “System and Method for Interlocking a Host and a Gateway,” Inventors: Geoffrey Howard Cooper, et al. |
U.S. Appl. No. 13/275,196, filed Oct. 17, 2011, entitled “System and Method for Host-Initiated Firewall Discovery in a Network Environment,” Inventors: Geoffrey Cooper, et al. |
USPTO Mar. 1, 2013 Nonfinal Office Action from U.S. Appl. No. 13/437,900. |
USPTO Mar. 1, 2013 Nonfinal Office Action from U.S. Appl. No. 13/275,196. |
USPTO Mar. 25, 2013 Response to Dec. 24, 2012 Nonfinal Office Action from U.S. Appl. No. 13/032,851. |
Office Action received for the U.S. Appl. No. 13/032,851, mailed on Jul. 16, 2013, 15 pages. |
Response to the Office Action dated Mar. 1, 2013, received for the U.S. Appl. No. 13/437,900. |
Response to the Office Action dated Mar. 1, 2013, received for the U.S. Appl. No. 13/275,196, 12 pages. |
International Preliminary Report on Patentability and Written Opinion issued Jan. 29, 2013 for International Application No. PCT/US2011/024869 (6 pages). |
Office Action received for U.S. Appl. No. 12/844,892, mailed on Jan. 17, 2013, 29 pages. |
Office Action received for U.S. Appl. No. 12/844,892, mailed on Sep. 6, 2012, 33 pages. |
Zhen Chen et al., “Application Level Network Access Control System Based on TNC Architecture for Enterprise Network,” in: Wireless communications Networking and Information Security (WCNIS), 2010 IEEE International Conference, Jun. 25-27, 2010 (5 pages). |
International Preliminary Report on Patentability, International Application No. PCT/US2012/026169, mailed Aug. 27, 2013, 8 pages |
USPTO Oct. 2, 2013 Final Office Action from U.S. Appl. No. 13/275,196. |
USPTO Oct. 4, 2013 Nonfinal Office Action from U.S. Appl. No. 12/844,892. |
USPTO Oct. 25, 2013 Nonfinal Office Action from U.S. Appl. No. 12/844,964. |
U.S. Appl. No. 14/045,208, filed Oct. 3, 2013, entitled “Execution Environment File Inventory,” Inventors: Rishi Bhargava, et al. |
PCT Application Serial No. PCT/US13/66690, filed Oct. 24, 2013, entitled “Agent Assisted Malicious Application Blocking in a Network Environment,” , 67 pages. |
Patent Examination Report No. 1, Australian Application No. 2011283160, mailed Oct. 30, 2013 . |
USPTO Sep. 27, 2013, Notice of Allowance from U.S. Appl. No. 13/437,900 . |
PCT Application Serial No. PCT/US13/71327, filed Nov. 21, 2013, entitled “Herd Based Scan Avoidance System in a Network Environment,” , 46 pages. |
“Xen Architecture Overview,” Xen, dated Feb. 13, 2008, Version 1.2, http://wiki.xensource.com/xenwiki/XenArchitecture?action=AttachFile&do=get&target=Xen+architecture—Q1+2008.pdf, printed Aug. 18, 2009 (9 pages). |
Eli M. Dow, et al., “The Xen Hypervisor,” Informit, dated Apr. 10, 2008, http://www.informit.com/articles/printerfriendly.aspx?p=1187966, printed Aug. 11, 2009 (13 pages). |
Desktop Management and Control, Website: http://www.vmware.com/solutions/desktop/, printed Oct. 12, 2009, 1 page. |
Secure Mobile Computing, Website: http://www.vmware.com/solutions/desktop/mobile.html, printed Oct. 12, 2009, 2 pages. |
Barrantes et al., “Randomized Instruction Set Emulation to Dispurt Binary Code Injection Attacks,” Oct. 27-31, 2003, ACM, pp. 281-289. |
Gaurav et al., “Countering Code-Injection Attacks with Instruction-Set Randomization,” Oct. 27-31, 2003, ACM, pp. 272-280. |
Check Point Software Technologies Ltd.: “ZoneAlarm Security Software User Guide Version 9”, Aug. 24, 2009, XP002634548, 259 pages, retrieved from Internet: URL:http://download.zonealarm.com/bin/media/pdf/zaclient91—user—manual.pdf. |
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority (1 page), International Search Report (4 pages), and Written Opinion (3 pages), mailed Mar. 2, 2011, International Application No. PCT/US2010/055520. |
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration (1 page), International Search Report (6 pages), and Written Opinion of the International Searching Authority (10 pages) for International Application No. PCT/US2011/020677 mailed Jul. 22, 2011. |
Notification of Transmittal of the International Search Report and Written Opinion of the International Searching Authority, or the Declaration (1 page), International Search Report (3 pages), and Written Opinion of the International Search Authority (6 pages) for International Application No. PCT/US2011/024869 mailed Jul. 14, 2011. |
Tal Garfinkel, et al., “Terra: A Virtual Machine-Based Platform for Trusted Computing,” XP-002340992, SOSP'03, Oct. 19-22, 2003, 14 pages. |
IA-32 Intel® Architecture Software Developer's Manual, vol. 3B; Jun. 2006; pp. 13, 15, 22 and 145-146. |
Notification of International Preliminary Report on Patentability and Written Opinion mailed May 24, 2012 for International Application No. PCT/US2010/055520, 5 pages. |
Sailer et al., sHype: Secure Hypervisor Approach to Trusted Virtualized Systems, IBM research Report, Feb. 2, 2005, 13 pages. |
Kurt Gutzmann, “Access Control and Session Management in the HTTP Environment,” Jan./Feb. 2001, pp. 26-35, IEEE Internet Computing. |
“Apache Hadoop Project,” http://hadoop.apache.org/, retrieved and printed Jan. 26, 2011, 3 pages. |
“Cbl, composite blocking list,” http://cbl.abuseat.org, retrieved and printed Jan. 26, 2011, 8 pages. |
A Tutorial on Clustering Algorithms, retrieved Sep. 10, 2010 from http://home.dei.polimi.it/matteucc/clustering/tutorial.html, 6 pages. |
A. Pitsillidis, K. Levchenko, C. Kreibich, C. Kanich, G.M. Voelker, V. Pason, N. Weaver, and S. Savage, “Botnet Judo: Fighting Spam with Itself,” in Proceedings of the 17th Annual Network and Distributed System Security Symposium (NDSS'10), Feb. 2010, 19 pages. |
A. Ramachandran, N. Feamster, and D. Dagon, “Revealing botnet membership using DNSBL counter-intelligence,” in Proceedings of the 2nd USENIX Steps to Reducing Unwanted Traffic on the Internet, 2006, 6 pages. |
A. Ramachandran, N. Feamster, and S. Vempala, “Filtering Spam with Behavioral Blacklisting,” in Proceedings of ACM Conference on Computer Communications Security, 2007, 10 pages. |
B. Stone-Gross, M. Cova, L. Cavallor, B. Gilbert, M. Szydlowski, R. Kemmerer, C. Kruegel, and G. Vigna, “Your Botnet is My Botnet: Analysis of a Botnet Takeover,” in Proceedings of the 16th Acm Conference on Computer and Communicatinos Security, 2009, 13 pages. |
C. Kanich, C. Kreibich, K. Levchenko, B. Enright, G.M. Voelker, V. Paxson, and S. Savage, “Spamalytics: An Empirical Analysis of Spam Marketing Conversion,” in Proceedings of the 15th ACM conference on Computer and Communications Security, 2008, 12 pages. |
C.J. Burges, “A Tutorial on Support Vector Machines for Pattern Recognition,” in Journal of Data Mining and Knowledge Discovery, 1998, 43 pages. |
E-Mail Spamming Botnets: Signatures and Characteristics, Posted Sep. 22, 2008, http://www.protofilter.com/blog/email-spam-botnets-signatures.html, retrieved and printed Feb. 2, 2011, 4 pages. |
G. Gu, J. Zhang, and W. Lee, “BotSniffer: Detecting Botnet Command and Control Channels in Network Traffic,” in Proceedings of the 15th Annual Network and Distributed System Security Symposium (NDSS'08), Feb. 2008, 24 pages. |
G. Gu, P. Porras, V. Yegneswaran, M. Fong, and W. Lee, “BotHunter: Detecting Malware Infection Through IDS-Driven Dialog Correlation,” in Proceedings of the 16th USNIX Security Symposium, 2007, 34 pages. |
G. Gu, R. Perdisci, J. Zhang, and W. Lee, “BotMiner: Clustering Analysis of Network Traffic for Protocol and Structure-Independent Botnet Detection,” in Proceedings of the 17th USENIX Security Symposium, 2008, 15 pages. |
I. Jolliffe, “Principal Component Analysis,” in Springer Series in Statistics, Statistical Theory and Methods, 2nd ed.), 2002, 518 pages. |
J. Dean and S. Ghemawat, “MapReduce: Simplified Data Processing on Large Clusters,” in Proceedings of Sixth Symposium on Operating System Design and Implementation, OSDI, 2004, 13 pages. |
J. Goebel and T. Holz, “Rishi: Identify Bot Contaminated Hosts by IRC Nickname Evaluation,” in Proceedings of the USENIX HotBots, 2007, 12 pages. |
J.B. Grizzard, V. Sharma, C. Nunnery, B.B. Kang, and D. Dagon, “Peer-to-Peer Botnets: Overview and Case Study,” in Proceedings of the 1st Workshop on Hot Topics in Understanding Botnets, Apr. 2007, 14 pages. |
J.P. John, A. Moshchuk, S.D. Gribble, and A. Krishnamurthy, “Studying Spamming Botnets Using Botlab,” in Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation, 2009, 16 pages. |
K. Li, Z. Zhong, and L. Ramaswamy, “Privacy-Aware Collaborative Spam Filtering,” in Journal of IEEE Transactions on Parallel and Distributed Systems, vol. 29, No. 5, May 2009, pp. 725-739. |
L. Zhuang, J. Dunagan, D.R. Simon, H.J. Wang, and J.D. Tygar, “Characterizing botnets from email spam records,” in Proceedings of the 1st Usenix Workshop on Large-Scale Exploits and Emergent Threats), 2008, 18 pages. |
M. Frigo and S.G. Johnson, “The Design and Implementation of FFTW3,” in Proceedings of the IEEE 93(2), Invited paper, Special Issue on Program Generation, Optimization, and Platform Adaptation, 2005, 16 pages. |
R. Perdisci, I. Corona, D. Dagon, and W. Lee, “Detecting Malicious Flux Service Networks through Passive Analysis of Recursive DNS Traces,” in Proceedings of the 25th Annual Computer Security Applications Conference (ACSAC 2009), Dec. 2009, 10 pages. |
X. Jiang, D. Xu, and Y.-M. Wang, “Collapsar: A VM-Based Honeyfarm and Reverse Honeyfarm Architecture for Network Attack Capture and Detention,” in Journal of Parallel and Distributed Computing, Special Issue on Security in Grid and Distributed Systems, 2006, 16 pages. |
Y. Tang, S. Krasser, P. Judge, and Y.-Q. Zhang, “Fast and Effective Spam Sender Detection with Granular SVM on Highly Imbalanced Mail Server Behavior Data,” in Proceedings of 2nd International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborativeCom), Nov. 2006, 6 pages. |
Y. Zhao, Y. Xie, F. Yu, Q. Ke, Y. Yu, Y. Chen, and E. Gillum, “BotGraph: Large Scale Spamming Botnet Detection,” in Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation, 2009, 26 pages. |
Yinglian Xie, Fang Yu, Kannan Achan, Rina Panigraphy, Geoff Hulten, and Ivan Osipkov, “Spamming Botnets: Signatures and Characteristics,” SIGCOMM '08, Aug. 17, 22, 2008, http://ccr.sigcomm.org/online/files/p171-xie.pdf, pp. 171-182. |
Z. Li, A. Goya!, Y. Chen, and V. Paxson, “Automating Analysis of Large-Scale Botnet probing Events,” in Proceedings of ACM Symposium on Information, Computer and Communications Security (ASIACCS)), 2009, 12 pages. |
Myung-Sup Kim et al., “A load cluster management system using SNMP and web”, [Online], May 2002, pp. 367-378, [Retrieved from Internet on Oct. 24, 2012], <http://onlinelibrary.wiley.com/doi/10.1002/nem.453/pdf>. |
G. Pruett et al., “BladeCenter systems management software”, [Online], Nov. 2005, pp. 963-975, [Retrieved from Internet on Oct. 24, 2012], <http://citeseerx.lst.psu.edu/viewdoc/download?doi=10.1.1.91.5091&rep=rep1&type=pdf>. |
Philip M. Papadopoulos et al., “NPACI Rocks: tools and techniques for easily deploying manageable Linux clusters” [Online], Aug. 2002, pp. 707-725, [Retrieved from internet on Oct. 24, 2012], <http://onlinelibrary.wiley.com/doi/10.1002/cpe.722/pdf>. |
Thomas Staub et al., “Secure Remote Management and Software Distribution for Wireless Mesh Networks”, [Online], Sep. 2007, pp. 1-8, [Retrieved from Internet on Oct. 24, 2012], <http://cds.unibe.ch/research/pub—files/B07.pdf>. |
“What's New: McAfee VirusScan Enterprise, 8.8,” copyright 2010, retrieved on Nov. 23, 2012 at https://kc.mcafee.com/resources/sites/MCAFEE/content/live/PRODUCT—DOCUMENTATIon/22000/PD22973/en—US/VSE%208.8%20-%20What's%20New.pdf, 4 pages. |
“McAfee Management for Optimized Virtual Environments,” copyright 2012, retrieved on Nov. 26, 2012 at AntiVirushttp://www.mcafee.com/us/resources/data-sheets/ds-move-anti-virus.pdf, 2 pages. |
Rivest, R., “The MD5 Message-Digest Algorithm”, RFC 1321, Apr. 1992, retrieved on Dec. 14, 2012 from http://www.ietf.org/rfc/rfc1321.txt, 21 pages. |
Hinden, R. and B. Haberman, “Unique Local IPv6 Unicast Addresses”, RFC 4193, Oct. 2005, retrieved on Nov. 20, 2012 from http://tools.ietf.org/pdf/rfc4193.pdf, 17 pages. |
“Secure Hash Standard (SHS)”, Federal Information Processing Standards Publication, FIPS PUB 180-4, Mar. 2012, retrieved on Dec. 14, 2012 from http://csrc.nist.gov/publications/fips/fips180-4/fips-180-4.pdf, 35 pages. |
U.S. Appl. No. 13/728,705, filed Dec. 27, 2012, entitled “Herd Based Scan Avoidance System in a Network Environment,” Inventors Venkata Ramanan, et al. |
An Analysis of Address Space Layout Randomization on Windows Vista™, Symantec Advanced Threat Research, copyright 2007 Symantec Corporation, available at http://www.symantec.com/avcenter/reference/Address—Space—Layout—Randomization.pdf, 19 pages. |
Bhatkar, et al., “Efficient Techniques for Comprehensive Protection from Memory Error Exploits,” USENIX Association, 14th USENIX Security Symposium, Aug. 1-5, 2005, Baltimore, MD, 16 pages. |
Dewan, et al., “A Hypervisor-Based System for Protecting Software Runtime Memory and Persistent Storage,” Spring Simulation Multiconference 2008, Apr. 14-17, 2008, Ottawa, Canada, (available at website: www.vodun.org/papers/2008—secure—locker—submit—v1-1.pdf, printed Oct. 11, 2011), 8 pages. |
Shacham, et al., “On the Effectiveness of Address-Space Randomization,” CCS'04, Oct. 25-29, 2004, Washington, D.C., Copyright 2004, 10 pages. |
International Search Report and Written Opinion mailed Dec. 14, 2012 for International Application No. PCT/US2012/055674, 9 pages. |
International Preliminary Report on Patentability and Written Opinion issued Jan. 29, 2013 for International Application No. PCT/US2011/020677 (9 pages). |
Office Action received for U.S. Appl. No. 13/032,851, mailed on Dec. 4, 2013, 16 pages. |
Notice of Allowance received for U.S. Appl. No. 13/275,196, mailed on Dec. 16, 2013, 10 pages. |
Notice of Allowance received for U.S. Appl. No. 13/437,900, mailed on Jan. 13, 2014, 11 pages. |
U.S. Appl. No. 14/127,395, entitled “Agent Assisted Malicious Application Blocking In A Network Environment,” filed Dec. 18, 2013, Inventors: Chandan CP et al. |
Patent Examination Report No. 1, Australian Application No. 2011283164, mailed Jan. 14, 2014. |
USPTO Dec. 30, 2013 Final Office Action from U.S. Appl. No. 13/629,765. |
Number | Date | Country | |
---|---|---|---|
20130097658 A1 | Apr 2013 | US |