Network attack event visualization processing method, related device and medium
By building a network attack event tree and merging redundant nodes, the problem of low visual presentation of network attack events in the existing technology is solved, and the amount of information and delivery efficiency is improved, helping administrators better handle network attack events.
Patent Information
- Application Number
- CN202310540681.X
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2023-05-12
- Publication Date
- 2024-11-12
AI Technical Summary
The existing technology is difficult to effectively visualize the presentation of network attack events, resulting in congestion of interfaces, large amount of information, and low information transmission efficiency, affecting the administrator's incident investigation and processing.
The visual processing method of network attack incidents is adopted to build an attack event tree through node processing, merge nodes that meet predetermined conditions, reduce redundant information, improve the amount of information and transmission efficiency.
It realizes efficient and streamlined transmission of event contacts in the network attack event tree, reduces redundant information, improves the amount of information presented in visual presentation and information transmission efficiency, and helps administrators better respond to network attack events.
Smart Images

Figure CN118944905A_ABST
Abstract
Description
Technical Field
[0001] The present disclosure relates to the field of data security, and in particular to a method for visualizing and processing network attack events, and related devices and media. Background Art
[0002] Event investigation is needed in the field of server security. Event investigation refers to identifying network attack events from the operation of the server, investigating the occurrence time, relationship, sequence, etc. of various network attack events, and presenting them to the administrator user in the form of a list for the administrator user to analyze so as to take relevant measures against the network attack events. The related technology is not intuitive in the way of visually presenting various network attack events to the administrator user. When there are too many network attack events, the interface appears crowded and untidy, the amount of useful information on the interface is small, and the efficiency of information transmission is poor, which is not conducive to the administrator user to correctly respond to network attack events. Summary of the invention
[0003] The embodiments of the present disclosure provide a method, a related device and a medium for visualizing network attack events in an electronic map, which can improve the amount of information presented and the efficiency of information transmission when visually presenting various network attack events.
[0004] According to one aspect of the present disclosure, a method for visualizing a network attack event is provided, comprising:
[0005] Obtain multiple network attack events against the target subject;
[0006] Node processing is performed on the network attack events to obtain tree nodes, and the association relationship of the network attack events is obtained, and the tree nodes are connected by using the association relationship to obtain the network attack event tree of the target subject;
[0007] Determining that the same layer of the network attack event tree contains nodes to be merged that meet a predetermined condition;
[0008] Acquiring node data of the nodes to be merged, integrating the node data of the nodes to be merged into node data of a merged node, thereby merging the nodes to be merged into the merged node;
[0009] The merged node is displayed on the network attack event tree, and a merge mark is displayed on the merged node.
[0010] According to one aspect of the present disclosure, a network attack event visualization processing device is provided, comprising:
[0011] A first acquisition unit, used to acquire multiple network attack events on a target subject;
[0012] A node processing unit, used to perform node processing on the network attack event to obtain a tree node, and obtain the association relationship of the network attack event, and connect the tree nodes using the association relationship to obtain the network attack event tree of the target subject;
[0013] A first determining unit, configured to determine whether the network attack event tree contains nodes to be merged that meet a predetermined condition on the same layer;
[0014] A second acquisition unit is used to acquire the node data of the nodes to be merged, integrate the node data of the nodes to be merged into the node data of the merged node, and merge the nodes to be merged into the merged node;
[0015] The first display unit is used to display the merged node on the network attack event tree and display a merge mark on the merged node.
[0016] Optionally, the node data of the tree node includes a node identifier of the tree node and a parent node identifier of the tree node on the network attack event tree;
[0017] The node processing unit is specifically used for:
[0018] The tree node whose parent node identifier in the node data of the tree node is empty is used as the root node of the network attack event tree, and the root node is used as the determined layer node;
[0019] Execute a first process, which includes: using a tree node whose parent node identifier in the node data of the tree node is equal to a node identifier of the determined layer node as a lower-layer tree node of the determined layer node, and using the lower-layer tree node to update the determined layer node, and returning to the first process until the lowest-layer tree node is determined, thereby obtaining the network attack event tree.
[0020] Optionally, the network attack event visualization processing device further includes:
[0021] A second determining unit is used to determine, for each of the network attack events, that other network attack events among the plurality of network attack events have the same node identifier as the network attack event;
[0022] The third acquisition unit is used to acquire the node data of the tree nodes corresponding to the other network attack events, and delete the node data.
[0023] Optionally, the node data of the tree node also includes the process name of the network attack event, the command line, the time information of obtaining the network attack event, and the identified alarm type;
[0024] The network attack event visualization processing device also includes:
[0025] A first response unit, configured to obtain the process name, the command line, the time information, and the alarm type in the node data of the target tree node in response to a first trigger of the target tree node of the network attack event tree;
[0026] The second display unit is used to display the obtained process name, command line, time information and alarm type.
[0027] Optionally, the network attack event visualization processing device further includes:
[0028] A third determining unit, configured to determine a first coordinate of the tree node based on a layer number of the tree node in the network attack event tree;
[0029] A first execution unit is configured to traverse from the top layer of the network attack event tree from top to bottom, and for a first current traversal layer, execute a second process, wherein the second process comprises: for each of the tree nodes of the first current traversal layer, obtaining a next layer node extending from the tree node; determining a second coordinate of the next layer node extending from the tree node as a first value, wherein the first value is equal to the sum of a sequence number of the next layer node and a total number of next layer nodes extending from other nodes before the tree node in the first current traversal layer;
[0030] A combining unit, used for combining the first coordinate and the second coordinate of the tree node into the coordinate of the tree node;
[0031] The third display unit is used to display the tree node according to the coordinates.
[0032] Optionally, the network attack event visualization processing device further includes:
[0033] The second execution unit is used to traverse from the second to last layer of the network attack event tree from bottom to top, and for the second current traversal layer, execute a third process, and the third process includes: for each tree node of the second current traversal layer, based on the average of the second coordinates of the next layer nodes extending from the tree node, updating the second coordinate of the tree node.
[0034] Optionally, the second acquiring unit is specifically configured to:
[0035] Generate node data of the merged node, wherein the node data of the merged node includes a merged node identifier, the node identifier of each of the nodes to be merged, and the parent node identifier;
[0036] The node data of the node to be merged is deleted.
[0037] Optionally, the node data of the merged node further includes a merge flag;
[0038] The first display unit is specifically used to: traverse the node data of each tree node in the network attack event tree, and if the node data of the tree node includes the merge flag, display the merge mark on the merged node.
[0039] Optionally, the network attack event visualization processing device further includes:
[0040] a second response unit, configured to, in response to a second trigger on a target tree node of the network attack event tree, obtain the node identifier and the parent node identifier of the node to be merged from the node data of the merged node if the target tree node is the merged node, and restore the node data of each node to be merged according to the node identifier and the parent node identifier of the node to be merged;
[0041] The first deleting unit is used to delete the node data of the merged node.
[0042] Optionally, the second acquisition unit is specifically configured to: store the coordinates of the to-be-merged node into the node data of the merged node;
[0043] The first deleting unit is used to put the coordinates of the node to be merged stored in the node data of the merged node into the node data of each restored node to be merged, and delete the node data of the merged node.
[0044] Optionally, the network attack event visualization processing device further includes:
[0045] A first receiving unit, configured to receive a third trigger for a parent node of the restored tree node;
[0046] The returning unit is used to return to the step of determining the first coordinate of the tree node based on the layer number of the tree node in the network attack event tree.
[0047] Optionally, the second acquiring unit is specifically configured to:
[0048] Set a tree node number counter, wherein the tree node number counter is initialized to 0;
[0049] Execute a fourth process, the fourth process comprising: starting from the topmost layer of the network attack event tree and traversing from top to bottom, for the third current traversal layer, integrating the node data of the nodes to be merged in the third current traversal layer that meet the predetermined conditions into the node data of the merged node, thereby merging the nodes to be merged into the merged node, and after traversing the last layer, determining the number of nodes in the attack transaction tree, if the number of tree nodes is inconsistent with the tree node number counter, updating the tree node number counter with the tree node number, and repeating the fourth process until the number of tree nodes is consistent with the tree node number counter.
[0050] Optionally, the first display unit is specifically used to:
[0051] Based on the node data of each tree node of the network attack event tree, obtain a node set corresponding to each path of the network attack event tree, and obtain a path set, wherein the path set includes each path of the network attack event tree;
[0052] Set a line segment set to be rendered, wherein the line segment set to be rendered is initially an empty set;
[0053] Executing a fifth process, the fifth process comprising: taking out an untaken path from the path set, obtaining a node set corresponding to the untaken path, if a line segment between adjacent nodes in the tree node set is not in the line segment set to be rendered, adding the line segment to the line segment set to be rendered, and marking the untaken path as taken out, repeating the fifth process until all paths in the path set are marked as taken out;
[0054] The line segments in the set of line segments to be rendered are rendered and displayed to display the network attack event tree, wherein the network attack event tree has the merged node.
[0055] Optionally, the node data of the tree node includes a node identifier of the node tree and a parent node identifier of the node tree;
[0056] The first display unit is specifically used for:
[0057] For each bottom-level tree node of the network attack event tree, the bottom-level tree node is used as a node to be investigated and put into a node set;
[0058] Executing a sixth process, the sixth process comprising: obtaining a tree node whose node identifier in the node data of the tree node is equal to the parent node identifier of the node to be examined, putting the obtained tree node into the tree node set, and updating the node to be examined with the obtained tree node, repeating the sixth process until the node to be examined is the root node of the top layer of the network attack event tree;
[0059] The path from the bottom tree node to the root node in the repeated sixth process is put into the path set, and the tree node set is used as the node set corresponding to the path.
[0060] Optionally, the network attack event visualization processing device further includes:
[0061] A third response unit, configured to, in response to a fifth trigger on a target tree node of the network attack event tree, obtain the node set where the target tree node is located;
[0062] The fourth display unit is used to display the path corresponding to the node set in a first manner.
[0063] Optionally, the node data of the tree node includes the identified alarm type;
[0064] The network attack event visualization processing device also includes:
[0065] a fourth response unit, configured to, in response to a fifth trigger on a target tree node of the network attack event tree, obtain a plurality of node sets where the target tree node is located;
[0066] A fourth acquisition unit, configured to acquire the alarm type in the node data of the target tree node;
[0067] A fifth display unit is used to display the path corresponding to the node set in a second manner if the alarm type of each of the tree nodes in the node set obtained is the same as the alarm type in the node data of the tree node.
[0068] According to one aspect of the present disclosure, an electronic device is provided, including a memory and a processor, wherein the memory stores a computer program, and the processor implements the above-mentioned network attack event visualization processing method when executing the computer program.
[0069] According to one aspect of the present disclosure, a computer-readable storage medium is provided, wherein the storage medium stores a computer program, and when the computer program is executed by a processor, the network attack event visualization processing method as described above is implemented.
[0070] According to one aspect of the present disclosure, a computer program product is provided. The computer program product includes a computer program. The computer program is read and executed by a processor of a computer device, so that the computer device executes the above-mentioned network attack event visualization processing method.
[0071] In the disclosed embodiment, a network attack event tree of the target subject is constructed based on the node data of the tree nodes of multiple network attack events of the target subject. Each network attack event is equivalent to a node. The connection between each network attack event is efficiently and concisely transmitted in the network attack event tree. For some nodes that meet the predetermined conditions, they are merged in the network attack event tree, thereby reducing the expression of some redundant information in the visual presentation, making the remaining information more refined, and improving the amount of information in the visual presentation and the efficiency of information transmission, which is conducive to the correct response to network attack events.
[0072] Other features and advantages of the present disclosure will be described in the following description, and partly become apparent from the description, or understood by practicing the present disclosure. The purpose and other advantages of the present disclosure can be realized and obtained by the structures particularly pointed out in the description, claims and drawings. BRIEF DESCRIPTION OF THE DRAWINGS
[0073] The accompanying drawings are used to provide further understanding of the technical solution of the present disclosure and constitute a part of the specification. Together with the embodiments of the present disclosure, they are used to explain the technical solution of the present disclosure and do not constitute a limitation on the technical solution of the present disclosure.
[0074] Figure 1 is a system architecture diagram of a method for visualizing processing network attack events according to an embodiment of the present disclosure;
[0075] Figure 2A -G is a schematic diagram of the network attack event visualization processing method according to the embodiment of the present disclosure applied to the server network attack event investigation scenario;
[0076] Figure 3 is a flowchart of a method for visualizing and processing network attack events according to an embodiment of the present disclosure;
[0077] Figure 4 A schematic diagram showing the frame structure of node data of a network attack event is shown;
[0078] Figure 5 is Figure 3 On the basis of the above, a flowchart of the process of deduplication of network attack events is added;
[0079] Figure 6 yes Figure 3 Step 320 constructs a flow chart of a network attack event tree;
[0080] Fig. 7A It is a schematic diagram of node data of multiple tree nodes;
[0081] Figure 7B is based on Fig. 7A A schematic diagram of a network attack event tree generated by node data of the tree nodes;
[0082] Figure 8 is Figure 3 On the basis of adding a flow chart of the process of determining node coordinates;
[0083] Fig.9A -F is a schematic diagram of the process of determining the coordinates for each node in the network attack event tree;
[0084] Fig.10 yes Figure 3 Step 330 generates a flow chart of the merged nodes;
[0085] Fig.11A is based on Fig. 7A A schematic diagram of generating node data of a merged node from node data of a tree node;
[0086] Fig. 11B is based on Fig.11A A schematic diagram of a network attack event tree generated by node data of the tree nodes;
[0087] Fig.12 yes Figure 3 Step 330 generates a flow chart of the merged nodes;
[0088] Fig.13A -C is Fig.12 Schematic diagram of the process of generating merged nodes;
[0089] Fig.14 is a diagram of an example of a cyber attack event tree;
[0090] Fig.15 It is a flow chart for generating a cyber attack event tree;
[0091] Fig.16 yes Figure 3 Step 340 shows a flow chart of a network attack event tree;
[0092] Fig.17 yes Fig.16 A schematic diagram of the path set described in step 1610;
[0093] Fig.18A -C is Fig.16 A schematic diagram of the process of obtaining a set of line segments to be rendered in ;
[0094] Fig.19 yes Fig.16 Step 1610 is a flow chart for obtaining a path set;
[0095] Fig. 20A -E is Fig.19 A schematic diagram of the process of obtaining a path set in ;
[0096] Fig.21 is Figure 3 A flow chart based on the response to the first trigger;
[0097] Fig. 22 is Figure 3 A flow chart based on the response to the second trigger;
[0098] Fig.23A yes Fig.11A A schematic diagram of the node data after the node data of the tree node is restored;
[0099] Fig. 23B yes Fig. 11B Schematic diagram of the network attack event tree after the network attack event tree is restored;
[0100] Fig.24 yes Fig.11A A schematic diagram of storing node coordinates in the node data of a tree node;
[0101] Fig.25 It is a flow chart showing the node after recovery;
[0102] Fig.26 is a flow chart in response to a third trigger;
[0103] Fig. 27 is a flow chart in response to a fourth trigger;
[0104] Fig.28 is Fig. 27 A flowchart showing the node information of each to-be-merged node contained in the merged node based on the above;
[0105] Fig.29 yes Fig.28 The schematic diagram showing the node information of each to-be-merged node contained in the merged node;
[0106] Fig.30 is Fig. 27 A flow chart showing the node information of the next layer of tree nodes of the tree node based on the above;
[0107] Fig.31 yes Fig.30 A schematic diagram of the node information of the next layer of tree nodes of the display tree node;
[0108] Fig.32 is a flow chart in response to a fifth trigger;
[0109] Fig.33 yes Fig.32 In response to the fifth trigger, a schematic diagram of a path where the target tree node is located is displayed;
[0110] Fig.34 is a flow chart in response to a sixth trigger;
[0111] Fig.35 yes Fig.34 In response to the sixth trigger, a schematic diagram of a path corresponding to a set of nodes having the same alarm type as the target tree node is displayed;
[0112] Fig.36 is a flowchart of the overall implementation details of the network attack event visualization processing method according to the embodiment of the present disclosure;
[0113] Fig.37 is a module diagram of a network attack event visualization processing device according to an embodiment of the present disclosure;
[0114] Fig.38 According to the embodiment of the present disclosure Figure 3 The terminal structure diagram of the network attack event visualization processing method shown;
[0115] Fig.39 According to the embodiment of the present disclosure Figure 3 The server structure diagram of the network attack event visualization processing method is shown. DETAILED DESCRIPTION
[0116] In order to make the purpose, technical solution and advantages of the present disclosure more clear, the present disclosure is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present disclosure and are not used to limit the present disclosure.
[0117] Before further describing the embodiments of the present disclosure in detail, the nouns and terms involved in the embodiments of the present disclosure are described. The nouns and terms involved in the embodiments of the present disclosure are subject to the following interpretations:
[0118] Network attack incidents: offensive incidents targeting computer information systems, basic equipment, computer networks or personal computer equipment. Common types of network attack incidents include: malicious occupation of server system resources, consumption of server CPU and memory resources, harm to network systems such as firewalls, consumption of resources for specific applications or services in the server application layer, and introduction of viruses into the server.
[0119] Attack tracing: tracing the causes and consequences of server network attacks, attack sources, and intermediate events.
[0120] Tree structure: A data structure in which there is a "one-to-many" tree relationship between data elements. In a tree structure, the root node has no predecessor node, and each of the remaining nodes has one and only one predecessor node. Leaf nodes have no successor nodes, and the number of successor nodes for each of the remaining nodes can be one or more.
[0121] System architecture and scenario description of the application of the embodiments of the present disclosure
[0122] Figure 1 1 is a system architecture diagram used in the network attack event visualization processing method according to an embodiment of the present disclosure, which includes an attack terminal 110, a server 120, and a display terminal 130, wherein the server 120 also includes a security analysis device 121.
[0123] The attack terminal 110 is a device that launches a network attack event to the server 120. It includes desktop computers, PDAs (personal digital assistants), mobile phones, vehicle-mounted terminals, home theater terminals, dedicated terminals, etc. In addition, it can be a single device or a collection of multiple devices. For example, multiple devices are connected through a local area network and work together using a common display device, forming an attack terminal 110.
[0124] The server 120 refers to a computer system that can provide certain services. The server 120 can be a high-performance computer in a network platform, a cluster of multiple high-performance computers, a portion of a high-performance computer (such as a virtual machine), a combination of portions of multiple high-performance computers (such as virtual machines), etc. The server 120 will be attacked by the attack terminal 110, and a network attack event will be generated for each attack.
[0125] The security analysis device 121 refers to the information in the server 120, which is used to investigate the process name, command line, time information, alarm type, etc. of the occurrence of network attack events, and is also used to determine the correlation and occurrence sequence between network attack events. The security analysis device 121 can be an independent device in the server 120; it can also be a specific program that can be combined with the service provided by the server 120.
[0126] The display terminal 130 refers to a device that can be used to display network attack events and the association between network attack events. The administrator can view network attack events through the display terminal 130, and can also handle network attack events through the display terminal 130. The display terminal 130 can be a desktop computer, a mobile phone, a dedicated terminal, etc., which communicates with the server 120 through the Internet; it can also be a display device directly connected to the server 120.
[0127] The embodiments of the present disclosure can be applied in various scenarios, such as Figure 2A -G shows the server network attack incident investigation scenario, etc.
[0128] See also Figure 2A In the server network attack event investigation scenario, the network attack event tree shows multiple network attack event nodes and the relationship between network attack event nodes. Network attack event nodes include: attack source node (address information of the attacking terminal that attacks the server), access vulnerability node (vulnerability information existing in the server and accessed by the attacked terminal), attacked server node (address information of the attacked server), process node (process information accessed by the network attack event, such as Figure 2A AE in the process), and file nodes (file information accessed by network attack events, such as Figure 2A AB in the file). Network attack event nodes are also divided into alarm nodes and ordinary nodes. Alarm nodes refer to event nodes where network attack events cause risk alarms to the server, and ordinary nodes refer to event nodes that do not generate risk alarms. Among them, alarm nodes are also divided into pending alarm nodes and processed alarm nodes. Different types of nodes have different manifestations in the event association relationship display diagram. Administrators can directly determine the type of each event node through different manifestations, so as to adopt different processing methods for different event node types. The node name is displayed below the node, and the administrator can also select a specific event node to view event information through specific trigger instructions. For example, when the administrator puts the mouse on the "Process C" node, the process information of "Process C" can be viewed, including: process name, command line, event time. Since "Process C" is an alarm node, the process information also includes: alarm type.
[0129] Figure 2B In the example above, the administrator can select a specific network attack event node to handle the event through another specific trigger method. Figure 2A The difference is that this method can display more detailed information of the network attack event node and enable the administrator to handle the event. For example, when the administrator double-clicks the "Process C" node, the process information and alarm information of the node will be displayed in the event investigation interface. Figure 2A Basically similar, the alarm information will describe the specific alarm type, processing status, and operation of the event. The specific alarm type indicates the severity and specific alarm type of the alarm event, such as password cracking and malicious requests; the processing status indicates whether the event node is "pending" or "processed"; the operation is the operation instruction that the administrator can perform on the node, such as viewing the alarm details and selecting a specific processing method. The processing methods may include: marking the alarm as processed, adding the alarm to the whitelist, ignoring the alarm, and deleting the alarm. The administrator can perform the corresponding operation on the alarm by selecting the processing method.
[0130] Figure 2C In the network attack event tree, a merged node is included. A merged node is generated by merging multiple network attack event nodes to be merged on the same layer that meet the predetermined conditions. The merge mark in the upper right corner of the node indicates that the merged node is formed by merging several nodes to be merged. For example, "Process C" is a merged node, and the merge mark in the upper right corner is 2, indicating that it is formed by merging two nodes to be merged. When the administrator executes a specific trigger instruction ( Figure 2C If you hover the mouse over the node, you can view the process information of the merged node. The process information includes: process name, number of nodes to be merged, alarm type of the alarm node, and "Split Node" field. Figure 2D As shown in the figure, the administrator can split a merged node into multiple network attack event nodes by clicking "Split Node". After clicking "Split Node", the network attack event tree is as follows Figure 2E As shown, “Process C” is split into two network attack event nodes named “Process C”.
[0131] If a network attack event node has multiple sub-nodes, the sub-nodes that meet the predetermined conditions can be merged. Figure 2F As shown in the figure, there are two sub-nodes under "Process C", namely "File A" and "File B". Put the mouse on "Process C" to display the process information of "Process C" and the "Merge Node" field in the upper right corner. The administrator selects "Merge Node" to merge the sub-nodes that can be merged under "Process C". "File A" and "File B" are two sub-nodes that can be merged. Therefore, after clicking "Merge Node", the network attack event relationship diagram becomes as follows: Figure 2G As shown in the figure, "File A" and "File B" are merged into one node, and the merged node is a child node of "Process C". A merge mark is displayed in the upper right corner of the merged node, which means that the merged node is formed by merging two network attack event nodes. When the administrator places the mouse on the merged node, the node information of the node and the "Split Node" field are displayed. The administrator can split the node into the child nodes before the merger by clicking the "Split Node" field.
[0132] The reason why Figure 2C-G performs node merging and splitting because in the investigation of network attack events, there may be a large number of nodes in the network attack event relationship graph, many of which have similar properties or are caused by the same reasons. If they are not merged or split, the presented relationship graph will be redundant and complex, with a large amount of information, and it will not be easy to extract useful information, so as to find the correct response plan for the network attack event. The disclosed embodiment makes the remaining information more refined through merging and splitting, improves the amount of information presented visually and the efficiency of information transmission, and is conducive to the correct response to network attack events.
[0133] General description of the disclosed embodiments
[0134] According to an embodiment of the present disclosure, a method for visualizing and processing network attack events is provided.
[0135] The visualization processing method of network attack events is often used in Figure 2A -G server network attack incident investigation scenario. Figure 2A -G It can be seen that the embodiment of the present disclosure can split and merge network attack event nodes in the network attack event tree, thereby improving the amount of information presented visually and the efficiency of information transmission.
[0136] like Figure 3 As shown, according to one embodiment of the present disclosure, a method for visualizing and processing network attack events includes:
[0137] Step 310: Acquire multiple network attack events against the target subject;
[0138] Step 320: Node-process the network attack events to obtain tree nodes, obtain the association relationships of the network attack events, and connect the tree nodes using the association relationships to obtain the network attack event tree of the target subject;
[0139] Step 330: Determine whether the same layer of the network attack event tree contains nodes to be merged that meet a predetermined condition;
[0140] Step 340: Obtain node data of the nodes to be merged, integrate the node data of the nodes to be merged into the node data of the merged node, and merge the nodes to be merged into the merged node;
[0141] Step 350: Display the merged node on the network attack event tree, and display a merge mark on the merged node.
[0142] exist Figure 1 Under the system architecture, steps 310-350 are executed by the security analysis device 121 in the server 120, but in some cases, it can also be executed by other parts of the server 120 or by the client.
[0143] The above steps 310 - 340 are described in detail below.
[0144] Detailed description of step 310
[0145] The target subject refers to the subject being attacked. A network attack event refers to the event that occurs when the target subject is attacked.
[0146] In one embodiment, obtaining multiple network attack events against a target entity includes: obtaining node data of multiple network attack events. The node data of the network attack event includes relevant information of the network attack event, such as the attack event node identifier, the time when the network attack event occurred, etc. The advantage of obtaining the node data of the network attack event is that the obtained node data can be displayed, thereby increasing the amount of information presented in the visualization processing of the network attack event.
[0147] In one embodiment, obtaining node data of multiple network attack events includes: obtaining node data of all network attack events that occurred in the target subject within a period of time before the current time. For example, the current time is 8:10:00 on December 5, 2022, and the previous period is one day, then the node data of all network attack events on the current server from 8:10:00 on December 4, 2022 to 8:10:00 on December 5, 2022 is obtained. Identifying network attack events is a common function of the current server's security analysis device. It can detect network attack events with the help of code analysis, parameter changes, and sudden changes in workload, and obtain node data of network attack events. For example, the node identifier of the network attack event can be obtained from the request to initiate the network attack event; for the attack time, it can be obtained through the system time, and so on. The purpose of this embodiment is to check the security status of the target subject in the recent period of time, so it is necessary to view all network attack events.
[0148] In another embodiment, obtaining node data of multiple network attack events against a target subject includes: determining a target network attack event; and obtaining node data of the target network attack event and other network attack events related to the target network attack event.
[0149] A target network attack event refers to a network attack event that is the target of concern. For example, a large number of resources on the server have been lost recently, which is likely due to the password being cracked. Therefore, only the network attack event of password cracking can be determined among all network attack events as the target network attack event. Other network attack events related to the target network attack event refer to events that are not the target network attack event itself, but have various connections (such as causal relationships) with the target network attack event. For example, an access vulnerability event is the result of a password cracking event, and therefore belongs to other network attack events related to the target network attack event. At present, the security analysis device of the server can detect various events from code analysis, parameter changes, and sudden changes in workload, and can also identify the type of event. If the type of the identified event is a target network attack event or other network attack events related to the target network attack event, the node data of these events can be obtained.
[0150] The advantage of this embodiment is that event relationship graphs can be generated for various events of concern. Compared with the solution of generating a unified event relationship graph for various events, the relationships between events can be sorted out in different categories, thereby improving the effectiveness of resisting targeted attacks in special scenarios.
[0151] Detailed description of step 320
[0152] In step 320, the network attack event needs to be first converted into a tree node, and the node data of the network attack event is associated with the tree node. In other words, the information in the node data of the network attack event can be viewed through the tree node.
[0153] In one embodiment, Figure 4 As shown, the node data of the tree node includes: node ID, parent node ID, process name, command line, time information, and alarm type.
[0154] The node identifier is used to indicate the network attack event. The node identifier of each network attack event is unique. When a network attack event occurs, an identifier will be generated for the network attack event. Even if two attacks occur in the same process but at different times, they are two different network attack events and should generate different node identifiers. The node identifier can be used to quickly find the node data of the tree node.
[0155] The parent node identifier is the event identifier of the parent event of the network attack event. There is a tree relationship between network attack events, that is, network attack events other than the root event have and only have one parent event, and the root event is the starting event of subsequent network attack events. For example, the target subject includes process A, process B, process C, and process D. Process B and process C are child processes of process A, and process D is the child process of process B. In the target subject, a network attack event is generated for each process. The tree relationship between network attack events needs to be determined according to the relationship between processes. In other words, network attack event A generated for process A is the parent event of network attack event B generated for process B and network attack event C generated for process C, and network attack event B is the parent event of network attack event D generated for process D. Therefore, the parent node identifier is included in the node data of the tree node to indicate the tree relationship between network attack events.
[0156] The process name indicates the location where the network attack event occurred. The process names of different network attack events may be the same, indicating that multiple network attack events have occurred against the process.
[0157] The command line refers to the command line that generates the network attack event. Through the command line, you can view the detailed information of the network attack event.
[0158] Time information refers to the time when the network attack event occurs.
[0159] The alarm type refers to the type of risk warning caused by the network attack event to the target entity. The alarm type can be password cracking, malicious request, malicious resource occupation, virus invasion, etc. According to different alarm types and danger levels, different risk levels can be set for alarm types, such as high risk, low risk, etc.
[0160] Based on the above embodiments, in one embodiment, Figure 5 As shown, after obtaining multiple network attack events on the target subject, the network attack event visualization processing method also includes:
[0161] Step 510: for each network attack event, determine whether other network attack events among the plurality of network attack events have the same node identifier as the network attack event;
[0162] Step 520: Obtain node data of tree nodes corresponding to other network attack events, and delete the node data.
[0163] Each network attack event has a unique corresponding node identifier. In the process of obtaining network attack events, it may happen that a network attack event is obtained repeatedly. For example, if the parent events of two network attack events are the same, then when the parent events of the two network attack events are obtained separately, the parent event will be obtained repeatedly. If repeated network attack events are not deduplicated, on the one hand, repeated network attack events will occupy storage resources and increase computing loss in the subsequent traversal process; on the other hand, in the process of constructing the network attack event tree, since network attack events are not unique, when determining the tree relationship between network attack events, it is impossible to determine which of the repeated network attack events is associated with, resulting in an unclear network attack event tree and reduced information transmission efficiency.
[0164] Therefore, in step 510 of the embodiment of the present disclosure, after obtaining multiple network attack events, for each network attack event, it is determined whether the node identifier in the node data of other network attack events is the same as the node identifier of the network attack event being checked. If there are network attack events with the same node identifier, it means that the network attack event is repeatedly obtained, and it is necessary to deduplicate the network attack events and retain only one of the network attack events.
[0165] In step 520, the node data of the tree nodes corresponding to other network attack events with the same node identifier as the network attack event being checked are obtained, and the node data are deleted. After the node data is deleted, among the tree nodes of all network attack events, only the node data of the tree node corresponding to the network attack event being checked is retained.
[0166] The advantage of the disclosed embodiment is that the uniqueness of the acquired network attack events is guaranteed, and the tree relationship between network attack events can be accurately found through node identifiers and parent node identifiers, so that the tree relationship can be clearly displayed, thereby improving the information transmission efficiency of network attack events.
[0167] In step 320, obtaining the association relationship of the network attack events includes: determining the association relationship between the network attack events according to the node identifier and the parent node identifier in the node data of the tree node. For example, in the node data of a tree node, the node identifier is A and the parent node identifier is B, then there is an association relationship between network attack event A and network attack event B. The tree node A corresponding to the network attack event A and the tree node B corresponding to the network attack event B need to be connected.
[0168] The tree nodes are connected by using the association relationship between network attack events to obtain the network attack event tree of the target subject. The network attack event tree includes multiple layers of tree nodes. The tree nodes of other layers except the bottom layer of the multi-layer tree nodes extend downward to the lower layer of tree nodes. Each tree node in the multi-layer tree nodes corresponds to a network attack event among multiple network attack events. The network attack event corresponding to the bottom layer of the multi-layer tree nodes is not the parent event of any other network attack event. The nodes except the bottom layer of the tree nodes extend downward to one or more lower layer of tree nodes.
[0169] In one embodiment, Figure 6 As shown, the association relationship of the network attack event is obtained, and the tree nodes are connected by using the association relationship to obtain the network attack event tree of the target subject, including:
[0170] Step 610: Use the tree node whose parent node is marked as empty in the node data of the tree node as the root node of the network attack event tree, and use the root node as the determined layer node;
[0171] Step 620, execute the first process, the first process includes: taking the tree node whose parent node identifier in the node data of the tree node is equal to the node identifier of a determined layer node as the lower-layer tree node of the determined layer node, and updating the determined layer node with the lower-layer tree node, and returning to the first process until the lowest-layer tree node is determined, thereby obtaining a network attack event tree.
[0172] In step 610, first, a tree node whose parent node identifier storage location is empty in the node data of multiple tree nodes is used as a root node. The root node does not have a parent event and is the first layer of the network attack event tree. For example, Fig. 7A The node data of the 8 tree nodes shown (only the node identifier and the parent node identifier are shown, and the remaining fields that may appear in the node data are not shown), the parent node identifier of the node data with node identifier D is empty, then the tree node corresponding to the node data is used as the root node of the network attack event tree.
[0173] After determining the first layer of the network attack event tree, it is necessary to loop through the node data of the remaining tree nodes to determine each layer of the network attack event tree. In order to perform the loop process, the root node is set to the determined layer node as the initial value of the loop process.
[0174] In step 620, the above-mentioned loop process is executed. First, the next-level tree node of the determined layer node is determined by executing the first process, and the tree node whose parent node identifier in the node data is the same as the node identifier in the node data of the determined layer node is used as the next-level tree node of the determined layer node. There may be multiple determined layer nodes, so it is necessary to determine the next-level tree node of each determined layer node in turn. After determining the next-level tree node of all determined layer nodes, modify the determined layer node and use the next-level tree node as the new determined layer node. Determine whether all the determined layer nodes are the lowest tree nodes. If there are determined layer nodes that are not the lowest tree nodes, then use the determined layer nodes to execute the first process again; if all the determined layer nodes are the lowest tree nodes, then terminate the loop, and at this time obtain a network attack event tree constructed according to the association relationship between multiple tree nodes.
[0175] For example, by Fig. 7A The node data of the tree nodes constructs a network attack event tree. Fig. 7A The root node of the network attack event tree can be determined to be tree node D, and tree node D is used as a determined layer node. The first process is performed on tree node D: among the node data of the remaining tree nodes, the parent node identified as D is tree node B, then the next lower tree node of tree node D is determined to be tree node B, and tree node B is used as a new determined layer node.
[0176] Tree node B is not the lowest-level tree node, and the first process is performed on tree node B: in the node data of the remaining tree nodes, the tree nodes A and C have parent nodes identified as B. Therefore, tree node A and tree node C are determined to be the lower-level tree nodes of tree node B, and tree node A and tree node C are used as new determined-level nodes.
[0177] If tree nodes A and C are not the lowest level tree nodes, the first process is performed on tree nodes A and C. The tree nodes E, F, and G are identified as the parent node A, so tree nodes E, F, and G are determined to be the lower level tree nodes of tree node A; the tree node C is identified as the parent node H, so tree node H is determined to be the lower level tree node of tree node C, and tree nodes E, F, G, and H are used as new determined level nodes. Tree nodes E, F, G, and H are all the lowest level tree nodes, the loop terminates, and the following is generated: Figure 7B The cyber attack event tree shown.
[0178] exist Figure 7B In the network attack event tree, from the root node (tree node D) to the lowest tree nodes corresponding to tree nodes E, F, G, and H, they are arranged layer by layer from top to bottom. It should be noted that Figure 7BThe top-down arrangement of the tree nodes shown is one of multiple selectable arrangements. The network attack event tree can also be arranged from left to right or from bottom to top.
[0179] The advantage of the embodiment of steps 610-620 is that the tree nodes of each layer of the network attack event tree are determined layer by layer, making the hierarchical structure in the network attack event tree clearer, facilitating the determination of the association between the network attack events corresponding to the tree nodes of each layer through the constructed network attack event tree, and improving the efficiency of searching for information through the network attack event tree.
[0180] After constructing the network attack event tree of the target subject, the network attack event tree needs to be displayed. In order to make the layout of each node in the network attack event tree clear and easy to find information, it is necessary to determine the position of each tree node of the network attack event tree.
[0181] In one embodiment, Figure 8 As shown, after obtaining the correlation relationship of the network attack event, connecting the tree nodes using the correlation relationship, and obtaining the network attack event tree of the target subject, it also includes:
[0182] Step 810: Determine the first coordinate of the tree node based on the layer number of the tree node in the network attack event tree;
[0183] Step 820: traverse from the top layer of the network attack event tree to the bottom layer, and execute the second process for the first current traversal layer; wherein the second process includes:
[0184] Step 821: For each tree node of the first currently traversed layer, obtain the next layer of nodes extending from the tree node;
[0185] Step 822: determine the second coordinate of the next layer node extended from the tree node as a first value, where the first value is equal to the sum of the sequence number of the next layer node and the total number of next layer nodes extended from other nodes before the tree node in the first currently traversed layer;
[0186] Step 830, traversing from the second to last layer of the network attack event tree from bottom to top, for the second current traversal layer, executing a third process, the third process comprising: for each tree node of the second current traversal layer, based on the average of the second coordinates of the nodes in the next layer extending from the tree node, updating the second coordinate of the tree node;
[0187] Step 840: Combine the first coordinate and the second coordinate of the tree node into the coordinate of the tree node.
[0188] Step 850: Display the tree nodes according to the coordinates.
[0189] In step 810, the first coordinate is determined according to the layer number of the tree node, and the layer number increases gradually from top to bottom. The first coordinate here is the ordinate, and the second coordinate is the abscissa. However, those skilled in the art should understand that the opposite setting may also be used.
[0190] like Figure 7B As shown, first let the root node be at (1,1), that is, both the horizontal and vertical coordinates are 1. The horizontal axis is horizontal to the right, and the vertical axis is vertically downward. Figure 7B In the example, the root node is located at level 1, so the first coordinate of the root node is 1. Each time you go down a level, the first coordinate of the tree node increases by 1, that is, the first coordinate of all tree nodes in the second level is 2, the first coordinate of all tree nodes in the third level is 3, and so on.
[0191] In step 820, the second coordinate of the tree node is initialized. Starting from the top layer of the network attack event tree, that is, the root node, the tree is traversed layer by layer downwards. Therefore, the top layer is set as the first current traversal layer as the initial value of the loop. Next, the second process is performed on the first current traversal layer.
[0192] In step 821 of the second process, each tree node of the first current loop traversal layer is traversed one by one from left to right, and the next layer of tree nodes extending downward from each tree node is obtained.
[0193] In step 822 of the second process, the initial second coordinate of the next-layer tree node is set to a first value, where the first value is equal to the sequence number of the next-layer tree node in all the next-layer tree nodes extending from the parent node plus the sum of the total number of next-layer tree nodes extending from other tree nodes before the parent node in the first current loop traversal layer.
[0194] For example, in Fig.9A In the network attack event tree shown, after the first coordinate of each tree node is determined according to the layer number, the first value of the second coordinate is obtained from top to bottom. First, take the first layer as the first current traversal layer, the tree node of the first layer is node D, and obtain the next layer of tree nodes of node D, and the next layer of tree nodes is node B. The first value of node B is the sum of the sequence number of node B in the next layer of tree nodes of node D and the total number of next layer nodes of the tree nodes before node D in the first current traversal layer, and node B is the only next layer of tree nodes of node D. Therefore, the sequence number of node B in the next layer of node D is 1, and node D is the only tree node in the first current traversal layer. Therefore, there are no other tree nodes before node D, and the sum of the total number of next layer tree nodes of the tree node before node D in the first current traversal layer is 0. Therefore, the first value of the second coordinate of node B is set to 1+0=1.
[0195] The number of network attack events is traversed from top to bottom, such as Fig. 9BAs shown, the first current traversal layer becomes the second layer of the network attack event tree. The tree node of the second layer is node B, and the next layer of tree nodes of node B are obtained, which are node A and node C respectively. The first values of node A and node C are respectively the sum of the sequence number of each tree node in the next layer of tree nodes of node B and the total number of next layer tree nodes of the tree nodes before node B in the first current traversal layer. The sequence number of node A in the next layer of tree nodes of node B is 1, and the sequence number of node C in the next layer of tree nodes of node B is 2; in the first current traversal layer, there is only one tree node, node B, and there are no other tree nodes before node B. Therefore, the first value of the second coordinate of node A is set to 1+0=1, and the first value of the second coordinate of node C is set to 2+0=2.
[0196] like Fig. 9C As shown, the first current traversal layer becomes the third layer of the network attack event tree. First determine the second coordinate of the next layer of tree nodes of node A in the third layer. The next layer of tree nodes of node A includes: node E, node F, and node G. The first values of node E, node F, and node G are respectively the sum of the sequence number of each tree node in the next layer of tree nodes of node A and the total number of next layer nodes of the tree nodes before node A in the first current traversal layer. The sequence numbers of node E, node F, and node G in the next layer of tree nodes of node A are 1, 2, and 3 respectively; in the first current traversal layer, there are no other tree nodes before node A. Therefore, the first value of the second coordinate of node E is set to 1+0=1; the first value of the second coordinate of node F is set to 2+0=2; the first value of the second coordinate of node G is set to 3+0=3. After the second coordinate of the next layer of tree nodes of node A is determined, the second coordinate of the next layer of tree nodes of node C is determined. The next tree node of node C is node H, and the first value of node H is the sum of the sequence number of node H in the next tree node of node C and the total number of next tree nodes of the tree node before node C in the first current traversal layer. The sequence number of node H in the next tree node of node C is 1. In the first current traversal layer, there is node A before node C, and the total number of next tree nodes of node A is 3. Therefore, the first value set as the second coordinate of node H is 1+3=4.
[0197] In step 830, the second coordinate generated in step 820 needs to be adjusted. The network attack event tree is traversed from the second to last layer from bottom to top, and the second to last layer is set as the second current traversal layer as the initial value of the loop. The second coordinate of each tree node in the second current traversal layer is updated to the average of the second coordinates of the tree nodes in the next layer of the tree node.
[0198] For example, Fig.9DIn the example, the second-to-last layer is set as the second current traversal layer, which contains nodes A and C. The second coordinates of nodes A and C are the averages of the second coordinates of the next-layer tree nodes of nodes A and C. Therefore, the second coordinate of node A is (1+2+3) / 3=2, and the second coordinate of node C is 4 / 1=4.
[0199] Fig.9E In the second current traversal layer, node B is included. The second coordinate of node B is the average of the second coordinates of node A and node C. Therefore, the second coordinate of node B is (2+4) / 2=3.
[0200] Fig.9F In the figure, the second currently traversed layer contains node D, and node D has only one next-layer tree node, node B. Therefore, the second coordinate of node D is equal to the second coordinate of node B, and the second coordinate of node D is 3.
[0201] In step 840, the first coordinate and the second coordinate are combined into the coordinate of the tree node.
[0202] In step 850, the tree nodes are displayed at corresponding positions according to the coordinates of each tree node. Fig.9D - The network attack event tree shown in FIG. 1-E, as the second coordinates of the nodes in the second current traversal layer are adjusted, the positions of the tree nodes will also change. The advantage of displaying the tree nodes of the network attack event tree at the coordinate positions is that the tree nodes are arranged in fixed positions, making the overall layout of the network attack event tree clearer and neater, and the relationship between the tree nodes is clearer, avoiding the problem of overlapping display of tree nodes when there are too many tree nodes, and more efficiently determining the association between events through the network attack event tree, and processing network attack events, thereby improving the efficiency of information transmission.
[0203] The advantage of the embodiment of steps 810-850 is that the position of the tree node display is determined by obtaining fixed coordinates for each tree node, so that the displayed network attack event tree is clearer and neater; the method of determining the coordinates in this embodiment allows the tree node coordinates to be adjusted according to the coordinates of the next layer of tree nodes, so that the association relationship between the tree nodes in the network attack event tree is clearer, the nodes are arranged more neatly, and the required events can be found more easily, thereby improving the efficiency of information search.
[0204] Detailed description of step 330
[0205] In each layer of nodes in the network attack event tree, nodes that meet predetermined conditions are determined as nodes to be merged.
[0206] The predetermined condition refers to the condition that in one layer of the network attack event tree, the next layer of tree nodes extending from the same parent node can be merged into one node. The predetermined condition can be all file nodes under the same parent process node. For example, node A is a process node, and node B, node C, and node D are the next layer of file nodes of node A, then node B, node C, and node D can be used as nodes to be merged. The predetermined condition can also be process nodes with the same process name under the same parent node. For example, node A and node B have the same parent node, and the corresponding network attack events occur in the same process, then node A and node B can be used as nodes to be merged.
[0207] Detailed description of step 340
[0208] In step 340, the node data of the nodes to be merged need to be integrated together so that the nodes to be merged can be merged into a merged node and displayed in the network attack event tree.
[0209] In one embodiment, Fig.10 As shown, the node data of the node to be merged are integrated into the node data of the merged node, including:
[0210] Step 1010: Generate node data of the merged node;
[0211] Step 1020: Delete the node data of the node to be merged.
[0212] In step 1010, node data of the merged node is generated according to the node data of the node to be merged. In one embodiment, the node data structure of the merged node includes: a merged node identifier, a node identifier of each node to be merged, and a parent node identifier.
[0213] The merged node identifier is a unique identifier used to indicate the node data of the merged node. In one embodiment, the merged node identifier is the node identifier of any one of all the nodes to be merged. Since the node identifier of any one of the nodes to be merged is unique, the merged node identifier obtained according to any one of the node identifiers is also unique. The advantage of using the node identifier corresponding to any one of all the nodes to be merged as the merged node identifier is that there is no need to regenerate a new identifier for the merged node, thereby improving the efficiency of generating the node data of the merged node.
[0214] The node identifier and parent node identifier of each node to be merged can be directly obtained from the node data of the node to be merged.
[0215] For example, the next layer of nodes extending from node A includes node B, node C, and node D. Node B, node C, and node D are nodes that can be merged if they meet predetermined conditions. Therefore, the node data of the merged node is {B, {(node identifier: B, parent node identifier: A), (node identifier: C, parent node identifier: A), (node identifier: D, parent node identifier: A)}}, where the first digit "B" of the node data of the tree node is the merged node identifier, and the second digit set stores the node identifier and parent node identifier of the node to be merged.
[0216] If there is a merged node in the node to be merged, then the complete node data of the node to be merged (merged node) needs to be stored in the node data of the merged node. For example, node B is the merged node of node B and node E, and the node data of the tree node corresponding to node B is {B, {(node identifier: B, parent node identifier: A), (node identifier: E, parent node identifier: A)}}, then the node data of the merged node of node B, node C, and node D is {B, {{(node identifier: B, parent node identifier: A), (node identifier: E, parent node identifier: A)}, (node identifier: C, parent node identifier: A), (node identifier: D, parent node identifier: A)}}. The node identifier and parent node identifier of the node to be merged are stored in the node data of the merged node so that the node to be merged contained in the merged node can be removed back to its original position when the node is split later.
[0217] The reason for storing the node identifier of the node to be merged and the parent node identifier in the node data of the merged node in correspondence is that if the parent node of the node to be merged in the original network attack event tree is not the same, the node to be merged can be restored to the next layer of tree nodes of the corresponding parent node in the subsequent splitting process. For example, the next layer of nodes of node A is node B, and the next layer of nodes of node Z is node C and node D. Node A and node Z are mergeable tree nodes. After node A and node Z are merged, node B, node C, and node D can also be merged. If the node identifier of the node to be merged is not stored in correspondence with the parent node identifier, when restoring to the original network attack event tree, the parent nodes of node B, node C, and node D may not be clear. Therefore, storing the node identifier of the node to be merged in correspondence with the parent node identifier can ensure the correctness of tree node recovery.
[0218] In step 1020, the node data of the node to be merged is deleted, and only the node data of the merged node is retained.
[0219] In another embodiment, the node data of the merged node also includes a merge flag. The node data of the tree node includes a merge flag, which means that the node is formed by merging multiple nodes to be merged and can be split.
[0220] For example, Fig.11A The node data for the tree nodes shown in is Fig. 7A The node data of the merged tree nodes shown in FIG. 1 is the node data of the merged node. In this example, tree nodes E, F, and G are file nodes extending from tree node A, and the predetermined condition is that all file nodes under the same tree node can be merged. Therefore, tree nodes E, F, and G are mergeable tree nodes that meet the predetermined condition. The node data of the merged node is as follows: Fig.11A The node data of the last tree node in the , including: the merged node identifier, the node identifier and parent node identifier of the node to be merged, and the merge flag. After generating the node data of the merged node, delete the node data of the node to be merged (tree node E, tree node F, and tree node G).
[0221] Correspondingly, in the following step 350 (described in detail later), the node data corresponding to each tree node in the network attack event tree is traversed. If the node data includes a merge flag, a merge flag is displayed on the merged node in the network attack tree.
[0222] For example, Fig. 11B The network attack event tree shown in Fig.11A Node E is a merged node of tree node E, tree node F, and tree node G. The node data of the merged node E contains a merge flag. Therefore, when displaying the network attack event tree, a merge mark is displayed on node E. In one embodiment, the merge mark is the number of nodes to be merged in the merged node, which is used to indicate that the merged node is formed by merging several nodes to be merged.
[0223] The advantage of this embodiment is that, through the merge flag, a tree node can be intuitively indicated as a merged node on the displayed network attack event tree, and it can be shown that the merged node is formed by merging several nodes to be merged, which is convenient for directly performing corresponding processing on the merged node, thereby improving the amount of information displayed by the network attack event tree and the efficiency of network attack event processing.
[0224] In addition, since the node data corresponding to each node to be merged has been merged into the node data of the merged node, in order to reduce redundancy and improve data storage efficiency, the node data of the node to be merged can be deleted.
[0225] The embodiment of steps 1010-1020 generates the node data of the merged node according to the node data of the node to be merged, and then deletes the node data of the node to be merged. The node data of the node to be merged is retained in the node data of the merged node, and the detailed information of the node to be merged can be directly obtained through the merged node quickly. Therefore, the advantage of this embodiment is that the efficiency of processing network attack events in the merged node through the network attack event tree is improved.
[0226] In the process of merging nodes in step 340, not all nodes to be merged that meet the predetermined conditions may be merged into a merged node in one round of merging. For example, the next layer of nodes of tree node A are tree node B and tree node C, and tree node B and tree node C are tree nodes that can be merged; the next layer of tree nodes of tree node B are tree node D and tree node E, and tree node D and tree node E are tree nodes that can be merged; the next layer of tree nodes of tree node C are tree node F and tree node G, and tree node F and tree node G are tree nodes that can be merged. In one round of merging, tree node B and tree node C can be merged into a merged node as a child node of tree node A; tree node D and tree node E can be merged into a tree node as a child node of the merged node of tree node B and tree node C; tree node F and tree node G can be merged into a merged node as a child node of the merged node of tree node B and tree node C. In the network attack event tree, the node after the merger of tree node D and tree node E and the node after the merger of node F and node G can also be merged, so a new round of merging is needed.
[0227] Therefore, in one embodiment, if Fig.12 As shown, obtaining node data of the nodes to be merged, integrating the node data of the nodes to be merged into the node data of the merged node, thereby merging the nodes to be merged into the merged node, includes:
[0228] Step 1210, setting a tree node number counter, and initializing the tree node number counter to 0;
[0229] Step 1220, execute the fourth process, the fourth process includes: starting from the top layer of the network attack event tree, traversing from top to bottom, for the third current traversal layer, integrating the node data of the nodes to be merged that meet the predetermined conditions in the third current traversal layer into the node data of the merged node, thereby merging the nodes to be merged into the merged nodes, and after traversing the last layer, determining the number of nodes in the attack transaction tree, if the number of tree nodes is inconsistent with the tree node number counter, then updating the tree node number counter with the tree node number, and repeating the fourth process until the number of tree nodes is consistent with the tree node number counter.
[0230] In this embodiment, the number of tree nodes in the last round of network attack transaction tree is recorded by a tree node number counter, and by comparing whether the tree node number counter is consistent with the number of tree nodes of the network attack event tree generated in this round, it is determined whether the network attack event tree has been completely merged. This process is specifically as follows: the initial value of the tree node number counter is set to 0; the network attack event tree is traversed from top to bottom, and the nodes to be merged that meet the predetermined conditions in each layer are merged into the merged nodes. After traversing the last layer, the number of tree nodes in the network attack event tree is determined; if the number of tree nodes is consistent with the tree node number counter, it means that the network attack event tree has been completely merged, and this process can be exited; if the number of tree nodes is inconsistent with the tree node number counter, it means that the network attack event tree has not been completely merged, and the value of the tree node number counter is updated to the number of tree nodes, and the number of network attack events is traversed again, and the nodes to be merged that can be merged in each layer are merged.
[0231] For example, Fig.13A The nodes to be merged in the network attack event tree are not merged, and the value of the node counter is initialized to 0; after a round of merging, Fig. 13B As shown in FIG. 1 , the number of tree nodes after the network attack event tree is merged is 4, which is inconsistent with the node number counter (0). Therefore, the tree node number counter is updated to 4, and the network attack event tree is merged in the next round; Fig. 13C As shown, after a new round of merging, the number of tree nodes in the network attack event tree after merging is 3, which is inconsistent with the tree node number counter (4). Therefore, the tree node number counter is updated to 3, and the next round of merging is performed on the network attack event tree. After a new round of merging, the tree nodes in the network attack event tree are not merged again, and the number of tree nodes in the network attack event tree is still 3, which is consistent with the tree node number counter (3). Therefore, the merging of the network attack event tree is completed and the merging process can be exited.
[0232] The advantage of this embodiment is that it ensures that all tree nodes that meet predetermined conditions in the network attack event tree can be merged, avoids the omission of mergeable nodes, and improves the accuracy and completeness of the generated merged network attack event tree.
[0233] like Fig.14 An example of a network attack event tree is shown, wherein tree node B, tree node C, tree node I, and tree node K are merged nodes, and the merge mark displayed in the upper right corner of the merged node indicates the number of nodes to be merged into the merged node.
[0234] like Fig.15The overall flow chart of merging nodes is shown. The process of merging nodes includes: taking the root node as the current node; finding the next layer of tree nodes of the current node. If the current node does not have a next layer of tree nodes, it means that the current node is the lowest layer of tree nodes, the network attack event tree traversal is completed, and the merging process ends; if the current node has a next layer of tree nodes, the next layer of tree nodes are merged, and the coordinates of the merged nodes are determined; the next layer of tree nodes are taken as the current node, and the above process is re-executed.
[0235] In one embodiment, determining the coordinates of the merged node includes: using the coordinates of the nodes to be merged that are ranked first in the coordinate position as the coordinates of the merged node. For example, the coordinates of the nodes participating in the merger are (3,1), (3,2), (3,4), and (3,6), respectively, then (3,1) is used as the coordinates of the merged node. The advantage of this embodiment is that it ensures that there are no other tree nodes at the coordinate position, and there is no need to re-move other unmerged tree nodes, thereby improving the efficiency of generating a network attack event tree.
[0236] Detailed description of step 350
[0237] In step 350, the merged node is displayed on the network attack event tree, and a merge mark is displayed on the merged node. The generation process of the merge mark has been described in detail in the above embodiment, and will not be repeated here.
[0238] In one embodiment, Fig.16 As shown, the merged nodes are displayed on the network attack event tree, including:
[0239] Step 1610: based on the node data of each tree node of the network attack event tree, obtain a node set corresponding to each path of the network attack event tree, and obtain a path set;
[0240] Step 1620, setting a line segment set to be rendered, where the line segment set to be rendered is initially an empty set;
[0241] Step 1630, executing the fifth process, which includes: taking out an un-taken path from the path set, obtaining a node set corresponding to the un-taken path, and if the line segment between adjacent nodes in the tree node set is not in the line segment set to be rendered, adding the line segment to the line segment set to be rendered, and marking the un-taken path as taken out, repeating the fifth process until all paths in the path set are marked as taken out;
[0242] Step 1640: Render and display the line segments in the set of line segments to be rendered to display a network attack event tree, where the network attack event tree has merged nodes.
[0243] In step 1610, the path set includes each path of the network attack event tree. A path is a tree node set of tree nodes from the lowest tree node to the root node. Fig. 11B Taking the network attack event tree in as an example, the bottom tree nodes are tree nodes E and tree nodes H, and the root node is node D. Therefore, Fig. 11B The tree node set of the network attack event tree path includes: (E, A, B, D) and (H, C, B, D). These two paths constitute Fig.17 The path collection of the network attack event tree.
[0244] In one embodiment, Fig.19 As shown, based on the node data of each tree node of the network attack event tree, a node set corresponding to each path of the network attack event tree is obtained, and a path set is obtained, including:
[0245] Step 1910: for each bottom-level tree node of the network attack event tree, the bottom-level tree node is used as a node to be examined and put into a node set;
[0246] Step 1920, executing the sixth process, which includes: obtaining a node whose node identifier is equal to the parent node identifier of the node to be examined in the node data of the tree node, putting the obtained tree node into the tree node set, and updating the node to be examined with the obtained tree node, and repeating the sixth process until the node to be examined is the root node of the top layer of the network attack event tree;
[0247] Step 1930: put the path from the lowest tree node to the root node in the repeated sixth process into a path set, and use the tree node set as the node set corresponding to the path.
[0248] Traverse the network attack event tree from bottom to top, that is, determine the path to the root node from the lowest tree node. Set the lowest tree node as the node to be examined as the initial value of the loop. Put the node to be examined into a tree node set, and each tree node set stores the tree nodes on a path.
[0249] Get the tree node whose node identifier is equal to the parent node of the node to be examined, put the tree node into the tree node set, and update the node to be examined to the obtained tree node. Determine whether the node to be examined is the root node. If the node to be examined is not the root node, repeat the above process; if the node to be examined is the root node, a path is obtained and the path is put into the path set.
[0250] For example, Figures 20A-20E The process of obtaining a path collection is shown. Fig. 20AIn the example, the lowest tree node is used as the node to be examined. The nodes to be examined are tree node E and tree node H. It is necessary to determine the path to the root node for tree node E and tree node H respectively. Therefore, two tree node sets are generated, and tree node E and tree node H are stored in the corresponding tree node sets respectively. The parent nodes of the nodes to be examined are placed in the tree node set. The parent nodes of tree node E and tree node H are tree node A and tree node C respectively. Tree node A and tree node C are stored in the corresponding tree node set. The updated tree node set is as follows: Fig. 20B As shown, the nodes to be examined become tree nodes A and C. Tree nodes A and C are not root nodes. Get the parent nodes of tree nodes A and C. The parent nodes of tree nodes A and C are tree nodes B. Store tree node B in two tree node sets. The updated tree node sets are as follows: Fig. 20C As shown in , the node to be examined becomes tree node B. Tree node B is not the root node. Get the parent node of tree node B. The parent node of tree node B is tree node D. Store tree node D in two tree node sets. The updated tree node sets are as follows: Fig.20D As shown in , the node to be investigated becomes tree node D. Tree node D is the root node of the network attack event tree, so two paths from the lowest tree node to the root node are obtained. Fig.20E As shown, the two paths constitute the path set of the network attack event tree.
[0251] The advantage of the implementation method of steps 1910-1930 is that the traversal starts from the bottom-level tree node until the root node is reached, and the path from the bottom-level tree node to the root node is determined. The acquisition of each path is independent of each other and does not affect each other, ensuring that the tree nodes in the network attack event tree are fully covered by the path, thereby improving the accuracy of the acquired path set.
[0252] In step 1620, the line segment set to be rendered is used to store the line segments between two adjacent tree nodes, and the line segment set to be rendered is set to an empty set.
[0253] In step 1630, the line segment set to be rendered is used to store the line segments that need to be rendered and displayed. The reason for setting the line segment set to be rendered is that if the paths in the path set are directly displayed, the same line segments between different paths in the path set will be repeatedly rendered. For example, Fig.17 There are duplicate parts in the two paths contained in the path set, that is, the line segment from tree node B to tree node D. If the path is rendered directly, the line segment from tree node B to tree node D will be rendered twice. Therefore, the purpose of setting the line segment set to be rendered is to remove the same parts between different paths in the path set to avoid repeated rendering of the path.
[0254] Take out a path that has not been taken out from the path set obtained in step 1610, and obtain the line segments between every two adjacent tree nodes in the path. If there are no line segments between two adjacent tree nodes in the line segment set to be rendered, add the line segments between the two adjacent tree nodes to the line segment set to be rendered, and mark the taken out path as taken out in the path set page. If there are still untaken paths in the path set, then continue to obtain the line segments in each path, and add the line segments that do not exist in the line segment set to be rendered to the set to be rendered; if all the paths in the path set are marked as taken out, then the line segments in all paths are obtained, and the fifth process is exited.
[0255] For example, Figures 18A-18C The process of obtaining the set of line segments to be rendered is shown. Fig.18A There are two parts in it. The left part is the path set of the network attack event tree, and the right part is the empty line segment set to be rendered. Fig.18B In the process, a path that has not been taken out from the path set is taken out, and the taken out path is (E, A, B, D). The line segments between every two adjacent tree nodes in the taken out path are obtained, which are (E, A), (A, B), and (B, D). The line segments that do not exist in the line segment set to be rendered are added to the set. Therefore, three line segments are added to the set, and the path (E, A, B, D) in the path set is marked as taken out. Fig. 18C In the process, an unretrieved path in the path set is retrieved, and the retrieved path is (H, C, B, D). The line segments between every two adjacent tree nodes in the retrieved path are obtained, which are (H, C), (C, B), and (B, D) respectively. There is already a line segment (B, D) between the line segment set to be rendered, so the line segment (B, D) in the retrieved path does not need to be added to the line segment set to be rendered. Add line segments (H, C) and (C, B) to the line segment set to be rendered, and mark the path (H, C, B, D) as retrieved. All paths in the path set are marked as retrieved, and the fifth process is exited.
[0256] In step 1640, the line segments in the set of line segments to be rendered are rendered and displayed.
[0257] The advantages of the implementation example of steps 1610-1640 are that by deduplicating the connection relationship between two adjacent tree nodes in different paths, repeated rendering of line segments is avoided, thereby improving the generation efficiency of the network attack event tree; different paths are combined together by common line segments, and the association relationship between tree nodes in different paths is displayed, thereby improving the correlation between tree nodes in the network attack event tree, making it easier for administrators to view other related network attack events when handling network attack events, thereby improving the processing efficiency of network attack events.
[0258] After displaying the network attack event tree, you can process network attack events through the network attack event tree.
[0259] In one embodiment, Fig.21 As shown, after displaying the merged node on the network attack event tree and displaying a merge mark on the merged node, the network attack event visualization processing method further includes:
[0260] Step 2110: in response to a first trigger on a target tree node of the network attack event tree, obtaining a process name, a command line, time information, and an alarm type in the node data of the target tree node;
[0261] Step 2120: Display the obtained process name, command line, time information and alarm type.
[0262] The target tree node refers to the tree node for which the brief information of the network attack event needs to be viewed. The first trigger is used to initiate an operation of viewing the brief information of the network attack event on the target tree node. The first trigger can be: placing the mouse on the target tree node, clicking the target tree node, or double-clicking the target tree node. After the first trigger is performed on the target tree node, the process name, command line, time information, and alarm type in the node data of the target tree node are obtained.
[0263] The acquired process name, command line, time information and alarm type are displayed in a first format. The first format may be: an event card popped up on a target tree node, an event pop-up window popped up in an event investigation window, an event drawer displayed on one side of an event investigation window, etc.
[0264] like Figure 2A As shown, place the mouse on the target tree node, and the process name, command line, event time, and alarm type of the network attack event corresponding to the target tree node will be displayed through the event card.
[0265] In this embodiment, in response to the first trigger, the brief information of the node data of the target tree node is displayed, so as to facilitate the quick viewing of the basic situation of the network attack event corresponding to the target tree node. Therefore, the advantage of this embodiment is that the efficiency of viewing the network attack event is improved, thereby improving the efficiency of processing the network attack event.
[0266] In another embodiment, Fig. 22 As shown, after displaying the merged node on the network attack event tree and displaying a merge mark on the merged node, the network attack event visualization processing method further includes:
[0267] Step 2210: In response to the second triggering of the target tree node of the network attack event tree, if the target tree node is a merged node, obtain the node identifier and the parent node identifier of the node to be merged from the node data of the merged node, and restore the node data of each node to be merged according to the node identifier and the parent node identifier of the node to be merged;
[0268] Step 2220: Delete the node data of the merged node.
[0269] The second trigger is used to initiate a split operation on the merged node. The second trigger can be: selecting a field indicating the split of the merged node, double-clicking the merged node, clicking the merge mark on the merged node, etc. In response to the second trigger, the node identifier and parent node identifier corresponding to each node to be merged are obtained from the node data of the merged node. Each node to be merged in the merged node is restored to the next layer of tree nodes corresponding to the parent node identifier. The node data corresponding to each tree node is restored, and the node data of the merged node is deleted.
[0270] For example, Fig.23A -B will Fig.11A -B responds to the result after the second trigger. Fig. 11B In the example, tree node E is the merged node, and the second operation is performed on tree node E. The node identifier and parent node identifier of the node to be merged are obtained from the node data corresponding to tree node E, which are (node identifier: E, parent node identifier: A), (node identifier: F, parent node identifier A), and (node identifier: G, parent node identifier: A). The node data of tree nodes E, F, and G are restored, and the node data of the merged node is deleted. The node data of the updated tree node is as follows: Fig.23A As shown. Restore tree nodes E, F, and G to the next layer of nodes of tree node A. The updated network attack event tree is as follows: Fig. 23B shown.
[0271] If the next layer of tree nodes of the merged node contains other merged nodes, then after responding to the second trigger of the merged node, the operations of steps 2210-2220 will also be performed on the merged nodes in the next layer of tree nodes. For example, the next layer of tree nodes of tree node A is tree node B, and the next layer of tree nodes of tree node B is tree node C. Tree nodes A, tree nodes B, and tree nodes C are all merged nodes. If the administrator initiates a second trigger on tree node A, then tree node B will also be split, and then tree node C will also be split. In other words, the network attack event tree starting from tree node A and going downwards is restored to the original network attack event tree before the merger.
[0272] Based on the above embodiments, in one embodiment, generating node data of a merged node includes: storing the coordinates of the nodes to be merged in the node data of the merged node.
[0273] In the aforementioned embodiment, before merging the network attack event tree, corresponding coordinates are generated for each tree node, and the coordinates are stored in the node data so that the node can be displayed according to the position of the coordinates. After the merged node is generated, the node data corresponding to the node to be merged that participates in the merge is deleted, and the coordinates corresponding to the node to be merged cannot be found in the node data of the tree node. Therefore, when generating the node data of the merged node, it is necessary to store the node to be merged and its coordinates in the node data of the merged node. For example, Fig.24 As shown in Fig.11A In the schematic diagram of storing the corresponding coordinates of the tree nodes based on , each tree node stores the corresponding coordinates, and the node data corresponding to the merged node E stores the coordinates of the tree nodes E, tree node F, and tree node G involved in the merge.
[0274] Deleting the node data of the merged node includes: putting the coordinates of the node to be merged stored in the node data of the merged node into the node data of each restored node to be merged, and deleting the node data of the merged node. For example, Fig.24 The node data shown, after responding to the second trigger, restores the coordinates of each to-be-merged node stored in the node data of the merged node E to the node data of the tree node. After the node data of the to-be-merged node is restored, the merged node E is deleted.
[0275] The advantage of this embodiment is that by storing the coordinates, the coordinates can be directly retrieved when splitting the nodes, and the tree nodes can be restored and displayed at the positions corresponding to the coordinates, thereby improving the efficiency of splitting and merging the nodes.
[0276] In another embodiment, Fig.25 As shown, after deleting the node data of the merged node, the network attack event visualization processing method further includes:
[0277] Step 2510: Determine the first coordinate of the restored node based on the layer number of the restored node to be merged in the network attack event tree;
[0278] Step 2520, traversing from the upper layer of the restored node of the network attack event tree from top to bottom, for the fourth current traversal layer, executing the seventh process, the seventh process includes: for each tree node of the fourth current traversal layer, obtaining the next layer of tree nodes extending from the tree node; determining the second coordinate of the next layer of tree nodes extending from the tree node as a second value, the second value is equal to the sequence number of the next layer of tree nodes and the sum of the total number of next layer of tree nodes extending from other tree nodes before the tree node in the fourth current traversal layer;
[0279] Step 2530: Combine the first coordinates and the second coordinates of the layer nodes below the layer where the restored node to be merged is located into the coordinates of the layer node;
[0280] Step 2540: Display the layer nodes according to the coordinates of the layer nodes below the layer where the restored node to be merged is located.
[0281] In this embodiment, when generating the node data of the merged node, the coordinates of the nodes to be merged are not stored. Therefore, when restoring the node, the coordinates of the restored nodes to be merged need to be re-acquired to display the nodes to be merged at the position corresponding to the coordinates.
[0282] In this embodiment, the tree nodes that are not involved in the merge do not need to re-acquire coordinates. The first coordinate of the restored node to be merged is the layer number of the node to be merged in the network attack event tree. The second coordinate is obtained based on the seventh process, which is executed on the fourth traversal layer. The previous layer of the restored node to be merged is set as the initial value as the fourth traversal layer, and then the network attack event tree is traversed from top to bottom.
[0283] In the seventh process, the second value of the next layer tree node extended from each tree node in the fourth traversal layer is used as the second coordinate. The second value is equal to the sum of the sequence number of the next layer tree node in all the next layer tree nodes of the parent node and the total number of next layer tree nodes extended from other tree nodes before the tree node in the fourth current traversal layer. The method for determining the second value is the same as the method for determining the first value in the aforementioned embodiment, and will not be repeated here.
[0284] The first coordinate and the second coordinate are combined into the coordinates of the layer node, and the layer nodes of the layer where the restored node to be merged is located and the layers below are displayed at the positions of the re-acquired coordinates.
[0285] The advantage of this embodiment is that there is no need to additionally store the coordinates of the nodes to be merged that participate in the merge, and the coordinates can be re-acquired when the nodes are restored, thereby improving the utilization rate of the storage space.
[0286] The embodiment of steps 2210-2220 is used to split the merged node into the original tree node, so as to display the original association relationship of the network attack event, and also facilitate the processing of the network attack event of a single tree node. Therefore, the advantage of this embodiment is that it improves the reading efficiency of the network attack event corresponding to the merged node, thereby improving the processing efficiency of the network attack event.
[0287] In another embodiment, Fig.26 As shown, after restoring the node data of each node to be merged, the network attack event visualization processing method further includes:
[0288] Step 2610: Receive a third trigger for the parent node of the restored tree node;
[0289] Step 2620: Return to the step of determining the first coordinate of the tree node based on the layer number of the tree node in the network attack event tree.
[0290] The third trigger is used to merge the restored tree nodes, and the third trigger operation is on the parent node of the restored tree node. In other words, the third trigger is performed on the target tree node, and the tree nodes below the target tree node that meet the predetermined conditions and can be merged are merged. The third trigger can be: hover the mouse on the parent node, a node pop-up window appears, click "Merged Node" on the node pop-up window; select the parent node, use a special key to represent "Merged Node"; click the parent node, display the operable menu, click "Merged Node" in the menu, and other trigger methods.
[0291] After receiving the third trigger, return to step 810 and execute step 810 and steps after step 810. Take the parent node as the root node, obtain the node coordinates of the tree nodes below the parent node; merge the tree nodes that meet the predetermined conditions into merged nodes; display the merged nodes on the network attack event tree. The specific process has been described in detail in the above multiple embodiments and will not be repeated here.
[0292] In this embodiment, the restored tree nodes can be merged back into merged nodes to avoid confusion in event display due to excessive amount of information. Therefore, the advantage of this embodiment is that it increases the amount of information displayed in the network attack event display window and the flexibility of network attack event processing.
[0293] In another embodiment, Fig. 27 As shown, after displaying the merged nodes on the network attack event tree, the network attack event visualization processing method further includes:
[0294] Step 2710: receiving a fourth trigger on a target tree node of the network attack event tree;
[0295] Step 2720, display multiple candidate processing methods for the alarm type corresponding to the target tree node;
[0296] Step 2730: in response to receiving a selection of multiple candidate processing methods, obtaining a target processing method;
[0297] Step 2740: Process the alarm type according to the target processing method.
[0298] The target tree node here is the tree node to be processed for the alarm type. The fourth trigger is used to display the alarm type details of the network attack event corresponding to the target tree node and facilitate the processing of the network attack event. The fourth trigger can be: double-clicking the target tree node, selecting the target tree node and then clicking a special key, etc.
[0299] After receiving the fourth trigger instruction, multiple candidate processing methods for the alarm type corresponding to the target tree node are displayed. There are many ways to display multiple candidate processing methods for the alarm type. For example, Figure 2B As shown, an event drawer pops up on one side of the display window, and the information of the network attack event corresponding to the target tree node and the alarm type of the network attack event are displayed in the event drawer. The processing status and executable operations are displayed after each alarm type, and the administrator can view the candidate processing methods by clicking the processing method. For another example, after receiving the fourth trigger instruction, jump to another window, and the alarm type and executable operations of the network attack event are displayed in detail in the new window. All processing operations of the administrator on the network attack event are performed in the new window.
[0300] The administrator can select one of multiple candidate processing methods, which can be: marking the alarm as processed, adding the alarm to the whitelist, ignoring the alarm, deleting the alarm, etc.
[0301] After selecting a processing method, obtain the target processing method and process the alarm according to the target processing method.
[0302] In one embodiment, obtaining a target processing method and processing the alarm type according to the target processing method includes:
[0303] The security analysis device 121 receives the target processing request from the display terminal 130 and calls a processing module corresponding to the target processing method in the target processing request;
[0304] Use the processing module to handle network attack events accordingly;
[0305] The security analysis device 121 feeds back the processing result to the display terminal 130 so that the display terminal 130 displays the processing result and updates the display mode of the node corresponding to the network attack event.
[0306] The security analysis device 121 is used to process the network attack event corresponding to the target tree node. The target processing request includes: the node identifier corresponding to the target tree node and the target processing method selected by the administrator. Different processing methods have different processing modules. The processing module corresponding to the target processing method is called to process the network attack event.
[0307] After the processing is completed, the processing result is fed back to the display terminal 130, and the display terminal 130 updates the display mode of the tree node corresponding to the network attack event according to the processing result. For example, the processing status of the processed alarm is changed to "processed", and the display mode of the tree node is changed from the display mode of the unprocessed alarm node to the display mode of the processed alarm node.
[0308] This embodiment can feed back the processing result to the display terminal 130 so that the administrator can view the processing result. When the processing status of the network attack event changes, the display terminal 130 can update the display mode of the tree node corresponding to the network attack event in real time, so that the processing status of the network attack event can be intuitively seen to prevent the administrator from repeating the operation on the tree node corresponding to the network attack event because the administrator is not clear about the processing status. Therefore, the advantage of this embodiment is that the timeliness of the network attack event tree displaying the network attack event is improved, and the processing efficiency of the network attack event is also improved.
[0309] In another embodiment, Fig.28 As shown, in step 2710, after receiving the fourth trigger of the target tree node of the network attack event tree, the network attack event visualization processing method further includes:
[0310] Step 2810: If the target tree node is a merged node, obtain node information of each to-be-merged node in the node data corresponding to the merged node;
[0311] Step 2820: Display the node information of each node to be merged.
[0312] In this embodiment, in response to the fourth trigger, if the target tree node is a merged node, the node information of the node to be merged in the node data of the merged node is retrieved and the node information is displayed.
[0313] For example, in Fig.29 In the interface shown, it can be seen from the merge mark that process C is formed by merging two nodes. After the fourth trigger is executed on the process C node, a window on the right side of the interface pops up, in which the information of the two nodes involved in merging process C is displayed. The two nodes are process C node and process K node.
[0314] In this embodiment, if the target tree node is a merged node, the administrator can view the basic information of the tree nodes contained in the merged node through the fourth trigger, and restore the merged node if there is node information that needs to be processed in the tree nodes involved in the merger. This avoids the administrator from merging the tree nodes again when he finds that there are no tree nodes that need to be processed after restoring the nodes. Therefore, the advantage of this embodiment is that it improves the efficiency of processing network attack events corresponding to the tree nodes contained in the merged node and avoids the waste of computing resources.
[0315] In another embodiment, Fig.30 As shown, in step 2710, after receiving the fourth trigger of the target tree node of the network attack event tree, the network attack event visualization processing method further includes:
[0316] Step 3010: If the target tree node is not the lowest tree node of the network attack event tree, obtain node information of a lower tree node extending from the target tree node;
[0317] Step 3020: Display node information of the next lower tree node.
[0318] In this embodiment, if the target tree node has a next-level node, the administrator can view the basic information of the next-level tree node of the target tree node through the fourth trigger. Obtaining the node information of the next-level tree node extending from the target tree node includes: obtaining the node identifier in the node data of the target tree node; obtaining the next-level tree node whose parent node identifier in the node data is equal to the node identifier of the target tree node; and calling the node information of the next-level tree node.
[0319] After obtaining the node information, the node information is displayed. Fig.31 As shown, the next layer of tree nodes of process C node includes file A node and file B node. After the fourth trigger is executed on process C node, the node information of file A node and file B node is displayed in a window popped up on the right side of the interface.
[0320] In this embodiment, by triggering the target tree node, the node information of the target tree node and the child nodes of the target tree node can be viewed at the same time, so that when processing the network attack event corresponding to the target tree node, the influence of the next level tree node on the target tree node can also be considered. Therefore, the advantage of this embodiment is that the amount of information that can be viewed is increased, so that it is convenient to handle the network attack event and the accuracy of handling the network attack event is improved.
[0321] In the embodiment of steps 2710-2740, the network attack event corresponding to the target tree node can be processed through the fourth trigger, thereby improving the processing efficiency of the network attack event; the network attack event is processed with reference to the relationship between each tree node in the network attack event tree, thereby improving the accuracy of the network attack event processing; and a variety of candidate processing methods are provided for the network attack event processing, thereby improving the flexibility of the network attack event processing.
[0322] In another embodiment, Fig.32 As shown, after displaying the network attack event tree, the network attack event visualization processing method further includes:
[0323] Step 3210: In response to the fifth trigger of the target tree node of the network attack event tree, obtain the node set where the target tree node is located;
[0324] Step 3220: Display the path corresponding to the node set in a first manner.
[0325] In this embodiment, the fifth trigger is used to display the path of the target tree node in the network attack event tree. The fifth trigger can be a variety of triggering methods, such as double-clicking the target tree node with a mouse, selecting the target tree node and triggering a preset special key, etc.
[0326] Obtaining the node set where the target tree node is located includes: obtaining the target tree node identifier in the node data of the tree node corresponding to the target tree node; and obtaining the node set containing the target tree node identifier in the path set obtained in step 1610.
[0327] The node set refers to the node set of tree nodes on a path from the root node to the lowest tree node, including the target tree node. There may be multiple node sets obtained, because if the target tree node is not the lowest tree node, and the target tree node has multiple lower tree nodes, then there will be multiple node sets including the target tree node. The paths corresponding to all the obtained node sets are displayed in the network attack event tree in the first way.
[0328] There are many first ways to display the path, such as highlighting the path, highlighting and enlarging the path, or displaying the path in other colors.
[0329] For example, Fig.33 In the interface diagram shown, select process C node as the target tree node, bold the two path segments where process C node is located, and fill the tree node with black.
[0330] In this embodiment, by triggering a target tree node to view the entire path where the target tree node is located, the network attack event can be traced more clearly to determine the source of the network attack event and the intermediate events experienced, thereby improving the efficiency of information transmission.
[0331] In another embodiment, Fig.34 As shown, after displaying the network attack event tree, the network attack event visualization processing method further includes:
[0332] Step 3410: In response to the fifth trigger of the target tree node of the network attack event tree, obtain multiple node sets where the target tree node is located;
[0333] Step 3420: Obtain the alarm type in the node data of the target tree node;
[0334] Step 3430: If the alarm type of each tree node in a node set obtained is the same as the alarm type in the node data of the tree node, display the path corresponding to the node set in a second manner.
[0335] In this embodiment, the fifth trigger is used to display the path where the alarm types of all tree nodes in the node set are the same as the alarm type of the target tree node. The sixth trigger can be a variety of triggering methods, such as double-clicking the target tree node, triggering a preset special key after selecting the target tree node, etc.
[0336] After obtaining the alarm type in the node data of the tree node corresponding to the target tree node, obtain a node set in which the alarm types of all tree nodes are the same as the alarm type of the target tree node. Obtaining a node set in which the alarm types of all tree nodes are the same as the alarm type of the target tree node includes: obtaining the node identifier in the node data of the tree node corresponding to the target tree node; traversing each node set in the path set obtained in step 1610, and based on each tree node in each node set, obtaining the alarm type in the node data of the tree node corresponding to the tree node; obtaining a node set in which the alarm type of each tree node is the same as the alarm type of the target tree node.
[0337] After obtaining the node set, the path corresponding to the node set in the network attack event tree is displayed in a second manner. The second manner may be a plurality of manners different from the first manner. For example, marking the path corresponding to the node set with other colors, highlighting the path corresponding to the node set, etc.
[0338] For example, Fig.33 In the interface diagram shown, the process C node is selected as the target tree node, and after traversing the path set, it is determined that the alarm type of each node on the path from the root node to the file A node is the same as the alarm type of the process C node. Therefore, all the line segments and nodes on the path from the root node to the file A node are displayed in bold.
[0339] Through this embodiment, the paths of other tree nodes with the same alarm type as the target tree node can be viewed, so as to process the tree nodes on the path of the same alarm type, and the association between network attack events of the same alarm type can be viewed, so as to trace the network attack events of the alarm type, and then formulate strategies to prevent network attack events of this alarm type. Therefore, the advantage of this embodiment is that it improves the efficiency of information transmission, makes it possible to quickly implement prevention strategies for network attack events of a specific alarm type, and improves security.
[0340] Detailed description of the overall implementation of the disclosed embodiment
[0341] Refer to the following Fig.36, and illustrates in detail the overall implementation details of the embodiments of the present disclosure.
[0342] In step 3601, the administrator selects a network attack event from among all network attack events in the server 120;
[0343] In step 3602, the display terminal 130 obtains multiple network attack events associated with the target network attack event from the security analysis device 121;
[0344] In step 3603, the network attack event is node-processed to generate a tree node corresponding to the network attack event;
[0345] In step 3604, based on the association relationship of the network attack events, a network attack event tree is determined, and based on the layer number of the tree node in the network attack event tree and the position of the tree node in the layer, the coordinates of the tree node are determined;
[0346] In step 3605, it is determined that the same layer of the network attack event tree contains nodes to be merged that meet a predetermined condition;
[0347] In step 3606, the node data of the nodes to be merged are obtained, and the node data of the nodes to be merged are integrated into the node data of the merged node, so that the nodes to be merged are merged into the merged node, and the node data of the nodes to be merged are deleted;
[0348] In step 3607, the network attack event tree is traversed again, and the tree nodes that meet the predetermined conditions and can be merged are merged again. If after one round of circulation, the total number of tree nodes of the network attack event tree is equal to the total number of tree nodes after the previous round of merging, the circulation is terminated;
[0349] In step 3608, the merged node is displayed on the network attack event tree, and a merge mark is displayed on the merged node;
[0350] In step 3609, based on the node data of the tree nodes of the network attack event tree, a path set from the root node to the lowest tree node is obtained. Based on the path set, the following can be achieved:
[0351] Displaying the path where the target tree node is located in a first manner;
[0352] Displaying the path corresponding to the node set having the same alarm type as the target tree node in a second manner;
[0353] In step 3610, line segments between adjacent nodes are obtained according to the path set;
[0354] In step 3611, the network attack event tree is displayed, the line segments between adjacent nodes are rendered, and the tree nodes corresponding to the network attack events are displayed at the positions corresponding to the node coordinates;
[0355] In step 3612, in response to a first trigger on a target tree node on the network attack event tree, the process name, command line, event information, and alarm type of the target tree node are displayed;
[0356] In step 3613, in response to the second trigger of the target tree node on the network attack event tree, if the target tree node is a merged node, the merged node is restored to multiple nodes to be merged; the process of restoring multiple nodes to be merged needs to return to step 3604, and after executing step 3604, jump to step 3609.
[0357] In step 3614, in response to the third trigger of the target tree node on the network attack event tree, the nodes to be merged that meet the predetermined conditions in the next-level tree nodes of the target tree node are merged; the process of merging nodes needs to return to step 3604 and execute downward from step 3604;
[0358] In step 3615, in response to the fourth triggering of the target tree node on the network attack event tree, multiple candidate processing methods for the alarm type corresponding to the target tree node are displayed.
[0359] Description of the apparatus and device of the present disclosure
[0360] It is to be understood that, although the steps in the above-mentioned flowcharts are sequentially displayed according to the characterization of arrows, these steps are not necessarily executed in sequence according to the order of arrow characterization. Unless there is a clear description in the present embodiment, the execution of these steps does not have a strict order restriction, and these steps can be executed in other orders. Moreover, at least a portion of the steps in the above-mentioned flowcharts can include multiple steps or multiple stages, and these steps or stages are not necessarily executed at the same time, but can be executed at different times, and the execution order of these steps or stages is not necessarily to be carried out in sequence, but can be executed in turn or alternately with other steps or at least a portion of the steps or stages in other steps.
[0361] It should be noted that in each specific implementation of the present application, when it comes to the need to perform relevant processing based on data related to the characteristics of the target object such as the target object attribute information or attribute information set, the permission or consent of the target object will be obtained first, and the collection, use and processing of these data will comply with relevant laws, regulations and standards. In addition, when the embodiment of the present application needs to obtain the attribute information of the target object, the separate permission or separate consent of the target object will be obtained through a pop-up window or jump to a confirmation page. After clearly obtaining the separate permission or separate consent of the target object, the necessary target object-related data used to enable the normal operation of the embodiment of the present application is obtained.
[0362] Fig.37 The schematic diagram of the structure of the network attack event visualization processing device 3700 provided in the embodiment of the present disclosure. The network attack event visualization processing device 3700 includes:
[0363] A first acquisition unit 3710 is used to acquire multiple network attack events on a target subject;
[0364] The node processing unit 3720 is used to perform node processing on the network attack event to obtain a tree node, obtain the association relationship of the network attack event, and connect the tree nodes using the association relationship to obtain the network attack event tree of the target subject;
[0365] The first determining unit 3730 is used to determine whether the same layer of the network attack event tree contains nodes to be merged that meet a predetermined condition;
[0366] The second acquisition unit 3740 is used to acquire node data of the nodes to be merged, integrate the node data of the nodes to be merged into the node data of the merged node, and merge the nodes to be merged into the merged node;
[0367] The first display unit 3750 is used to display the merged node on the network attack event tree and display a merge mark on the merged node.
[0368] Optionally, the node data of the tree node includes a node identifier of the tree node and a parent node identifier of the tree node on the network attack event tree;
[0369] The node processing unit 3720 is specifically used for:
[0370] The tree node whose parent node is marked as empty in the node data of the tree node is used as the root node of the network attack event tree, and the root node is used as the determined layer node;
[0371] Execute the first process, which includes: using the tree node whose parent node identifier in the node data of the tree node is equal to the node identifier of a determined layer node as a lower-layer tree node of the determined layer node, and updating the determined layer node with the lower-layer tree node, and returning to the first process until the lowest-layer tree node is determined, thereby obtaining a network attack event tree.
[0372] The network attack event visualization processing device 3700 further includes:
[0373] A second determining unit (not shown), configured to determine, for each network attack event, that other network attack events among the plurality of network attack events have the same node identifier as the network attack event;
[0374] The third acquisition unit (not shown) is used to acquire node data of tree nodes corresponding to other network attack events and delete the node data.
[0375] Optionally, the node data of the tree node also includes the process name of the network attack event, the command line, the time information of obtaining the network attack event, and the identified alarm type;
[0376] The network attack event visualization processing device 3700 further includes:
[0377] A first response unit (not shown), configured to obtain a process name, a command line, time information, and an alarm type in node data of a target tree node in response to a first trigger of the target tree node of the network attack event tree;
[0378] The second display unit (not shown) is used to display the acquired process name, command line, time information and alarm type.
[0379] Optionally, the network attack event visualization processing device 3700 further includes:
[0380] A third determining unit (not shown), configured to determine a first coordinate of a tree node based on a layer number of the tree node in the network attack event tree;
[0381] A first execution unit (not shown) is used to traverse from the top to the bottom of the network attack event tree starting from the top layer, and for a first current traversal layer, execute a second process, the second process comprising: for each tree node of the first current traversal layer, obtaining a next layer node extending from the tree node; determining a second coordinate of the next layer node extending from the tree node as a first value, the first value being equal to the sum of the sequence number of the next layer node and the total number of next layer nodes extending from other nodes before the tree node in the first current traversal layer;
[0382] a combining unit (not shown), configured to combine the first coordinate and the second coordinate of the tree node into the coordinate of the tree node;
[0383] The third display unit (not shown) is used to display the tree nodes according to the coordinates.
[0384] Optionally, the network attack event visualization processing device 3700 further includes:
[0385] A second execution unit (not shown) is used to traverse from the second to last layer of the network attack event tree from bottom to top, and for the second current traversal layer, execute a third process, the third process including: for each tree node of the second current traversal layer, based on the average of the second coordinates of the nodes in the next layer extending from the tree node, updating the second coordinate of the tree node.
[0386] Optionally, the second acquiring unit 3740 is specifically configured to:
[0387] Generate node data of the merged node, wherein the node data of the merged node includes a merged node identifier, a node identifier of each node to be merged, and a parent node identifier;
[0388] Delete the node data of the node to be merged.
[0389] Optionally, the node data of the merged node also includes a merge flag;
[0390] The first display unit 3750 is specifically used to: traverse the node data of each tree node in the network attack event tree, and if the node data of the tree node includes a merge flag, display the merge mark on the merged node.
[0391] Optionally, the network attack event visualization processing device 3700 further includes:
[0392] A second response unit (not shown) is used to respond to a second trigger on a target tree node of the network attack event tree, and if the target tree node is a merged node, obtain a node identifier and a parent node identifier of the node to be merged from the node data of the merged node, and restore the node data of each node to be merged according to the node identifier and the parent node identifier of the node to be merged;
[0393] The first deleting unit (not shown) is used to delete the node data of the merged node.
[0394] Optionally, the second acquisition unit 3740 is specifically used to: store the coordinates of the node to be merged into the node data of the merged node;
[0395] The first deleting unit (not shown) is used to put the coordinates of the node to be merged stored in the node data of the merged node into the node data of each restored node to be merged, and delete the node data of the merged node.
[0396] Optionally, the network attack event visualization processing device 3700 further includes:
[0397] A first receiving unit (not shown), configured to receive a third trigger for a parent node of the restored tree node;
[0398] The returning unit (not shown) is used to return to the step of determining the first coordinate of the tree node based on the layer number of the tree node in the network attack event tree.
[0399] Optionally, the second acquiring unit 3740 is specifically configured to:
[0400] Set the tree node number counter, and initialize the tree node number counter to 0;
[0401] Execute the fourth process, which includes: starting from the top layer of the network attack event tree and traversing from top to bottom, for the third current traversal layer, integrating the node data of the nodes to be merged that meet the predetermined conditions in the third current traversal layer into the node data of the merged node, thereby merging the nodes to be merged into the merged nodes, and after traversing the last layer, determining the number of nodes in the attack transaction tree, if the number of tree nodes is inconsistent with the tree node number counter, updating the tree node number counter with the number of tree nodes, and repeating the fourth process until the number of tree nodes is consistent with the tree node number counter.
[0402] Optionally, the first display unit 3750 is specifically used for:
[0403] Based on the node data of each tree node of the network attack event tree, obtain a node set corresponding to each path of the network attack event tree, and obtain a path set, wherein the path set includes each path of the network attack event tree;
[0404] Set the line segment set to be rendered, which is initially an empty set;
[0405] Executing a fifth process, the fifth process includes: taking out an un-taken path from the path set, obtaining a node set corresponding to the un-taken path, if a line segment between adjacent nodes in the tree node set is not in the line segment set to be rendered, adding the line segment to the line segment set to be rendered, and marking the un-taken path as taken out, repeating the fifth process until all paths in the path set are marked as taken out;
[0406] Render and display the line segments in the to-be-rendered line segment set to display a network attack event tree, where the network attack event tree has merged nodes.
[0407] Optionally, the node data of the tree node includes a node identifier of the node tree and a parent node identifier of the node tree;
[0408] The first display unit 3750 is specifically used for:
[0409] For each bottom-level tree node of the network attack event tree, the bottom-level tree node is used as a node to be examined and put into a node set;
[0410] Executing a sixth process, the sixth process comprising: obtaining a tree node whose node identifier is equal to the parent node identifier of the node to be examined in the node data of the tree node, putting the obtained tree node into a tree node set, and updating the node to be examined with the obtained tree node, and repeating the sixth process until the node to be examined is the root node of the top layer of the network attack event tree;
[0411] The path from the lowest tree node to the root node in the repeated sixth process is put into the path set, and the tree node set is used as the node set corresponding to the path.
[0412] Optionally, the network attack event visualization processing device 3700 further includes:
[0413] A third response unit (not shown), configured to obtain a node set where the target tree node is located in response to a fifth trigger on the target tree node of the network attack event tree;
[0414] The fourth display unit (not shown) is used to display the path corresponding to the node set in a first manner.
[0415] Optionally, the node data of the tree node includes the identified alarm type;
[0416] The network attack event visualization processing device 3700 further includes:
[0417] a fourth response unit (not shown), configured to obtain a plurality of node sets where the target tree node is located in response to a fifth trigger on the target tree node of the network attack event tree;
[0418] A fourth acquisition unit (not shown), configured to acquire an alarm type from node data of a target tree node;
[0419] A fifth display unit (not shown) is used to display the path corresponding to the node set in a second manner if the alarm type of each tree node in a node set obtained is the same as the alarm type in the node data of the tree node.
[0420] Reference Fig.38 , Fig.38 The structural block diagram of the terminal part of the network attack event visualization processing method of the embodiment of the present disclosure is as follows: the terminal includes: a radio frequency (RF) circuit 3810, a memory 3815, an input unit 3830, a display unit 3840, a sensor 3850, an audio circuit 3860, a wireless fidelity (WiFi) module 3870, a processor 3880, and a power supply 3890. Those skilled in the art can understand that Fig.38 The terminal structure shown does not constitute a limitation on the mobile phone or computer, and may include more or fewer components than shown in the figure, or combine certain components, or arrange the components differently.
[0421] The RF circuit 3810 may be used for receiving and sending signals during information transmission or calls. In particular, after receiving the downlink information from the base station, it is sent to the processor 3880 for processing; in addition, the designed uplink data is sent to the base station.
[0422] The memory 3815 may be used to store software programs and modules. The processor 3880 executes various functional applications and data processing of the target terminal by running the software programs and modules stored in the memory 3815 .
[0423] The input unit 3830 may be used to receive input digital or character information and generate key signal input related to the setting and function control of the target terminal. Specifically, the input unit 3830 may include a touch panel 3831 and other input devices 3832.
[0424] The display unit 3840 may be used to display input information or provided information and various menus of the target terminal. The display unit 3840 may include a display panel 3841.
[0425] The audio circuit 3860, the speaker 3861, and the microphone 3862 may provide an audio interface.
[0426] In this embodiment, the processor 3880 included in the terminal can execute the network attack event visualization processing method of the previous embodiment.
[0427] The terminals of the embodiments of the present disclosure include but are not limited to mobile phones, computers, intelligent voice interaction devices, smart home appliances, vehicle terminals, aircraft, etc. The embodiments of the present invention can be applied to various scenarios, including but not limited to data security, data visualization processing, information technology, etc.
[0428] Fig.39 A block diagram of the structure of a portion of a server for implementing a method for visualizing processing network attack events according to an embodiment of the present disclosure. The server may have relatively large differences due to different configurations or performances, and may include one or more central processing units (CPUs) 3922 (e.g., one or more processors) and a memory 3932, and one or more storage media 2130 (e.g., one or more mass storage devices) storing application programs 3942 or data 3944. Among them, the memory 3932 and the storage medium 3930 may be short-term storage or permanent storage. The program stored in the storage medium 3930 may include one or more modules (not shown in the figure), and each module may include a series of instruction operations on the server. Furthermore, the central processing unit 3922 may be configured to communicate with the storage medium 3930 and execute a series of instruction operations in the storage medium 3930 on the server.
[0429] The server may also include one or more power supplies 3939, one or more wired or wireless network interfaces 3950, one or more input and output interfaces 3958, and / or one or more operating systems 3941, such as Windows ServerTM, Mac OS XTM, UnixTM, LinuxTM, FreeBSDTM, etc.
[0430] The central processor 3922 in the server can be used to execute the network attack event visualization processing method of the embodiment of the present disclosure.
[0431] The embodiments of the present disclosure also provide a computer-readable storage medium, which is used to store program codes, and the program codes are used to execute the network attack event visualization processing methods of the aforementioned embodiments.
[0432] The embodiment of the present disclosure also provides a computer program product, which includes a computer program. A processor of a computer device reads and executes the computer program, so that the computer device executes the above-mentioned network attack event visualization processing method.
[0433] The terms "first", "second", "third", "fourth", etc. (if any) in the specification of the present disclosure and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments of the present disclosure described herein can, for example, be implemented in an order other than those illustrated or described herein. In addition, the terms "comprises" and "comprising" and any variations thereof are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units that are clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.
[0434] It should be understood that in the present disclosure, "at least one (item)" means one or more, and "plurality" means two or more. "And / or" is used to describe the association relationship of associated objects, indicating that three relationships may exist. For example, "A and / or B" can mean: only A exists, only B exists, and A and B exist at the same time, where A and B can be singular or plural. The character " / " generally indicates that the objects associated before and after are in an "or" relationship. "At least one of the following" or similar expressions refers to any combination of these items, including any combination of single or plural items. For example, at least one of a, b or c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, c can be single or multiple.
[0435] It should be understood that in the description of the embodiments of the present disclosure, the meaning of multiple (or multiple items) is more than two, greater than, less than, exceed, etc. are understood to not include the number, and above, below, within, etc. are understood to include the number.
[0436] In the several embodiments provided in the present disclosure, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of units is only a logical function division. There may be other division methods in actual implementation. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be an indirect coupling or communication connection through some interfaces, devices or units, which can be electrical, mechanical or other forms.
[0437] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
[0438] In addition, each functional unit in each embodiment of the present disclosure may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.
[0439] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present disclosure is essentially or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the various embodiments of the present disclosure. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (Read-Only Memory, referred to as ROM), random access memory (Random Access Memory, referred to as RAM), disk or optical disk and other media that can store program codes.
[0440] It should also be understood that the various implementations provided in the embodiments of the present disclosure can be combined arbitrarily to achieve different technical effects.
[0441] The above is a specific description of the implementation methods of the present disclosure, but the present disclosure is not limited to the above implementation methods. Technical personnel familiar with the art can also make various equivalent modifications or substitutions without violating the spirit of the present disclosure. These equivalent modifications or substitutions are all included in the scope defined by the claims of the present disclosure.
Claims
1. A method for visualizing network attack events, characterized in that: include: Obtain multiple network attack events against the target subject; Node processing is performed on the network attack events to obtain tree nodes, and the association relationship of the network attack events is obtained, and the tree nodes are connected by using the association relationship to obtain the network attack event tree of the target subject; Determining that the same layer of the network attack event tree contains nodes to be merged that meet a predetermined condition; Acquiring node data of the nodes to be merged, integrating the node data of the nodes to be merged into node data of a merged node, thereby merging the nodes to be merged into the merged node; The merged node is displayed on the network attack event tree, and a merge mark is displayed on the merged node.
2. The method for visualizing network attack events according to claim 1, characterized in that: The node data of the tree node includes the node identifier of the tree node and the parent node identifier of the tree node on the network attack event tree; The obtaining of the association relationship of the network attack events, and connecting the tree nodes using the association relationship to obtain the network attack event tree of the target subject, includes: The tree node whose parent node identifier in the node data of the tree node is empty is used as the root node of the network attack event tree, and the root node is used as the determined layer node; Execute a first process, which includes: using a tree node whose parent node identifier in the node data of the tree node is equal to a node identifier of the determined layer node as a lower-layer tree node of the determined layer node, and using the lower-layer tree node to update the determined layer node, and returning to the first process until the lowest-layer tree node is determined, thereby obtaining the network attack event tree.
3. The method for visualizing network attack events according to claim 2, characterized in that: After acquiring a plurality of network attack events on the target subject, the network attack event visualization processing method further includes: For each of the network attack events, determining that other network attack events among the plurality of network attack events have the same node identifier as the network attack event; Obtain node data of the tree nodes corresponding to the other network attack events, and delete the node data.
4. The method for visualizing network attack events according to claim 2, characterized in that: The node data of the tree node also includes the process name of the network attack event, the command line, the time information of obtaining the network attack event, and the identified alarm type; After displaying the merged node on the network attack event tree and displaying a merge mark on the merged node, the network attack event visualization processing method further includes: In response to a first trigger of a target tree node of the network attack event tree, acquiring the process name, the command line, the time information, and the alarm type in the node data of the target tree node; The obtained process name, command line, time information and alarm type are displayed.
5. The method for visualizing network attack events according to claim 1, characterized in that: After obtaining the association relationship of the network attack event, connecting the tree nodes using the association relationship, and obtaining the network attack event tree of the target subject, the network attack event visualization processing method further includes: Determine a first coordinate of the tree node based on the layer number of the tree node in the network attack event tree; Starting from the top layer of the network attack event tree and traversing from top to bottom, for the first current traversal layer, executing the second process, the second process comprising: for each of the tree nodes of the first current traversal layer, obtaining the next layer node extending from the tree node; determining the second coordinate of the next layer node extending from the tree node as a first value, the first value being equal to the sum of the sequence number of the next layer node and the total number of next layer nodes extending from other nodes before the tree node in the first current traversal layer; Combining the first coordinate and the second coordinate of the tree node into the coordinate of the tree node; According to the coordinates, the tree nodes are displayed.
6. The method for visualizing network attack events according to claim 5, characterized in that: After traversing from the top layer of the network attack event tree from top to bottom and executing the second process for the first current traversal layer, the network attack event visualization processing method further includes: Starting from the second-to-last layer of the network attack event tree and traversing from bottom to top, for the second current traversal layer, executing the third process, the third process includes: for each of the tree nodes of the second current traversal layer, based on the average of the second coordinates of the nodes in the next layer extending from the tree node, updating the second coordinate of the tree node.
7. The method for visualizing network attack events according to claim 5, characterized in that: The step of integrating the node data of the nodes to be merged into the node data of the merged node includes: Generate node data of the merged node, wherein the node data of the merged node includes a merged node identifier, the node identifier of each of the nodes to be merged, and the parent node identifier; The node data of the node to be merged is deleted.
8. The method for visualizing network attack events according to claim 7, characterized in that: The node data of the merged node also includes a merge flag; The displaying of a merge mark on the merged node includes: traversing the node data of each tree node in the network attack event tree, and if the node data of the tree node includes the merge flag, displaying the merge mark on the merged node.
9. The method for visualizing network attack events according to claim 7, characterized in that: After displaying the merged node on the network attack event tree and displaying a merge mark on the merged node, the network attack event visualization processing method further includes: In response to a second trigger on a target tree node of the network attack event tree, if the target tree node is the merged node, obtaining the node identifier and the parent node identifier of the node to be merged from the node data of the merged node, and restoring the node data of each node to be merged according to the node identifier and the parent node identifier of the node to be merged; The node data of the merged node is deleted.
10. The method for visualizing network attack events according to claim 9, characterized in that: The generating the node data of the merged node comprises: storing the coordinates of the nodes to be merged into the node data of the merged node; The deleting the node data of the merged node includes: putting the coordinates of the node to be merged stored in the node data of the merged node into the node data of each restored node to be merged, and deleting the node data of the merged node.
11. The method for visualizing network attack events according to claim 9, characterized in that: After restoring the node data of each of the nodes to be merged, the network attack event visualization processing method further includes: receiving a third trigger for a parent node of the restored tree node; Return to the step of determining the first coordinate of the tree node based on the layer number of the tree node in the network attack event tree.
12. The method for visualizing network attack events according to claim 1, characterized in that: The acquiring the node data of the nodes to be merged, integrating the node data of the nodes to be merged into the node data of the merged node, thereby merging the nodes to be merged into the merged node, includes: Set a tree node number counter, wherein the tree node number counter is initialized to 0; Execute a fourth process, the fourth process comprising: starting from the topmost layer of the network attack event tree and traversing from top to bottom, for the third current traversal layer, integrating the node data of the nodes to be merged in the third current traversal layer that meet the predetermined conditions into the node data of the merged node, thereby merging the nodes to be merged into the merged node, and after traversing the last layer, determining the number of nodes in the attack transaction tree, if the number of tree nodes is inconsistent with the tree node number counter, updating the tree node number counter with the tree node number, and repeating the fourth process until the number of tree nodes is consistent with the tree node number counter.
13. The method for visualizing network attack events according to claim 1, characterized in that: The displaying the merged node on the network attack event tree includes: Based on the node data of each tree node of the network attack event tree, obtain a node set corresponding to each path of the network attack event tree, and obtain a path set, wherein the path set includes each path of the network attack event tree; Set a line segment set to be rendered, wherein the line segment set to be rendered is initially an empty set; Executing a fifth process, the fifth process comprising: taking out an untaken path from the path set, obtaining a node set corresponding to the untaken path, if a line segment between adjacent nodes in the tree node set is not in the line segment set to be rendered, adding the line segment to the line segment set to be rendered, and marking the untaken path as taken out, repeating the fifth process until all paths in the path set are marked as taken out; The line segments in the set of line segments to be rendered are rendered and displayed to display the network attack event tree, wherein the network attack event tree has the merged node.
14. The method for visualizing network attack events according to claim 13, characterized in that: The node data of the tree node includes a node identifier of the node tree and a parent node identifier of the node tree; The step of obtaining a node set corresponding to each path of the network attack event tree based on the node data of each tree node of the network attack event tree, and obtaining a path set, includes: For each bottom-level tree node of the network attack event tree, the bottom-level tree node is used as a node to be investigated and put into a node set; Executing a sixth process, the sixth process comprising: obtaining a tree node whose node identifier in the node data of the tree node is equal to the parent node identifier of the node to be examined, putting the obtained tree node into the tree node set, and updating the node to be examined with the obtained tree node, repeating the sixth process until the node to be examined is the root node of the top layer of the network attack event tree; The path from the bottom tree node to the root node in the repeated sixth process is put into the path set, and the tree node set is used as the node set corresponding to the path.
15. The method for visualizing network attack events according to claim 14, characterized in that: After displaying the merged node on the network attack event tree and displaying a merge mark on the merged node, the network attack event visualization processing method further includes: In response to a fifth trigger of a target tree node of the network attack event tree, acquiring the node set where the target tree node is located; The path corresponding to the node set is displayed in a first manner.
16. The method for visualizing network attack events according to claim 14, characterized in that: The node data of the tree node includes the identified alarm type; After displaying the merged node on the network attack event tree and displaying a merge mark on the merged node, the network attack event visualization processing method further includes: In response to a fifth trigger of a target tree node of the network attack event tree, acquiring a plurality of node sets where the target tree node is located; Obtain the alarm type in the node data of the target tree node; If the acquired alarm type of each of the tree nodes in the node set is the same as the alarm type in the node data of the tree node, the path corresponding to the node set is displayed in a second manner.
17. A network attack event visualization processing device, characterized in that: include: A first acquisition unit, used to acquire multiple network attack events on a target subject; A node processing unit, used to perform node processing on the network attack event to obtain a tree node, and obtain the association relationship of the network attack event, and connect the tree nodes using the association relationship to obtain the network attack event tree of the target subject; A first determining unit, configured to determine whether the network attack event tree contains nodes to be merged that meet a predetermined condition on the same layer; A second acquisition unit is used to acquire the node data of the nodes to be merged, integrate the node data of the nodes to be merged into the node data of the merged node, and merge the nodes to be merged into the merged node; The first display unit is used to display the merged node on the network attack event tree and display a merge mark on the merged node.
18. An electronic device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the network attack event visualization processing method according to any one of claims 1 to 16 is implemented.
19. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the network attack event visualization processing method according to any one of claims 1 to 16 is implemented.
20. A computer program product, comprising a computer program, wherein the computer program is read and executed by a processor of a computer device, so that the computer device executes the network attack event visualization processing method according to any one of claims 1 to 16.
Citation Information
Cited By
Network attack path diagram generation method and electronic equipment
CN121173546A
