WO1998002815A1 - Apparatus and methods for transmission security in a computer network - Google Patents

Apparatus and methods for transmission security in a computer network Download PDF

Info

Publication number
WO1998002815A1
WO1998002815A1 PCT/US1997/012083 US9712083W WO9802815A1 WO 1998002815 A1 WO1998002815 A1 WO 1998002815A1 US 9712083 W US9712083 W US 9712083W WO 9802815 A1 WO9802815 A1 WO 9802815A1
Authority
WO
WIPO (PCT)
Prior art keywords
message packet
security key
time reference
time
packet
Prior art date
Application number
PCT/US1997/012083
Other languages
French (fr)
Inventor
Andrei Godoroja
Glenn S. Fawcett
Joseph P. R. Tosey
Original Assignee
Glenayre Electronics, Inc.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Glenayre Electronics, Inc. filed Critical Glenayre Electronics, Inc.
Priority to AU37248/97A priority Critical patent/AU3724897A/en
Priority to PCT/US1997/012083 priority patent/WO1998002815A1/en
Priority to GB9900104A priority patent/GB2330284B/en
Publication of WO1998002815A1 publication Critical patent/WO1998002815A1/en
Priority to SE9900033A priority patent/SE9900033L/en

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/606—Protecting data by securing the transmission between two devices or processes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/16—Multipoint routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/26—Flow control; Congestion control using explicit feedback to the source, e.g. choke packets
    • H04L47/263—Rate modification at the source after receiving feedback
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/28—Flow control; Congestion control in relation to timing considerations
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/37—Slow start
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/08—Network architectures or network communication protocols for network security for authentication of entities
    • H04L63/083—Network architectures or network communication protocols for network security for authentication of entities using passwords
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/12—Applying verification of the received information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/50—Network services
    • H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
    • H04L67/62—Establishing a time schedule for servicing the requests
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L2463/00—Additional details relating to network architectures or network communication protocols for network security covered by H04L63/00
    • H04L2463/121—Timestamp

Definitions

  • This invention relates to message transmission security in computer networks, and more particularly to apparatus and methods for validating message transmissions communicated in a computer network.
  • Computer networks are configurable according to several different models.
  • a computer network has a plurality of communicatively interconnected components, or nodes, that are each capable of sending and receiving messages from one another. Such messages include information requests and/or data. Each component acts as a server and a client with respect to the other components.
  • the components may be fully interconnected such that each component has communication connections with all of the other components.
  • a computer network of this design is particularly suited for using a multicast transmission protocol. In a multicast transmission protocol, message transmissions sourced by one node are communicated through the network to all other nodes.
  • a node in a computer network may malfunction and erroneously fill the computer network communication channels with invalid or improper message transmissions.
  • a computer network's communication channels may be flooded with invalid or improper message transmissions originating from a hostile source outside the computer network.
  • a computer network typically acknowledges and attempts to process each message transmission as if it were valid. Considerable processing time and resources are wasted before the computer network discovers, if ever, the erroneous nature of the transmissions. Consequently, invalid message transmissions unnecessarily burden the processing resources of a computer network. This problem is magnified when a computer network uses a multicast transmission protocol because each node in such a computer network is individually burdened by processing the invalid transmissions.
  • Some systems attempt to address these problems by including a special code in each message transmission.
  • the code is designed to verify that the message was generated by a valid node.
  • hostile nodes analyzing valid message transmissions may identify the code portion of the message and simply copy the code into an invalid message, thus giving the message an appearance of validity.
  • the invalid messages continue to present an unnecessary burden on the computer network's processing resources.
  • the present invention is a computer network and method that enables network components to efficiently make a determination regarding the validity of transmissions communicated over the network.
  • the computer network is comprised of a plurality of communicatively interconnected components.
  • Abstract entities called “nodes” operate to represent the components in the network.
  • the components identify and communicate with one another through their respective abstract nodes.
  • message transmissions, or packets, transmitted from one node to another include a header and a body.
  • the body of the packet includes data and/or information requests.
  • the header includes addressing information, security and time codes, and other information relevant to the packet transmission.
  • a portion of the packet header is reserved for storing a time reference indicative of the time at which the particular packet originated.
  • Another portion of the packet header is reserved for storing a unique security key generated by an algorithm that combines a known password with the stored time reference.
  • the receiving node When a node receives a packet encoded in accordance with the invention, the receiving node reads the time reference stored in the packet header and compares it against a present time reference. If the comparison indicates that the packet is "old," i.e., the time of origination stored in the packet header is outside of a predetermined window of acceptable time, the entire packet is presumed invalid and is immediately discarded.
  • the receiving node also independently generates a security key from the known password and the stored time reference. The generated key is compared with the security key stored in the packet header. If the two keys do not correspond, the entire packet is presumed invalid and is immediately discarded.
  • the invention preserves node processing capacity for otherwise valid tasks.
  • discarded packets are logged to indicate configuration or security problems to the network operator.
  • FIGURE 1 is a graph illustrating a computer network suitable for the present invention
  • FIGURE 2 illustrates a message packet with a header and body
  • FIGURE 3 is a graph illustrating a computer network with which an external node has established connections.
  • FIGURE 1 A computer network suitable to employ the present invention is illustrated in FIGURE 1.
  • network components represented by nodes A, B, C, D, E and F all have communication links to one another.
  • the communication links are illustrated as lines extending from each node to the other remaining nodes.
  • Each node is capable of sending and receiving messages to and from any of the other nodes.
  • nodes A, B, C, D, E and F may be independent, standalone computers or may form part of other larger computing devices. Each node has computing capacity to formulate and send message transmissions, or packets, to other nodes. Each node also has computing capacity to receive and process packets from the other nodes.
  • a computer network of such design is known and can be readily constructed by persons of ordinary skill in the computer network art. Referring to FIGURE 2, a message packet 10 transmitted from a source node to a destination node has a header 12 and a body 14.
  • the body 14 may include data, information requests, or portions thereof.
  • the header 12 includes information relevant to the transmission and security of the message packet.
  • This information includes addressing information (e.g., an identification of the source and destination node), optional security fields, and indications of the amount of data communicated by the packet.
  • a portion 16 of the header 12 is reserved for storing a time reference indicative of the time at which the particular packet originated. Also reserved is a portion 18 for storing a security key. As described in greater detail below, the time reference and the security key stored in a packet header is used by the node receiving the packet to determine the validity of the packet transmission.
  • Each of the nodes shown in FIGURE 1 has access to a clock mechanism (not shown) that maintains a time reference.
  • a clock mechanism may be resident in each individual network component. Alternatively, the network components may have access to a central clock mechanism. In any event, it is essential that the network components share reference to a common time frame.
  • each clock mechanism is synchronized with a common time frame. While it is preferable that the synchronization be exact, for purposes of the present invention, a certain amount of time difference may be tolerated. For example, it may be sufficient that all of the nodes are synchronized within two minutes to the same time reference (that is, plus or minus one minute).
  • Each of the nodes shown in FIGURE 1 also has access to one or more passwords to be used in communicating with the other nodes.
  • a single password is used by all nodes in a network belonging to one carrier or organization.
  • a different password is provided to each of the several organizations. In this manner, each node will use one password for communication to other commonly owned nodes, and other passwords for communication with nodes belonging to other organizations that access the network.
  • a node when generating a message packet, a node references its clock mechanism and obtains a present time reference. This time reference is recorded in the time portion 16 of the header 12.
  • a preferred embodiment of the invention uses a UNIX time format.
  • a 32-bit Internet time format is also suitable.
  • Packet security is further established by generating and including a security key in the key portion 18 of the message packet header 12.
  • a node uses a predetermined key-generating algorithm to generate a unique security key for each packet. The key-generating algorithm combines a known password with the present time reference recorded in the time portion 16 of the header 12.
  • the key-generating algorithm may use conventional encoding techniques (e.g., performing addition, subtraction, multiplication, division, raising to a power, calculating a root, performing logic comparisons, etc.) using the password, time reference information, and other variables, if applicable, along with randomly-selected numbers, as operands, to generate a security key in a manner which is difficult to reverse.
  • encoding techniques e.g., performing addition, subtraction, multiplication, division, raising to a power, calculating a root, performing logic comparisons, etc.
  • the following routine is used to generate a security key.
  • Variable “in” is an array of values that includes the password and the time reference recorded in the packet header.
  • Variable “out” is the security key sent with the packet.
  • void security_key_hash unsigned long in [12], unsigned long out [2]) ⁇ unsigned long ex[72]; unsigned long rO, rl, r2, r3, r4, r5; unsigned int i;
  • packet validity is determined by inspection of the time reference and the security key stored in the packet header.
  • the destination node references a clock mechanism to obtain a present time reference.
  • the destination node compares the present time reference with the time reference recorded in the packet header. In this manner, the time stored in the packet header is used in determining the "age" of the packet.
  • the node accomplishes the comparison step by subtracting the time reference in the header from the present time reference.
  • the result is a time differential reflecting the time difference between origination of the packet at its source to reception of the packet at its destination.
  • a predetermined amount of time is allotted for normal packet transmission delay. If the time differential resulting from the comparison step is greater than the allotted time for normal packet transmission, the packet is presumed to be invalid and is immediately removed from further consideration. The destination node discards, ignores, erases, or otherwise denies the packet further consideration.
  • the destination node may accomplish the comparison step by first obtaining a present time reference and then subtracting a predetermined amount of time from that time reference. If the time reference recorded in the message packet is earlier than the time reference resulting from the subtraction step, the packet is presumed to be "old” and therefore invalid. Because "old" message packets do not receive further consideration, processing resources of the computer network are conserved.
  • packet validity is established by inspection of the security key stored in the packet header.
  • the destination node uses the password associated with the packet transmission and the time reference representing when the packet originated, along with other variables, if applicable, in a key- generating algorithm to generate a security key that should correspond with the key stored in the packet header. If the generated security key does not correspond with the security key recorded in the packet header, it is presumed that the source node does not know the password, does not know the time, or does not have a proper key- generating routine. The packet is presumed to be invalid and is immediately removed from further consideration. As described above, the destination node discards, ignores, erases, or otherwise denies the packet further consideration.
  • the invention provides a solution for situations in which a valid network node malfunctions or otherwise becomes hostile to the operation of the network and floods the network communication channels with duplicate, out-of-date messages.
  • a computer network constructed in accordance with the invention uses a time-based mechanism to determine the age of the message.
  • the time information recorded in the message header will indicate that the message is "old" and presumably invalid.
  • the invalid messages are ignored, thus preserving valuable processing time of network components for otherwise valid tasks.
  • the time savings is multiplied in computer networks that use broadcast communication, such as networks using a multicast transmission protocol.
  • the invention thus reduces the overall processing burdens on a computer network.
  • the invention also provides a solution for situations in which a node outside of the computer network obtains communication access to the network.
  • node X is shown as having obtained communication access to the network through nodes A, B, and C.
  • Node X may be hostile to the normal operation of the network and flood the network's communication channels with invalid messages. Messages originated by hostile node X will likely lack a proper time reference in the message header, or will lack a time reference synchronized with the clock mechanisms of the network.
  • the invalidity of the messages will be quickly determined because the time information in the messages will not be within the acceptable time window established by the network.
  • a computer network constructed in accordance with the invention also uses a key-based mechanism to determine the validity of a message transmission.
  • a security key included with a message transmission is generated by a unique combination of a password, a time reference, and other variables as applicable.
  • messages originated by hostile node X will likely lack a proper security key in the message header.
  • a proper security key requires knowledge of a password, a time reference, and a other variables as applicable.
  • the invention links a password with a time reference to provide a security key for establishing and determining the validity of message transmissions communicated over a computer network.
  • the invention is particularly useful in computer networks that employ User Datagram Protocol (UDP) for communications control.
  • UDP is a "connectionless" transport protocol and accordingly, nodes do not require specific connection establishment with other nodes to send a message.
  • a connectionless environment is particularly susceptible to the situation described above where external hostile node X obtains access to the network. Once node X obtains access to the network, node X is capable of communicating invalid packets to any or all of the nodes in the computer network.
  • the invention provides means for nodes in a computer network to determine the validity of message transmissions and exclude those transmissions that do not fit the proper criteria.
  • the receiving nodes find that the time reference or the security key is invalid in any packet, the nodes can assume that the sending node does not know the password or proper time reference and the packet is discarded.
  • FIGURE 1 shows a fully meshed connection-oriented network
  • the present invention may be used with computer networks of other topologies and configurations for both point-to-point and broadcast-type transmission.
  • Network configurations that appear as a ring, a star, or a line are commonly known and are suitable for carrying out the invention.

Abstract

A method for validating a message packet having a header and a body that is communicated from a source node to a destination node in a computer network is disclosed. The source node and destination node have access to a clock mechanism synchronized with a common time frame. The method comprised generating a first security key using a time reference obtained from the clock mechanism which is recorded in the time portion of a header and a password known by the source node and destination node, communicating the first security key with a message packet from the source node to the destination node, and when the first security key and message packet are received by the destination node, generating a second security key using the password and the time reference and comparing the second security key with the first security key. The message packet is discarded if the second security key does not correspond with the first security key.

Description

APPARATUS AND METHODS FOR TRANSMISSION SECURITY IN A
COMPUTER NETWORK
Related Applications The benefit of the filing date of provisional application serial No. 60/022,045, filed on July 22, 1996, and provisional application serial No. 60/021,617, filed on July 12, 1996, is hereby claimed for this application under 35 U.S.C. § 119(e).
Field of the Invention This invention relates to message transmission security in computer networks, and more particularly to apparatus and methods for validating message transmissions communicated in a computer network.
Background of the Invention
Computer networks are configurable according to several different models.
In one model, a computer network has a plurality of communicatively interconnected components, or nodes, that are each capable of sending and receiving messages from one another. Such messages include information requests and/or data. Each component acts as a server and a client with respect to the other components.
The components may be fully interconnected such that each component has communication connections with all of the other components. A computer network of this design is particularly suited for using a multicast transmission protocol. In a multicast transmission protocol, message transmissions sourced by one node are communicated through the network to all other nodes.
Under certain undesirable circumstances, a node in a computer network may malfunction and erroneously fill the computer network communication channels with invalid or improper message transmissions. In other circumstances, a computer network's communication channels may be flooded with invalid or improper message transmissions originating from a hostile source outside the computer network. In either set of circumstances, a computer network typically acknowledges and attempts to process each message transmission as if it were valid. Considerable processing time and resources are wasted before the computer network discovers, if ever, the erroneous nature of the transmissions. Consequently, invalid message transmissions unnecessarily burden the processing resources of a computer network. This problem is magnified when a computer network uses a multicast transmission protocol because each node in such a computer network is individually burdened by processing the invalid transmissions.
Some systems attempt to address these problems by including a special code in each message transmission. The code is designed to verify that the message was generated by a valid node. However, hostile nodes analyzing valid message transmissions may identify the code portion of the message and simply copy the code into an invalid message, thus giving the message an appearance of validity. The invalid messages continue to present an unnecessary burden on the computer network's processing resources.
Summary of the Invention Accordingly, the present invention is a computer network and method that enables network components to efficiently make a determination regarding the validity of transmissions communicated over the network.
The computer network is comprised of a plurality of communicatively interconnected components. Abstract entities called "nodes" operate to represent the components in the network. The components identify and communicate with one another through their respective abstract nodes.
In the invention, message transmissions, or packets, transmitted from one node to another include a header and a body. The body of the packet includes data and/or information requests. The header includes addressing information, security and time codes, and other information relevant to the packet transmission. A portion of the packet header is reserved for storing a time reference indicative of the time at which the particular packet originated. Another portion of the packet header is reserved for storing a unique security key generated by an algorithm that combines a known password with the stored time reference.
When a node receives a packet encoded in accordance with the invention, the receiving node reads the time reference stored in the packet header and compares it against a present time reference. If the comparison indicates that the packet is "old," i.e., the time of origination stored in the packet header is outside of a predetermined window of acceptable time, the entire packet is presumed invalid and is immediately discarded. The receiving node also independently generates a security key from the known password and the stored time reference. The generated key is compared with the security key stored in the packet header. If the two keys do not correspond, the entire packet is presumed invalid and is immediately discarded. Thus, the invention preserves node processing capacity for otherwise valid tasks.
Preferably, discarded packets are logged to indicate configuration or security problems to the network operator.
Brief Description of the Drawings The foregoing aspects and many of the attendant advantages of this invention will become more readily appreciated as the same becomes better understood by reference to the following detailed description, when taken in conjunction with the accompanying drawings, wherein:
FIGURE 1 is a graph illustrating a computer network suitable for the present invention;
FIGURE 2 illustrates a message packet with a header and body; and FIGURE 3 is a graph illustrating a computer network with which an external node has established connections.
Detailed Description of the Preferred Embodiment A computer network suitable to employ the present invention is illustrated in FIGURE 1. In FIGURE 1, network components represented by nodes A, B, C, D, E and F all have communication links to one another. The communication links are illustrated as lines extending from each node to the other remaining nodes. Each node is capable of sending and receiving messages to and from any of the other nodes.
The network components represented by nodes A, B, C, D, E and F may be independent, standalone computers or may form part of other larger computing devices. Each node has computing capacity to formulate and send message transmissions, or packets, to other nodes. Each node also has computing capacity to receive and process packets from the other nodes. A computer network of such design is known and can be readily constructed by persons of ordinary skill in the computer network art. Referring to FIGURE 2, a message packet 10 transmitted from a source node to a destination node has a header 12 and a body 14. The body 14 may include data, information requests, or portions thereof. The header 12 includes information relevant to the transmission and security of the message packet. This information includes addressing information (e.g., an identification of the source and destination node), optional security fields, and indications of the amount of data communicated by the packet. A portion 16 of the header 12 is reserved for storing a time reference indicative of the time at which the particular packet originated. Also reserved is a portion 18 for storing a security key. As described in greater detail below, the time reference and the security key stored in a packet header is used by the node receiving the packet to determine the validity of the packet transmission.
Each of the nodes shown in FIGURE 1 has access to a clock mechanism (not shown) that maintains a time reference. A clock mechanism may be resident in each individual network component. Alternatively, the network components may have access to a central clock mechanism. In any event, it is essential that the network components share reference to a common time frame.
In the event that each individual component has its own resident clock mechanism, each clock mechanism is synchronized with a common time frame. While it is preferable that the synchronization be exact, for purposes of the present invention, a certain amount of time difference may be tolerated. For example, it may be sufficient that all of the nodes are synchronized within two minutes to the same time reference (that is, plus or minus one minute).
Each of the nodes shown in FIGURE 1 also has access to one or more passwords to be used in communicating with the other nodes. In one embodiment of the invention, a single password is used by all nodes in a network belonging to one carrier or organization. In the case where several organizations exchange data on the same network, a different password is provided to each of the several organizations. In this manner, each node will use one password for communication to other commonly owned nodes, and other passwords for communication with nodes belonging to other organizations that access the network.
To assist in establishing packet security, when generating a message packet, a node references its clock mechanism and obtains a present time reference. This time reference is recorded in the time portion 16 of the header 12. Although many different time formats are suitable for the invention, a preferred embodiment of the invention uses a UNIX time format. A 32-bit Internet time format is also suitable. Packet security is further established by generating and including a security key in the key portion 18 of the message packet header 12. According to a preferred embodiment of the invention, a node uses a predetermined key-generating algorithm to generate a unique security key for each packet. The key-generating algorithm combines a known password with the present time reference recorded in the time portion 16 of the header 12. Other variables as well, including the source and destination node identifiers, packet length information, sequence numbers, and actual data communicated by the packet, may be used in generating the unique security key. The key-generating algorithm may use conventional encoding techniques (e.g., performing addition, subtraction, multiplication, division, raising to a power, calculating a root, performing logic comparisons, etc.) using the password, time reference information, and other variables, if applicable, along with randomly-selected numbers, as operands, to generate a security key in a manner which is difficult to reverse. Providing computer software routines that perform such encoding techniques is readily within the ordinary skill of one involved in the computer programming art.
In a preferred embodiment of the invention, the following routine is used to generate a security key. Variable "in" is an array of values that includes the password and the time reference recorded in the packet header. Variable "out" is the security key sent with the packet. void security_key_hash ( unsigned long in [12], unsigned long out [2]) { unsigned long ex[72]; unsigned long rO, rl, r2, r3, r4, r5; unsigned int i;
for (i = 0; i < 72; i++) ex[i] = 0;
for (i = 0; i < 12; i++) ex[i] = in[i] ; for ( ; i < 72; i++) ex[i] = ex[i - 3] Λ ex[i - 5] Λ ex[i - 6] Λ ex[i - 12];
rO 3822118087 rl 4206368529L r2 2636563960L r3 1419098426L r4 742554211L
for (i = 0; i < 72; i++) { switch {i / 18) { case 0: r3) I (r2 & r3) ) + (r4 « 11) + (r4 » 21) + 2049053871L; break; case 1:
& r3) ) + (r4 « 11) + (r4 » 21) + 909867182L; break; case 2:
(~rl & ~{r2 & r3) ) ) + (r4 « 11) + (r4 » 21) + 2073245137L; break; case 3:
(~rl & ~r2) ) + (r4 « 11) + (r4 » 21) + 4157358317L; break; }
rO = rl; rl = r2; r2 = (r3 « 27) + (r3 » 5) ; r3 = r4; r4 = r5; out [0] = rO + ( r2 * 2628165923L) + (r4 * 545239213L) ; out [ l ] = rl + ( r3 * 68740181L ) ; } } A formulated packet with a complete header and body is transmitted over the computer network to a destination node. Before processing a received message packet, the destination node verifies the validity of the packet. In terms of the present invention, packet validity is determined by inspection of the time reference and the security key stored in the packet header. Accordingly, in one aspect, the destination node references a clock mechanism to obtain a present time reference. The destination node compares the present time reference with the time reference recorded in the packet header. In this manner, the time stored in the packet header is used in determining the "age" of the packet.
Preferably, the node accomplishes the comparison step by subtracting the time reference in the header from the present time reference. The result is a time differential reflecting the time difference between origination of the packet at its source to reception of the packet at its destination.
According to a preferred embodiment of the invention, a predetermined amount of time is allotted for normal packet transmission delay. If the time differential resulting from the comparison step is greater than the allotted time for normal packet transmission, the packet is presumed to be invalid and is immediately removed from further consideration. The destination node discards, ignores, erases, or otherwise denies the packet further consideration.
In an alternative embodiment, the destination node may accomplish the comparison step by first obtaining a present time reference and then subtracting a predetermined amount of time from that time reference. If the time reference recorded in the message packet is earlier than the time reference resulting from the subtraction step, the packet is presumed to be "old" and therefore invalid. Because "old" message packets do not receive further consideration, processing resources of the computer network are conserved.
In another aspect of the invention, packet validity is established by inspection of the security key stored in the packet header. The destination node uses the password associated with the packet transmission and the time reference representing when the packet originated, along with other variables, if applicable, in a key- generating algorithm to generate a security key that should correspond with the key stored in the packet header. If the generated security key does not correspond with the security key recorded in the packet header, it is presumed that the source node does not know the password, does not know the time, or does not have a proper key- generating routine. The packet is presumed to be invalid and is immediately removed from further consideration. As described above, the destination node discards, ignores, erases, or otherwise denies the packet further consideration.
The invention provides a solution for situations in which a valid network node malfunctions or otherwise becomes hostile to the operation of the network and floods the network communication channels with duplicate, out-of-date messages. Rather than requiring network components to process such invalid messages, a computer network constructed in accordance with the invention uses a time-based mechanism to determine the age of the message. When a node malfunctions and floods a computer network with multiple copies of the same message, after a predetermined amount of time, the time information recorded in the message header will indicate that the message is "old" and presumably invalid. The invalid messages are ignored, thus preserving valuable processing time of network components for otherwise valid tasks. The time savings is multiplied in computer networks that use broadcast communication, such as networks using a multicast transmission protocol. The invention thus reduces the overall processing burdens on a computer network. The invention also provides a solution for situations in which a node outside of the computer network obtains communication access to the network. For example, in FIGURE 3, node X is shown as having obtained communication access to the network through nodes A, B, and C. Node X may be hostile to the normal operation of the network and flood the network's communication channels with invalid messages. Messages originated by hostile node X will likely lack a proper time reference in the message header, or will lack a time reference synchronized with the clock mechanisms of the network. For computer networks using the invention, the invalidity of the messages will be quickly determined because the time information in the messages will not be within the acceptable time window established by the network.
As described earlier, a computer network constructed in accordance with the invention also uses a key-based mechanism to determine the validity of a message transmission. A security key included with a message transmission is generated by a unique combination of a password, a time reference, and other variables as applicable. In situations where hostile node X, as described above, has communication access to the network, messages originated by hostile node X will likely lack a proper security key in the message header. As noted, a proper security key requires knowledge of a password, a time reference, and a other variables as applicable. In the event that hostile node X succeeds in including a proper time reference, hostile node X will likely be unable to include a proper security key unless the hostile node also has access to the proper password, the other variables, and the proper security key-generating algorithm. In this manner, the invention links a password with a time reference to provide a security key for establishing and determining the validity of message transmissions communicated over a computer network.
The invention is particularly useful in computer networks that employ User Datagram Protocol (UDP) for communications control. UDP is a "connectionless" transport protocol and accordingly, nodes do not require specific connection establishment with other nodes to send a message. A connectionless environment is particularly susceptible to the situation described above where external hostile node X obtains access to the network. Once node X obtains access to the network, node X is capable of communicating invalid packets to any or all of the nodes in the computer network. The invention provides means for nodes in a computer network to determine the validity of message transmissions and exclude those transmissions that do not fit the proper criteria. If the receiving nodes find that the time reference or the security key is invalid in any packet, the nodes can assume that the sending node does not know the password or proper time reference and the packet is discarded. The chance that a hostile node can flood the computer network with invalid data, the possibility of which is increased when multicast protocols or UDP are used, accordingly is reduced.
While the preferred embodiment of the invention has been illustrated and described, it will be appreciated that various changes can be made therein without departing from the spirit and scope of the invention. For instance, while FIGURE 1 shows a fully meshed connection-oriented network, it is appreciated that the present invention may be used with computer networks of other topologies and configurations for both point-to-point and broadcast-type transmission. Network configurations that appear as a ring, a star, or a line are commonly known and are suitable for carrying out the invention.

Claims

The embodiments of the invention in which an exclusive property or privilege is claimed are defined as follows:
1. A method for validating a message packet communicated from a source node to a destination node in a computer network, the source node and destination node having access to a clock mechanism synchronized with a common time frame, the method comprising:
(a) generating a first security key using a time reference obtained from said clock mechanism and a password known by said source node and said destination node;
(b) communicating said first security key with a message packet from said source node to said destination node;
(c) when said first security key and said message packet are received by said destination node, generating a second security key using said password and said time reference and comparing said second security key with said first security key; and
(d) discarding said message packet if said second security key does not correspond with said first security key.
2. A method for validating a message packet according to Claim 1, wherein generating said first security key and said second security key further uses information selected from a group consisting of node identifiers, packet length information, sequence numbers, actual packet data, and randomly selected numbers.
3. A method for validating a message packet according to Claim 1, wherein said message packet is comprised of a header and a body, and wherein said first security key is stored in said message packet header.
4. A method for validating a message packet according to Claim 1, further comprising logging information regarding said message packet if said message packet is discarded.
5. A method for validating a message packet according to Claim 1, further comprising:
(a) communicating a first time reference obtained from said clock mechanism with said message packet;
(b) when said first time reference and said message packet are received by said destination node, comparing said first time reference with a second time reference obtained from said clock mechanism; and
(c) discarding said message packet if the difference in time between said first time reference and said second time reference is greater than a predetermined amount of time.
6. A method for validating a message packet according to Claim 5, wherein said message packet has a header and a body, and wherein said first time reference is recorded in said message packet header.
7. A method for validating a message packet according to Claim 5, wherein said predetermined amount of time is based on a calculated normal packet transmission delay.
8. A method for validating a message packet according to Claim 5, wherein said first time reference and said second time reference use a UNIX time format.
9. A computer network comprising a plurality of communicatively interconnected components represented by nodes, wherein a message packet communicated from a source node to a destination node includes a first security key generated using a password and a time reference, and wherein said destination node generates a second security key using said password and said time reference and compares said second security key with said first security key, said destination node discarding the message packet if said second security key does not correspond with said first security key.
10. A computer network according to Claim 9, wherein the generation of said first security key and said second security key further uses information selected from a group consisting of node identifiers, packet length information, sequence numbers, actual packet data, and randomly selected numbers.
11. A computer network according to Claim 9, further comprising a log for recording information regarding said message packet if said message packet is discarded.
12. A computer network according to Claim 3, wherein said message packet includes a first time reference, wherein said destination node compares said first time reference with a second time reference, and wherein said message packet is discarded if the difference in time between the first and second time references is greater than a predetermined amount of time.
13. A computer network according to Claim 12, wherein said predetermined amount of time is based on a calculated normal packet transmission delay.
14. A computer network according to Claim 12, wherein said first time reference and said second time reference use a UNIX time format.
PCT/US1997/012083 1996-07-12 1997-07-11 Apparatus and methods for transmission security in a computer network WO1998002815A1 (en)

Priority Applications (4)

Application Number Priority Date Filing Date Title
AU37248/97A AU3724897A (en) 1996-07-12 1997-07-11 Apparatus and methods for transmission security in a computer network
PCT/US1997/012083 WO1998002815A1 (en) 1996-07-12 1997-07-11 Apparatus and methods for transmission security in a computer network
GB9900104A GB2330284B (en) 1996-07-12 1997-07-11 Apparatus and methods for transmission security in a computer network
SE9900033A SE9900033L (en) 1996-07-12 1999-01-08 Device security and method of transmission security in a computer network

Applications Claiming Priority (5)

Application Number Priority Date Filing Date Title
US2161796P 1996-07-12 1996-07-12
US60/021,617 1996-07-12
US2204596P 1996-07-22 1996-07-22
US60/022,045 1996-07-22
PCT/US1997/012083 WO1998002815A1 (en) 1996-07-12 1997-07-11 Apparatus and methods for transmission security in a computer network

Publications (1)

Publication Number Publication Date
WO1998002815A1 true WO1998002815A1 (en) 1998-01-22

Family

ID=27361679

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US1997/012083 WO1998002815A1 (en) 1996-07-12 1997-07-11 Apparatus and methods for transmission security in a computer network

Country Status (1)

Country Link
WO (1) WO1998002815A1 (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2355322A (en) * 1999-10-05 2001-04-18 Authoriszor Ltd System and method for positive client identification
WO2004051922A1 (en) * 2002-12-02 2004-06-17 Pro-Corp Holdings International Limited Data packet exchange system and method
WO2005002172A1 (en) 2003-06-27 2005-01-06 Nokia Corporation Security for protocol traversal
CN109979116A (en) * 2019-04-01 2019-07-05 深圳市摩线科技有限公司 A kind of offline cryptogram encryption method about equipment leasing

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4023163A (en) * 1975-09-19 1977-05-10 Johnson Controls, Inc. High security alarm transmission system
US5058161A (en) * 1985-11-27 1991-10-15 Kenneth Weiss Method and apparatus for secure identification and verification
US5079767A (en) * 1988-09-27 1992-01-07 Digital Equipment Corporation Method of multicast message distribution
US5081678A (en) * 1989-06-28 1992-01-14 Digital Equipment Corporation Method for utilizing an encrypted key as a key identifier in a data packet in a computer network
US5113499A (en) * 1989-04-28 1992-05-12 Sprint International Communications Corp. Telecommunication access management system for a packet switching network
US5175765A (en) * 1989-05-09 1992-12-29 Digital Equipment Corporation Robust data broadcast over a distributed network with malicious failures
US5428645A (en) * 1992-11-03 1995-06-27 International Business Machines Corporation Anonymous time synchronization method
US5455865A (en) * 1989-05-09 1995-10-03 Digital Equipment Corporation Robust packet routing over a distributed network containing malicious failures

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4023163A (en) * 1975-09-19 1977-05-10 Johnson Controls, Inc. High security alarm transmission system
US5058161A (en) * 1985-11-27 1991-10-15 Kenneth Weiss Method and apparatus for secure identification and verification
US5079767A (en) * 1988-09-27 1992-01-07 Digital Equipment Corporation Method of multicast message distribution
US5113499A (en) * 1989-04-28 1992-05-12 Sprint International Communications Corp. Telecommunication access management system for a packet switching network
US5175765A (en) * 1989-05-09 1992-12-29 Digital Equipment Corporation Robust data broadcast over a distributed network with malicious failures
US5455865A (en) * 1989-05-09 1995-10-03 Digital Equipment Corporation Robust packet routing over a distributed network containing malicious failures
US5081678A (en) * 1989-06-28 1992-01-14 Digital Equipment Corporation Method for utilizing an encrypted key as a key identifier in a data packet in a computer network
US5428645A (en) * 1992-11-03 1995-06-27 International Business Machines Corporation Anonymous time synchronization method

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2355322A (en) * 1999-10-05 2001-04-18 Authoriszor Ltd System and method for positive client identification
WO2004051922A1 (en) * 2002-12-02 2004-06-17 Pro-Corp Holdings International Limited Data packet exchange system and method
WO2005002172A1 (en) 2003-06-27 2005-01-06 Nokia Corporation Security for protocol traversal
CN109979116A (en) * 2019-04-01 2019-07-05 深圳市摩线科技有限公司 A kind of offline cryptogram encryption method about equipment leasing
CN109979116B (en) * 2019-04-01 2021-04-20 深圳市摩线科技有限公司 Offline password encryption method for equipment leasing

Similar Documents

Publication Publication Date Title
US6032258A (en) Apparatus and methods for transmission security in a computer network
Karn et al. Photuris: Session-key management protocol
Freedman et al. Tarzan: A peer-to-peer anonymizing network layer
Kaufman et al. Internet key exchange protocol version 2 (IKEv2)
KR100199077B1 (en) Use of marker packets for synchronization of encryption/decryption keys in a data communication network
AU725712B2 (en) Network security device
CN1960233B (en) Repetition grouping detector, method, program storage device and internet
US6725276B1 (en) Apparatus and method for authenticating messages transmitted across different multicast domains
US6167515A (en) Method and system for performing the transmission of private data over a public network
CN111404672B (en) Quantum key distribution method and device
CN112106322A (en) Password-based threshold token generation
JP2001508627A (en) Improved network security device
HUT68148A (en) Method and system for digital signal processing
Haberman et al. Network time protocol version 4: Autokey specification
US20060155981A1 (en) Network device, network system and group management method
Liu et al. A lightweight authentication scheme based on self‐updating strategy for space information network
US8230229B2 (en) Security in computing networks
EP1171972A2 (en) Apparatus and method for authenticating messages in a multicast
US20090113065A1 (en) Integrity mechanism for file transfer in communications networks
CN113691512A (en) Data hiding transmission system and method combining block chain and onion network
Höglund et al. Lightweight certificate revocation for low-power IoT with end-to-end security
WO1998002815A1 (en) Apparatus and methods for transmission security in a computer network
Herlea et al. On securely scheduling a meeting
US20080313461A1 (en) Security association verification and recovery
EP1949591B1 (en) Security in computing networks

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 97196344.4

Country of ref document: CN

AK Designated states

Kind code of ref document: A1

Designated state(s): AL AM AT AU AZ BA BB BG BR BY CA CH CN CU CZ DE DK EE ES FI GB GE GH HU IL IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MD MG MK MN MW MX NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT UA UG UZ VN YU ZW AM AZ BY KG KZ MD RU TJ TM

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH KE LS MW SD SZ UG ZW AT BE CH DE DK ES FI FR GB GR IE IT LU MC NL PT

121 Ep: the epo has been informed by wipo that ep was designated in this application
CFP Corrected version of a pamphlet front page

Free format text: REVISED ABSTRACT RECEIVED BY THE INTERNATIONAL BUREAU AFTER COMPLETION OF THE TECHNICAL PREPARATIONS FOR INTERNATIONAL PUBLICATION

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
ENP Entry into the national phase

Ref document number: 9900104

Country of ref document: GB

Kind code of ref document: A

REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

NENP Non-entry into the national phase

Ref document number: 1998506170

Country of ref document: JP

122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase

Ref country code: CA