A method, system, medium and program product for judging the security of business network mutual access

By constructing a forwarding graph using BDD and deep search algorithms, the problems of configuration complexity and low efficiency of automatic verification in judging the security of business network inter-access are solved, and fast and accurate network security judgment is achieved.

CN118413399BActive Publication Date: 2024-11-08XIAMEN UNIV

Patent Information

Application Number
CN202410873787.6
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-07-02
Publication Date
2024-11-08
Estimated Expiration
2044-07-02

AI Technical Summary

Technical Problem

Existing technologies for assessing the security of inter-network access in business systems suffer from high probability of configuration errors and high configuration complexity, leading to network security threats. Furthermore, existing automated verification methods are inefficient and incomplete in their testing.

Method used

By employing BDD (Binary Decision Diagram) to encode and store network device port forwarding rules and access control policies, and combining them with a deep search algorithm, a forwarding graph is constructed to perform security assessments, quickly and accurately identifying non-isolated business networks.

Benefits of technology

It enables rapid and accurate assessment of the security of business network interoperability in centralized scenarios, reducing the complexity of manual inspections and improving the efficiency and accuracy of network security assessments.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118413399B_ABST
    Figure CN118413399B_ABST
Patent Text Reader

Abstract

The present invention relates to a method, system, medium and program product for judging the security of mutual access of service networks, which generates a forwarding graph according to the connection topology; then selects a corresponding destination service port according to the destination service network to construct a destination forwarding graph; in the destination forwarding graph, takes the destination service port as the starting point and performs a deep search along the topology structure; after the deep search, the destination service network evaluates all service ports other than the destination service port to judge whether there is a network segment forwarded from the service port; if there is and the destination service network segment is not allowed to be accessed, it is considered that the service interface is not isolated from the destination service port and the network is not safe; otherwise, it is considered that the network is safe. The present invention adopts the method of network modeling and formal analysis to quickly and accurately calculate the mutual access relationship between service network segments, and can quickly and accurately judge the security of mutual access of service networks by combining network planning information.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of network security technology, and in particular to a method, system, medium and program product for judging the security of business network mutual access. Background Art

[0002] Modern networks are often planned according to certain business intentions. Business networks are deployed on a certain interface of network devices, and network devices are configured to ensure that some business networks can be accessed by some business networks, or cannot be accessed by some business networks. However, due to the increasing complexity of the network (the network scale is getting larger and the configuration is getting more complex), the probability of configuration errors is increasing. Misconfiguration of routing policies or security policies may lead to illegal business network mutual access, bringing huge network security threats.

[0003] Relying on manual inspection of existing configurations is no longer feasible under the scale of modern networks. The industry has proposed some automatic verification methods for the security of business network mutual access. A common method is to perform configuration verification and check for incorrect configurations based on templates. However, network configurations will affect each other and spread from one device to the entire network, making it difficult to check. On the other hand, policy-based configurations are difficult to define locally as correct or incorrect. Another common method is to inject messages into the existing network for testing, inject messages from a certain business network interface, and then check whether they can reach the destination business interface to be tested. However, this method faces the problem of incomplete testing, because the business network is often a network segment (for example, a / 24 network segment has 256 IP addresses), and two business networks need to generate 256*256=65536 messages to be fully tested. In fact, there are a large number of business networks in the network. If a full test is performed, a large number of messages need to be generated. If a sampling test is performed, there may be a problem of incomplete testing.

[0004] Therefore, it is necessary to study a more efficient and complete method to determine the security of business network mutual access. Summary of the invention

[0005] The purpose of the present invention is to provide a method, system, medium and program product for determining the security of mutual access between business networks, which can use BDD in a centralized scenario to quickly and accurately find non-isolated business networks, and combine network planning and network security verification tools to determine the security of existing networks.

[0006] To achieve the above object, the technical solution adopted by the present invention is:

[0007] A method for determining the security of business network mutual access, the method comprising the following steps:

[0008] Step 1: Mark the device ports of the access layer as service ports according to the provided fat tree network structure, and obtain the correct mutual access information between the service ports;

[0009] Step 2: According to the specific information of the actual router, the corresponding device port forwarding rules, device port access control policies and connection topology are collected, and a forwarding graph is generated according to the connection topology; wherein the device forwarding rules are rules that allow a certain network segment to be forwarded through a certain port of the device; the device port control policy is a policy that does not allow a certain network segment to be forwarded through any port of the device; in the forwarding graph, points are devices, edges are lines connecting device ports, and edges have message spaces that allow forwarding, which are encoded and stored using BDD;

[0010] Step 3: According to the destination service network, select a destination service port and construct a destination forwarding graph;

[0011] Step 4: In the destination forwarding graph constructed in step 3, starting from the destination service port, perform a deep search along the topology structure. When it encounters another service port or accesses a duplicate port or the message space has no intersection, the search branch ends and returns to the previous layer.

[0012] Step 5: After the deep search is completed, the destination service network evaluates all service ports except the destination service port to determine whether there is a network segment forwarded from the service port; if there is and the destination service network segment is not allowed to access, it is considered that the service interface is not isolated from the destination service port and the network is not secure; otherwise, the network is considered secure;

[0013] Step 6: Select the next destination service port and continue the deep search until all destination service ports are traversed.

[0014] In step 2, the operation of using BDD to encode and store network segment space is as follows:

[0015] (1) Generate a BDD root node, specify the BDD encoding method, and determine the bit length of the message header to be encoded;

[0016] (2) For the access control policy set, convert each access control policy into the corresponding network segment space And store it in BDD diagram; record the network segment space allowed to pass as , the network segment space that is not allowed to pass is ; Encode and store the encoding results in sequence according to the order of the policy table items;

[0017] (3) For the forwarding rule set, convert each forwarding rule into the corresponding network segment space And store it in BDD graph; calculate the network segment space corresponding to each forwarding rule and store it in BDD graph, and associate it with the corresponding outbound port, and record the current forwarding network segment space as , according to the priority order of forwarding rules, encode and store the encoding results in sequence.

[0018] The step 3 is specifically as follows: selecting a destination service port from a port set having a service network segment, and reusing the read topological connection relationship to construct a destination forwarding graph from the destination service port to other ports.

[0019] In step 4, the specific operation of performing a deep search on the destination forwarding graph is as follows:

[0020] (1) The destination forwarding graph starts from the destination service port, generates the corresponding network segment space, records the access path, and starts forwarding this network segment space in a deep search manner;

[0021] (2) Mark each device port accessed during the deep search process and determine whether it is a device port that has been accessed. If so, it is considered that a loop has occurred. At this time, the search of this branch is exited and returned to the previous layer;

[0022] (3) For each new non-loop port, use BDD to determine the intersection of the forwarded network segment space and the new port forwarding strategy network segment space; if there is no intersection, abandon the search of this branch and return to the previous layer; if there is an intersection, take the intersection and continue the search of the next layer;

[0023] (4) For the service port in the destination service network, store the network segment space forwarded to the current service port, stop the current search, and return to the previous layer to continue searching using the same network segment intersection;

[0024] (5) Repeat recursive steps (2)-(4) until all depth search traversals are completed.

[0025] A system for determining the security of mutual access between business networks, comprising a memory, a processor and a computer program stored in the memory, wherein the processor executes the computer program to implement the steps of a method for determining the security of mutual access between business networks as described above.

[0026] A computer-readable storage medium stores a computer program / instruction thereon, which, when executed by a processor, implements the steps of a method for determining the security of mutual access between business networks as described above.

[0027] A computer program product includes a computer program / instruction, which, when executed by a processor, implements the steps of the method for determining the security of mutual access between business networks as described above.

[0028] In summary, the present invention performs network modeling in steps 1 to 2 and uses a formal verification method in steps 3 to 6, so as to quickly and accurately calculate the mutual access relationship between business network segments. Combined with network planning information, the security of business network mutual access can be quickly and accurately determined. BRIEF DESCRIPTION OF THE DRAWINGS

[0029] Figure 1 It is a schematic diagram of the algorithm flow of the present invention;

[0030] Figure 2 It is a principle block diagram of the present invention.

[0031] Figure 3 This is a schematic diagram of a fat tree network of the present invention;

[0032] Figure 4 This is a schematic diagram of the BDD transformation of the present invention;

[0033] Figure 5 It is a schematic diagram of deep search propagation of the present invention;

[0034] Figure 6 It is a schematic diagram of network segment security determination of the present invention. DETAILED DESCRIPTION

[0035] like Figure 1 and Figure 2 As shown, the present invention discloses a method for determining the security of business network mutual access, which includes the following steps:

[0036] Step 1: Mark the device ports of the access layer as service ports according to the provided fat-tree network structure, and obtain the correct mutual access information between the service ports, that is, the actual local routing, for subsequent formal verification.

[0037] The fat tree network is composed of three levels of equipment, including the core layer, the aggregation layer and the access layer. The core layer is the top layer of the fat tree network, connecting all the aggregation layer devices. The core layer is responsible for handling traffic forwarding in the entire network to achieve communication between different aggregation layers. The core layer switches usually have the highest bandwidth and processing power, and can handle large-scale data center network traffic. The aggregation layer is located in the middle layer, connecting the access layer and the core layer. The function of the aggregation layer is to aggregate traffic from the access layer and forward it to the core layer devices. Aggregation layer devices usually have higher bandwidth and processing power, and can handle large amounts of data traffic from the access layer. The access layer is the lowest cluster in the network, usually connected to servers, computers, etc. The service network segment mentioned in the present invention is located on the access layer device of the fat tree network structure, and the service port is the port on the access layer device. The destination service network in the present invention is a global network with global topology information and a set of destination service ports. Such as Figure 3As shown in the figure, D, E, F, G, and H represent the ports on the access layer device, which are also the destination service ports in this article; A, B, and C represent the ports on the aggregation layer device; and S represents the port on the core layer device.

[0038] Step 2: According to the specific information of the actual router, collect the corresponding device port forwarding rules, device port access control policies and connection topology, and generate a forwarding graph based on the connection topology. Among them, the device forwarding rule is a rule that allows a certain network segment to be forwarded through a certain port of the device; the device port access control policy is a policy that does not allow a certain network segment to be forwarded through any port of the device. In the forwarding graph, the point is the device, the edge is the connection between the device port and the device port, and the edge has the network segment space allowed to be forwarded, which is encoded and stored using the Binary Decision Diagram (BDD).

[0039] In step 2, the operations of using BDD to encode and store the message space are as follows:

[0040] (1) Generate a BDD root node, specify the BDD encoding method, and determine the bit length of the message header to be encoded.

[0041] (2) For the access control policy set, convert each access control policy into the corresponding network segment space And store it in BDD diagram. Record the network segment space allowed to pass as , the network segment space that is not allowed to pass is . Encoding is performed in sequence according to the order of the policy items and the encoding results are stored.

[0042] (3) For the forwarding rule set, convert each forwarding rule into the corresponding network segment space Calculate the network segment space corresponding to each forwarding rule and store it in the BDD graph, and associate it with the corresponding outbound port, and record the current forwarding network segment space as . Encoding is performed in sequence according to the priority order of the forwarding rules and the encoding results are stored.

[0043] In order to better explain how to use BDD to encode and store network segment space, the following will be explained with specific examples. Figure 4 As shown, the specific process is as follows:

[0044] (1) Initialize the root node of BDD and read the network segment space specified by the access control policy and forwarding rules. For each bit in the input network segment space, BDD will add a subtree layer downward. Figure 4 In it is specified that for a value of "0", BDD will add a subtree to the left; for a value of "1", BDD will add a subtree to the right.

[0045] (2) Read in order Figure 4 (1) shows the access control policies (ACL1, ACL2). The policy corresponding to ACL1 is to not allow the network segment with IP address 255.255.255.0 / 24 to forward, so BDD will first encode the corresponding network segment space and mark it as Deny. Then, because the policy corresponding to ACL2 is to allow the network segment with IP address 255.255.254.0 / 23 to forward, it is necessary to first obtain the network segment space corresponding to ACL2 and The intersection of the Deny network segment space is marked as Allow, such as Figure 4 (2) as shown.

[0046] (3) Read in order of priority Figure 4 (1) shows the forwarding rules (Rule1, Rule2). The forwarding rule corresponding to Rule1 is that the network segment with the destination IP address of 255.255.0.0 / 16 is forwarded from port 1, so BDD will first encode the corresponding network segment space and mark it as forwarding from port 1. Then, because the forwarding rule corresponding to Rule2 is that the network segment with the destination IP address of 255.254.0.0 / 15 is forwarded from port 2, it is necessary to first find the non-intersection part of the network segment space corresponding to Rule2 and Rule1, and mark it as forwarding from port 2, as shown in Figure 4 (3) as shown.

[0047] Step 3: Select a destination service port from the destination service network having all destination service ports, and use it as a starting point to construct a destination forwarding graph, wherein the destination service network is a global network having global topology information and a set of destination service ports.

[0048] Specifically, one is selected from a set of ports having a service network segment as a destination service port, and the read topological connection relationship is reused to construct a destination forwarding graph from the destination service port to other ports.

[0049] Step 4: In the destination forwarding graph constructed in step 3, starting from the destination service port, a deep search is performed along the topology structure. When it encounters another service port or accesses a duplicate port or the message space has no intersection, the search branch ends and returns to the previous layer.

[0050] The specific operations for deep search of the destination forwarding graph are as follows:

[0051] (1) The destination forwarding graph starts from the destination service port, generates the corresponding network segment space, records the access path, and starts forwarding this network segment space in a deep search manner.

[0052] (2) Mark each device port accessed during the deep search process and determine whether it is a device port that has been accessed. If so, it is considered that a loop has occurred. At this time, exit the search of this branch and return to the previous layer.

[0053] (3) For each new non-loop port, use BDD (binary decision diagram) to determine the intersection of the forwarded network segment space and the new port forwarding strategy network segment space. If there is no intersection, abandon the search of this branch and return to the previous layer; if there is an intersection, take the intersection and continue the search of the next layer.

[0054] (4) For the service port in the destination service network, store the network segment space forwarded to the current service port, stop the current search, and return to the previous layer to continue searching using the same network segment intersection.

[0055] (5) Repeat recursive steps (2) to (4) until all depth-of-depth search (DFS) traversals are completed.

[0056] In order to better illustrate the specific process of the depth search of the present invention, the following will be described with reference to specific examples. Figure 3 The following describes this process in detail:

[0057] (1) The destination forwarding graph starts from the destination service port, generates the corresponding network segment space, records the access path, and starts forwarding this network segment space in a deep search manner. Figure 5 As shown in (1): Service port D generates a network segment space named P1, starts a deep search, and forwards to port A.

[0058] (2) Mark each port visited during the deep search and determine whether it is a port that has been visited. If so, it is considered that a loop has occurred. At this time, the search of this branch is exited and returned to the previous layer. Figure 5 As shown in (2): The network segment space at service port A will not be forwarded to D because this will form a loop, but will be forwarded to E or S.

[0059] (3) For each new port that is not a loop, use BDD to determine the intersection of the forwarded network segment space and the new port forwarding strategy network segment space. If there is no intersection, abandon the search of this branch and return to the previous layer; if there is an intersection, take the intersection and continue the search of the next layer. Figure 5 As shown in (3): the network segment forwarded to B via port D->A->S will continue to search towards F and G because there is an intersection P2; while the network segment forwarded to C via port D->A->S will stop searching immediately because there is no intersection.

[0060] (4) For the service port in the destination forwarding graph, store the network segment space forwarded to the current service port and return to the previous layer to continue searching. Figure 5 As shown in (4): The result is forwarded to the network segment of F via port D->A->S->B, and then returns to the previous layer and continues to search towards G.

[0061] (5) Repeat recursive steps (2) to (4) until all DFS traversals are completed.

[0062] Step 5. After the deep search is completed, the destination forwarding graph evaluates all service ports except the destination service port to determine whether there is a network segment forwarded from the destination service port. If there is and the destination service port network segment is not allowed to access, it is considered that the service interface is not isolated from the destination service port and the network is not secure; otherwise, the network is considered secure.

[0063] Figure 6 The network segment isolation judgment diagram of the present invention is shown: the destination forwarding diagram evaluates all service ports except the destination service port to determine whether there is a network segment forwarded from the destination service port. If so, it is considered that the service port is not isolated from the destination service port and the network is not secure; otherwise, it is considered that the network is relatively secure. Figure 6 As shown, in the embodiment of the present invention, the destination forwarding graph takes the destination service port D as the starting point, uses the service network segment P1 for deep search, and finally obtains the reachability information to the service ports E, F, G, etc. For E, F, and G, they all receive a subset P2 of the P1 network segment, so we believe that they are not completely isolated from D, that is, there are security risks in the network; and for H, since it does not receive any information, we believe that it is completely isolated from D, that is, the network is safe.

[0064] Step 6: Select the next destination service port, generate a destination forwarding graph, and continue the deep search until all destination service ports are traversed.

[0065] In summary, the present invention performs network modeling in steps 1 to 2 and uses a formal verification method in steps 3 to 6, so as to quickly and accurately calculate the mutual access relationship between business network segments. Combined with network planning information, the security of business network mutual access can be quickly and accurately determined.

[0066] The present invention also provides a system for determining the security of mutual access between business networks, which includes a memory, a processor, and a computer program stored in the memory, and the processor executes the computer program to implement the steps of a method for determining the security of mutual access between business networks as described above.

[0067] The present invention further provides a computer-readable medium, which may be included in the electronic device described in the above embodiment; or may exist independently without being assembled into the electronic device.

[0068] The computer-readable medium carries one or more programs. When the one or more programs are executed by an electronic device, the electronic device implements the method described in the above embodiments.

[0069] It should be noted that, although several modules or units of the device for action execution are mentioned in the above detailed description, this division is not mandatory. In fact, according to the embodiments of the present disclosure, the features and functions of two or more modules or units described above can be embodied in one module or unit. On the contrary, the features and functions of one module or unit described above can be further divided into multiple modules or units to be embodied.

[0070] It should be understood by those skilled in the art that embodiments of the present invention may provide methods, systems, storage media, or computer program products. Therefore, the present invention may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present invention may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

Claims

1. A method for determining the security of business network mutual access, characterized in that: The method comprises the following steps: Step 1: Mark the device ports of the access layer as service ports according to the provided fat tree network structure, and obtain the correct mutual access information between the service ports; Step 2: According to the specific information of the actual router, the corresponding device port forwarding rules, device port access control policies and connection topology are collected, and a forwarding graph is generated according to the connection topology; wherein the device forwarding rule is a rule that allows a certain network segment to be forwarded through a certain port of the device; the device port configuration policy is a policy that does not allow a certain network segment to be forwarded through any port of the device; in the forwarding graph, the point is the device, the edge is the connection between the device port and the device port, and the edge has a message space that allows forwarding, which is encoded and stored in BDD; In step 2, the operation of using BDD to encode and store network segment space is as follows: Step 2.1, generate a BDD root node, specify the encoding method of the BDD, and determine the bit length of the message header to be encoded; Step 2.2: For the access control policy set, convert each access control policy into the corresponding network segment space And store it in BDD diagram; record the network segment space allowed to pass as , the network segment space that is not allowed to pass is ; Encode and store the encoding results in sequence according to the order of strategies; Step 2.3: For the forwarding rule set, convert each forwarding rule into the corresponding network segment space And store it in BDD graph; calculate the network segment space corresponding to each forwarding rule and store it in BDD graph, and associate it with the corresponding outbound port, and record the current forwarding network segment space as , encode and store the encoding results in sequence according to the priority order of the forwarding rules; Step 3: Select a destination service port and construct a destination forwarding graph; Step 4: In the destination forwarding graph constructed in step 3, starting from the destination service port, perform a deep search along the topology structure. When it encounters another service port or accesses a duplicate port or the message space has no intersection, the search branch ends and returns to the previous layer. In step 4, the specific operation of performing a deep search on the destination forwarding graph is as follows: Step 4.1: The destination forwarding graph generates the corresponding network segment space from the destination service port, records the access path, and starts forwarding this network segment space in a deep search manner; Step 4.2, mark each device port accessed during the deep search process, and determine whether it is a device port that has been accessed. If so, it is considered that a loop has occurred, and the search of this branch is exited at this time, and the previous layer is returned; Step 4.3: For each new port in the non-loop, use BDD to determine the intersection of the forwarded network segment space and the new port forwarding strategy network segment space; if there is no intersection, abandon the search of this branch and return to the previous layer; if there is an intersection, take the intersection and continue the search of the next layer; Step 4.4: For the service port in the destination service network, store the network segment space forwarded to the current service port, stop the current search, and return to the previous layer to continue searching using the same network segment intersection; Step 4.5, repeat recursively steps 4.2-4.4 until all the depth search traversals are completed; Step 5: After the deep search is completed, the destination service network evaluates all service ports except the destination service port to determine whether there is a network segment forwarded from the destination service port; if there is and the destination service network segment is not allowed to access, it is considered that the service port is not isolated from the destination service port and the network is not secure; otherwise, the network is considered secure; Step 6: Select the next destination service port according to the destination service network, and continue the deep search until all destination service ports are traversed.

2. A method for determining the security of business network mutual access according to claim 1, characterized in that: The step 3 is specifically as follows: selecting a destination service port from a port set having a service network segment, and reusing the read topological connection relationship to construct a destination forwarding graph from the destination service port to other ports.

3. A system for determining the security of business network mutual access, characterized in that: It includes a memory, a processor and a computer program stored in the memory, and the processor executes the computer program to implement the steps of a method for determining the security of business network mutual access as described in claim 1 or 2.

4. A computer-readable storage medium having a computer program / instruction stored thereon, characterized in that: When the computer program / instructions are executed by the processor, the steps of a method for determining the security of mutual access between business networks as described in claim 1 or 2 are implemented.

5. A computer program product comprising a computer program / instructions, characterized in that When the computer program / instructions are executed by the processor, the steps of a method for determining the security of mutual access between business networks as described in claim 1 or 2 are implemented.

Citation Information

Patent Citations

  • Intrusion behavior detection method and system and electronic equipment

    CN113079124A

  • Network system service change management method and device, equipment and storage medium

    CN116723100A

  • Dynamic access control method and system

    CN118041517A

  • System and method for migrating to and maintaining a white-list network security model

    US20180367541A1

  • Network Modeling and Device Configuration Based on Observed Network Behavior

    US20200127893A1

Cited By

  • Incremental analysis method and system for judging network asset mutual access security and storage medium

    CN121056248A

  • An incremental analysis method, system and storage medium for judging network asset mutual visit security

    CN121056248B