US 6,954,775 B1Grant
Parallel intrusion detection sensors with load balancing for high speed networks
Issue Date:2005-10-11
•14 Claims
•4 Drawing Sheets
Abstract
Various embodiments of a method and system for detecting unauthorized signatures to or from a local network. Multiple sensors are connected at an internetworking device, which can be a router or a switch. The sensors operate in parallel and each receives a portion of traffic through the internetworking device, at a session-based level or at a lower (packet-based) level. Depending on the type of internetworking device (router or switch) the load balancing mechanism that distributes the packets can be internal or external to the internetworking device. Also depending on the level of packet distribution (session-based or packet-based), the sensors share a network analyzer (if session-based) or both a network analyzer and a session analyzer (if packet-based).
Metadata
Assignee
- Cisco Technology, Inc.
Inventors
- Steven D. Shanklin
- Gerald S. Lathem
Application Information
Application Number:US 10/334,206
Filing Date:2002-12-30
Priority Date:1999-01-15
Art Unit:2135
Patent Drawings (4 sheets)
Description
RELATED PATENT APPLICATION
[0001] This application is a continuation of U.S. application Ser. No. 09/232,276 filed Jan. 15, 1999 entitled Parallel Intrusion Detection Sensors with Load Balancing for High Speed Networks, now U.S. Pat. No. 6,578,147.
TECHNICAL FIELD OF THE INVENTION
[0002] This invention relates to computer networks, and more particularly to prevention of unauthorized access to a local network from computers external to the local network.
BACKGROUND OF THE INVENTION
[0003] Prevention of unauthorized access by outsiders to a computer network is a part of any network management program. This security problem has been complicated by recent trends in internetworking of a previously isolated private networks with value added networks, public networks (such as the internet), and with the networks of other enterprises.
[0004] Firewalls are one approach to preventing unauthorized access. Essentially, a firewall is a control layer inserted between an enterprise's network and the outside. It permits only some traffic to pass through. The firewall is configured by the administrator of the local network based on the enterprise's security policy. For example, the firewall may block traffic of a certain type, traffic from certain addresses, or traffic from all but a predetermined set of addresses.
[0005] Techniques used by network intruders for penetrating network system security have evolved in pace with sophisticated methods for detecting the intruders. Detection methods include software solutions, specifically, software intrusion detection systems, which continually monitor network traffic and look for known patterns of attack.
[0006] When an intrusion detection system detects inappropriate activity, it generates appropriate alarms and provides other responses while the attack is occurring. For example, the intrusion detection system might report the attack, log the attack, and terminate the misused connection.
[0007] One approach to intrusion detection relies on known patterns of unauthorized activity, referred to as “signatures”. These signatures are stored, and, in real time, compared to the packet flow incoming to the network. If a match is found, the incoming datastream is assumed to be misused.
[0008] Many existing intrusion detection systems are host-based rather than network based. A host-based system resides on a particular host computer and detects only attacks to that host. A network-based system is connected at some point on a local network and detects attacks across the entire local network.
[0009] As an example of network-based intrusion detection, one known pattern of unauthorized access is associated with “IP spoofing”, whereby an intruder sends messages to a computer with an IP address indicating that the message is from a trusted port. To engage in IP spoofing, the intruder must first use a variety of techniques to find an IP address of a trusted port and must then modify the packet headers so that it appears that the packets are coming from that port. This activity results in a signature that can be detected when matched to a previously stored signature of the same activity.
SUMMARY OF THE INVENTION
[0010] One aspect of the invention is a method of detecting unauthorized access on a network as indicated by signature analysis of packet traffic on the network. A plurality of intrusion detection sensors are connected at a network entry point associated with an internetworking device, such as a router or switch. The packet load to the sensors is “load balanced”, such that said packets are distributed at least at a session-based level. The load balancing may be at a lower (packet-based) level, which tends to more evenly distribute the load on each sensor but requires additional processing external to the sensors or requires sharing of session-level data between sensors. The sensors are used to detect signatures indicated by the packets. Packets indicating a composite signature from multiple sessions are delivered to a network analyzer, which detects the composite signatures. The results of the detection performed by the sensors and the network analyzer are used to determine if there is an attempt to gain unauthorized access to the network.
[0011] An advantage of the invention is that it provides a processor-based intrusion detection system that can keep up with the high traffic throughput of today's networks. Existing sensors may be used, and the solution provided by the invention is easily scalable.
BRIEF DESCRIPTION OF THE DRAWINGS
[0012] FIG. 1 illustrates a typical computer network, with a “local network” protected by an intrusion detection system (IDS) sensor in accordance with the invention.
[0013] FIG. 2 illustrates an intrusion detection system, used with a router that provides session-based load balancing, and having multiple sensors operating in parallel.
[0014] FIG. 3 illustrates an intrusion detection system, used with a router that provides packet-based load balancing, and having multiple sensors operating in parallel.
[0015] FIG. 4 illustrates an intrusion detection system, integrated into a switch, and having session-based load balancing to multiple sensors operating in parallel.
[0016] FIG. 5 illustrates an intrusion detection system, integrated into a switch, and having packet-based load balancing to multiple sensors operating in parallel.
[0017] FIG. 6 illustrates an intrusion detection system, integrated into a switch, and having packet-based load balancing to multiple sensors operating in parallel, where the load balancing is achieved with arbitration circuits at each sensor.
DETAILED DESCRIPTION OF THE INVENTION
[0018] The invention described herein is directed to a network intrusion detection system that accommodates the higher packet throughput enabled by today's high speed networks. Multiple intrusion detection sensors are used at the entry point to the network, specifically, at an “internetworking device” such as a router or a switch. These devices have in common the function of linking a local network to an external network, such as another local network or to a wide area network using a telecommunications link.
[0019] As explained below, the internetworking device, whether a router or switch, is processor-based and includes load balancing programming, which controls how packets are distributed from the internetworking device to the sensors for processing.
[0020] Two specific embodiments of the invention are described herein. A first embodiment provides multiple sensors at the output of a router. A second embodiment provides multiple sensors inside a switch. In both cases, each sensor is identical to the other sensors and is capable of performing the same intrusion detection processing. The sensors operate in parallel, and analyze packets to determine if any packet or series of packets has a “signature” that matches one of a collection of known intrusion signatures. Thus, the invention provides an easily scalable solution to providing an intrusion detection system whose ability to perform signature analysis can keep up with high speed networks.
[0021] For simplicity of description, each of the embodiments described herein is described in terms of signature analysis of packet datastreams incoming to a local network. However, the same concepts apply to outgoing traffic.
[0022] Intrusion Detection System Overview
[0023] FIG. 1 illustrates a typical computer network, with a “local network” 10 protected by an intrusion detection system (IDS) sensor 11 in accordance with the invention. The local network 10 is the network being secured, with the rest of the network being referred to herein as the “external network”. It is assumed that local network 10 receives and sends data in “packets”, which are switched between network segments via router 12.
[0024] “Intrusion detection” is a term familiar in the art of network security. It includes the various attacks discussed herein, and in general, all types of misuse that may be indicated by signatures.
[0025] Router 12 is of a type known in the field of networking, making connections between networks at the transport layer of the OSI model. Router 12 decides whether to forward a packet by examining the packet's protocol level addresses. Router 12 is capable of handling any datalink protocol, thus, ethernet, FDDI, ISDN, and so on are handled in the same manner.
[0026] Router 12 inspects packets incoming from the external network to determine which should be forwarded into the local network 10. Similarly, packets originating in the local network are inspected to determine whether they are to be forwarded to the external network. As stated above, router 12 is a type of “internetworking device” in that it is used to connect separate network segments. A characteristic of a router is its ability to communicate with other routers outside the local network 10 to determine the best routes for network traffic.
[0027] As explained below, sensor 11 analyzes packets to determine if traffic into and out from local network 10 is misused. Sensor 11 may be implemented as a hardware device or as a combination of hardware and software. Sensor 11 processes a packet by examining its header and payload, as well as its relationship to other packets in the data stream. It detects “signatures” associated with misused access, where a “signature” is an pattern of one or more events represented by strings of binary code.
[0028] Although local network 10 is illustrated as having a “mesh” type topology, this is for purposes of example. Local network 10 could be any system of interconnected computer stations 10a, typically having a server 10b to function as a sort of gateway to network resources.
[0029] Local network 10 may include an IDS manager station 10c, which provides system management personnel with a user interface and system management functionality especially directed to intrusion detection and response. In this case, sensor 11 might forward alarms to station 10c, which may then alert the system manager or automatically take action. Alternatively, sensor 11 may autonomously comprise the entire intrusion detection system. In this case, sensor 11 may have appropriate functionality so that if it detects an intrusion, it can take appropriate action, such as terminating the connection.
[0030] An example of a suitable IDS sensor 11 is the sensor device provided with the NETRANGER intrusion detection system, available from Cisco Systems, Inc. The NETRANGER product also includes director management software for use at station 10c. A feature of the NETRANGER sensors is their ability to monitor almost any type of IP (internet protocol) network, ranging from internet connections, LAN segments, and the network side of dial-in modems. The data link protocol might be any one of various types, such as ethernet, fast ethernet, token ring, or FDDI. However, other types of intrusion detection sensors (often referred to as “signature processors”) could be used and other types of protocols can be analyzed.
[0031] In the example of this description, which is in terms of network traffic using the IP protocol, the packets incoming to local network 10 may adhere to various protocols running on top of the IP protocol or to IP extensions. For example, the IP protocol may have a TCP or UDP protocol running on top of it. The TCP (transmission control protocol) enables two hosts to establish a connection and exchange streams of data and includes various delivery guarantees. The UDP (user datagram protocol) is used primary for broadcasting messages and provides few error recovery services. The ICMP (internet control message protocol) is an extension to IP and supports packets containing various error, control, and informational messages.
[0032] In the example of this description, sensor 11 is capable of examining packets for each of these three IP protocols, i.e., TCP, UDP, and ICMP. In today's networking environments, these IP protocols cover most internet traffic. However, the same concepts could be applied to examination of other protocols, including alternatives to IP.
[0033] Sensor 11 captures network data, and parses each packet before signature analysis occurs. Various capabilities of sensor 11 to support signature analysis include, but are not limited to, checksum verification, hop count checking, IP option checking, MTU checking for maximum packet size, IP fragment reassembly, and TCP stream reassembly, as well as pattern matching.
[0034] The signatures detected by sensor 11 include those associated with malicious intent attacks, denial of service attacks, evasion attempts, and other methods of misuse.
[0035] Signature Analysis Overview
[0036] Signature analysis uses one or more intrusion detection sensors 11, which are installed on a network segment and are transparent to network performance. For purposes of example, the operation of a typical intrusion detection sensor 11 is described herein. However, it should be understood that the basic concepts of the invention are not limited to a particular type of sensor, and can be applied in the context of any hardware/software configuration that is a intrusion signature “sensor” in that it performs signature analysis.
[0037] A sensor 11 contains a detection engine, which examines each packet incoming to the sensor 11, including its header and payload. The sensor 11 also analyzes each packet's relationship to adjacent and related packets in the data stream. If the analysis indicates misuse, the sensor may act autonomously to take action, such as disconnection, or it may send an alarm to a separate intrusion detection management station.
[0038] The signature detection engine of a sensor 11 uses a signature recognition methodology that includes both context and content oriented signature analysis. Context-oriented signatures consist of known network service vulnerabilities that can be detected by inspecting packet headers. Examples of context-oriented signatures are SATAN, TCP Hijacking, and IP spoofing signatures. Content-oriented signatures require the inspection of data fields within a packet to determine if an intrusion has occurred at the application level. These include e-mail and web attack signatures. A sensor 11 might also have the capability to be programmed to analyze packets for customized signatures for a particular network.
[0039] Signatures may also be categorized as being either atomic or composite. Atomic signatures comprise information (context or content) in a single packet. Composite signatures comprise information in multiple packets.
[0040] Network with Parallel Sensors External to Router
[0041] FIGS. 2 and 3 illustrate two embodiments of an intrusion detection system, used with a router, having multiple sensors 21 operating in parallel. In the example of this description, both embodiments have three sensors, but any number of sensors could be used. In each embodiment, the router has a load balancing unit, which distributes packets among the sensors.
[0042] In the embodiment of FIG. 2 , the load balancing is “session-based”, which means that each sensor 21 handles a portion of the sessions incoming to the network. A stream of packets, S1, S2, . . . S6, . . . is illustrated. In the example of FIG. 2 , the load balancing is such that S1 goes to a first sensor, S2 to a second, S3 to a third, S4 to the first, and so on. Thus, each sensor 21 handles one-third of the sessions in a given datastream.
[0043] A network analyzer 25 receives packets from different sessions, which may be used to detect certain types of composite signatures. For example, a “ping” type signature is indicated by multiple sessions that attempt to connect to different destinations with the local network. Single packets indicating ping behavior can be delivered to network analyzer 25, which then monitors similar packets from different sessions to see if a ping pattern is indicated. In general, network analyzer 25 detects signatures of attacks against multiple hosts and different sessions. Such attacks are often detecting using statistical correlations.
[0044] Network analyzer 25 can be implemented using state information. As an example, state information stored in network analyzer 25 may depend on the connectivity associated with a particular signature. For example, a ping sweep signature is a “one-to-many” signature because a source host transmits to a number of destination hosts. Analysis of the ping sweep signature, includes tracking the number of destination hosts to which a source host transmits an ICMP echo request packet. If the threshold of destination hosts is N, then a table of N−1 addresses is maintained for each source host that has transmitted an ICMP echo request packet. Another example of a signature requiring network analyzer 35 is a signature known as a “TCP scan” signature, which is indicated by a series of connections from the same source to different hosts.
[0045] FIG. 3 illustrates an alternative intrusion detection system 30, also having a router 32 and parallel sensors 31, but where the load balancing is “packet-based”. Router 32 has a load balancing unit 32a, which distributes a packet stream comprised of packets P1, P2, . . . P6 . . . . The load balancing is such that P1 goes to a first sensor, P2 to a second, P3 to a third, P4 to the first, and so on.
[0046] As explained above, IP traffic may contain various packet types, such as TCP, UDP, and ICMP. The packet-based load balancing is especially beneficial under “flooding” conditions. For example, packet flooding might result in a series of only TCP packets. Even in this situation, each sensor 31 processes only one-third of the packets. Thus, even if the traffic is flooded with one type of packet, each processor will handle the same load.
[0047] Like intrusion detection system 20, system 30 uses a network analyzer 35, which detects signatures requiring packet information from packets of different sessions. As explained above, network analyzer 35 primarily detects correlations among signatures in different sessions.
[0048] Additionally, system 30 has a session analyzer 36, which stores information used to detect signatures from different packets in the same session. For example, a first sensor 31 might receive a packet indicating a signature that would be comprised of different packets from the same session. Because that sensor 31 does not necessary process all packets from the same session, the suspicious packet would be delivered to session analyzer 36, which would receive suspicious packets from other sensors 31, and determine whether the signature had been transmitted to the local network 10. Session analyzer 36 might be as simple as a counting mechanism, that counts signatures of a certain type. Or session analyzer 36 might process state information, such as determining that a packet indicates a state A, then determining if a second packet indicates a state B, etc.
[0049] For the embodiments of both FIG. 2 and FIG. 3 , the load balancing unit 22a or 32a could be implemented as software or hardware, or some combination of the two. Each sensor 21 or 31 receives only the packets that it will process.
[0050] For a software implementation of the load balancing unit 22a or 32a, routing to sensors 21 and 31 can be performed with appropriate modifications to existing router software. Like other IP routing, the decision of which sensor 21 or 31 will receive a particular packet (or session of packets) is determined by an address associated with the sensor. For example, each sensor 21 or 31 might have a unique IP address so that routing is performed as with other IP-addressed destinations. The sensors receive copies of the same packets that are destined to the local network. Specifically, a “copy to” operation is used to send each packet to the appropriate sensor as well as to the destination in local network 10 to which the packet is addressed. For example, router 21 may encapsulate the packet so that its new header information addresses the packet to the appropriate sensor. The addressing to sensors 21 or 31 need not be IP addressing—various other transport addressing mechanisms could be used.
[0051] If desired, the load balancing software can be programmed so that certain destinations are included or excluded. For example, router 22 or 32 could be programmed so that only packets destined for a given range of IP addresses are copied to intrusion detection sensors. Thus, if router 22 or 32 were connected to two local networks, only packets incoming from the external network could be directed to the sensors and not packets being transported between the local networks.
[0052] Network with Sensors Internal to Switch
[0053] FIGS. 4–6 illustrate various configurations for using intrusion detection sensors operating in parallel, internal to a switch. As explained below, FIG. 4 illustrates an intrusion detection system with session-based load balancing, whereas the systems of FIGS. 5 and 6 have packet-based load balancing. FIGS. 4 and 5 illustrate two different ways of using a load balancing unit within the switch, whereas FIG. 6 illustrates an arbitration circuit at each sensor. Either session-based or packet-based load balancing may be used with any of the three techniques for distributing packets.
[0054] For purposes of this description, a “switch” is a multiport device that filters and forwards packets between network segments. It operates at multiple layers of the OSI model and therefore is capable of supporting any packet protocol. A switch may or may not include routing capabilities, and in the former case, is sometimes referred to as a routing switch.
[0055] As stated above, a switch is a type of “internetworking” device. An example of a suitable switch, and the one used for purposes of example herein, is the CATALYST 6000 switch manufactured by Cisco Systems, Inc. This switch has a backplane and bus architecture to which sensors may be easily connected, typically by connecting one or more printed circuit boards, each having circuitry for one or more sensors.
[0056] For purposes of this description, only those elements of the switch relevant to intrusion detection are illustrated. A typical high speed data switch has a complex-internal structure with various buffers and control structures other than shown in FIGS. 3–6 .
[0057] FIG. 4 illustrates a switch 40 having internal intrusion detection sensors 41. Switch 40 has multiple ports, each having an associated port adapter 44 and each capable of supporting a single end station or another network. Packets are forwarded by switch 40 based on the destination address. Essentially, the operation of switch 40 is such that its control unit 43 ensures that only packets having a certain address are output from the port associated with that address.
[0058] A high speed internal bus transports packets within switch 40. As an example, internal bus might transport data at a rate of 16 gigabits per second, whereas the output from each port 44 is 100 megabits per second. Thus, the packet throughput internal to switch 40 exceeds the throughput of any output port on the switch 40. In a bus-based switch such as switch 40, sensors 41 may be connected onto the bus, but the invention could be implemented with other switches with different internal transport mechanisms. For example, the invention could be implemented with a “worm-hole routing” type switch.
[0059] For purposes of intrusion detection, it is assumed that no single sensor could process all packets being processed by the switch 40. A sensor at each port would not have access to all packets. The solution, as illustrated in FIG. 4 , is the use of multiple intrusion detection sensors 41 and a load balancer 42 internal to switch 40. Load balancer 42 distributes traffic so that each sensor 41 processes only one Nth of the traffic in and out of switch 40, where N is the number of sensors 41.
[0060] Sensors 41 may be substantially the same as sensors 21 and 31 of FIGS. 2 and 3 . Various types of sensors 41 can be used, with the common characteristic being that each sensor 41 analyzes packets to determine if unauthorized intrusion is indicated.
[0061] In the embodiment of FIG. 4 , load balancer 42 provides “session-based” load balancing, where all packets for a particular session are delivered to the same one of sensors 31. Load balancer 42 operates by inspecting each packet of the entire stream of network traffic and retransmitting them to the appropriate sensor 41.
[0062] Sensors 41 each access a network analyzer 45, which accommodates signatures that require analysis of packets from more than one session. Network analyzer 45 is similar to the network analyzers 25 and 35 described above, and receives packets from sensors that indicate an attack across multiple sessions.
[0063] FIG. 5 illustrates an alternate embodiment, a switch 50, which implements “packet-based” load balancing. In this embodiment, packets from the same session may be distributed to different sensors 51.
[0064] Rather than receiving and retransmitting packets, load balancer 52 delivers control signals to sensors 51. These control signals communicate to each sensor 51 which packets are to be processed by that sensor 51.
[0065] For packet-based load balancing, switch 50 has both a network analyzer 55 and a session analyzer 56. These elements operate in a manner similar to the network analyzers 25, 35, 45 and session analyzer 36 described above.
[0066] In the embodiments of both FIG. 4 and FIG. 5 , load balancing is achieved with a load balancing unit external to the sensors. Two alternative means for distributing packets are described—one involving retransmittal of packets through the load balancer and the other involving the use of control signals to the sensors. These techniques could be interchanged for session-based and packet-based load balancing.
[0067] FIG. 6 illustrates a variation of a packet-based load balancing switch, a switch 60 whose sensors 61 each have an arbitration circuit 61a for determining packet distribution. An arbitration bus 67 carries, among the sensors 61, control signals used to control packet distribution. The arbitration circuit 61a at the front end of each sensor 61 determines which packets shall be analyzed by that sensor. Although the embodiment of FIG. 6 is shown as being packet-based, session-based arbitration could also be performed and would eliminate the need for shared signature memory 66.
Other Embodiments
[0068] Although the present invention has been described in detail, it should be understood that various changes, substitutions, and alterations can be made hereto without departing from the spirit and scope of the invention as defined by the appended claims.
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
1. A system for detecting network intrusion, comprising:
an internetworking device coupled with a network, and being operable to receive a plurality of packets;
a plurality of intrusion detection sensors coupled for communication with the internetworking device, wherein the plurality of intrusion detection sensors operate in parallel;
a load balancer being operable to determine a distribution of the plurality of packets to one or more of the plurality of intrusion detection sensors; and
an analyzer being operable to detect a composite signature of more than one of the plurality of packets, the composite signature being associated with an unauthorized attempt at access to the network contained in more than one session.
2. The system of claim 1, wherein the at least one sensor comprises a detection engine operable to examine a header and payload of the at least one of the plurality of packets.
3. A system for detecting network intrusion, comprising:
means for receiving a plurality of packets at an internetworking device coupled with a network;
means for distributing the plurality of packets to a plurality of intrusion detection sensors operating in parallel, in accordance with a load balancing technique;
means for detecting a composite signature of more than one of the plurality of packets; and
means for determining whether the composite signature is associated with unauthorized access to the network.
4. A system of detecting unauthorized access on a network having a plurality of intrusion detection sensors at a network entry point associated with an internetworking device as indicated by signature analysis of packet traffic on the network, comprising:
means for balancing a packet load to said sensors, such that said packets are distributed at least at a session-based level;
means for detecting signatures indicated by said packets delivered to said sensors;
means for delivering packets indicating a composite signature from multiple sessions to a network analyzer;
means for detecting composite signatures delivered to said network analyzer; and
means for using the results of said detecting steps to determine unauthorized access to said network.
5. A system of detecting unauthorized access on a network having a plurality of intrusion detection sensors at a network entry point associated with an internetworking device, comprising:
means for balancing a packet load to said sensors, such that packets are distributed at a packet-based level;
means for detecting signatures indicated by said packets delivered to said sensors;
means for delivering packets indicating a composite signature to an analyzer;
means for detecting a composite signature delivered to said analyzer; and
means for using the results of said detecting steps to determine unauthorized access to said network.
6. A system of detecting unauthorized access on a network having a plurality of intrusion detection sensors between a router and a local network, comprising:
means for balancing a packet load to said sensors, such that packets are distributed at a packet-based level;
means for detecting signatures indicated by said packets delivered to said sensors;
means for delivering packets indicating a composite signature to an analyzer;
means for detecting a composite signature delivered to said analyzer; and
means for using the results of said detecting steps to determine unauthorized access to said network.
7. A system of using a switch to detect unauthorized access on a network, having means for providing a plurality of intrusion detection sensors within a switch, comprising:
means for balancing a packet load to said sensors, such that packets are distributed at a packet-based level;
means for detecting signatures indicated by said packets delivered to said sensors;
means for delivering packets indicating a composite signature to an analyzer;
means for detecting a composite signature delivered to said analyzer; and
means for using the results of said detecting steps to determine unauthorized access to said network.
8. Logic encoded in media for detecting network intrusion, the logic being operable to perform the following steps:
receiving a plurality of packets at an internetworking device coupled with a network;
distributing the plurality of packets to one or more of a plurality of intrusion detection sensors operating in parallel, in accordance with a load-balancing technique;
detecting a composite signature of more than one the plurality of packets; and
determining whether the composite signature is associated with unauthorized access to the network.
9. Logic encoded in media for detecting network intrusion of a network having a plurality of intrusion detection sensors at a network entry point associated with an internetworking device, the logic being operable to perform the following steps:
balancing a packet load to said sensors, such that said packets are distributed at least at a session-based level;
detecting signatures indicated by said packets delivered to said sensors;
delivering packets indicating a composite signature from multiple sessions to a network analyzer;
detecting composite signatures delivered to said network analyzer; and
using the results of said detecting steps to determine unauthorized access to said network.
10. Logic encoded in media for detecting network intrusion of a network having a plurality of intrusion detection sensors at a network entry point associated with an internetworking device, the logic being operable to perform the following steps:
balancing a packet load to said sensors, such that packets are distributed at a packet-based level;
detecting signatures indicated by said packets delivered to said sensors;
delivering packets indicating a composite signature to an analyzer;
detecting the composite signature delivered to said analyzer; and
using the results of said detecting steps to determine unauthorized access to said network.
11. Logic encoded in media for detecting network intrusion on a network having a plurality of intrusion detection sensors coupled with a router and a local network, the logic being operable to perform the following steps:
balancing a packet load to said sensors, such that packets are distributed at a packet-based level;
detecting signatures indicated by said packets delivered to said sensors;
delivering packets indicating a composite signature to an analyzer;
detecting the composite signature delivered to said analyzer; and
using the results of said detecting steps to determine unauthorized access to said network.
12. Logic encoded in media for detecting network intrusion of a network having a plurality of intrusion detection sensors coupled with a switch, the logic being operable to perform the following steps:
balancing a packet load to said sensors, such that packets are distributed at a packet-based level;
detecting signatures indicated by said packets delivered to said sensors;
delivering packets indicating a composite signature to an analyzer;
detecting the composite signature delivered to said analyzer; and
using the results of said detecting steps to determine unauthorized access to said network.
13. A system for detecting network intrusion, comprising:
a router coupled with an external network and a local network, and being operable to receive a plurality of packets from the external network and route the plurality of packets to the local network, and wherein the plurality of packets constitute at least one session;
a plurality of intrusion detection sensors arranged to operate in parallel and coupled between the router and the local network, and wherein the plurality of intrusion detection sensors are operable to detect a first signature contained in one of the plurality of packets, the first signature being associated with unauthorized access to the local network, and wherein the unauthorized access to the local network is associated with a malicious intent attack, a denial of service attack, an evasion attempt attack, or IP spoofing;
a load balancer being operable to determine a distribution of the plurality of packets to one or more of the plurality of intrusion detection sensors, wherein the distribution of the plurality of packets results in each of the plurality of intrusion detection sensors receiving an equal number of packets;
a session analyzer being operable to detect a second signature contained in more than one of the plurality of packets from a single session; and
a network analyzer being operable to detect a third signature contained in more than one of the plurality of packets from more than one session.
14. The method of claim 13, wherein the detection of the composite signature comprises performing a signature analysis selected from the group consisting of checksum verification, hop count checking, IP option checking, MTU checking for maximum packet size, IP fragment reassembly, and TCP stream assembly.
Patent Citations (64)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4672572(A) | 1987-06-01 | Alsberg | Applicant |
| US4769771(A) | 1988-09-01 | Lippmann et al. | Applicant |
| US5003595(A) | 1991-03-01 | Collins et al. | Applicant |
| US5032979(A) | 1991-07-01 | Hecht et al. | Applicant |
| US5101402(A) | 1992-03-01 | Chiu et al. | Applicant |
| US5278901(A) | 1994-01-01 | Shieh et al. | Applicant |
| US5365580(A) | 1994-11-01 | Morisaki | Applicant |
| US5375070(A) | 1994-12-01 | Hershey et al. | Examiner |
| US5414833(A) | 1995-05-01 | Hershey et al. | Applicant |
| US5448724(A) | 1995-09-01 | Hayashi | Applicant |
| US5488715(A) | 1996-01-01 | Wainwright | Applicant |
| US5524238(A) | 1996-06-01 | Miller et al. | Applicant |
| US5555377(A) | 1996-09-01 | Christensen et al. | Applicant |
| US5557742(A) | 1996-09-01 | Smaha et al. | Applicant |
| US5606668(A) | 1997-02-01 | Shwed | Applicant |
| US5621889(A) | 1997-04-01 | Lermuzeaux et al. | Applicant |
| US5623601(A) | 1997-04-01 | Vu | Applicant |
| US5634008(A) | 1997-05-01 | Gaffaney et al. | Applicant |
| US5682478(A) | 1997-10-01 | Watson et al. | Applicant |
| US5699513(A) | 1997-12-01 | Feigen et al. | Applicant |
| US5751964(A) | 1998-05-01 | Ordanic et al. | Applicant |
| US5757916(A) | 1998-05-01 | MacDoran et al. | Applicant |
| US5757924(A) | 1998-05-01 | Friedman et al. | Applicant |
| US5774660(A) | 1998-06-01 | Brendel, et al. | Applicant |
| US5781550(A) | 1998-07-01 | Templin et al. | Applicant |
| US5784559(A) | 1998-07-01 | Frazier et al. | Applicant |
| US5793763(A) | 1998-08-01 | Mayes, et al. | Applicant |
| US5793951(A) | 1998-08-01 | Stein et al. | Applicant |
| US5796942(A) | 1998-08-01 | Esbensen | Applicant |
| US5798706(A) | 1998-08-01 | Kraemer et al. | Applicant |
| US5805801(A) | 1998-09-01 | Holloway et al. | Applicant |
| US5826014(A) | 1998-10-01 | Coley et al. | Applicant |
| US5828846(A) | 1998-10-01 | Kirby et al. | Applicant |
| US5864666(A) | 1999-01-01 | Shrader | Applicant |
| US5867647(A) | 1999-02-01 | Haigh et al. | Applicant |
| US5886643(A) | 1999-03-01 | Diebboll et al. | Applicant |
| US5892903(A) | 1999-04-01 | Klaus | Applicant |
| US5918021(A) | 1999-06-01 | Aditya | Applicant |
| US5919257(A) | 1999-07-01 | Trostle | Applicant |
| US5931946(A) | 1999-08-01 | Terada, et al. | Applicant |
| US5958009(A) | 1999-09-01 | Friedrich, et al. | Applicant |
| US5958053(A) | 1999-09-01 | Denker | Applicant |
| US5968176(A) | 1999-10-01 | Nessett et al. | Applicant |
| US5991881(A) | 1999-11-01 | Conklin, et al. | Applicant |
| US6003030(A) | 1999-12-01 | Kenner et al. | Applicant |
| US6009475(A) | 1999-12-01 | Shrader | Applicant |
| US6035404(A) | 2000-03-01 | Zhao | Applicant |
| US6061650(A) | 2000-05-01 | Malkin et al. | Applicant |
| US6088804(A) | 2000-07-01 | Hill et al. | Applicant |
| US6108310(A) | 2000-08-01 | Wilkinson et al. | Applicant |
| US6128642(A) | 2000-10-01 | Doraswamy et al. | Applicant |
| US6256306(B1) | 2001-07-01 | Bellenger | Examiner |
| US6279113(B1) | 2001-08-01 | Vaidya | Applicant |
| US6301668(B1) | 2001-10-01 | Gleichauf et al. | Applicant |
| US6321337(B1) | 2001-11-01 | Porras, et al. | Applicant |
| US6393438(B1) | 2002-05-01 | Kathrow et al. | Examiner |
| US6460082(B1) | 2002-10-01 | Lumelsky et al. | Examiner |
| US6529515(B1) | 2003-03-01 | Raz et al. | Examiner |
| US6550012(B1) | 2003-04-01 | Villa et al. | Examiner |
| US6658565(B1) | 2003-12-01 | Gupta et al. | Examiner |
| US6697103(B1) | 2004-02-01 | Fernandez et al. | Examiner |
| US6738814(B1) | 2004-05-01 | Cox et al. | Applicant |
| US6804778(B1) | 2004-10-01 | Levi et al. | Examiner |
| US6853619(B1) | 2005-02-01 | Grenot | Examiner |
Non-Patent Literature (110)
- “Introduction to Algorithms,” by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Chapter 34, pp. 853-885, © 1990.Applicant
- Microsoft Press; Microsoft Corporation, “Microsoft Press Computer Dictionary,” 1997, 3rd Ed., pp. 415 and 454, includes two pages (printouts).Applicant
- Scambray, J., Infoworld Publications, Inc., “Package Detects Most Intrusions.” Feb. 1998. vol. 20, pp. 43-48.Applicant
- Millikin M., Horizon House Publications, Inc., “Managing Intranet Complexity with Open-System Tools.” Aug. 1997. vol. 31, pp. S10-S12, includes five pages (printouts).Applicant
- Thomas, B., Business Wire, “Enigma Logic Introduces Safe Word As Advanced Client Server Software For Secure User Authentication.” May 1995. Section 1, includes two pages (printouts).Applicant
- “The Design of GrIDS: A Graph-Based Intrusion Detection System,” S. Cheung et al., U.C. Davis Computer Science Department Technical Report SCE99-2, 1999, pp. 147, (found at http://seclab.cs.ucdavis.edu/papers.html.), Jan. 26, 1999.Applicant
- “Luby-Rackoff Backwards: Increasing Security by Making Block Ciphers Non-Invertible”, M. Bellare, et al., Advances in Cryptology-Eurocrypt 98 Proceedings, Lecture Notes in Computer Science, vol. 1403 Springer-Verlat (1998) pp. 1-27, (found at http://seclab.cs.ucdavis.edu/papers.html.), Oct. 17, 1998.Applicant
- “Detecting Disruptive Routers: A Distributed Network Monitoring Approach,” K.A. Bradley, et al., Proceedings of the 1998 IEEE Symposium on Security and Privacy, Oakland, CA, pp. 115-124 (found at http://seclab.cs.ucdavis.edu/papers.html.), May 1, 1998.Applicant
- Abstract entitled “Teaching Computer Security” by M. Bishop, May 1, 1993.Applicant
- Abstract entitled “Recent Changes to Privacy Enhanced Electronic Mail” by M. Bishop, Journal of Internetworking: Research and Experience. vol. 4, No. 1, pp. 47-59. (found at http://seclab.cs.ucdavis.edu/papers.html), Mar. 1, 1993.Applicant
- “Analysis Of An Algorithm For Distributed Recognition And Accountability”, Ko et al., Proc. 1st ACM Conference on Computer and Communication Security. Fairfax, VA, Nov. 1993, 11 pages, (found at http://seclab.cs.ucdavis.edu/papers.html).Applicant
- “Secure RPC Authentication (SRA) for TELNET and FTP,” D.R. Safford, et al., pp. 1-5, (found at http://www.cs.purdue.edu/coast/archive/data/categ30.html), 1993.Applicant
- Master Thesis entitled “Paradigms for the Reduction of Audit Trails” by B. Wetmore, pp. i-6. Unable to obtain entire thesis—portion downloaded from http://seclab.cs.ucdavis.edu/papers.html, 1993.Applicant
- Master Thesis entitled “USTAT A Real-time Intrusion Detection System for UNIX”, Univeristy of California, K. Ilgun, pp. 1-204, (found at http://www.cs.purdue.edu/coast/archive/data/categ24.html), Nov. 1, 1992.Applicant
- “OARnet Security Procedures”, K. Varadhan, pp. 1-14, (found at http://www.cs.purdue.edu/coast/archive/data.categ30.html), Sep. 15, 1992.Applicant
- “A Best-Case Network Performance Model”, S.M. Bellovin, pp. 1-10, (found at http://www.cs.purdue.edu/coast/archive/data/categ30.html), Feb. 12, 1992.Applicant
- “Anatomy of a Proactive Password Changer”, Matt Bishop, Proc. of the UNIX Security Symposium III Baltimore, MD, 15 pages. (found at http://seclab.cs.ucdavis.edu/paper.html), 1992.Applicant
- Dissertation entitled “Issues in Debugging Sequential and Concurrent Programs: Methods, Techniques, and Implementation”, Univeristy of California, Wingshun Wilson Ho, 191 pages. (found at http://seclab.cs.ucdavis.edu/papers.html), 1992.Applicant
- “Open System Security—an Architectural Framework”, Arto T. Karila, (found at http://www/cs.purdue.edu/coast/archive/data.categ.30.html), Jun. 30, 1991.Applicant
- Abstract entitled “Verification of Secure Distributed Systems in Higher Order Logic: A Modular Approach Using Generic Components” by.J. Alves-Foss, K. Levitt, Proc. of the 1991 IEEE Computer Society Symposium on Research in Security and Privacy, Oakland CA May 20-22, 1991, pp. 122-135. (found at http://seclab.cs.ucdavis.edu/papers.html), May 1, 1991.Applicant
- Abstract entitled “Password Management” by M. Bishop, COMPCON Spring '91. Digest of Papers. San Francisco, CA, Feb. 25, 1991, pp. 167-169. (found at http://seclab.cs.ucdavis.edu/papers.html), Mar. 1, 1991.Applicant
- Abstract entitled “An Authentication Mechanism for USENET” by M. Bishop, Proc. of the Winter 1991 USENIX Conference. Jan. 21-25, 1991, pp. 281-287, (found at http://seclab.cs.ucdavis.edu/papers.html), Jan. 1, 1991.Applicant
- “DIDS (Distributed Intrusion Detection System)—Motivation, Architecture, and An Early Prototype”, Snapp et al., Proc. 14th National Computer Security Conference, Washington, DC (9 pages.) (found at http://seclab.cs.ucdavis.edu/papers.html), 1991.Applicant
- “Data Level Inference Detection in Database Systems,” R.W. Yip et al., Proceedings of the 11th IEEE Computer Security Foundations Workshop, Rockport, Massachusetts,(found at http://seclab.cs.ucdavis.edu/papers.html.), 1998.Applicant
- “Stack and Queue Integrity on Hostile Platforms,” P.T. Devanbu, et al., IEEE Symposium on Security and Privacy, Oakland CA, (found at http://seclab.cs.ucdavis.edu.edu/papers.html.), 1998.Applicant
- “Techniques for Trusted Software Engineering,” P.T. Devanbu et al., Proceedings of the 20th International Conference on Software Engineering, Kyoto, Japan, (found at http://seclab.cs.ucdavis.edu/papers.html.), 1998.Applicant
- “The Design and Implementation of a Data Level Database Inference Detection System,”. Yip et al., Proceedings of the Twelfth Annual IFIP WG 11.3 Working Conference on Database Security, Chalkidiki, Greece 14 pages, (found at http://seclab.cs.ucdavis.edu/papers.html.), 1998.Applicant
- “Bucket Hashing and its Application to Fast Message Authentication”, Phillip Rogaway, Acvances in Cryptology—CRYPTO '95. (found at http://seclab.cs.ucdavis.edu/papers.html.), Oct. 13, 1997.Applicant
- “A Software-Optimized Encryption Algorithm”, Rogaway et al., Proc. of the Fast Software Encryption Cambridge Security Workshop, Cambridge, UK (16 pages.) (found at http://seclab.cs.ucdavis.edu/papers.html), Sep. 5, 1997.Applicant
- “Cryptographic Verfication of Test Coverage Claims,” P. Devanbu et al., Proceedings, Fifth ACM/SIGSOFT Conference on Foundations of Software Engineering Zurich, Switzerland) (found at http://seclab.cs.ucdavis.edu/papers.html.), Feb. 12, 1997.Applicant
- “An Efficient Message Authentication Scheme for Link State Routing,” S. Cheung, Proc. 13th annual Computer Security Applications Conference, San Diego, CA, 9 pages, (found at http://seclab.cs.ucdavis.edu/papers.html.), 1997.Applicant
- “Protecting Routing Infrastructures from Denial of Service Using Cooperative Intrusion Detection,” S. Cheung et al., Proc. new Security Paradigms Workshop, Cumbria, UK 13 pages, found at http://seclab.cs.ucdavis.edu/papers.html.), 1997.Applicant
- “Extending The TakeGrant Protection System,” J. Frank et al., The IEEE Oakland Conference on Research in Security and Privacy., (found at http://seclab.cs.ucdavis.edu/papers.html.), Dec. 5, 1996.Applicant
- “A Methodology for Testing Intrusion Detection Systems,” Puketza et al., IEEE Transactions on Software Engineering, vol. 22, No. 10, (found at http://seclab.cs.ucdavis.edu/papers.html), Sep. 27, 1996.Applicant
- “IDIOT-User Guide”, M. Crosbie, et al., pp. 1-63, (found at http://www.cs.purdue.edu/coast/archive/data/categ24.html), Sep. 4, 1996.Applicant
- “Use of A Taxonomy of Security Faults”, T. Aslam, et al., pp. 1-10, (found at http://www.cs.purdue.edu/coast/archive/data/categ24.html), Sep. 4, 1996.Applicant
- “A Few Attacks on the Zero Knowledge State in Novell's Netware”, Greg Miller, pp. 111. (found at http;//www.cs.purdue.edu/coast/archive/data/categ30.html), Jul. 30, 1996.Applicant
- “The Exact Security of Digital Signatures-How to Sign with RSA and Rabin”, Bellare et al. Earlier version appears in Advances in Cryptology--Eurocrypt '96, LNCS vol. 1070, U. Maurer ed., Springer-Verlag, pp. 399-416), (found at http://seclab.cs.ucdavis.edu/papers.html), Mar. 14, 1996.Applicant
- “An Isolated Network for Research,” Bishop et al., The 19th NISSC, pp. 1-9, (found at http://seclab.cs.ucdavis.edu/papers.html), 1996.Applicant
- “Attack Class: Address Spoofing,” Heberlein et al., The 19th National Information Systems Security Conference, (found at http://seclab.cs.ucdavis.edu/papers.html), 1996.Applicant
- “Checking for Race Conditions in File Accesses,” Bishop et al., Computing Systems 9(2)., (found at http://seclab.cs.ucdavis.edu/papers.html.), 1996.Applicant
- “Goal-Oriented Auditing and Logging,” Bishop et al., submitted to IEEE Transactions on Computing Systems, (found at http://seclab.cs.ucdavis.edu/papers.html.), 1996.Applicant
- “GrIDS-A Graph Based Intrusion Detection System For Large Networks”, Staniford-Chen et al., The 19th NISSC. 10 pages, (found at http://seclab.cs.ucdavis.edu/papers.html), 1996.Applicant
- “How to Protect DES Against Exhaustive Key Search”, Kilian et al., Advances in Cryptology—CRYPTO '96., (found at http://seclab.cs.ucdavis.edu/papers.html), 1996.Applicant
- “NetKuang—A Multi-Host Configuration Vulnerablility Checker”, Zerkle et al., Proc. of the 6th USENIX Security Symposium, San Jose, CA., (found at http://seclab.cs.ucdavis.edu/papers.html), 1996.Applicant
- “Network Security Via Reverse Engineering of TCP Code: Vulnerability Analysis and Proposed Solutions,” Guha et al., Proc. of the IEEE Infocom '96, San Francisco, CA (found at http://seclab.cs.ucdavis.edu/papers.html.), 1996.Applicant
- PhD. Theses entitled “Execution Monitoring Of Security-Critical Programs In A Distributed System: A Specification-Based Approach,” Calvin Cheuk Wang Ko, 111 pages, (found at http://seclab.cs.ucdavis.edu/papers.html), 1996.Applicant
- “Optimal Asymmetric Encryption—How to Encrypt with RSA”, Bellare et al., Eurocrypt '94, 20 pages, (found at http://seclab.cs.ucdavis.edu/papers.html.), Nov. 19, 1995.Applicant
- “XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions”, Bellare et al.,Advances in Cryptology—CRYPTO '95, (found at http://seclab.cs.ucdavis.edu/papers.html), Oct. 1, 1995.Applicant
- “Audit Log Analysis Using the Visual Audit Browser Toolkit”, Hoagland et al., U.C. Davis Computer Science Department Technical Report CSE95-11, (found at http://seclab.cs.ucdavis.edu/papers.html), Sep. 13, 1995.Applicant
- “WAN-hacking with AutoHack-Auditing Security Behind the Firewall”, Alec Muffet, 14 pages, (found at http://www.cs.purdue.edu/coast/archive/data/categ30.html), Jun. 6,1995.Applicant
- Short presentation entitled “Intrusion Detection for network Infrastructures” by S. Cheung, K.N. Levitt, C. Ko. The 1995 IEEE Symposium on Security and Privacy, Oakland CA, May 1, 1995.Applicant
- “A Software Architecture to Support Misuse Intrusion Detection”, S. Kumar, et al., pp. 1-17, (found at http://www.cs.purdue.edu/coast/archive/data/categ24.html), Mar. 17, 1995.Applicant
- “Random Oracles are Practical : A Paradigm for Designing Efficient Protocols”, Bellare et al., Proc. of the 1st ACM Conference on Computer and Communication Security, Fairfax, VA, Nov. 1993, pp. 1545164. (found at http://seclab.cs.ucdavis.edu/papers.html), Feb. 14, 1995.Applicant
- “Holding Intruders Accountable on the Internet”, Staniford-Chen et al., Proc. of the 1995 IEEE Symposium on Security and Privacy, Oakland, CA, (11 pages) (found at http://seclab.cs.ucdavis.edu/papers.html), 1995.Applicant
- “Improving System Security via Proactive Password Checking”, Matt Bishop,Computers & Security, vol. 14, No. 3, pp. 233-249, (found at http://seclab.cs.ucdavis.edu/papers.html), 1995.Applicant
- “Network Security Monitor”, L. Todd Heberlein , Lawerence Livermore National Laboratory project deliverable, (found at http://seclab.cs.ucdavis.edu/papers.html), 1995.Applicant
- “Simulating Concurrent Intrusions for Testing Intrusion Detection Systems: Parellelizing Intrusions”, Chung et al., Proc. of the 1995 NISSC, Baltimore, MD, 11 pages, (found at http://seclab.cs.ucdavis.edu/papers.html), 1995.Applicant
- Abstract entitled “Theft of Information in the TakeGrant Protection Model”, Matt Bishop, Journal of Computer Security, vol. 3, No. 4, (found at http://seclab.cs.ucdavis.edu/papers.html), 1995.Applicant
- “Property-based Testing of Privileged Programs”, Fink et al., Proc. of the 10th Annual Computer Security Applications Conference, Orlando, FL. 10 pages, (found at http://seclab.cs.ucdavis.edu/papers.html), Dec. 1, 1994.Applicant
- “Preliminary Report on Advanced Security Audit Trail Analysis on UNIX”, N. Habra et al., pp. 134 (found at http://www.cs.purdue.edu/coast/archive/data/categ24.html), Sep. 26, 1994.Applicant
- “Information Security and Privacy in Network Environments”, U.S. Office of Technology Assessment, OTATCT606 (Washington DC: US Government Printing Office), Sep. 20, 1994.Applicant
- “An Application of Pattern Matching in Intrusion Detection”, S. Kumar, et al., pp. 1-55, (found at http://www.cs.purdue.edu/coast/archive/data/categ24.html), Jun. 17, 1994.Applicant
- “Artificial Intelligence and Intrusion Detection: Current and Future Directions”, Jeremy Frank, pp. 1-12, (found at http://www.cs.purdue.edu/coast/archive/data/categ24.html), Jun. 9, 1994.Applicant
- “Artificial Intelligence and Intrusion Detection: Current and Future Directions”, Jeremy Frank, Proc. of the 17the National Computer Security Conference. 12 pages, (found at http://seclab.cs.ucdavis.edu/papers.html), Jun. 9, 1994.Applicant
- “Paving The Road To Network Security Or The Value Of Small Cobblestones”, H. Orman, et al., pp. 1-17, (found at http://www.cs.purdue.edu/coast/archive/data/categ30.html), May 23, 1994.Applicant
- “MCF: A Malicious Code Filter”, R.W. Lo et al., Computers & Security, (1995) vol. 14, No. 6. (27 pages.), (found at http://seclab.cs.ucdavis.edu/papers.html), May 4, 1994.Applicant
- “Network Intrustion Detection”, Mukherjee et al., IEEE Network, Jun. 1994, vol. 8, No. 3, pp. 26-41. (found at http://seclab.cs.ucdavis.edu/papers.html), May 1994.Applicant
- “Defending a Computer System Using Autonomous Agents”, M. Crosbie, et al., pp. 1-11, (found at http://www.cs.purdue.edu/coast/archive/data/categ24.html), Mar. 11, 1994.Applicant
- Abstract entitled “A Modified Random Perturbation Method for Database Security” by P. Tendick, N. Matloff, ACM Transactions on Database Systems, vol. 19, No. 1, pp. 47-63, (found at http://seclab.cs.ucdavis.edu/papers.html), Mar. 1, 1994.Applicant
- “Automated Detection of Vulnerabilities in Privileged Programs by Execution Monitoring”, Ko et al., Proc. of the 10th Annual Computer Security Applications Conference, Orlando, FL. (found at http://seclab.cs.ucdavis.edu/papers.html), 1994.Applicant
- “Common Techniques in FaultTolerance and Security”, Levitt et al., Proc. of the Dependable Computing for Critical Applications 4, San Diego, CA. 4 pages, (found at http://seclab.cs.ucdavis.edu/papers.html), 1994.Applicant
- “The Security of Cipher Block Chaining”, Bellare et al., Advances in Cryptology—CRYPTO '94, Santa Barbara CA. (19 pages.) (found at http://seclab.cs.ucdavis.edu/papers.html), 1994.Applicant
- “Towards a Property-based Testing Environment with Applications to Security-Critical Software”, Fink et al., Proc. of the 4th irvine Software Symposium. 10 pages, (found at http://seclab.cs.ucdavis.edu/papers.html), 1994.Applicant
- “Packets Found on an Internet”, S. Bellovin, pp. 1-6, (found at http://www.cs.purdue.edu/coast/archive/data/categ30.html), Aug. 23, 1993.Applicant
- “Entity Authentication and Key Distribution”, Bellare et al., Advances in Cryptology—CRYPTO '93, Santa Barbara, CA, pp. 232-249. (found at http://seclab.cs.ucdavis.edu/papers.html), Aug. 1, 1993.Applicant
- Masters Thesis entitled “Addressing Weaknesses In The Domain Name System Protocol”, Purdue University, Christoph Schuba, pp. 1-87., (found at http://www.cs.purdue.edu/coast/archive/data/categ30,html), Aug. 1, 1993.Applicant
- “Proactive Password Checking”, Matt Bishop, Proc. of the 7th International Conference on Information Security, May 1991, pp. 169-181. (found at http://seclab.cs.ucdavis.edu/papers.html).Applicant
- Abstract entitled “A Security Analysis of the NTP Protocol Version 2” by M. Bishop, Dec. 1, 1990.Applicant
- “ACMAINT: An Account Creation and Maintenance System for Distributed UNIX Systems”, D.A. Curry, et al., pp. 1-9, (found at http://www.cs.purdue.edu/coast/archive/data/categ30.html), Oct. 19, 1990.Applicant
- Abstract entitled “PACLs: An Access Control List Approach to AntiViral Security” by D.R. Wichers, et al., Proc. 13th National Computer Security Conference, Washington, DC, Oct. 1-4, 1990, pp. 340-349. (found at http://seclab.cs.ucdavis.edu/papers.html).Applicant
- Abstract entitled “Static Analysis Virus Detection Tools for UNIX Systems” by P. Kerchen, et al., Proc. 13th National Computer Security Conference, Washington DC, Oct. 1-4, 1990, pp. 350-365, (found at http://seclab.cs.ucdavis.edu/papers.html).Applicant
- Abstract entitled “Security with Low Communication Overhead” by D. Beaver, et al., Proc. Advances in Cryptology-CRYPTO —90, Santa Barbara, CA, Aug. 11-15, 1990, pp. 62-76, (found at http://seclab.cs.ucdavis.edu/papers.html).Applicant
- “A Security Analysis of the NTP Protocol”, Matt Bishop, pp. 1-20, (found at http://www.cs.purdue.edu/coast/archive/data/categ30.html), Jun. 13, 1990.Applicant
- Abstract entitled “A Little Knowledge Goes a Long Way; Faster Detection of Compromised Data in 2-D Tables” by D. Gusfield, Proc. of the 1990 IEEE Symposium on Research in Security and Privacy, Oakland, CA, May 7-9, 1990, pp. 86-94, (found at http://seclab.cs.ucdavis.edu/papers.html).Applicant
- Abstract entitled “A Network Security Monitor” by L.T. Heberlein, G.V. Dias, K.N. Levitt, B. Mukherjee, and others, Proc. of the 1990 IEE Symposium on Research in Security and Privacy, Oakland, CA, May 7-9, 1990, pp. 296-304, (foundat http://seclab.cs.ucdavis.edu/papers.html).Applicant
- Abstract entitled “Collaboration Using Roles” by M. Bishop, Software-Practice and Experience, vol. 20, No. 5,. (found at http://seclab.cs.ucdavis.edu/papers.html), May 1, 1990.Applicant
- Abstract entitled “The Round Complexity of Secure Protocols” by D. Beaver, et al., Proc. of the 22nd Annual ACM Symposium on Theory of Computing, Baltimore, MD, May 14-16, 1990, pp. 503-513. (found at http;//seclab.cs.ucdavis.edu/papers.html).Applicant
- Abstract entitled “An Extendable Password Checker” by M. Bishop, Proc. UNIX Security II Portland, OR, Aug. 27-28, 1990, pp. 15-16, (found at http://seclab.cs.ucdavis.edu/papers.html).Applicant
- “Security Problems in the TCP/IP Protocol Suite”, S.M. Bellovin, (reprinted from Computer Communication Review, vol. 19, No. 2, pp. 32-48) pp. 1-17, Apr. 1, 1989.Applicant
- “A Weakness in the 4.2BSD Unix TCP/IP Software”, R. Morris, 4 pages, (found at http://www.cs.purdee.edu/coast/archiive/data/categ30.html), Feb. 25, 1985.Applicant
- “A Pattern Matching Model For Misuse Intrusion Detection”, S. Kumar, et al., pp. 1-11, (found at http://www.cs.purdue.edu/coast/archive/data/categ24.html), no date.Applicant
- “A Reliable and Secure UNIX Connection Service”, D. Draheim, et al., pp. 1-12, (found at http://www.cs.purdue.edu/coast/archive/data/categ30.html), no date.Applicant
- “A Standard Audit Trail Format”, Matt Bishop, 10 pages, (found at http://www.cs.purdue.edu/coast/archive/data/categ24.html), no date.Applicant
- “A Unix Network Protocol Security Study: Network Information Service”, D.K. Hess, et al., 5 pages, (found at http://ww.cs.purdue.edu/coast/archive/data/categ30.html), no date.Applicant
- “An Introduction to Intrusion Detection”, A. Sundaram, pp. 1-10, (found at http://www.cs.purdue.edu/coast/archive/data/categ24.html), no date.Applicant
- “Analysis Of An Algorithm For Distributed Recognition and Accountability”, C. Ko, et al., pp. 1-11, (found at http://www.cs.purdue.edu/coast/archive/data/categ24.html), no date.Applicant
- “Applying Genetic Programming to Intrusion Detection”, M. Crosbie, et al., pp. 1-8 (found at http://www.cs.purdue.edu/coast/archive/data/categ24.html), no date.Applicant
- “ASAX Conceptual Overview”, ASAX Brochure, A. Mounji, (found at http://www.cs.purdue.edu/coast/archive/data/categ24.html), no date.Applicant
- “Characteristics of WideArea TCP/IP Conversations”, R. Cáceres, et al., pp. 1-12, (found at http://www.cs.purdue.edu/coast/archive/data/categ30.html), no date.Applicant
- “Countering Abuse of Name-Based Authentication”, C.L. Schuba, et al., pp. 1-21., (found at http://www.cs.purdue.edu/coast/archive/data/categ30.html), no date.Applicant
- “GrIDSA Graph Based Intrusion Detection System For Large Networks”, S. Staniford-Chen, et al., 10 pages,(found at http://www.cs.purdue.edu/coast/archive/data/categ24.html), no date.Applicant
- “NFS Tracing By Passive Network Monitoring”, Matt Blaze, 11 pages, (found at http://www.cs.purdue.edu/coast/archive/data/categ30.html), no date.Applicant
- “PseudoNetwork Drivers and Virtual Networks”, S.M. Bellovin, 15 pages, (found at http://www.cs.purdue.edu/coast/archive/data/categ30.html), no date.Applicant
- “TCP Wrapper Network Monitoring, Access Control, and Booby Traps”, Wietse Venema, 8 pages., (found at http://www.cs.purdue.edu/coast/archive/data/categ30.html), no date.Applicant
- “The Architecture and Implementation of Network-Layer Security Under Unix”, J. Ioannidis, et al., 11 pages,(found at http://www.cs.purdue.edu/coast/archive/data/categ30.html), no date.Applicant
- “The ‘Session Tty’ Manager”, S.M. Bellovin, pp. 1-16., (found at http://www.cs.purdue.edu/coast/archive/data/categ30.html), no date.Applicant
- Product description for “Oil Change” located on the Internet at http://store.mcafee.com/product.asp?ProductID=28&CategoryID12, pp. 1-2, no date.Applicant
- “CERT® Advisory CA-1996-21 TCP SYN Flooding and IP Spooling Attacks,” http://www.cert.org/advisories/CA-1996-21.html @ Internet, 7 pages, Sep. 19, 1996.Applicant
- Schuba et al., “Analysis of a Denial of Service Attack on TCP,” IEEE, 1997, 16 pages.Applicant