A data risk assessment method based on data concentration

Abstract

The present invention belongs to the field of data security technology and proposes a data risk assessment method based on data concentration. This method formulates a data classification and grading rule table, constructs a data classification and grading tree for the field data of the structured data table accordingly. At the same time, inserts new field data into the data classification and grading tree using the BERT model, assigns weights to the leaf nodes according to the privacy levels of the field data in the data classification and grading tree to obtain a data weighted classification and grading tree, uses the breadth-first search algorithm to find the shortest path distance between any two leaf nodes in the data weighted classification and grading tree, calculates the weighted distance in combination with the node weights, constructs a leaf pair weighted distance set, calculates the mean value of the weighted distance and takes the reciprocal thereof to obtain a data concentration index, compares the risk assessment threshold with the data concentration index to determine the data risk level, and obtains a security policy from the predefined policy library accordingly. This method can scientifically evaluate the data leakage risk and provide strong support for data security management.

Description

Technical Field

[0001] The present invention relates to the technical field of data security, and particularly relates to a data risk assessment method based on data concentration. Background Art

[0002] In the era of big data, data has become a key asset, and data security issues have become increasingly prominent. Data leakage may lead to serious consequences including user privacy leakage, loss of corporate secrets, and increased compliance risks.

[0003] Currently, the industry mainly adopts traditional data classification and grading methods to reduce the risk of data leakage, but there are many problems. Existing methods mostly set data categories and levels based on rule matching or manual experience. There are large differences in standards between different industries and enterprises, and subjectivity is strong. It is difficult to form an objective and unified classification system. Existing methods focus on data access control and encryption technologies, ignoring the effective measurement of the overall concentration of data. In the event of data leakage, the data concentration of data cannot be quantitatively analyzed, resulting in limitations in risk assessment and data desensitization strategy formulation, and it is easy to underestimate the true risk of the data set. At the same time, existing methods only focus on data levels and ignore the relevance between data categories. Therefore, how to achieve scientific and effective assessment of data leakage risk and provide strong support for data security management has become an urgent problem to be solved. For this reason, a data risk assessment method based on data concentration is proposed. Summary of the Invention

[0004] The purpose of the present invention is to provide a data risk assessment method based on data concentration to solve the problems raised in the above background art.

[0005] To achieve the above purpose, the present invention provides the following technical solutions:

[0006] A data risk assessment method based on data concentration, comprising the following steps:

[0007] S_{1}. Formulate a data classification and grading rule table, and based on the data classification and grading rule table, construct a data classification and grading tree for the field data of the structured data table and store it in the database. At the same time, parse the new field data through the NLP model and insert it into the data classification and grading tree;

[0008] S_{2}. Obtain the privacy level corresponding to the field data through the data classification and grading tree, and accordingly assign weights to the leaf nodes of the data classification and grading tree to obtain a weighted data classification and grading tree;

[0009] S_{3}. For any two leaf nodes of the weighted data classification and grading tree, obtain the shortest path distance between the two leaf nodes through the breadth-first search algorithm, and obtain the weighted distance between the two leaf nodes according to the respective weights of the two leaf nodes, and accordingly construct a set of weighted distances of leaf pairs;

[0010] S4. Calculate the weighted distance mean of leaf pairs based on the weighted distance set of leaf pairs, and obtain the reciprocal of the weighted distance mean of leaf pairs accordingly, which is the data concentration index of the structured data table;

[0011] S5. Set a data risk assessment threshold, compare it with the data concentration index of the structured data table to obtain the data risk level. At the same time, construct a predefined policy library, and obtain a security policy through the predefined policy library based on the data risk level.

[0012] Preferably, the method for formulating a data classification and grading rule table and constructing a data classification and grading tree for the field data of the structured data table according to the data classification and grading rule table:

[0013] According to the "Rules for Data Classification and Grading" (GB / T 43697-2024), and combined with the actual business needs of the industry or enterprise, formulate a data classification and grading rule table including data types, field instances, classification paths, and risk levels. The data types in the data classification and grading rule table macro-classify the field data according to business attributes or themes. The field instances in the data classification and grading rule table list the names of specific field data. The classification paths in the data classification and grading rule table describe the paths of field data in the classification and grading tree. The risk levels in the data classification and grading rule table assign privacy levels to field data;

[0014] Map the field data in the structured data table to the corresponding classification paths and privacy levels through the data classification and grading rule table. Take the set of all field data in the structured data table as the root node of the data classification and grading tree. Take the leaf nodes of the classification paths corresponding to the field data and the root node as the leaf nodes of the data classification and grading tree and the first-level nodes of the root node of the data classification and grading tree respectively. At the same time, merge the classification paths corresponding to the field data with the same path parts to obtain the data classification and grading tree;

[0015] The data classification and grading tree is used to classify and manage the field data in the structured data table. The non-leaf nodes of the data classification and grading tree represent the classification levels of the field data. The leaf nodes of the data classification and grading tree store the field data and the corresponding privacy levels of the field data. All the nodes on the path from the root node of the data classification and grading tree to the leaf node storing the field data, excluding the root node of the data classification and grading tree, constitute the classification path corresponding to the field data, that is, the classification path in the data classification and grading rule table is the storage location of the field data in the data classification and grading tree;

[0016] A node is a basic component of a tree - like data structure, used to store data and represent the relationships between nodes. The root node is the starting point of the data classification and grading tree, which is unique. Subsequent node levels extend from the root node. The first - level nodes are the next - level nodes directly connected to the root node. The leaf nodes are the terminal nodes in the data classification and grading tree, storing specific field data and their corresponding privacy levels, without further sub - node extensions. Non - leaf nodes are nodes other than leaf nodes;

[0017] The structured data table is the basic data source for constructing the data classification and grading tree, storing information on various business scenarios under different enterprises or industries.

[0018] Preferably, the method for parsing new field data through an NLP model and inserting it into the data classification and grading tree:

[0019] Use the data classification and grading rule table as training data to complete the training of the NLP model. The trained NLP model can master the association between the semantic information contained in different field names and descriptions and the classification paths. Input the new field data into the trained NLP model to obtain the matching probabilities of the new field data with each classification path in the grading rule table. Select the classification path with the highest matching probability as the insertion position of the new field data in the data classification and grading tree, and insert the new field data into the data classification and grading tree to achieve the dynamic update of the data classification and grading tree, enabling the data classification and grading tree to adapt to the constantly changing data environment.

[0020] Preferably, the method for obtaining the data - weighted classification and grading tree:

[0021] For the privacy level corresponding to the field data stored in the leaf nodes of the data classification and grading tree Use the leaf - node weight formula to obtain the weight corresponding to the field data , and store the weight corresponding to the field data into the leaf node storing the corresponding field data Thereby obtaining a data classification and grading tree in which the leaf nodes store field data, as well as the privacy level and weight corresponding to the field data, that is, the data - weighted classification and grading tree;

[0022] The leaf - node weight formula is: ;

[0023] where is the weight corresponding to the field data, is the privacy level corresponding to the field data, is the unique identifier of the leaf node of the data classification and grading tree, that is, the unique identifier of the field data.

[0024] Preferably, a method for obtaining the shortest path distance between two leaf nodes through a breadth-first search algorithm:

[0025] Mark all nodes of the data weighted classification and grading tree as unvisited, which is used to clarify whether a node has been processed during the search process, and determine two leaf nodes in the data weighted classification and grading tree and , take one of the two leaf nodes as the starting node and mark it as visited, take the other leaf node as the destination node, and set the path distance count value to 0, which is used to record the path length from the starting node to the destination node, that is, the shortest path distance between the two leaf nodes. Visit all unvisited adjacent nodes of the starting node, and add 1 to the path distance count value. At the same time, judge whether all adjacent nodes include the destination node. If the destination node is included, the shortest path from the starting node to the destination node is found, and at this time, the path distance count value is the shortest path distance between the two leaf nodes;

[0026] If the destination node is not included, mark all unvisited adjacent nodes of the starting node as visited and use them as the new starting node, and visit all unvisited adjacent nodes of the new starting node;

[0027] The adjacent node is a node directly connected to a certain specific node in a graph or tree data structure.

[0028] Preferably, a method for obtaining the weighted distance between two leaf nodes and constructing a set of weighted distances of leaf pairs:

[0029] The shortest path distance between two leaf nodes , and the weights of the two leaf nodes and , obtain the weighted distance between the two leaf nodes through the leaf node weighted distance formula ;

[0030] The leaf node weighted distance formula is: ;

[0031] Wherein, is the weighted distance between two leaf nodes and , is the shortest path distance between two leaf nodes and , and are the respective weights corresponding to the leaf nodes and ;

[0032] For all leaf nodes of the data weighted classification and grading tree , perform non-repeating pairing, and calculate the weighted distance between two leaf nodes of all non-repeating pairings through the leaf node weighted distance formula to obtain the weighted distances of all two leaf nodes, and form a leaf pair weighted distance set accordingly ;

[0033] The non-repeating pairing means that each pair of leaf nodes is only paired once.

[0034] Preferably, the method for calculating the mean value of leaf pair weighted distances:

[0035] For the leaf pair weighted distance set Obtain the mean value of leaf pair weighted distances through the leaf node pair weighted distance mean value formula;

[0036] The weighted distance mean value formula is: ;

[0037] Among them, is the mean value of leaf pair weighted distances, is the weighted distance between two leaf nodes and , and i and j are index variables used to traverse leaf node pairs, and n is the number of field data in the structured data table, that is, the number of leaf nodes in the data classification and grading tree.

[0038] Preferably, the method for setting a data risk assessment threshold and comparing the data concentration index of the structured data table to obtain the data risk level:

[0039] According to the mean value of leaf pair weighted distances, obtain the reciprocal of the mean value of leaf pair weighted distances , that is, the data concentration index of the structured data table , and compare the data concentration index of the structured data table through the data risk assessment threshold;

[0040] If is less than 0.1, the data risk level of the structured data table is a low risk level, indicating that the degree of association between the field data of the structured data table is relatively weak, and the possible impact when being attacked or leaked is relatively small;

[0041] If is greater than or equal to 0.1 and less than 0.2, the data risk level of the structured data table is a medium risk level, indicating that there is a certain data association in the field data of the structured data table, and the data risk faced is also at a medium level, and corresponding protection measures need to be taken;

[0042] If If it is greater than or equal to 0.2, the data risk level of the structured data table is a high risk level, indicating that the correlation between the field data of the structured data table is very strong. Once a data leak occurs, attackers are likely to obtain more sensitive information through correlation analysis, causing a serious security threat. High-intensity security protection strategies must be taken immediately.

[0043] Preferably, a predefined security policy library is constructed, and the method for obtaining security policies from the data risk level through the predefined security policy library:

[0044] Corresponding security policies are formulated for different data risk levels, and the risk level field is used as the ID primary key to establish a mapping between the data risk level field and the security policy field. A predefined policy library containing the data risk level field and the security policy content field is constructed, and the data risk level is matched with the data risk level field of the predefined security policy library to map and obtain the security policy corresponding to the data risk level;

[0045] The risk level field includes low risk level, medium risk level, and high risk level, and the security policy field includes basic access control RBAC, log auditing, data backup, Advanced Encryption Standard 256-bit encryption algorithm AES-256, role-based fine-grained permission control, regular security assessment, multi-factor authentication MFA, real-time monitoring and alerting, full data encryption, dynamic data masking, data minimization principle, and network segmentation;

[0046] The corresponding security policies formulated for different data risk levels are as follows:

[0047] The security policies mapped to the low risk level are basic access control RBAC, log auditing, and data backup;

[0048] The security policies mapped to the medium risk level are Advanced Encryption Standard 256-bit encryption algorithm AES-256, role-based fine-grained permission control, and regular security assessment;

[0049] The security policies mapped to the high risk level are multi-factor authentication MFA, real-time monitoring and alerting, full data encryption, dynamic data masking, data minimization principle, and network segmentation.

[0050] Compared with the prior art, the present invention has the following beneficial effects:

[0051] 1. The present invention constructs a scientific and unified data classification and grading system, which overcomes the traditional data classification and grading methods that are mostly based on rule matching or manual experience, with strong subjectivity, large differences in standards among different industries and enterprises, and it is difficult to form an objective and unified classification standard. The present invention formulates a rule table according to the Rules for Data Classification and Grading (GB / T 43697-2024), combines the actual business needs of the industry or enterprise to construct a data classification and grading tree, clearly defines the data type, classification path and risk level, realizes the scientific classification and grading management of data, effectively avoids the interference of subjective factors, and forms an objective and unified classification system.

[0052] 2. The present invention realizes the accurate measurement of data concentration and improves the accuracy of risk assessment. Existing methods focus on data access control and encryption technology, ignoring the effective measurement of the overall data concentration, and there are limitations in risk assessment and data desensitization strategy formulation, which are prone to underestimating the real risk of the data set. The present invention obtains the data concentration index through the leaf node weight formula, the leaf node weighted distance formula and the weighted distance mean formula, accurately quantifies the correlation degree between data, so as to accurately evaluate the data leakage risk, provides a reliable basis for data desensitization and security protection, and makes up for the deficiencies of traditional methods in risk assessment.

[0053] 3. The present invention considers the relevance of data categories and provides targeted security strategies. Existing technologies only focus on data levels and ignore the relevance between data categories. The present invention calculates the shortest path distance and weighted distance between leaf nodes in the weighted data classification and grading tree by means of the breadth-first search algorithm, constructs a set of weighted distances for leaf pairs, fully considers the data category association, comprehensively reflects potential risks. At the same time, it divides the risk levels according to the data concentration, constructs a predefined strategy library, provides corresponding security strategies for different risk levels, realizes the accurate matching of security strategies, and effectively improves the data security protection ability. BRIEF DESCRIPTION OF THE DRAWINGS

[0054] In order to more clearly illustrate the technical solutions and advantages in the embodiments of the present invention or the prior art, the following will briefly introduce the drawings required for the description of the embodiments or the prior art. Obviously, the following drawings are only some embodiments of the present invention. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative efforts.

[0055] Figure 1 It is a flowchart of the method steps of the present invention. DETAILED DESCRIPTION OF THE INVENTION

[0056] To make the objectives, technical solutions and advantages of the present invention clearer, the technical solutions of the present invention will be described in detail below. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all the embodiments. All other implementation manners obtained by those of ordinary skill in the art based on the embodiments of the present invention without creative efforts fall within the scope protected by the present invention.

[0057] An embodiment is as Figure 1 shown. A data risk assessment method based on data concentration includes the following steps:

[0058] S1. Formulate a data classification and grading rule table, and based on the data classification and grading rule table, construct a data classification and grading tree for the field data of the structured data table and store it in the database. At the same time, parse the new field data through the BERT model and insert it into the data classification and grading tree;

[0059] S2. Through the data classification and grading tree, obtain the privacy level corresponding to the field data, and accordingly assign weights to the leaf nodes of the data classification and grading tree to obtain a weighted data classification and grading tree;

[0060] S3. For any two leaf nodes of the weighted data classification and grading tree, obtain the shortest path distance between the two leaf nodes through the breadth-first search algorithm, and based on the respective weights of the two leaf nodes, obtain the weighted distance between the two leaf nodes, and accordingly construct a set of weighted distances for leaf pairs;

[0061] S4. According to the set of weighted distances for leaf pairs, calculate the mean of the weighted distances for leaf pairs, and accordingly obtain the reciprocal of the mean of the weighted distances for leaf pairs, that is, the data concentration index of the structured data table;

[0062] S5. Set a data risk assessment threshold, compare the data concentration index of the structured data table to obtain a data risk level. At the same time, construct a predefined policy library, and obtain a security policy for the data risk level through the predefined policy library.

[0063] Further, the working principle of the present invention is illustrated below through an embodiment:

[0064] Suppose there is an e-commerce enterprise. The structured data table of the e-commerce enterprise includes field data of user information, order information and payment information. The user information includes name, ID number and contact information. The order information includes order number, commodity name and purchase amount. The payment information includes payment method and bank card number.

[0065] According to the Rules for Data Classification and Grading (GB / T 43697-2024) and the actual business requirements of e-commerce enterprises, a data classification and grading rule table is formulated. For example, data is divided into three categories: user-related data, business-related data, and payment-related data. Among them, user-related data is further subdivided into user basic information and user identity information, business-related data is subdivided into order information and commodity information, and payment-related data is subdivided into payment method information and bank card information. These data categories are mapped to the classification path and corresponding risk levels are assigned. For example, the ID number and bank card number are of high risk level, and the order number is of low risk level. The field data set is used as the root node, and the leaf nodes and first-level nodes are determined according to the classification path. The same path parts are merged to construct a data classification and grading tree, which is stored in the database. If new field data appears, such as the user's delivery address, the data classification and grading rule table is used as training data to complete the training of the BERT model. The user's delivery address is input, and the matching probability between the user's delivery address and each classification path is obtained. The classification path with the highest probability is selected. For example: user-related data - user basic information. According to the classification path with the highest probability, the user's delivery address is inserted into the data classification and grading tree to achieve dynamic update of the data classification and grading tree.

[0066] Obtain the privacy level of each field data through the data classification and grading tree, and use the leaf node weight formula to calculate the weight. For example, the privacy level of the ID number is 4, and its weight is , the privacy level of the order number is 2, and its weight is . The calculated weights are stored in the corresponding leaf nodes to obtain a weighted data classification and grading tree.

[0067] Taking two leaf nodes with field data of ID number and bank card number in the weighted data classification and grading tree as an example, all nodes are marked as unvisited. Select the leaf node with field data of ID number as the starting node and mark it as visited. The leaf node with field data of bank card number is used as the destination node, and the path distance counter is set to 0. Visit all adjacent nodes of the starting node and count. Determine whether the destination node is included. If not, mark the adjacent node as visited and use it as the new starting node to continue visiting until the destination node is found to obtain the shortest path distance. Assume that the shortest path distance between the two leaf nodes with field data of ID number and bank card number is 3. According to the leaf node weighted distance formula , assume the weight of the ID number is , and the weight of the bank card number is . Calculate the weighted distance between the two leaf nodes with field data of ID number and bank card number to be 12. Pair all leaf nodes in the weighted data classification and grading tree without repetition, calculate the weighted distances of all paired leaf nodes, and construct a set of weighted distances of leaf pairs.

[0068] For the set of weighted distances of leaf pairs, through the formula for the weighted distance mean of leaf node pairs Calculate the weighted distance mean. Assume that there are 10 leaf nodes in the structured data table of an e-commerce enterprise. The calculated weighted distance mean is 8. Take the reciprocal of the weighted distance mean to obtain a data concentration index of 0.125.

[0069] Set the data risk assessment threshold and compare it with the data concentration index , when = 0.125, since 0.1 < 0.125 < 0.2, the data risk level of this structured data table is medium risk level. Construct a predefined policy library, where the low risk level corresponds to basic access control RBAC, log auditing, and data backup; the medium risk level corresponds to the Advanced Encryption Standard 256-bit encryption algorithm AES-256, role-based fine-grained permission control, and regular security assessment; the high risk level corresponds to multi-factor authentication MFA, real-time monitoring and alerting, full data encryption, dynamic data masking, the principle of data minimization, and network segmentation. Obtain the corresponding security policies from the predefined policy library according to the data risk level, that is, take security measures such as AES-256 encryption, role-based fine-grained permission control, and regular security assessment for the data of this e-commerce enterprise.

[0070] It should be noted that: the above sequence of the embodiments of the present invention is only for description and does not represent the superiority or inferiority of the embodiments. And the above describes specific embodiments of this specification. In addition, the processes depicted in the drawings do not necessarily require the specific order or continuous order shown to achieve the desired results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.

[0071] Each embodiment in this specification is described in a progressive manner. For the same or similar parts between each embodiment, reference can be made to each other. The key point of each embodiment is to illustrate the differences from other embodiments.

[0072] The above-described embodiments are only used to illustrate the technical solutions of the present application, not to limit them; modifying the technical solutions recorded in the foregoing embodiments, or equivalently replacing some of the technical features, does not make the essence of the corresponding technical solutions deviate from the scope of the technical solutions of each embodiment of the present application, and should all be included within the protection scope of the present application.

Claims

1. A data risk assessment method based on data concentration degree, characterized in that It includes the following steps: S1. Formulate a data classification and grading rule table, and based on the data classification and grading rule table, construct a data classification and grading tree for the field data of the structured data table and store it in the database. At the same time, parse the new field data through the BERT model and insert it into the data classification and grading tree; S2. Through the data classification and grading tree, obtain the privacy level corresponding to the field data, and accordingly assign weights to the leaf nodes of the data classification and grading tree to obtain a weighted data classification and grading tree; S3. For any two leaf nodes of the weighted data classification and grading tree, obtain the shortest path distance between the two leaf nodes through the breadth-first search algorithm, and based on the respective weights of the two leaf nodes, obtain the weighted distance between the two leaf nodes. Accordingly, the method for constructing a set of weighted distances for leaf pairs is as follows: Obtain the weighted distance between the two leaf nodes by using the shortest path distance between the two leaf nodes and the weights of the two leaf nodes through the leaf node weighted distance formula; Pair all the leaf nodes of the weighted data classification and grading tree without repetition, and calculate the weighted distances between all non-repeated paired leaf nodes through the leaf node weighted distance formula to obtain the weighted distances between all two leaf nodes, and accordingly form a set of weighted distances for leaf pairs; The non-repeated pairing means that each pair of leaf nodes is only paired once; S4. Calculate the mean value of the weighted distances for leaf pairs according to the set of weighted distances for leaf pairs, and accordingly obtain the reciprocal of the mean value of the weighted distances for leaf pairs, that is, the data concentration index of the structured data table; S5. Set a data risk assessment threshold, compare the data concentration index of the structured data table to obtain a data risk level. At the same time, construct a predefined policy library, and obtain a security policy through the predefined policy library based on the data risk level.

2. The data risk assessment method based on data concentration degree according to claim 1, wherein The method for formulating a data classification and grading rule table and constructing a data classification and grading tree for the field data of the structured data table based on the data classification and grading rule table: According to the data classification and grading rules and in combination with the actual business requirements of the industry or enterprise, formulate a data classification and grading rule table including data types, field instances, classification paths, and risk levels. The data type is used to macroscopically classify the field data according to business attributes or topics, the field instance is used to list the names of specific field data, the classification path is used to describe the path of the field data in the classification and grading tree, and the risk level is used to assign the privacy level of the field data; Map the field data in the structured data table to the corresponding classification path and privacy level through the data classification and grading rule table. Take the set of all field data in the structured data table as the root node of the data classification and grading tree, and take the leaf nodes of the classification path corresponding to the field data and the root node as the leaf nodes of the data classification and grading tree and the first-level nodes of the root node of the data classification and grading tree respectively. At the same time, merge the classification paths corresponding to the field data with the same path part to obtain a data classification and grading tree; The data classification and grading tree is used to classify and hierarchically manage the field data in the structured data table. The non-leaf nodes of the data classification and grading tree represent the classification levels of the field data, and the leaf nodes of the data classification and grading tree store the field data and the corresponding privacy levels of the field data; The root node, first-level node, leaf node, and non-leaf node are components in the tree data structure.

3. The data risk assessment method based on data concentration degree according to claim 2, wherein The method for parsing new field data through the BERT model and inserting it into the data classification and grading tree: Using the data classification and grading rule table as training data to complete the training of the NLP model. Inputting the new field data into the trained BERT model to obtain the matching probabilities of the new field data with each classification path in the grading rule table. Selecting the classification path with the highest matching probability as the insertion position of the new field data in the data classification and grading tree, and inserting the new field data into the data classification and grading tree; The BERT model is a natural language processing model.

4. The data risk assessment method based on data concentration degree according to claim 3, wherein, The method for obtaining the data weighted classification and grading tree: Using the leaf node weight formula for the privacy levels corresponding to the field data stored in the leaf nodes of the data classification and grading tree to obtain the weights corresponding to the field data, and storing the weights corresponding to the field data into the leaf nodes storing the field data, thereby obtaining the data weighted classification and grading tree; The data weighted classification and grading tree is a data classification and grading tree in which the leaf nodes store field data, as well as the corresponding privacy levels and weights of the field data.

5. A data risk assessment method based on data concentration degree according to claim 4, characterized in that The method for obtaining the shortest path distance between two leaf nodes through the breadth-first search algorithm: Marking all nodes of the data weighted classification and grading tree as unvisited, determining two leaf nodes in the data weighted classification and grading tree, taking one of the two leaf nodes as the starting node and marking it as visited, taking the other leaf node as the destination node, setting the path distance count value to 0, visiting all unvisited adjacent nodes of the starting node, and incrementing the path distance count value by 1. At the same time, determining whether all adjacent nodes include the destination node. If the destination node is included, obtain the path distance count value, which is the shortest path distance; If the destination node is not included, mark all unvisited adjacent nodes of the starting node as visited and use them as the new starting node, and visit all unvisited adjacent nodes of the new starting node; The path distance count value is used to obtain the shortest path distance between two leaf nodes; The adjacent node is a node directly connected to a specific node in the graph or tree data structure.

6. The data risk assessment method based on data concentration degree according to claim 5, wherein, The method for calculating the mean weighted distance of leaf pairs: Obtaining the mean weighted distance of leaf pairs through the leaf node pair weighted distance mean formula for the leaf pair weighted distance set.

7. The data risk assessment method based on data concentration degree according to claim 6, wherein The method for setting the data risk assessment threshold and comparing the data concentration index of the structured data table to obtain the data risk level: Data concentration index for structured data tables Compare with the data risk assessment threshold; If is less than 0.1, the data risk level of the structured data table is a low risk level; If is greater than or equal to 0.1 and less than 0.2, the data risk level of the structured data table is medium risk level; If is greater than or equal to 0.2, the data risk level of the structured data table is a high risk level.

8. A data risk assessment method based on data concentration degree according to claim 7, characterized in that, The method for constructing a predefined security policy library and obtaining security policies based on the data risk level through the predefined security policy library: Formulate corresponding security policies for different data risk levels, use the risk level field as the ID primary key, establish the mapping between the data risk level field and the security policy field, construct a predefined policy library containing the data risk level field and the security policy content field, match the data risk level with the data risk level field of the predefined security policy library, and map to obtain the security policy corresponding to the data risk level; The risk level field includes low risk level, medium risk level, and high risk level, and the security policy field includes basic access control RBAC, log auditing, data backup, Advanced Encryption Standard 256-bit encryption algorithm AES-256, role-based fine-grained access control, regular security assessment, multi-factor authentication MFA, real-time monitoring and alerting, full data encryption, dynamic data masking, data minimization principle, and network segmentation; The formulating corresponding security policies for different data risk levels is as follows: The security policies mapped by the low risk level are basic access control RBAC, log auditing, and data backup; The security policies mapped by the medium risk level are Advanced Encryption Standard 256-bit encryption algorithm AES-256, role-based fine-grained access control, and regular security assessment; The security policies mapped by the high risk level are multi-factor authentication MFA, real-time monitoring and alerting, full data encryption, dynamic data masking, data minimization principle, and network segmentation.

Images