US 6,182,226 B2Grant
System and method for controlling interactions between networks
Issue Date:2001-01-30
•32 Claims
•7 Drawing Sheets
Abstract
A firewall is used to achieve network separation within a computing system having a plurality of network interfaces. A plurality of regions is defined within the firewall and a set of policies is configured for each of the plurality of regions. The firewall restricts communication to and from each of the plurality of network interfaces in accordance with the set of policies configured for the one of the plurality of regions to which the one of the plurality of network interfaces has been assigned.
Metadata
Assignee
- Secure Computing Corporation
Inventors
- Irving Reid
- Spencer Minear
Application Information
Application Number:US 09/040,832
Filing Date:1998-03-18
Priority Date:1998-03-18
Art Unit:7
Classifications
IPC:
H04L 900
Field of Search:
713200713201713202707 9709225709229709228709227711163
Patent Drawings (7 sheets)
Description
FIELD OF THE INVENTION
[0002] The present invention relates generally to network security, and more particularly to a system and method of grouping networks to enforce a security policy.
BACKGROUND OF THE INVENTION
[0003] Recent developments in technology have made access easier to publicly available computer networks, such as the Internet. Organizations are increasingly turning to external networks such as the Internet to foster communication between employees, suppliers and clients. With this increased access comes an increased vulnerability to malicious activities on the part of both people inside and outside the organization. Firewalls have become a key tool in controlling the flow of data between internal networks and these external networks.
[0004] A firewall is a system which enforces a security policy on communication traffic entering and leaving an internal network. Firewalls are generally developed on one or more of three models: the screening router, the bastion host, and the dual homed gateway. These models are described in U.S. Pat. No. 5,623,601 to Vu, issued Apr. 22, 1997 and entitled APPARATUS AND METHOD FOR PROVIDING A SECURE GATEWAY FOR COMMUNICATION AND DATA EXCHANGES BETWEEN NETWORKS (Vu), which is hereby incorporated herein by reference.
[0005] Vu describes packet filters as a more sophisticated type of screening that operates on the protocol level. Packet filters are generally host-based applications which permit certain communications over predefined ports. Packet filters may have associated rule bases and operate on the principle of that which is not expressly permitted is prohibited. Public networks such as the Internet operate in TCP/IP protocol. A UNIX operating system running TCP/IP has a capacity of 64 K communication ports. It is therefore generally considered impractical to construct and maintain a comprehensive rule base for a packet filter application. Besides, packet filtering is implemented using the simple Internet Protocol (IP) packet filtering mechanisms which are not regarded as being robust enough to permit the implementation of an adequate level of protection. The principal drawback of packet filters, according to Vu, is that they are executed by the operating system kernel and there is a limited capacity at that level to perform screening functions. As noted above, protocols may be piggybacked to either bypass or fool packet filtering mechanisms and may permit skilled intruders to access the private network.
[0006] Accordingly, it is an object of this invention is to provide a method for controlling interactions between networks by the use of firewalls with defined regions.
SUMMARY OF THE INVENTION
[0007] The present invention is directed to a system and method of achieving network separation within a computing system having a plurality of network interfaces. One aspect of the invention is a method comprising the steps of defining a plurality of regions; configuring a set of policies for each of the plurality of regions; assigning each of the plurality of network interfaces to only one of the plurality of regions, wherein at least one of the plurality of network interfaces is assigned to a particular region; and restricting communication to and from each of the plurality of network interfaces in accordance with the set of policies configured for the one of the plurality of regions to which the one of the plurality of network interfaces has been assigned.
[0008] Another aspect of the invention is a secure server comprising an operating system kernel; a plurality of network interfaces which communicate with the operating system kernel; and a firewall comprising a plurality of regions, wherein a set of policies have been configured for each of the plurality of regions; wherein each of the plurality of network interfaces is assigned to only one of the plurality of regions; wherein at least one of the plurality of network interfaces is assigned to a particular region; and wherein communication to and from each of the plurality of network interfaces is restricted in accordance with the set of policies configured for the one of the plurality of regions to which the one of the plurality of network interfaces has been assigned.
[0009] A feature of the present invention is the application level approach to security enforcement, wherein type enforcement is integral to the operating system. Still another feature is protection against attacks including intruders into the computer system. Yet another feature is a new graphical user interface (GUI) in effective Access Control Language (ACL). A further feature of the present invention is a visual access control system. Another feature is embedded support for Virtual Private Networking (VPN).
BRIEF DESCRIPTION OF THE DRAWINGS
[0010] FIG. 1 depicts an implementation of the firewall of the present invention.
[0011] FIG. 1ashows a representative computing system protected by a firewall.
[0012] FIG. 1bdepicts another computing system protected by a firewall.
[0013] FIG. 2 shows the regions and their members as defined in the present invention.
[0014] FIG. 3 is a graphical representation of ACL commands.
[0015] FIG. 4 is a flow diagram for a virus alert.
[0016] FIG. 5 depicts a method by which incoming data packets are processed in accordance with the present invention.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0017] In the following detailed description of the preferred embodiments, reference is made to the accompanying drawings which form a part hereof, and in which is shown by way of illustration specific embodiments in which the invention may be practiced. It is to be understood that other embodiments may be utilized and structural changes may be made without departing from the scope of the present invention.
[0018] FIG. 1 depicts a block diagram showing the relationship between a firewall 34 in accordance with this invention, the Internet 36, a Secure Server Network (SSN) 38, a Company Private Net 40, and a Partner Shared Net 42. As shown in FIG. 1, communications to and from any other servers or networks goes through the firewall 34.
[0019] Two representative firewall-protected computing systems are shown in FIGS. 1aand 1b. System 10 in FIG. 1aincludes an internal network 12 connected through firewall 14 to external network 16. A server 18 and one or more workstations 20 are connected to internal network 12 and communicate through firewall 14 with servers or workstations on external network 16.
[0020] System 30 in FIG. 1bincludes an internal network 32 connected through firewall 34 to external network 36. A server 38 and one or more workstations 40 are connected to internal network 32. In addition, a server 42 is connected through network 44 to firewall 34. Workstations 40 communicate through firewall 34 with servers or workstations on external network 36 and with server 42 on network 44. In one embodiment network 44 and server 42 are in a sort of demilitarized zone (DMZ) providing protected access to server 42 to internal users and to external entities.
[0021] In one embodiment, firewalls 14 and 34 implement a region-based security system as will be discussed below.
[0022] The operating system on which the firewall 34 is implemented is the BSDI 3.1 version of UNIX, a security hardened operating system with each application separated out, and protected by type enforcement technology. The functions of firewall 34 are all integrated with the operating system, and each one is completely compartmentalized and secured on its own, and then bound by type enforcement control.
[0023] Type enforcement, which is implemented within the operating system itself, assures a very high level of security by dividing the entire firewall into domains and file types. Domains are restricted environments for applications, such as FTP and Telnet. A domain is set up to handle one kind of application only, and that application runs solely in its own domain. File types are named groups of files and subdirectories. A type can include any number of files, but each file on the system belongs to only one type.
[0024] There is no concept of a root super-user with overall control. Type enforcement is based on the security principle of least privilege: any program executing on the system is given only the resources and privileges it needs to accomplish its tasks. On the firewall of this invention, type enforcement enforces the least privilege concept by controlling all the interactions between domains and file types. Domains must have explicit permission to access specific file types, communicate with other domains, or access system functions. Any attempts to the contrary fail as if the files did not exist. The type enforcement policy is mandatory, and nothing short of shutting the system down and recompiling the type enforcement policy database can change it.
[0025] Type enforcement is described in two pending patent applications entitled SYSTEM AND METHOD FOR PROVIDING SECURE INTERNETWORK SERVICES, Ser. No. 08/322,078, filed Oct. 12, 1994, and SYSTEM AND METHOD FOR ACHIEVING NETWORK SEPARATION, Ser. No. 08/599,232, filed Feb. 9, 1996, both of which are incorporated herein by reference. Essentially, a type enforcement scheme provides for the secure transfer of data between a workstation connected to a private network and a remote computer connected to an unsecured network. A secure computer is inserted into the private network to serve as the gateway to the unsecured network and a client subsystem is added to the workstation in order to control the transfer of data from the workstation to the secure computer. The secure computer includes a private network interface connected to the private network, an unsecured network interface connected to the unsecured network, wherein the unsecured network interface includes means for encrypting data to be transferred from the first workstation to the remote computer, a server function for transferring data between the private network interface and the unsecured network interface and a filter function for filtering data transferred between the remote computer and the workstation.
Application-Level Gateway Architecture
[0026] The firewall of the present invention features application-level gateways, which negotiate communications and never make a direct connection between two different networks. Hence, unlike packet filtering, which, as described in the prior art, applies rules on every incoming packet of data, the firewall applies rules applicable to the network or port in which data packets are entering. The gateways have a detailed understanding of the networking services they manage. This architecture isolates activity between network interfaces by shutting off all direct communication between them. Instead, application data is transferred in a sanitized form, between the opposite sides of the gateway.
Attack Protection
[0027] In addition to the firewall's secured type enforced operating system and application gateway architecture, the system has been designed to defend against known network penetration and denial of service attacks, including:
Intruder Response
[0028] Finding out who and where attacks are originating from is a key requirement to taking corrective action. The firewall also includes intruder response that allows administrators to obtain all the information available about a potential intruder. If an attack is detected or an alarm is triggered, the intruder response mechanism collects information on the attacker, their source, and the route they are using to reach the system.
[0029] In addition to real-time response via pager or SNMP, alarms can be configured to automatically print results or to email them to the designated person.
Regions
[0030] The growing need for applying specific security policies and access requirements to complex organizations requires a new way of managing firewalls—regions. Regions are groupings of physical interfaces (network cards) and virtual networks (VPNs) into entities of similar trust.
[0031] Suppose a company has thousands of roaming users connecting to the company network from encrypted virtual private network (“VPN”) clients—managing such users one at a time would be an enormous task. It would be easier to organize those roaming users into groups having, as an example, full access, medium access, and limited access rights. FIG. 2 depicts regions Internet, Secure ‘DMZ’, R&D Network, Sales Offices, Worldwide Customer Service, and Worldwide Sales. In FIG. 2, all Sales or Customer Support departments in the company's offices can be grouped together into regions Worldwide Sales and Worldwide Customer Service, respectively.
[0032] Regions permit the grouping of networks and VPNs that require the same type of security, thereby eliminating the need to enter multiple versions of the same access rule for each network or VPN. Thus regions allow flexibility in tailoring a security policy. In defining regions, the first task is to group together networks or VPNs that require the same type of network access. Each network interface card or VPN that is grouped in a region is considered a member of that region. A region can consist of the following members:
[0033] an interface card,
[0034] a VPN,
[0035] a group of VPNs,
[0036] an interface card and a VPN, or
[0037] an interface card and a group of VPNs.
[0038] Hence in FIG. 2, user1, user2, user3, mgr1, and mgr2 of Region named R&D Network would have the same rights defined for the R&D Region. In the same way, Roaming Sales 1, Roaming Sales 2, Roaming Sales 3, etc. would have the same rights accorded to all members of Region named Sales Offices. In FIG. 2, user1, user2, Roaming Sales 1, Roaming Sales 2, mgr1, etc., do not necessarily represent only workstations. In other words, it is possible for user2 to logon the workstation onto which user3 might ordinarily logon, or for mgr1 to logon the workstation onto which mgr3 might ordinarily logon.
Access Rules/Access Control Language
[0039] A discussion of the use of access control language to define a security policy is explained in greater detail by Reid et al. in SYSTEM AND METHOD FOR IMPLEMENTING A SECURITY POLICY, U.S. patent application Ser. No. 09/040,827, filed herewith, which discussion is hereby incorporated by reference.
[0040] Every region is protected from every other region as defined in the firewall of the present invention. All connections to and from each region are first examined by the firewall. Regions may communicate with each other only if an appropriate access rule has been defined. For each access rule, first, the services that the rule will control must be defined, then, second, the regions that the connection is traveling between must also be defined. For example, if the Internal region is to be allowed to access Telnet services on the Internet region, the access rule must specify Telnet as the service that the rule controls and specify the From: region as Internal and the To: region as Internet. Hence, the firewall of the present invention does not allow traffic to pass directly through the firewall in any direction. Region to Region connections are made via an application aware gateway. Application-level gateways understand and interpret network protocol and provide increased access control ability.
[0041] The ACLs are the heart and soul of the firewall. For each connection attempt, the firewall checks the ACLs for permissions on use and for constraints for the connection. Constraints can include: encryption requirements, authentication requirements, time of day restrictions, concurrent sessions restrictions, connection redirection, address or host name restrictions, user restrictions and so forth.
[0042] Access rules are the way in which the firewall protects regions from unauthorized access. For each connection attempt, the firewall checks it against the defined access rules. The rule that matches the characteristics of the connection request is used to determine whether the connection should be allowed or denied.
[0043] With the firewall of the present invention, access rules are created in a completely new way—using decision trees. Knowing that an access rule is based on a series of decisions made about a connection, the firewall permits the building of an access rule based on “nodes” of decision criteria. A node can be added to check for such criteria as the time of day, whether the connection uses the appropriate authentication or encryption, the user or groups initiating the connection request or the IP address or host of the connection. Each node is compared against an incoming connection request and you determine whether the connection is allowed or denied based on the results of the node comparison.
[0044] Every access rule must consist of two specific nodes. The first, the Services node, decides which service(s) the rule will control. The second, the From/To node determines the source region and destination region of the connection. Once the services and regions for the rule are established, more nodes can be added to determine specific details about the connection.
[0045] In addition to the Allow or Deny terminal nodes, there are four other types of nodes you can add to an access rule: decision nodes, filter nodes, redirects or address rewrites, and alerts.
Decision Nodes
[0046] At any point in an access rule, a connection request can be checked based on the time of day, its users and groups, its IP addresses and hosts or maximum concurrent sessions. At these decision nodes, the firewall determines whether the connection is true or false. If the connection meets the criteria listed in the node, the connection is considered true and proceeds along a “true” branch. If the connection does not meet the node criteria, the connection is considered false and proceeds along a “false” branch.
Filter Nodes
[0047] At any point in an access rule one can check whether a connection has certain authentication or encryption, use SmartFilter to block particular WWW connections, or filter the connection to see if it contains Java or ActiveX content. Filters differ from decision nodes in that they do not determine whether a connection is true or false. Instead, filters attempt to apply a condition to the connection. If the filter can be applied to the connection, the filter is performed and the connection proceeds along the same path. If the filter does not apply to the connection, the filter is ignored and the connection still proceeds.
Redirects or Address Rewrites
[0048] A rewrite node is a point in an access rule where source or destination addresses are mapped to other source or destination addresses. Destination IP address rewrites allow an inbound connection through network address translation (NAT) address hiding to be remapped to a destination inside the NAT barrier. Source address rewrites can be used on outbound connections to make the source appear to be one of many external addresses. This process allows the internal hosts to be aliased to external addresses. Rewrites can be based on any connection criteria, including users.
Alerts
[0049] At any point in an access rule, one can add an alert that notifies recipients when a connection has reached a particular point in an access rule. Using these alerts, one can monitor specific users, IP addresses and other criteria contained within a specific access rule.
True and False Branches
[0050] When a connection request reaches a node in a rule, it is checked against the information in the node. If the connection is a filter node, the filter condition is either applied or ignored. Only one branch leads out of a filter node. If the node happens to be a decision node, there are two possible results. If the connection meets the criteria listed, it is considered true and follows the “true” branch of the access rule. Otherwise, the connection is considered “false” and follows the false branch.
[0051] Referring to FIG. 3, the design for this feature falls almost directly out of the GUI representation. The GUI presents access rules as a decision tree with special kinds of nodes which make true or false decisions. Each decision leads to a branch which contains more nodes. Along the way, filters can be acquired. These filters are not processed by the kernel with the exception of redirects (rewrite destination address or port). In FIG. 3, the time of day is checked (50). If during business hours, the user is checked (52). Certain users are allowed, so connection is allowed (54) as indicated by the check mark. However, some users (56) require a SmartFilter check (58), whereas everyone else is denied (60).
[0052] The firewall of the present invention introduces a revolutionary means to manage network access control. Traditional firewalls provide lists of access control rules, but as more rules and controls are added, these lists become unmanageable. As shown in FIG. 3, the present invention presents a visual means by which access control can be defined and easily understood through flowchart style diagrams.
[0053] The firewall's access flow diagrams allow any decision criteria to be based on any other decision, in any order. If the administrator wants to check user first, then time, then apply a specific access policy, they can. In addition, the flow diagrams are object oriented for greater power.
[0054] Access control rules on the firewall can be defined with flexibility previously unknown in the industry. This allows, for example, for different web filtering polices on a per-user basis, the ability to deny a connection if it isn't encrypted, authenticate a connection by strong token and another connection by password. Access rules can incorporate any of the following criteria:
[0055] Source and destination Region
[0056] Users and groups
[0057] Source and destination addresses, networks, hosts, and domains
[0058] Type of service (WWW, Email, Telnet, FTP, etc.)
[0059] Time of day, Day of week
[0060] Load balancing
[0061] Maximum number of concurrent sessions
[0062] Required level of encryption
[0063] Required level of authentication (strong token, password, etc.)
[0064] Protocol filters (WWW, FTP—see later in this section)
[0065] SmartFilter™ URL blocking policy (see later in this section)
[0066] Multiple external IP address connected to
[0067] Source and destination service port and IP address rewrites
Address and Port Rewrites
[0068] The firewall's access control diagrams include the capability of IP address rewrites, which allows a connection inbound through NAT address hiding to be remapped to a destination inside the NAT barrier. Also, rewrites can be used on outbound connections to make the source appear to be one of many external addresses. This allows internal hosts to be aliased to external addresses.
[0069] Rewrites can be based on any connection criteria, including users. So the administrator can have anonymous FTP connections directed to a public access FTP server on the Secure Server Net, but remap users to their internal machines.
User Defined Alerts
[0070] The firewall's access control diagrams also include the capability of sending alerts, with an administrator-defined message, based on any connection decision. Alerts can be dropped into the access flow diagrams at any point. If a connection reaches that point in the diagram, the alert is triggered. For example, in FIG. 4, a check for viruses is performed on a file (70). If a virus is found, the administrator is alerted (72), and the transfer is redirected to a safe location for later inspection (74).
[0071] The ACLs consist of all the required kernel code. This is all the code that implements the rules themselves in the kernel including: build, modifying, deleting, and querying the rules. Also included are the system calls that the user level programs need to use the ACLs. The parsing of the return values, especially the filters are not part of the ACLs themselves since the filter rules are defined dynamically by the programs issuing the system calls to build the ACLs. It is the intent that the kernel be flexible enough to handle all the filter requirements without needing modifications for future enhancements.
[0072] The ACLs themselves must satisfy the requirements laid out by the GUI design. This dictates to a large degree how the rules must be implemented. Since the user has no direct access to the ACLs (rather they use the user interface), there are no ease of use concerns here except to say that the ACLs must be something the developers can work with easily. Hence, there exists a good set of tools to debug the ACLs.
Virtual Private Networking
[0073] Virtual Private Networking (VPN) has been embedded into the architecture of the firewall of the present invention, making it an operating characteristic of the operating system, as opposed to other firewalls which added VPN later. Every access control is available to VPN connections in exactly the same way as for physically connected networks: user controls, IP restrictions, protocol filters, address hiding, multi-homing, and more. VPN is a method of authenticating and transparently encrypting bi-directional data transmissions via the Internet. Both gateway to gateway network links as well as roaming users on VPN enabled laptops are utilizing the security and cost effectiveness of VPN Internet encrypted communications. VPN technology is embedded in the core design of the firewall of the present invention.
Proxies
[0074] There are usually 2 sockets per session, client_sock and server_sock. Each socket has two endpoints, so there can be up to four different IP addresses. Note that loc_dst_addr could be anything, if the firewall bound to a wildcard address. Here are diagrams for BFS Inbound, BFS Outbound, and the firewall of the present invention.
Proxy Signals
[0075] The SIGWINCH signal is used to force all ACLs to be rechecked and for proxies to re-initialize themselves (for proxies that use config files). Most proxies will handle this signal themselves, but if secured did an ACL before starting a proxy, it must also do the recheck. The SIGWINCH signal will come from the backend, which will use killpg() to signal all the inetd daemons, secured processes, and their child proxies or servers. Note that the default action for SIGWINCH is ignore, so inetd did not need to be modified.
[0076] Some transient proxies use the SIGALRM internally to do idle proxy timeouts (tcpgsp, tnauthp, sqlp).
[0077] All proxies should shutdown cleanly if given a SIGTERM signal. The backend (daemond actually) uses SIGTERM to kill inetd processes when the last service has been removed. We have modified inetd to catch SIGTERM and then use killpg(SIGTERM, pgid) to kill all its children (proxies and secureds). When it starts up, inetd creates a new process group and becomes the leader, which allows it to kill all children easily.
[0078] Squid will re-open (not rotate) its logfiles if given the SIGUSR1 signal, and re-initialize itself if given SIGWINCH or SIGHUP. Note that this means squid does not do ACL rechecks, it treats itjust like a SIGHUP—closes its listen sockets and waits 30 seconds for active sessions to terminate, then re-opens listen sockets. This easy way out was chosen because squid's connections are relatively short-lived.
Standard Proxy Options
[0079] The following options are passed to secured by the backend writing them on the inetd.conf line:
[0080] -D te_dom Set the TE domain of our child process to te_dom
[0081] -N service_number the service number is required for ACL calls.
[0082] secured will pass this number on to all proxies
[0083] -t Specifies that secured is running a transient service (with the wait flag in inetd.conf). ACL checks are not done by secured for transient services, because the service itself must do ACL checks.
[0084] -u Specifies that this service supports the notion of a user name, so secured should let service perform its own ACL checks. Currently only FTP, telnet and WWW support user names. Note: only needed for ftpp, because tnauthp and squid already do their own ACLs.
[0085] The following options are passed to a proxy by the backend writing them on the inetd.conf line:
[0086] -a audit_name use ‘name’ in call to openlog() and for auditing
[0087] -i N specify session idle timeout as N seconds
[0088] -I N specify proxy idle timeout as N seconds (transient only)
[0089] -P ch specify descriptor port, ch=S for secure, ch=L for lpr, ch=G for generic, otherwise, ch=N specify fixed port, or ch=low-high to specify a port range
[0090] The following ACL return values are passed to short-lived proxies by secured:
[0091] -N service_number the same service number that secured got via backend
[0092] -c cli_rgn set cli_region
[0093] -s srv_rgn set srv_region
[0094] -D IP specify the server IP address
[0095] -M IP specify an IP address to spoof as loc_src_addr, for MAT-out
[0096] -p N specify the server port number
[0097] -P N specify fixed value for descriptor port
[0098] -C spoof client-side socket (typically outbound proxies)
[0099] -S spoof server-side socket (typically inbound proxies)
[0100] By letting the ACLs control so many settings, the inetd.conf lines are much simpler and the degree of control is much greater. For example, here are some BFS inetd.conf entries for inbound proxies:
[0101] inbound_udp_relay -e 199.71.190.101 -w 65546 -u g_udp_ir -d 192.168.128.138 -m -g 0
[0102] secured -ws 144 -wr 1 -wn 1 -1 199.71.190.121 www_X www_r_i . . . d 192.168.125.2 -m
[0103] Here are the corresponding entries for the firewall of the present invention:
[0104] secured -N 123 -D RGnx -t - ntpp -a ntpp
[0105] secured -N 456 -D RGnx -t - httpp -a httpp
[0106] The following options are only used for debugging purposes, some might be disabled on production systems or supported in future releases:
[0107] -n non-transparent proxy mode—only works for VDO-Live
[0108] -U user_name set the user name (ftp ftp_mux and ftpp/ftpd)
[0109] -A ch set the audit method, ch=s for syslog, ch=a for audit, ch=e for stderr
[0110] -m disable socket mating
[0111] -L disable connection logging
[0112] -z set non-paranoid mode, which relaxes IP address checks for UDP proxies
Audit Issues
[0113] The firewall of the present invention uses new structured audit calls for session logging, which include src and dst region, ACL matched, auth method, encryption state, etc. The new calls are:
[0114] audit_session_begin
[0115] audit_session_continue
[0116] audit_session_end
[0117] audit_log_ftp—to log FTP file transfers, includes user, filename, size
[0118] audit_log_smartfilter—to log URL, action (allow/deny), blocked categories
[0119] audit_acl_deny—to log ACL denials
[0120] audit_ipsec_fail—to log IPSEC failures
[0121] audit_auth_fail—to log authentication failures
Authentication Issues
[0122] SecureZone has incorporated the proxy-warder-interface (pwif) from Sidewinder. We also support external authentication servers such as snk, safeword, securid. The pwif interface was already supported by tnauthp, we added pwif support to ftpp, and for GUI login. We are not using pwif for squid, instead we are using their build-in passwd file support. The backend will have to keep the squid passwd file in sync with the static-passwd file used for ftp and telnet.
ACL Issues
[0123] Besides a simple allow/deny, the ACLs also return the following: from_region, to_region, destination redirects for IP and port, source redirects for IP and port, transparency settings and filters. We have standardized ACL filters as follows (example from acl_util.h):
[0124] Here are some example filter strings, from acl_load.c:
SQUID Issues
[0125] The caching WWW proxy (squid) is very interesting because it has its own ACL checks and non-blocking DNS interface. We leveraged this built-in support in our work, but it was still tricky to integrate the firewall's ACL calls while operating as a non-blocking long-lived proxy.
[0126] Squid supports something called proxy-authentication, but this will only work if someone has configured their web browser to contact a proxy for all URLs. Before doing ACL checks, we use the following code to handle this special case:
[0127] This will cause ACL checks for transparent HTTP requests to bypass user nodes, and squid will ignore auth filters. Non-transparent requests (where the connection is TO the firewall) will enforce any user nodes and auth filters in the ACL tree.
[0128] Since the proxy might not get an authentication filter after the ACLs return NEEDS_USERNAME, the squid proxy-auth code has been changed to not return a failure code if the password was not accepted. Instead we save some internal state, and only check this state if an authentication filter is returned later.
[0129] It is worth noting that in non-transparent mode squid can proxy and authenticate http, gopher, ftp and wais URLs.
In the Proxy
[0130] The proxy will make two calls to the ACLs. The first will be:
[0131] The possible return values will be:
[0132] #define ACL_DENY 0
[0133] #define ACL_ALLOW_HIDE_SRC 1
[0134] #define ACL_ALLOW_HIDE_DST 2
[0135] #define ACL_ALLOW_HIDE_BOTH 3
[0136] #define ACL_ALLOW_SHOW_ALL 4
[0137] #define ACL_RESOLVE_SRC_ADDR 5
[0138] #define ACL_RESOLVE_DST_ADDR 6
[0139] #define ACL_NEED_MORE_FILTER_SPACE 7
[0140] #define ACL_NEED_USER_NAME 8
[0141] Thus the ACLs will return, for each connection, how to hide the addresses. The description of each of these values is as follows:
[0142] service_number: this is a number that the backend decides and is unique per service or possibly per service, from and to region triplet as desired.
[0143] src_ip: this is the source IP address of the connection.
[0144] dst_ip: this is the destination IP address of the connection.
[0145] src_host_name: this is the host name based on the reverse lookup of the source address of the connection. This is generally only used when the kernel explicitly asks for it by returning from a previous call to scc_is_service_allowed with a return value of ACL_RESOLVE_SRC_ADDR.
[0146] dst_host_name: this is the host name based on the reverse lookup of the destination address of the connection. This is generally only used when the kernel explicitly asks for it by returning from a previous call to scc_is_service_allowed with a return value of ACL_RESOLVE_DST_ADDR.
[0147] user_name: this is the user name of the person using the service. This value is only used when ACL_NEED_USER_NAME has been returned by the kernel. Use NULL, if the name has not yet been requested. Currently only FTP, telnet and WWW support user names.
[0148] name_valid: this tells the ACLs whether or not a user name makes any sense for this protocol. If the name_valid flag is set to TRUE, then user decision nodes will be used (and thus a user name will be required if a user decision node is encountered when checking the ACL). If set to false, then the user decision nodes will be ignored and the true path of those nodes encountered when checking the ACL will be used.
[0149] to_region: the region number that the destination address of this connection is in.
[0150] from_region: the region number that the source address of this connection is in.
[0151] filter_text_len: this is a pointer to an integer which has the length of the filter_text array in it. This value will be set to the amount of data returned by the access call on return. If the return value is ACL_NEED_MORE_FILTER_SPACE, then the value in this variable will contain the amount of space required.
[0152] filter_text: this is an array of characters of size filter_text_len which will be used to store the concatenated filter strings accumulated while checking the ACLs.
[0153] rule_name_len: this is the size of the array rule_name.
[0154] rule_name: this is the name of the rule that allowed or denied the connection. Only a maximum of rule_name_len—1 characters will be stored in there.
[0155] redirect_dst_addr_port: this is the address and port to redirect this connection to. The system will set this to all zeroes if it is not in use. The port and address will always both be set together in this structure if it is to be used. Only the sin_port and sin_addr part of the structure will be used.
[0156] redirect_src_addr_port: this is used to indicate to the firewall that when making the connection from the firewall to the destination, it should use the source address/port provided. Note that unlike the redirect_dst_addr_port field only the parts of the address required will be filled out. In particular, if the port is specified but not the address then the address field will be zero. Similarly, if the address is specified but not the port, then the port will be zero. For the redirect_dst_addr_port, if one or both field are specified then they are both returned (with the unspecified field left the same as the actual destination).
[0157] master_key: this is the key that indicates which items have been licensed on the firewall.
[0158] connection_id: this is the connection id for this connection. When the service is finished you provide this id to the scc_service_done system call and that function decrements the correct counters.
[0159] Note that the user name will be used by the system to get the groups automatically behind the scenes in the library call. This means that the actual call to the kernel will have more fields. In particular, there will be a list of group names and a counter to indicate how many elements are in the list.
[0160] The second call will be:
[0161] int scc_service_done(caddr_t connection_id);
[0162] This call always returns zero now. The kernel will use the information in the proc structure for this process to decrement the connection counts for this connection.
[0163] There is one other call that a proxy might have to make. When an ACL is updated, proxies have to recheck their connections to see if they can still make the connection. This is done as follows:
[0164] Returns from this will be the same as for the scc_is_service_allowed call except that connection_id is passed in as a parameter not a return value.
[0165] If the connection is not allowed, then the counters are automatically freed up and the proxy need not make any further calls for that connection. In the case of counter nodes, the recheck will fail until the counter is at an acceptable level. This means that, if the counter has been decreased below current connection levels, the first connection rechecked will fail and so on until the current number of connections counter has been decremented enough. Thus, proxies should recheck services in order of lowest priority to highest priority (typically by checking the oldest sessions first, when that is possible). Note that short-lived proxies and servers started by secured cannot guarantee the order in which ACLs will be rechecked, since they will all get a HUP signal at the same time.
Implementation of Regions
[0166] The following new system calls were added to BSDI 3.1 version of UNIX to support regions:
[0167] Other changes include:
[0168] initialization of region table at system startup time;
[0169] addition of a region number to the packet header data structure to record the region ID for every network packet received;
[0170] addition of a field to the network interface data to record which region that interface belongs to; and
[0171] addition of a field to the VPN security association data to record which region the VPN is belongs to.
[0172] Other further changes:
[0173] In the ICMP (Internet Control Message Protocol) processing, if the incoming packet is an ICMP ECHO_REQUEST (commonly known as a “ping”), check the region table and only respond if ping response is enabled for the region from which the packet came;
[0174] In the IPSec key and policy processing code, code was added to record the region ID associated with keys and policy table entries, and to manipulate keys and policies on a region-by-region basis;
[0175] List of changed files: Region modifications were made to the following files within the BSD/OS kernel:
Region Determination Processing
[0176] Referring to FIG. 5, when a packet is received as shown in step 80, the region ID is retrieved from the network interface and assigned to the packet in step 82. It is determined in step 84 whether the packet is encrypted, i.e., a VPN. If the packet is encrypted, processing proceeds to step 86 where the VPN security association for that packet is retrieved. The packet is then decrypted in step 88, and the previously stored region ID for that packet is replaced with the region ID of the VPN in step 90. All further operations take place on the decrypted packet.
[0177] Ordinarily, a UNIX system then checks whether the packet is destined for one of the firewall's IP addresses. If not, the packet is forwarded to the real destination. This has been modified in SecureOS to check that: (a) the destination is in the same region as the source and (b) the “router” flag is set for that region, as shown in steps 92 and 94. If either condition is not met, the packet is not forwarded, as shown in step 102.
[0178] In step 96, the system looks for any socket listening for the incoming packet. Traditionally this match looks at source IP address, source IP port, destination address, and destination port. This has been extended in SecureOS, as shown in step 98, to also check the region associated with the packet against the region specified in the rgnbind() system call, to ensure that sockets receive data originating only from the correct region. If all conditions are met, the packet is forwarded in step 100; otherwise, the packet is not forwarded (step 102).
[0179] Examples of User's View of Regions:
[0180] This example mimics the Borderware configuration of internal, external, and Secure Server Net (SSN):
[0181] The fields are:
[0182] The following example shows a region of the firewall of the present invention configured to sit between two departments of a company and transparently filter and control network access between the departments.
[0183] The two regions can see each others' addresses; that is, no address translation is done. Nevertheless, network connections are only allowed if an access rule on the firewall grants permission.
Conclusion
[0184] It is understood that the above description is intended to be illustrative, and not restrictive. Many other embodiments will be apparent to those of skill in the art upon reviewing the above description. The scope of the invention should, therefore, be determined with reference to the appended claims, along with the full scope of equivalents to which such claims are entitled.
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
What is claimed is:
1. A method of achieving network separation within a computing system having network interfaces connected to form a plurality of physical networks, the method comprising the steps of:
defining a plurality of regions;
defining a virtual private network;
establishing a set of security policies, wherein the set of security policies defines rules for communicating between each of the plurality of regions;
assigning each physical network to one of the plurality of regions;
assigning the virtual private network to one of the plurality of regions; and
restricting communication between the plurality of regions in accordance with the set of security policies.
2. The method according to claim 1, wherein establishing a set of security policies includes defining an access rule for communication between two regions.
3. The method according to claim 2, wherein the access rule establishes permissions for use of a communication path between the source and destination regions.
4. The method according to claim 2, wherein the access rule establishes one or more constraints on use of a communication path between the source and destination regions.
5. The method according to claim 4, wherein the constraints include an encryption requirement.
6. The method according to claim 4, wherein the constraints include an authentication requirement.
7. The method according to claim 4, wherein the constraints include a constraint from a group of constraints including a time of day restriction, a concurrent sessions restriction, connection redirection, an address restriction, a host name restriction and a user restriction.
8. The method according to claim 1, wherein restricting communication includes routing communication between different regions to an application level proxy, wherein the application level proxy applies the set of security policies.
9. A secure server, comprising:
an operating system kernel;
a plurality of network interfaces, wherein the network interfaces are connected to form a plurality of physical networks and wherein each of the plurality of network interfaces communicates with the operating system kernel;
a virtual private network;
a plurality of regions; and
a security policy, wherein the security policy defines rules for communicating between each of the plurality of regions;
wherein each of the physical networks is assigned to a region;
wherein the virtual private network is assigned to a region; and
wherein communication between the plurality of regions is restricted in accordance with the security policy.
10. The secure server according to claim 9, wherein the security policy uses an access rule to restrict communication between two regions and wherein communication between a source and destination region is only allowed if an access rule has been defined for communication from the source region to the destination region.
11. The secure server according to claim 10, wherein the access rule establishes permissions for use of a communication path between the source and destination regions.
12. The secure server according to claim 10, wherein the access rule establishes one or more constraints on use of a communication path between the source and destination regions.
13. The secure server according to claim 12, wherein the constraints include an encryption requirement.
14. The secure server according to claim 12, wherein the constraints include an authentication requirement.
15. The secure server according to claim 12, wherein the constraints include a constraint from a group of constraints including a time of day restriction, a concurrent sessions restriction, connection redirection, an address restriction, a host name restriction and a user restriction.
16. The secure server according to claim 10, wherein the secure server further comprises an application level proxy and wherein communication between regions is first examined by the application level proxy.
17. The secure server according to claim 10, wherein the secure server further comprises an application level proxy and wherein communication between regions is first examined by the application level proxy.
18. In a computer system having a plurality of network interfaces, including a first and a second network interface, in which the first and second network interfaces are connected to first and second networks, respectively, a method of processing a packet having a source region and a destination region, the method comprising:
defining a plurality of regions, wherein defining includes assigning a first region identifier to the first network and a second region identifier to the second network;
establishing a security policy, wherein the security policy defines rules for communicating between the plurality of regions;
receiving a packet at the first network interface;
assigning the first region identifier to the packet;
reviewing the security policy to determine if transfer of the packet between the source region and the destination region is permitted for packets assigned the first region identifier; and
if so, forwarding the packet to the destination region.
19. The method according to claim 18 wherein reviewing the security policy includes issuing a mgbind() system call to ensure that sockets receive data only from a predefined region.
20. In a computer system having a plurality of network interfaces, including a first and a second network interface, in which the first and second network interfaces are connected to first and second networks, respectively, a method of processing a packet having a source region and a destination region, the method comprising:
providing a virtual private network;
defining a plurality of regions, wherein defining includes assigning a first region identifier to the first network, a second region identifier to the second network and a third region identifier to the virtual private network;
establishing a security policy, wherein the security policy defines rules for communicating between the plurality of regions;
receiving a packet at the first network interface;
assigning the first region identifier to the packet;
determining if the packet is encrypted;
if the packet is encrypted, changing the region identifier assigned to the packet, wherein changing the region identifier includes:
retrieving a virtual private network security association for the packet;
decrypting the packet; and
replacing the first region identifier with the third region identifier;
reviewing the security policy to determine if transfer of the packet between the source region and the destination region is permitted when the packet is received from the virtual private network; and
if so, forwarding the packet to the destination.
21. The method according to claim 20 wherein reviewing the security policy includes issuing a mgbind() system call to ensure that sockets receive data only from a predefined region.
22. A method of achieving network separation within a computing system having a plurality of networks, including a virtual private network, the method comprising the steps of:
defining a plurality of regions;
configuring a set of security policies, wherein the set of security policies defines rules for communicating between each of the plurality of regions;
assigning each of the plurality of networks to one of the plurality of regions, wherein assigning includes assigning a region identifier to the virtual private network; and
restricting communication between regions in accordance with the set of security policies.
23. The method according to claim 22, wherein establishing a set of security policies includes defining an access rule for communication between two regions.
24. The method according to claim 23, wherein the access rule establishes permissions for use of a communication path between the two regions.
25. The method according to claim 23, wherein the access rule establishes one or more constraints on use of a communication path between the two regions.
26. The method according to claim 23, wherein the constraints include a constraint from a group of constraints including an encryption requirement, an authentication requirement, a time of day restriction, a concurrent sessions restriction, connection redirection, an address restriction, a host name restriction and a user restriction.
27. The method according to claim 22, wherein restricting communication includes routing communication between different regions to an application level proxy, wherein the application level proxy applies the set of security policies.
28. In a computer network system having a plurality of regions and a plurality of services, including a first service, wherein each service defines a protocol for transferring data between two of the plurality of regions, and wherein each region includes one or more networks, a method of limiting transfers between regions, comprising:
defining a to-from set, wherein the to-from set lists a source region and a destination region;
associating the to-from set with the first service;
defining a path, wherein the path includes desired options for limiting transfer from the source region to the destination region via the first service;
storing information regarding the to-from set, the first service and the path as an access control rule;
receiving a request to set up said first service between the source region and the destination region;
comparing the request to the access control rule to determine access; and
if access is allowed, establishing the service between the source and destination regions.
29. A method of achieving network separation within a computing system having network interfaces connected to form a plurality of physical networks, the method comprising the steps of:
defining a plurality of regions;
establishing a set of security policies, wherein the set of security policies defines rules for communicating between each of the plurality of regions;
assigning each physical network to one of the plurality of regions, wherein at least one of the regions is assigned two or more networks; and
restricting communication between the plurality of regions in accordance with the set of security policies.
30. The method according to claim 29, wherein establishing a set of security policies includes defining an access rule for communication between two regions.
31. A secure server, comprising:
an operating system kernel;
a plurality of network interfaces, wherein the network interfaces are connected to form a plurality of physical networks and wherein each of the plurality of network interfaces communicates with the operating system kernel;
three or more regions; and
a security policy, wherein the security policy defines rules for communicating between each of the plurality of regions;
wherein each of the physical networks is assigned to a region;
wherein at least one of the regions has two or more networks assigned to that region; and
wherein communication between the plurality of regions is restricted in accordance with the security policy.
32. The secure server according to claim 31, wherein the security policy uses an access rule to restrict communication between two regions and wherein communication between a source and destination region is only allowed if an access rule has been defined for communication from the source region to the destination region.
Patent Citations (64)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3956615 | 1976-05-01 | Anderson et al. | Applicant |
| US4104721 | 1978-08-01 | Markstein et al. | Applicant |
| US4177510 | 1979-12-01 | Appell et al. | Applicant |
| US4442484 | 1984-04-01 | Childs, Jr. et al. | Applicant |
| US4584639 | 1986-04-01 | Hardy | Applicant |
| US4621321 | 1986-11-01 | Boebert et al. | Applicant |
| US4648031 | 1987-03-01 | Jenner | Applicant |
| US4701840 | 1987-10-01 | Boebert et al. | Applicant |
| US4713753 | 1987-12-01 | Boebert et al. | Applicant |
| US4870571 | 1989-09-01 | Frink | Applicant |
| US4885789 | 1989-12-01 | Burger et al. | Applicant |
| US4914568 | 1990-04-01 | Kodosky et al. | Applicant |
| US5093914 | 1992-03-01 | Coplien et al. | Applicant |
| US5124984 | 1992-06-01 | Engel | Applicant |
| US5153918 | 1992-10-01 | Tuai | Applicant |
| US5204961 | 1993-04-01 | Barlow | Applicant |
| US5228083 | 1993-07-01 | Lozowick et al. | Applicant |
| US5263147 | 1993-11-01 | Francisco et al. | Applicant |
| US5272754 | 1993-12-01 | Boebert | Applicant |
| US5276735 | 1994-01-01 | Boebert et al. | Applicant |
| US5303303 | 1994-04-01 | White | Applicant |
| US5305385 | 1994-04-01 | Schanning et al. | Applicant |
| US5311593 | 1994-05-01 | Carmi | Applicant |
| US5329623 | 1994-07-01 | Smith et al. | Applicant |
| US5333266 | 1994-07-01 | Boaz et al. | Applicant |
| US5355474 | 1994-10-01 | Thuraisngham et al. | Applicant |
| US5414833 | 1995-05-01 | Hershey et al. | Applicant |
| US5416842 | 1995-05-01 | Aziz | Applicant |
| US5455828 | 1995-10-01 | Zisapel | Applicant |
| US5485460 | 1996-01-01 | Schrier et al. | Applicant |
| US5511122 | 1996-04-01 | Atkinson | Applicant |
| US5548646 | 1996-08-01 | Aziz et al. | Applicant |
| US5550984 | 1996-08-01 | Gelb | Applicant |
| US5566170 | 1996-10-01 | Bakke et al. | Applicant |
| US5583940 | 1996-12-01 | Vidrascu et al. | Applicant |
| US5586260 | 1996-12-01 | Hu | Applicant |
| US5604490 | 1997-02-01 | Blakley, III et al. | Applicant |
| US5606668 | 1997-02-01 | Shwed | Applicant |
| US5615340 | 1997-03-01 | Dai et al. | Applicant |
| US5619648 | 1997-04-01 | Canale et al. | Applicant |
| US5623601 | 1997-04-01 | Vu | Examiner |
| US5636371 | 1997-06-01 | Yu | Applicant |
| US5644571 | 1997-07-01 | Seaman | Applicant |
| US5671279 | 1997-09-01 | Elgamal | Applicant |
| US5673322 | 1997-09-01 | Pepe et al. | Applicant |
| US5684951 | 1997-11-01 | Goldman et al. | Applicant |
| US5689566 | 1997-11-01 | Nguyen | Applicant |
| US5699513 | 1997-12-01 | Feigen et al. | Applicant |
| US5706507 | 1998-01-01 | Schloss | Applicant |
| US5708780 | 1998-01-01 | Levergood et al. | Applicant |
| US5864683 | 1999-01-01 | Boerbert et al. | Examiner |
| US5918018 | 1999-06-01 | Gooderum et al. | Examiner |
| US5968176 | 1999-10-01 | Nessett et al. | Examiner |
| US5983350 | 1999-11-01 | Minear et al. | Applicant |
| EP554182A1 | 1993-04-01 | Applicant | |
| EP743777A2 | 1996-11-01 | Applicant | |
| GB2287619 | 1995-09-01 | Applicant | |
| WO96/13113 | 1996-05-01 | Applicant | |
| WO96/35994 | 1996-11-01 | Applicant | |
| WO97/13340 | 1997-04-01 | Applicant | |
| WO97/26731 | 1997-07-01 | Applicant | |
| WO97/26734 | 1997-07-01 | Applicant | |
| WO97/26735 | 1997-07-01 | Applicant | |
| WO97/29413 | 1997-08-01 | Applicant |
Non-Patent Literature (52)
- Boebert, W.E., et al., “Secure Ada Target: Issues, System Design, and Verification”, Proceedings of the Symposium on Security and Privacy, Oakland, California, pp. 59-66, (1985).Applicant
- Boebert, W.E., et al., “Secure Computing: The Secure Ada Target Approach”, Sci. Honeyweller, 6(2), 17 pages, (1985).Applicant
- International Search Report, PCT Application No. PCT/US 95/12681, 8 p. (mailed Apr. 9, 1996).Applicant
- News Release: “100% of Hackers Failed to Break Into One Internet Site Protected by Sidewinder™”, Secure Computing Corporation (Feb. 16, 1995).Applicant
- News Release: “Internet Security System Given ‘Product of the Year’ Award”, Secure Computing Corporation (Mar. 28, 1995).Applicant
- News Release: “SATAN No Threat to Sidewinder™”, Secure Computing Corporation (Apr. 26, 1995).Applicant
- “Answers to Frequently Asked Questions About Network Security”, Secure Computing Corporation, p. 1-41 & p. 1-16 (Sep. 25, 1994).Applicant
- “Sidewinder Internals”, Product information, Secure Computing Corporation, 16 p. (Oct. 1994).Applicant
- “Special Report: Secure Computing Corporation and Network Security”, Computer Select, 13 p. (Dec. 1995).Applicant
- Adam. J.A., “Meta-Matrices”, IEEE Spectrum, p. 26 (Oct. 1992).Applicant
- Adam, J.A., “Playing on the Net”, IEEE Spectrum, p. 29 (Oct. 1992).Applicant
- Ancilotti, P., et al., “Language Features for Access Control”, IEEE Transactions on Software Engineering, SE-9, 16-25 (Jan. 1983).Applicant
- Badger, L., et al., “Practical Domain and Type Enforcement for UNIX”, Proceedings of the 1995 IEEE Symposium on Security and Privacy, p. 66-77 (May 1995).Applicant
- Belkin, N.J., et al., “Information Filtering and Information Retrieval: Two Sides of the Same Coin?”, Communications of the ACM, 35, 29-38 (Dec. 1992).Applicant
- Bellovin, S.M., et al., “Network Firewalls”, IEEE Communications Magazine, 32, 50-57 (Sep. 1994).Applicant
- Bevier, W.R., et al., “Connection Policies and Controlled Interference”, Proceedings of the Eighth IEEE Computer Security Foundations Workshop, Kenmare, Ireland, p. 167-176 (Jun. 13-15, 1995).Applicant
- Bowen, T.F., et al., “The Datacycle Architecture”, Communications of the ACM, 35, 71-81 (Dec. 1992).Applicant
- Bryan, J., “Firewalls For Sale”, BYTE, 99-100, 102, 104-105 (Apr. 1995).Applicant
- Cobb, S., “Establishing Firewall Policy”, IEEE, 198-205 (1996).Applicant
- Damashek, M., “Gauging Similarity with n-Grams: Language-Independent Categorization of Text”, Science, 267, 843-848 (Feb. 10, 1995).Applicant
- Dillaway, B.B., et al., “A Practical Design For A Multilevel Secure Database Management System”, American Institute of Aeronautics and Astronautics, Inc., p. 44-57 (Dec. 1986).Applicant
- Fine, T., et al., “Assuring Distributed Trusted Mach”, Proceedings of the IEEE Computer Society Symposium on Research in Security and Privacy, p. 206-218 (1993).Applicant
- Foltz, P.W., et al., “Personalized Information Delivery: An Analysis of Information Filtering Methods”, Communications of the ACM, 35, 51-60 (Dec. 1992).Applicant
- Gassman, B., “Internet Security, and Firewalls Protection on the Internet”, IEEE, 93-107 (1996).Applicant
- Goldberg, D., et al., “Using Collaborative Filtering to Weave an Information Tapestry”, Communications of the ACM, 35, 61-70 (Dec. 1992).Applicant
- Grampp, F.T., “UNIX Operating System Security”, AT&T Bell Laboratories Technical Journal, 63, 1649-1672 (Oct. 1984).Applicant
- Greenwald, M., et al., “Designing an Academic Firewall: Policy, Practice, and Experience with SURF”, IEEE, 79-92 (1996).Applicant
- Haigh, J.T., et al., “Extending the Noninterference Version of MLS for SAT”, Proceedings of the 1986 IEEE Symposium on Security and Privacy, Oakland, CA, p. 232-239 (Apr. 7-9, 1986).Applicant
- Karn, P., et al., “The ESP DES-CBC Transform”, Network Working Group, Request for Comment No. 1829, http//ds.internic.net/rfc/rfc1829.txt, 9 p. (Aug. 1995).Applicant
- Kent, S.T., “Internet Privacy Enhanced Mail”, Communications of the ACM, 36, 48-60 (Aug. 1993).Applicant
- Lampson, B.W., et al., “Dynamic Protection Structures”, AFIPS Conference Proceedings, 35, 1969 Fall Joint Computer Conference, Las Vegas, NV, 27-38 (Nov. 18-20, 1969).Applicant
- Lee, K.C., et al., “A Framework for Controlling Cooperative Agents”, Computer, 8-16 (Jul. 1993).Applicant
- Lodin, S.W., et al., “Firewalls Fend Off Invasions from the Net”, IEEE Spectrum, 26-34 (Feb. 1998).Applicant
- Loeb, S., “Architecting Personalized Delivery of Multimedia Information”, Communications of the ACM, 35, 39-48 (1992).Applicant
- Loeb, S., et al., “Information Filtering”, Communications of the ACM, 35, 26-28 (Dec. 1992).Applicant
- McCarthy, S.P., “Hey Hackers? Secure Computing Says You Can't Break into This Telnet Site”, Computer Select, 2 p. (Dec. 1995).Applicant
- Merenbloom, P., “Network ‘Fire Walls’ Safeguard LAN Data from Outside Intrusion”, Infoworld, p. 69 & addnl. page (Jul. 25, 1994).Applicant
- Metzger, P., et al., “IP Authentication using Keyed MD5”, Network Working Group, Request for Comments No. 1828, http//ds.internic.net/rfc/rfc1828.txt, 5 p. (Aug. 1995).Applicant
- Obraczka, K., et al., “Internet Resource Discovery Services”, Computer, 8-22, (Sep. 1993).Applicant
- Peterson, L.L., et al., In: Computer Networks, Morgan Kaufmann Publishers, Inc., San Francisco, CA, p. 218-221, 284-286 (1996).Applicant
- Press, L., “The Net: Progress and Opportunity”, Communications of the ACM, 35, 21-25 (Dec. 1992).Applicant
- Schroeder, M.D., et al., “A Hardware Architecture for Implementing Protection Rings”, Communications of the ACM, 15, 157-170 (Mar. 1972).Applicant
- Schwartz, M.F., “Internet Resource Discovery at the University of Colorado”, Computer, 25-35 (Sep. 1993).Applicant
- Smith, R.E., “Constructing a High Assurance Mail Guard”, Secure Computing Corporation (Appeared in the Proceedings of the National Computer Security Conference), 7 p. (1994).Applicant
- Smith, R.E., “Sidewinder: Defense in Depth Using Type Enforcement”, International Journal of Network Management, p. 219-229 (Jul.-Aug. 1995).Applicant
- Stadnyk, I., et al., “Modeling User's Interests in Information Filters”, Communications of the ACM, 35, 49-50 (Dec. 1992).Applicant
- Stempel, S., “IpAccess—An Internet Service Access System for Firewall Installations”, IEEE, 31-41 (1995).Applicant
- Stevens, C., “Automating the Creation of Information Filters”, Communications of the ACM, 35, 48 (Dec. 1992).Applicant
- Thomsen, D., “Type Enforcement: The New Security Model”, SPIE, 2617, 143-150 (1995).Applicant
- Warrier, U.S., et al., “A Platform for Heterogeneous Interconnection Network Management”, IEEE Journal on Selected Areas in Communications, 8, 119-126 (Jan. 1990).Applicant
- White, L.J., et al., “A Firewall Concept for Both Control-Flow and Data-Flow in Regression Integration Testing”, IEEE, 262-271 (1992).Applicant
- Wolfe, A., “Honeywell Builds Hardware for Computer Security”, Electronics, 14-15 (Sep. 2, 1985).Applicant