Multi-party collaborative computing method and system for secure sharing of energy data

By constructing computer process feature vectors and differences and optimizing key update strategies, the communication burden and security risks caused by frequent key updates in collaborative computing of new energy data is solved, and more efficient key management and secure sharing are achieved.

CN118331733BActive Publication Date: 2024-11-22ECONOMIC TECH RES INST OF STATE GRID HENAN ELECTRIC POWER +1
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410464160.5
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-04-17
Publication Date
2024-11-22
Estimated Expiration
2044-04-17

AI Technical Summary

Technical Problem

In the collaborative calculation of new energy data, frequent update of keys will bring a communication burden, and traditional key management algorithms do not fully utilize computer feature information, resulting in key groups being updated multiple times or not being updated for a long time when the user exits at a high frequency. , poses safety risks.

Method used

By obtaining the computer's process calculation feature value, building process feature vectors, calculating the difference between computers and the predicted separation of key groups, optimizing the key update strategy, and avoiding frequent update of keys.

Benefits of technology

Effectively save computing resources, improve computing speed, reduce the communication burden caused by key updates, and enhance the security of key management.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118331733B_ABST
    Figure CN118331733B_ABST
Patent Text Reader

Abstract

The present invention relates to the field of data security technology, and in particular to a multi-party collaborative computing method and system for secure sharing of energy data, the method comprising: obtaining parameter data of each computer participating in the collaborative computing of energy data, obtaining the process computing difficulty characteristic value of each process of the computer using the parameter data, obtaining the inter-computer difference between two computers according to the difference of the process computing difficulty characteristic value between different computers, obtaining the intra-computer density of each computer set according to the inter-computer difference, thereby obtaining the computer group predicted separation degree of each computer key group, and performing key update to complete the multi-party collaborative computing of energy data. The present invention aims to reduce the high communication burden caused by frequent key updates during collaborative computing of energy data, improve computing speed, and save computing resources.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of data security technology, and in particular to a multi-party collaborative computing method and system for secure sharing of energy data. Background Art

[0002] The energy industry is the heart of modern industry, providing power for industrial production in various industries. Traditional energy industries include oil, coal, natural gas, etc., and new energy industries include hydropower, wind power, nuclear power, etc. In the new energy industry, the production of energy will generate a large amount of data. If a large amount of data is used reasonably, it can effectively improve the production efficiency of the new energy industry and achieve the goals of energy conservation, efficiency improvement, and environmental protection. Due to the large amount of data, a single computer device cannot meet the needs of data processing, so it is necessary to store the data in a distributed manner and perform multi-party collaborative computing.

[0003] When calculating and processing a large amount of new energy data, the amount of calculation is too large due to the excessive amount of data generated by new energy equipment, which makes it difficult to complete the calculation on a single computer. Therefore, multiple computers are required for collaborative calculation. In the process of collaborative calculation, computers need to frequently communicate collaborative calculation data. In order to ensure the security of computer communication channels and prevent energy data leakage, the transmitted energy collaborative calculation data should be encrypted. In the field of collaborative calculation, key management algorithms are often used to ensure the security of communication channels. However, when a user exits a key group, it is often necessary to update the key to ensure key security. Frequent key updates will bring a certain communication burden. Therefore, traditional key management algorithms set a fixed key update time, or automatically update the key when the number of group users accumulates to a certain extent. However, when updating the key, the characteristic information of the computer in the collaborative calculation in the key group is not fully utilized. The key group is prone to multiple key updates during the period of high user exit frequency, or not to update the key for a long time, resulting in communication burden and security risks. Summary of the invention

[0004] In order to solve the above technical problems, the purpose of the present invention is to provide a multi-party collaborative computing method and system for secure sharing of energy data. The technical solutions adopted are as follows:

[0005] In a first aspect, an embodiment of the present invention provides a multi-party collaborative computing method for secure sharing of energy data, the method comprising the following steps:

[0006] Obtain the required service time, CPU occupancy rate, RAM occupancy rate, and HDD occupancy rate of each computer participating in the collaborative calculation of energy data;

[0007] The process calculation difficulty characteristic value of each process of each computer is obtained by combining the hard disk HDD occupancy, memory RAM occupancy and central processing unit CPU occupancy rate; a two-dimensional coordinate system is obtained by taking the process calculation difficulty characteristic value as the vertical axis and the running time as the horizontal axis; the process difficulty distribution diagram of each computer is obtained by taking the required service time of each process as the variable in the two-dimensional coordinate system; the process characteristic vector of each computer is obtained according to the length distribution of the required service time of each process in the process difficulty distribution diagram; the first difference degree and the second difference degree between the two computers are obtained according to the difference in the process characteristic vectors between the two computers; the shorter vector extension credibility between the two computers is obtained according to the distribution difference of the elements in the process characteristic vectors between the two computers; the inter-computer difference degree between the two computers is obtained by combining the shorter vector extension credibility and the first difference degree and the second difference degree between the two computers; all computers participating in the collaborative calculation are divided into computer sets; the intra-computer density of each computer set is obtained according to the inter-computer difference degree; the computer group prediction separation degree of each computer key group is obtained according to the difference in the intra-computer density of different computer sets; the key is updated using the computer group prediction separation degree to complete the multi-party collaborative calculation of energy data.

[0008] Preferably, the process calculation difficulty characteristic value of each process of each computer is obtained by combining the hard disk HDD occupancy, the memory RAM occupancy and the central processing unit CPU occupancy, including:

[0009] For each process of each computer, the ratio of the RAM occupancy to the HDD occupancy is calculated, and the product of the ratio and the CPU occupancy rate is used as the process calculation difficulty characteristic value of each process of each computer.

[0010] Preferably, the process feature vector of each computer is obtained according to the length distribution of the service time required by each process in the process difficulty distribution graph, including:

[0011] In the process difficulty distribution diagram, the required service time of each process is sampled at equal intervals, and the process calculation difficulty characteristic values ​​of all sampling points are arranged from small to large according to the running time as the process characteristic vector of each computer.

[0012] Preferably, obtaining the first difference degree and the second difference degree between the two computers according to the difference of the process feature vectors between the two computers includes:

[0013] For two computers, the computer with more elements in the process feature vector is regarded as the kth computer, and the computer with fewer elements in the process feature vector is regarded as the lth computer. The expression of the first difference between the two computers is:

[0014]

[0015] Where Dc1 k,l represents the first difference between the kth computer and the lth computer, M l represents the number of elements in the process feature vector of the lth computer, Tf m,k represents the computational difficulty characteristic value of the mth process in the process characteristic vector of the kth computer, Tf m,l represents the mth process calculation difficulty characteristic value in the process characteristic vector of the lth computer, where m represents the sequence number of the elements in the process characteristic vector, wherein when calculating the first difference between two computers, the tail of the process characteristic vector of the lth computer is padded with zeros to be equal to the length of the process characteristic vector of the kth computer;

[0016] The expression of the second difference between the two computers is:

[0017]

[0018] Where Dc2 k,l represents the second difference between the kth computer and the lth computer, M k represents the number of elements in the process feature vector of the kth computer, μTf l Represents the mean of all elements in the process feature vector of the lth computer.

[0019] Preferably, obtaining the shorter vector extension credibility between the two computers according to the distribution difference of elements in the process feature vectors between the two computers comprises:

[0020] Calculate the absolute value of the difference between the standard deviation of all elements in the process feature vector of the kth computer and the standard deviation of all elements in the process feature vector of the lth computer, calculate the sum of the absolute value of the difference and 1, and use the reciprocal of the sum as the shorter vector between the two computers to extend the credibility.

[0021] Preferably, the step of combining the shorter vector extension credibility and the first difference and the second difference between the two computers to obtain the inter-computer difference between the two computers comprises:

[0022] Calculate the sum of the opposite of the shorter vector extension credibility between the two computers and 1, calculate the product of the sum and the first difference between the two computers, calculate the product of the shorter vector extension credibility between the two computers and the second difference, and use the sum of the two products as the inter-computer difference between the two computers.

[0023] Preferably, obtaining the intra-computer density of each computer set according to the inter-computer difference comprises:

[0024] The sum of the inter-computer differences between each computer in the computer set and other computers is calculated, and the average of all the sums in the computer set is used as the intra-computer set density of each computer set.

[0025] Preferably, the computer group predicted separation degree of each computer key group is obtained according to the intra-computer group density difference of different computer groups, and the expression is:

[0026]

[0027] Where PrD p The predicted separation degree of the computer group for the current p-th computer key group, Dcg p is the intra-computer density of the computer set consisting of all computers in the pth computer key group, Dcg ′ p is the density of the p-th computer key group consisting of all computers that have exited the group after the last key update, Dcg ′ p ′ is the density of the p-th computer key group consisting of all computers that have joined the group since the last key update, μit p is the mean of the time intervals between all computers that have left the p-th computer key group after the last key update, ct p It is the time interval between the current p-th computer key group and the last time a computer exited the group.

[0028] Preferably, the method of using a computer group to predict the separation degree to update the key and complete the multi-party collaborative computing of energy data includes:

[0029] A preset threshold is set. If the predicted separation degree of the computer group of the computer key group is less than or equal to the preset threshold, the key of the computer key group is updated. Otherwise, it is not updated.

[0030] In a second aspect, an embodiment of the present invention also provides a multi-party collaborative computing system for secure sharing of energy data, comprising a memory, a processor, and a computer program stored in the memory and running on the processor, wherein the processor implements the steps of any one of the above methods when executing the computer program.

[0031] The present invention has at least the following beneficial effects:

[0032] The present invention constructs a computer process feature vector through the parameter information of each process in the computer to characterize the process distribution in each computer; obtains the process feature vectors of any two computers, and constructs the difference between the computers according to the difference and distribution characteristics of the elements at the same position in the process feature vector, which fully characterizes the difference degree of the process distribution of the two computers;

[0033] Furthermore, the intra-computer density of each computer set is obtained based on the difference between computers to characterize the similarity of the distribution of computer processes in the computer set. The separation degree is predicted based on the constructed computer group to determine the possibility of a new computer exiting the current computer key group, and the key of the computer key group is updated based on the possibility. The process distribution in the computer during collaborative computing is fully considered to avoid the high communication burden caused by constantly updating the key when new computers frequently exit the key group, so that the computer key group can save computing resources and improve the computing speed when calculating new energy data. BRIEF DESCRIPTION OF THE DRAWINGS

[0034] In order to more clearly illustrate the technical solutions and advantages in the embodiments of the present invention or the prior art, the drawings required for use in the embodiments or the prior art descriptions are briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0035] Figure 1 A flowchart of the steps of a multi-party collaborative computing method for secure sharing of energy data provided by one embodiment of the present invention;

[0036] Figure 2 Build a flow chart for collaborative calculation of energy data indicators;

[0037] Figure 3 This is a process difficulty distribution diagram. DETAILED DESCRIPTION

[0038] In order to further explain the technical means and effects adopted by the present invention to achieve the predetermined invention purpose, the following is a detailed description of the multi-party collaborative computing method and system for secure sharing of energy data proposed by the present invention, its specific implementation method, structure, features and effects, in combination with the accompanying drawings and preferred embodiments. In the following description, different "one embodiment" or "another embodiment" does not necessarily refer to the same embodiment. In addition, specific features, structures or characteristics in one or more embodiments may be combined in any suitable form.

[0039] Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs.

[0040] The specific scheme of the multi-party collaborative computing method and system for secure sharing of energy data provided by the present invention is described in detail below with reference to the accompanying drawings.

[0041] See also Figure 1 , which shows a flowchart of a multi-party collaborative computing method for secure sharing of energy data provided by an embodiment of the present invention, the method comprising the following steps:

[0042] Step S001, obtaining parameter information of computers participating in collaborative energy data calculation.

[0043] In order to ensure the security of communication between different computers during collaborative computing of energy data, this embodiment optimizes and improves the key management algorithm. First, the process information of each computer participating in the collaborative computing of energy data is obtained, including the required service time of the computer process being calculated, the CPU occupancy rate, the RAM occupancy rate, the HDD occupancy rate, and the calculation order of each process.

[0044] Step S002, using the computer's parameter information to obtain the process calculation difficulty characteristic value of each process of each computer, obtain the process characteristic vector, obtain the inter-computer difference between the two computers based on the difference in the process characteristic vectors between the two computers, obtain the computer group density of each computer set based on the inter-computer difference, and construct the computer group prediction separation degree of each computer key group.

[0045] Specifically, this embodiment first obtains the parameter data of each computer participating in the energy data collaborative calculation, uses the parameter data to obtain the process calculation difficulty characteristic value of each process of the computer, obtains the computer difference between two computers according to the difference of the process calculation difficulty characteristic value between different computers, obtains the computer set density of each computer set according to the computer difference, thereby obtaining the computer group prediction separation degree of each computer key group, and performs key update to complete the energy data multi-party collaborative calculation. The energy data collaborative calculation indicator construction flow chart is as follows: Figure 2 The specific construction process of the computer group prediction separation degree of each computer key group is as follows:

[0046] Since the user object managed by the key management algorithm is each computer participating in the collaborative computing, it is necessary to extract the process features in each computer and construct the process computing difficulty feature value of each computer. The expression is:

[0047]

[0048] Where Tf n is the process computation difficulty characteristic value of the nth process in the current computer, HDD nis the HDD usage of the nth process, RAM n is the RAM usage of the nth process, CPU n is the CPU usage of the nth process.

[0049] The larger the hard disk space occupied by a computer process, the larger the amount of data in the process, the larger the RAM space occupied, the larger the amount of data processed in parallel, the higher the frequency of data exchange between the memory and the CPU, and the more complex the calculation method. Represents the complexity of the process calculation method under the unit data volume, The larger the value, the higher the complexity and the higher the calculation difficulty of the process. The larger the CPU occupancy rate of the process, the more CPU threads the process occupies when calculating, which means the calculation difficulty of the process is higher. Finally, the larger the characteristic value of the process calculation difficulty, the greater the calculation difficulty of the corresponding process in the current computer.

[0050] Furthermore, a rectangular coordinate system is constructed with the process calculation difficulty characteristic value as the vertical axis, the running time as the horizontal axis, and the required service time of each process as the length of the process, such as Figure 3 The process difficulty distribution is shown in the figure. Figure 3 Each straight line parallel to the horizontal axis represents a process in the computer. The running time of each process is sampled, and the sampling interval is C=0.1 seconds. The sampling interval can be set by the implementer according to the actual situation, and this embodiment does not limit this.

[0051] The process calculation difficulty characteristic values ​​of all sampling points are arranged from small to large according to the running time as the process characteristic vector of each computer, expressed as Com k =(Tf1 Tf2…Tf m …Tf K ), represents the computational difficulty of the processes running on the computers at different times. The more similar the process feature vectors between the two computers are, the more likely it is that the two computers are calculating the same problem, and the less likely they are to be divided into different key groups.

[0052] In the key management algorithm, multiple computers that need to communicate with each other and perform collaborative computing use the same key to complete key management. Therefore, this embodiment evaluates the degree of difference in process distribution between different computers. For two computers, the computer with a larger number of elements in the process feature vector is taken as the kth computer, and the computer with a smaller number of elements in the process feature vector is taken as the lth computer. The difference between computers is constructed, and the expression is:

[0053]

[0054]

[0055]

[0056] Dc k,l =Dc1 k,l ×(1-β)+Dc2 k,l ×β,M k >M l

[0057] Where Dc1 k,l represents the first difference between the kth computer and the lth computer, M l represents the number of elements in the process feature vector of the lth computer, Tf m,k represents the computational difficulty characteristic value of the mth process in the process characteristic vector of the kth computer, Tf m,l represents the mth process calculation difficulty characteristic value in the process characteristic vector of the lth computer, where m represents the sequence number of the elements in the process characteristic vector, wherein when calculating the first difference between two computers, the tail of the process characteristic vector of the lth computer is padded with zeros to be equal to the length of the process characteristic vector of the kth computer;

[0058] Dc2 k,l represents the second difference between the kth computer and the lth computer, M k represents the number of elements in the process feature vector of the kth computer, μTf l represents the mean of all elements in the process feature vector of the lth computer;

[0059] β represents the shorter vector extension credibility between the kth computer and the lth computer, σTf k represents the standard deviation of all elements in the process feature vector of the kth computer, σTf l represents the standard deviation of all elements in the process feature vector of the lth computer;

[0060] Dc k,l Represents the inter-computer difference between the k-th computer and the l-th computer.

[0061] The more similar the process feature vectors of two computers are, the more similar the process task distributions of the two computers are, and the smaller the first difference between the two computers is;

[0062] Since the number of processes to be calculated in the two computers is different, the lengths of the process feature vectors of the computers are usually different. m,k -μTf l |The larger the value, the greater the difference between the process feature vector of the kth computer and the process feature vector of the lth computer, and the greater the difference between the computers.

[0063] It should be noted that when the process feature vectors of two computers have the same length, the difference between the computers is equal to the first difference, and the second difference is not calculated.

[0064] The multiple computers participating in the collaborative computing are regarded as computer sets, and the density within the computer set is constructed. The expression is:

[0065]

[0066] Where Dcg q is the intra-computer density of the qth computer set, K is the number of computers in the qth computer set, Dc ′ k,l It is the inter-computer difference between the kth computer and the lth computer in the qth computer set.

[0067] Multiple computers are divided into a computer set, and the inter-computer difference between any two computers in the computer set is taken as the distance between the two computers, Dcg q The smaller it is, the more similar the distribution of computer processes in the computer set is, the greater the possibility that the computers in the computer set will collaborate with each other in computing, the greater the possibility that they will communicate with each other, and the less likely it is that a computer will exit the key group.

[0068] The computer group prediction separation degree of each computer key group is constructed based on the intra-computer density difference of different computer groups. The expression is:

[0069]

[0070] Where PrD p The predicted separation degree of the computer group for the current p-th computer key group, Dcg p is the intra-computer density of the computer set consisting of all computers in the pth computer key group, Dcg ′ p is the density of the p-th computer key group consisting of all computers that have exited the group after the last key update, Dcg ′ p ′ is the density of the p-th computer key group consisting of all computers that have joined the group since the last key update, μit p is the mean of the time intervals between all computers that have left the p-th computer key group after the last key update, ct p It is the time interval between the current p-th computer key group and the last time a computer exited the group.

[0071] A computer key group is divided into three computer sets. One computer set includes all computers currently in the computer key group. Another computer set is all computers that have exited the current computer key group after the last key update. The last computer set is all computers that have joined the group after the last key update. The smaller the value, the greater the difference between the process characteristics of each computer in the current computer key group and the process characteristics of each computer exiting the computer key group, which means that it is less likely for a new computer to exit the computer key group at this time.

[0072] The smaller it is, the longer the time interval is from when a large number of computers exit the key group, and the less likely it is that a computer will exit the group later.

[0073] Step S003, using the computer group to predict the separation degree to update the key and complete the multi-party collaborative calculation of energy data.

[0074] The smaller the predicted separation of the computer group, the less likely it is that a new computer will exit the key group. At this time, the key should be updated. The threshold is set. When the predicted separation of the computer group PrD p When β≤β, the key of the computer key group is updated, otherwise, the key is not updated. In this embodiment, β=0.75, and the implementer can set it according to the actual situation. This embodiment does not limit this.

[0075] In the process of collaborative computing of energy data, a key management algorithm is used to manage the computers participating in the collaborative computing, and the method of this embodiment is used to update the keys of the computer key group. While ensuring the security of the key group, the communication burden caused by high-frequency key updates is avoided, thereby obtaining better collaborative computing effects. The key management algorithm is an existing public technology and will not be described in detail in this embodiment.

[0076] Based on the same inventive concept as the above method, an embodiment of the present invention also provides a multi-party collaborative computing system for secure sharing of energy data, including a memory, a processor, and a computer program stored in the memory and running on the processor, and when the processor executes the computer program, the steps of any one of the above-mentioned multi-party collaborative computing methods for secure sharing of energy data are implemented.

[0077] In summary, the embodiments of the present invention analyze the process calculation difficulty of computers participating in the collaborative calculation of energy data, and avoid the high communication burden caused by constantly updating keys when new computers frequently exit the key group when performing key management, so that the computer key group can save computing resources and improve the computing speed when calculating new energy data.

[0078] It should be noted that the sequence of the above embodiments of the present invention is only for description and does not represent the advantages and disadvantages of the embodiments. The above is a description of a specific embodiment of this specification. In addition, the processes depicted in the accompanying 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.

[0079] The various embodiments in this specification are described in a progressive manner, and the same or similar parts between the various embodiments can be referenced to each other, and each embodiment focuses on the differences from other embodiments.

[0080] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the principles of the present invention should be included in the protection scope of the present invention.

Claims

1. A multi-party collaborative computing method for secure sharing of energy data, characterized in that: The method comprises the following steps: Obtain the required service time, CPU occupancy rate, RAM occupancy rate, and HDD occupancy rate of each computer participating in the collaborative calculation of energy data; The process calculation difficulty characteristic value of each process of each computer is obtained by combining the hard disk HDD occupancy, memory RAM occupancy and central processing unit CPU occupancy rate; the process calculation difficulty characteristic value is used as the vertical axis and the running time is used as the horizontal axis to obtain a two-dimensional coordinate system; the required service time of each process is used as a variable in the two-dimensional coordinate system to obtain the process difficulty distribution diagram of each computer; the process characteristic vector of each computer is obtained according to the length distribution of the required service time of each process in the process difficulty distribution diagram; the first difference degree and the second difference degree between the two computers are obtained according to the difference in the process characteristic vectors between the two computers; the shorter vector extension credibility between the two computers is obtained according to the distribution difference of the elements in the process characteristic vectors between the two computers; the inter-computer difference degree between the two computers is obtained by combining the shorter vector extension credibility and the first difference degree and the second difference degree between the two computers; all computers participating in the collaborative calculation are divided into computer sets; the intra-computer density of each computer set is obtained according to the inter-computer difference degree; the computer group prediction separation degree of each computer key group is obtained according to the difference in the intra-computer density of different computer sets; the key is updated using the computer group prediction separation degree to complete the multi-party collaborative calculation of energy data; The process feature vector of each computer is obtained according to the length distribution of the service time required by each process in the process difficulty distribution diagram, including: In the process difficulty distribution diagram, the required service time of each process is sampled at equal intervals, and the process calculation difficulty characteristic values ​​of all sampling points are arranged from small to large according to the running time as the process characteristic vector of each computer; The step of obtaining the first difference degree and the second difference degree between the two computers according to the difference of the process feature vectors between the two computers includes: For two computers, the computer with more elements in the process feature vector is regarded as the kth computer, and the computer with fewer elements in the process feature vector is regarded as the kth computer. The expression of the first difference between two computers is: In the formula, represents the kth computer and the The first degree of difference between the computers, Indicates The number of elements in the process feature vector of each computer, represents the process feature vector of the kth computer. The process calculates the difficulty characteristic value, Indicates The process feature vector of the computer The process calculates the difficulty characteristic value, Indicates the sequence number of each element in the process feature vector, where the first difference between two computers is calculated. The tail of the process feature vector of the kth computer is padded with zeros until the length is equal to the process feature vector of the kth computer; The expression of the second difference between the two computers is: In the formula, represents the kth computer and the The second degree of difference between the computers, represents the number of elements in the process feature vector of the kth computer, Indicates The mean of all elements in the process feature vector of each computer; The step of obtaining the shorter vector extension credibility between the two computers according to the distribution difference of elements in the process feature vectors between the two computers includes: Calculate the standard deviation of all elements in the process feature vector of the kth computer and the The absolute value of the difference between the standard deviations of all elements in the process feature vector of the two computers, the sum of the absolute value of the difference and 1 is calculated, and the reciprocal of the sum is used as the shorter vector between the two computers to extend the credibility; The computer group prediction separation degree of each computer key group is obtained according to the intra-computer density difference of different computer groups, and the expression is: In the formula, The predicted separation degree of the computer group for the current p-th computer key group, is the intra-computer density of the computer set consisting of all computers in the p-th computer key group, is the intra-computer density of the p-th computer key group consisting of all computers that have exited the group after the previous key update, is the intra-computer density of the p-th computer key group, which is the computer set consisting of all computers that have joined the group since the last key update. is the mean of the exit time intervals of all computers that exited the p-th computer key group after the last key update, It is the time interval between the current p-th computer key group and the last time a computer exited the group.

2. The multi-party collaborative computing method for secure sharing of energy data according to claim 1 is characterized in that: The process calculation difficulty characteristic value of each process of each computer is obtained by combining the hard disk HDD occupancy, the memory RAM occupancy and the central processing unit CPU occupancy, including: For each process of each computer, the ratio of the RAM occupancy to the HDD occupancy is calculated, and the product of the ratio and the CPU occupancy rate is used as the process calculation difficulty characteristic value of each process of each computer.

3. The multi-party collaborative computing method for secure sharing of energy data according to claim 1 is characterized in that: The step of combining the shorter vector extension credibility and the first difference and the second difference between the two computers to obtain the inter-computer difference between the two computers includes: Calculate the sum of the opposite of the shorter vector extension credibility between the two computers and 1, calculate the product of the sum and the first difference between the two computers, calculate the product of the shorter vector extension credibility between the two computers and the second difference, and use the sum of the two products as the inter-computer difference between the two computers.

4. The multi-party collaborative computing method for secure sharing of energy data according to claim 1 is characterized in that: The step of obtaining the intra-computer density of each computer set according to the inter-computer difference comprises: The sum of the inter-computer differences between each computer in the computer set and other computers is calculated, and the average of all the sums in the computer set is used as the intra-computer set density of each computer set.

5. The multi-party collaborative computing method for secure sharing of energy data according to claim 1 is characterized in that: The method of using a computer group to predict the separation degree to update the key and complete the multi-party collaborative computing of energy data includes: A preset threshold is set. If the predicted separation degree of the computer group of the computer key group is less than or equal to the preset threshold, the key of the computer key group is updated. Otherwise, it is not updated.

6. A multi-party collaborative computing system for secure sharing of energy data, comprising a memory, a processor, and a computer program stored in the memory and running on the processor, characterized in that: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 5 are implemented.