Information sharing method, first server, and second server

Abstract

The present application discloses an information sharing method, a first server and a second server, a device, and a medium, generally relating to the field of computer technologies, and specifically relating to the field of authentication and authorization technologies. The method includes: determining the number of splits m of the target information according to the data volume of the target information; determining a combined threshold value n of the target information according to the number of splits, where n is a positive integer less than m; determining a random coefficient of a split formula matching the target information according to the national cryptographic elliptic curve finite field, and splitting the target information into m target sub-information by means of the split formula with the set random coefficient; and respectively transmitting the m target sub-information to m information-owning terminals. While ensuring the security of the secret information, the contribution efficiency and recovery efficiency of the secret are improved.

Description

Technical Field

[0001] The present disclosure generally relates to the field of communication technologies, and in particular, to a method for information sharing, a first server, and a second server. Background Art

[0002] With the continuous development of communication technologies, the types of information that can be transmitted through communication technologies are increasing, and at the same time, the requirements for transmitting information are becoming more and more complex. Among them, transmitting information through communication technologies is actually very common.

[0003] In the related art, when the information to be transmitted is secret information, the secret information can often be processed according to the established secret information processing and transmission methods, split into multiple parts, and then the multiple parts of the secret information are respectively transmitted to multiple receiving parties of the secret. In this way, each part of the secret has no meaning when it exists alone, and only after being spliced to meet the preset conditions can the complete secret information be obtained. This way of processing and transmitting secrets protects the confidentiality and security of the secrets.

[0004] However, this way of splitting and combining secrets requires obtaining the secrets of all receiving parties of the secret to obtain the secret. In fact, it is overly dependent on each sharing party, which may lead to problems such as low secret recovery efficiency and complex calculation. Summary of the Invention

[0005] In view of the above defects or deficiencies in the related art, it is desirable to provide a method for information sharing, a first server, and a second server, which can solve the problems that it is necessary to obtain the secrets of all receiving parties of the secret to obtain the secret, is actually overly dependent on each sharing party, and may lead to problems such as low secret recovery efficiency and complex calculation, and improve the contribution efficiency and recovery efficiency of the secret while ensuring the security of the secret information.

[0006] In a first aspect, there is provided a method for information sharing, which is applied to a first server, and the method includes:

[0007] Determine the number of splits m of the target information according to the data volume of the target information, where the number of splits is less than the corresponding prime number P of the finite field of the national cryptographic elliptic curve, and m is a positive integer;

[0008] Determine the combination threshold value n of the target information according to the number of splits, where n is a positive integer less than m;

[0009] Determine the random coefficients of the splitting formula matching the target information according to the finite field of the national cryptographic elliptic curve, and split the target information into m target sub-information through the splitting formula with the set random coefficients, where the number of random coefficients is the same as the number of splits m of the target information;

[0010] Transmit the m target sub-information to m information-owning terminals respectively;

[0011] Among them, any n target sub-information in the m target sub-information are combined to generate target information, the combination threshold value n is the minimum number of target sub-information for generating the target information, and each target sub-information in the m target sub-information includes: sub-information content and combination threshold value n.

[0012] In this application, the first server first determines the splitting number m (m is a positive integer) of the target information according to the data volume of the target information, and this splitting number is less than the corresponding prime number P of the finite field of the national cryptography elliptic curve; then, according to the above splitting number, determine the combination threshold value n of the target information, where n is a positive integer less than m; then, according to the above finite field of the national cryptography elliptic curve, determine the random coefficient of the splitting formula matching the target information, and split the target information into m target sub-information through the splitting formula with the random coefficient set, and the number of the random coefficients is the same as the splitting number m of the target information; transmit the above m target sub-information to m information-owning terminals respectively; among them, any n target sub-information in the above m target sub-information are combined to generate target information, the above combination threshold value n is the minimum number of target sub-information for generating the target information, and each target sub-information in the above m target sub-information includes: sub-information content and combination threshold value n. In this way, the splitting number of the target information is determined according to the prime number P corresponding to the finite field of the national cryptography elliptic curve, and according to the splitting number, further determine the number of target sub-information generated after splitting, and determine the minimum number of target sub-information for generating the target information by combination, that is, the combination threshold value m, and this combination threshold value is less than the previous splitting number. Therefore, the target information can be restored without all the sub-information of the target sub-information split by the finite field of the national cryptography elliptic curve, which ensures the recoverability and recovery efficiency of the target information, and avoids the problem of easy information loss caused by the need for all information-owning terminals with all target sub-information to provide sub-information to restore the target information before.

[0013] In a second aspect, an information sharing method is provided, which is applied to a second server, and the method includes:

[0014] When receiving the first target sub-information of any one of the m information-owning terminals to which the m target sub-information belong, obtain at least n - 1 target sub-information according to the combination threshold value n of the target sub-information, where the m target sub-information are the information obtained after splitting the target information, and the splitting number is less than the corresponding prime number P of the finite field of the national cryptography elliptic curve;

[0015] According to the target combination formula and the national cryptography elliptic curve finite field, combine the at least n - 1 target sub-information and the first target sub-information into target information;

[0016] Among them, any n target sub-information in the m target sub-information are combined to generate target information. The combination threshold value n is the minimum number of target sub-information for generating the target information. Each target sub-information in the m target sub-information includes: sub-information content and combination threshold value n.

[0017] In a third aspect, a first server is provided. The first server includes:

[0018] A determination unit, configured to determine the splitting number m of the target information according to the data volume of the target information. The splitting number is less than the corresponding prime number P of the national cryptography elliptic curve finite field, and m is a positive integer;

[0019] The determination unit is further configured to determine the combination threshold value n of the target information according to the splitting number. n is a positive integer less than m;

[0020] An execution unit is further configured to determine, according to the national cryptography elliptic curve finite field, a random coefficient of a splitting formula matching the target information, and split the target information into m target sub-information by using the splitting formula with the set random coefficient. The number of the random coefficients is the same as the splitting number m of the target information;

[0021] A transmission unit, configured to transmit the m target sub-information to m information-owning terminals respectively;

[0022] Among them, any n target sub-information in the m target sub-information are combined to generate target information. The combination threshold value n is the minimum number of target sub-information for generating the target information. Each target sub-information in the m target sub-information includes: sub-information content and combination threshold value n.

[0023] In a fourth aspect, a second server is provided. The second server includes:

[0024] An acquisition unit, configured to, when receiving a first target sub-information of any one of the m information-owning terminals to which the m target sub-information belong, acquire at least n - 1 target sub-information according to the combination threshold value n of the target sub-information. The m target sub-information are the information obtained after splitting the target information. The splitting number is less than the corresponding prime number P of the national cryptography elliptic curve finite field;

[0025] An execution unit, configured to combine the at least n - 1 target sub-information and the first target sub-information into target information according to the target combination formula and the national cryptography elliptic curve finite field;

[0026] Among them, any n target sub-informations among the m target sub-informations are combined to generate a target information. The combined threshold value n is the minimum number of target sub-informations for combining to generate the target information. Each of the m target sub-informations includes: sub-information content and combined threshold value n.

[0027] In a fifth aspect, a computer device is provided, including a memory, a processor, and a computer program stored on the memory and executable on the processor. When the processor executes the program, the method described in the first aspect or the second aspect above is implemented.

[0028] In a sixth aspect, a computer-readable storage medium is provided, on which a computer program is stored. The characteristic is that when the program is executed by a processor, the method described in the first aspect or the second aspect above is implemented.

[0029] In a seventh aspect, a computer program product is provided. The computer program product contains instructions, and when the instructions are run by a processor, the method described in the first aspect or the second aspect above is implemented.

[0030] Additional aspects and advantages of the present invention will be given in part in the following description, become apparent in part from the following description, or be understood through the practice of the present invention. Description of the Drawings

[0031] By reading the detailed description of the non-limiting embodiments with reference to the following drawings, other features, objectives, and advantages of the present application will become more apparent:

[0032] Figure 1 One of the flow diagrams of the information sharing method provided for the embodiments of the present application;

[0033] Figure 2 Another flow diagram of the information sharing method provided for the embodiments of the present application;

[0034] Figure 3 Another flow diagram of the information sharing method provided for the embodiments of the present application;

[0035] Figure 4 The structural diagram of the first server provided for the embodiments of the present application;

[0036] Figure 5 The structural diagram of the second server provided for the embodiments of the present application;

[0037] Figure 6 The structural diagram of the computer device provided for the embodiments of the present application. Detailed Embodiments

[0038] The present application will be further described in detail below in conjunction with the accompanying drawings and embodiments. It can be understood that the specific embodiments described herein are only used to explain the related invention, rather than limiting the invention. Additionally, it should be noted that for ease of description, only the parts related to the invention are shown in the drawings.

[0039] It should be noted that, without conflict, the embodiments in the present application and the features in the embodiments can be combined with each other. The following will describe the related background of the present application as follows.

[0040] As described in the foregoing content, the process of information transmission also includes the transmission of secret information. The transmission of secret information generally adopts a sharing scheme, that is, a complete secret information is divided into multiple parts (sub-secret information). When each part exists independently, it is meaningless or almost meaningless. Under the condition of meeting the predefined conditions (for example, the owner of a sub-secret initiates a request to combine the secret through other servers), other secrets will be collected and combined again to restore the complete secret information.

[0041] This sharing scheme belongs to the distributed information processing technology, which was initially proposed by Shamir and Blakely in 1978 respectively, and is mainly applied to scenarios such as secure communication and distributed system management, improving security, especially for the protection of critical data such as cryptographic keys, private keys or sensitive information. The traditional single-point failure model may cause significant losses when facing internal leakage or malicious attacks. Through the secret information sharing scheme, even if some of the multiple storage nodes are damaged or fail, as long as the preset quantity limit is met, the original secret can still be safely restored.

[0042] Currently, there are the following several secret information sharing schemes in the related technologies:

[0043] 1. Shamir threshold scheme: This is the most famous type in the secret information sharing technology, created by Adi Shamir. It uses polynomial interpolation and random point generation to achieve the segmentation of secret information. Any combination of participants reaching the predefined quantity can recalculate the original secret information, and any combination with a quantity less than this cannot restore the original secret.

[0044] 2. Verifiable secret information sharing: In some applications, it is necessary to ensure that all participants correctly store and submit their shares, that is, the above-mentioned sub-secret information. This involves an additional mechanism or protocol to verify whether the share of each participant is valid and whether the secret information can be correctly reconstructed from these shares. This helps to prevent fraud and increase the transparency and security of the system.

[0045] 3. Multi-Party Computation: Although this solution is not strictly a type of secret information sharing technology, it is closely related to secret information sharing. It allows multiple participants to perform joint computations without revealing their inputs. In this case, secret information sharing can serve as the basis for security protocols to protect the privacy of participants and ensure that the results can only be accessed under the condition of correct combination.

[0046] 4. Ring Signatures and Threshold Signatures: Although not traditional secret sharing information technologies, they have similarities with secret information management. Ring signatures allow a participant (i.e., the owner of sub-secret information) to sign a message without revealing who the participant is until a certain number of other participants gather to verify the signature. Similarly, threshold signature schemes allow multiple participants to jointly generate a valid digital signature.

[0047] 5. Blockchain Secret Sharing Scheme: One way to use blockchain technology to achieve secret information sharing is through smart contracts and cryptocurrency platforms. In this method, the secret information is stored on the blockchain and can only be accessed when predefined conditions are met (such as reaching a specific number of transactions or being confirmed by verifiers).

[0048] These secret information sharing schemes have a wide range of applications in different fields, including but not limited to secure communication, resource allocation in distributed systems, data sharing in multi-cloud environments, and identity and permission management. With the progress of computing power and the development of technology.

[0049] However, in the existing secret information sharing schemes above, the original secret information can only be combined and generated when all the secret information owners output their secrets. Thus, in fact, it is overly dependent on each sharing party, which may lead to problems such as low secret recovery efficiency and high computational complexity.

[0050] Based on this, the present application proposes an information sharing method, a first server, and a second server, which can solve the problems that the secret can only be obtained by getting the secrets of all the receiving parties, and is overly dependent on each sharing party, which may lead to problems such as low secret recovery efficiency and high computational complexity, and improve the contribution efficiency and recovery efficiency of the secret while ensuring the security of the secret information.

[0051] Figure 1 is a schematic flowchart of an information sharing method provided by an embodiment of the present application. The execution subject of this method can be the first server. As Figure 1 shown, the method includes the following steps:

[0052] Step 301: Determine the number of splits m of the target information according to the data volume of the target information.

[0053] In the embodiment of the present application, the above splitting number is less than the corresponding prime number P of the finite field of the national cryptographic elliptic curve, and m is a positive integer.

[0054] It can be understood that the finite field of the national cryptographic elliptic curve refers to the finite field (Finite Field) used by the State Cryptography Administration of China (SM2 elliptic curve public key cryptography algorithm), also known as the Galois Field. The finite field is the basic mathematical structure of elliptic curve cryptography, and the security of the SM2 algorithm depends on the elliptic curve operations over the finite field.

[0055] The finite field of the national cryptographic elliptic curve includes the following three elements:

[0056] 1) Finite field: The SM2 algorithm is based on the finite field (Galois Field), usually denoted as Fp, where p is a large prime number, and this large prime number is the "corresponding prime number P of the finite field of the national cryptographic elliptic curve" mentioned above.

[0057] 2) Elliptic curve equation: The elliptic curve equation used by SM2 is as shown in the following Formula 1:

[0058] Formula 1

[0059] Where a and b are constants in the finite field Fp.

[0060] 3) Parameters: The SM2 algorithm has standard parameters, including the prime number p, the curve coefficients a and b, the coordinates of the base point G, and the order n of the base point G, etc.

[0061] In the embodiment of the present application, the above target information may include target secret information.

[0062] It can be understood that the target secret information can be: information that can be split into several parts and several shares. For example, the target information can be key information.

[0063] Exemplarily, according to the actual data volume of the target information, the splitting number of the target information can be determined.

[0064] Exemplarily, the splitting number of the target information can also be determined according to the data volume of the target information and the information-owning terminal that plans to hold the target sub-information.

[0065] Step 302: Determine the combined threshold value n of the target information according to the above splitting number.

[0066] Exemplarily, n is a positive integer less than m.

[0067] It can be understood that after determining the above splitting number, the combined threshold value n of the target information can be determined according to the splitting number based on a preset rule.

[0068] Further, after splitting the target information into m target sub-information, assuming that when the target sub-information needs to be combined to generate the target information subsequently, the number of target sub-information required in the actual combination process should be less than m, that is, the target information can be restored without all the target sub-information.

[0069] Furthermore, although the target information can be restored without all the target sub-information, the minimum number of target sub-information should be restricted. For example, assuming that the splitting number of the split target information is 5 target sub-information, the number of target information generated by combining the target sub-information is at least 3 or 4.

[0070] In one example, the preset rule for determining the combined threshold value n can be a preset formula. Specifically, the preset formula is as shown in Formula Two below:

[0071] Formula Two

[0072] That is, in Formula Two, the ratio of m to 2 needs to be rounded up. Based on Formula Two, assuming the splitting number is m = 5, then, n = 3.

[0073] It can be understood that after determining the splitting number, the combined threshold value can be calculated by the above Formula Two. At the same time, since it is required in advance that the combined threshold value is less than the splitting number, after the first server sets the combined threshold value, it can also combine Formula Two and "the combined threshold value is less than the splitting number" to detect whether the combined threshold value meets the preset requirements. After satisfying the value obtained by the calculation of Formula Two and the above and "the combined threshold value is less than the splitting number", it can be considered that the combined threshold value meets the preset requirements for detection.

[0074] Step 303: Determine the random coefficients of the splitting formula that matches the above target information according to the above national secret elliptic curve finite field, and split the target information into m target sub-information by setting the splitting formula of the random coefficients.

[0075] In the embodiment of the present application, the number of the above random coefficients is the same as the splitting number m of the above target information.

[0076] It can be understood that the process of splitting the target information based on the above national secret elliptic curve finite field is completed by a preset splitting formula. At the same time, in order to ensure the high confidentiality of the process of splitting the target information and the non-repetition with any other splitting process, the formula coefficients in the splitting formula are random coefficients, that is, the coefficients used in each splitting process are different.

[0077] In the embodiments of the present application, the splitting formula is as shown in Formula III below:

[0078] Formula III

[0079] Wherein, , is the aforementioned finite field Fp. to are the random coefficients in the aforementioned splitting formula.

[0080] It can be understood that the process of splitting the information is calculated based on the aforementioned finite field. Through Formula III, the target information is split into m pieces of target sub-information.

[0081] In one example, when the above target information is target secret information, the above target sub-information can be m pieces of secret sub-information. Since it is calculated based on the finite field of the national cryptographic elliptic curve, the expression form of the secret sub-information is coordinate components. For example, the secret sub-information is composed of m (x i , y i ).

[0082] Step 304: Transmit the m pieces of target sub-information to m information-owning terminals respectively.

[0083] In the embodiments of the present application, the above m information-owning terminals of the target sub-information are preset in advance or can also be set by the user.

[0084] It can be understood that after the target information is split, the specific corresponding information-owning terminal can be set in the first server in advance. After the first server splits the m pieces of target sub-information, it will transmit these m pieces of target sub-information to m information-owning terminals.

[0085] In the embodiments of the present application, any n pieces of target sub-information among the above m pieces of target sub-information are combined to generate the target information. The combination threshold value n is the minimum number of target sub-information for combining to generate the target information. Each target sub-information among the m pieces of target sub-information includes: sub-information content and combination threshold value n.

[0086] It can be understood that after the first server splits the above target information, each target sub-information is meaningless or basically meaningless information. At this time, during the process of the first server transmitting these m pieces of target sub-information from the first server to m information-owning terminals, there will be no problem of information leakage.

[0087] Further, for the m information-owning terminals storing m target sub-information, the subsequent process involves combining the target sub-information to generate the target information. As can be seen from the foregoing, for the embodiments of the present application, it is not necessary to obtain all the target sub-information again, that is, to obtain the m target sub-information again to complete the combination of the target information. Instead, only n target sub-information is required to complete the combination of the target information. Among them, the n target sub-information are any n of the m sub-information.

[0088] It can be understood that during the process of sending the m target sub-information to the m information-owning terminals after splitting, the sensitive information that may exist in the m target sub-information can be sent only to some of the m information-owning terminals, rather than allowing all the information-owning terminals to hold the sensitive information, so as to improve the privacy while not affecting the subsequent combination and restoration of the target information.

[0089] In this way, the robustness of the information splitting and combination process can be greatly increased. By setting the splitting process of the present application, while ensuring the security of the target information splitting and combination, it can be ensured that any combination of all the information-owning terminals that meets the threshold can recreate the original secret information, thereby avoiding the situation where the target information cannot be restored due to some of the information-owning terminals being unable to provide the target sub-information or the loss of the target sub-information. At the same time, since the combination process of the target sub-information in the related art is prone to single-point failure, this splitting method can also greatly enhance the security.

[0090] In the method provided by the embodiment of the present application, the first server first determines the number of splits m (m is a positive integer) of the target information according to the data volume of the target information, and this number of splits is less than the corresponding prime number P of the finite field of the national cryptography elliptic curve; then, according to the above number of splits, determines the combined threshold value n of the target information, and n is a positive integer less than m; then, according to the above finite field of the national cryptography elliptic curve, determines the random coefficients of the split formula matching the target information, and splits the target information into m target sub-information through the split formula with the set random coefficients, and the number of the random coefficients is the same as the number of splits m of the target information; transmits the above m target sub-information to m information-owning terminals respectively; wherein, any n of the above m target sub-information can be combined to generate the target information, the above combined threshold value n is the minimum number of target sub-information for combining to generate the target information, and each of the above m target sub-information includes: sub-information content and combined threshold value n. In this way, the number of splits of the target information is determined according to the prime number P corresponding to the finite field of the national cryptography elliptic curve, and according to the number of splits, the number of target sub-information generated after splitting is further determined, and the minimum number of target sub-information for combining to generate the target information is determined, that is, the combined threshold value m, and this combined threshold value is less than the previous number of splits. Therefore, the target information can be restored without all the sub-information after being split by the finite field of the national cryptography elliptic curve, which ensures the recoverability and recovery efficiency of the target information, improves the calculation efficiency, and avoids the problem of easy information loss caused by the need for all information-owning terminals with all target sub-information to provide sub-information to restore the target information before.

[0091] In another embodiment of the present application, a specific implementation manner of applying for the space used in the splitting process in advance before actually splitting the target information is also provided. Exemplarily, before the "determining the random coefficients corresponding to the split formula of the target information according to the above finite field of the national cryptography elliptic curve" mentioned above, the information sharing method provided by the present application includes: obtaining the storage space corresponding to splitting the target information according to the above number of splits.

[0092] Exemplarily, the above storage space is used to execute the splitting of the above target information, and the memory capacity of the above storage space corresponds to the above number of splits.

[0093] It can be understood that for the process of splitting the above target information, it is completed through a preset algorithm and a preset formula (see the above formula for details). In the process of executing the splitting of the target information, it is actually necessary to apply for storage space in advance to carry out this splitting process.

[0094] In one example, the above storage space can be the actual context memory required by the split formula or split algorithm in the first server. This context memory can also be understood as a process of initializing the context and then applying for the context memory.

[0095] Exemplarily, the above storage space can be determined jointly based on the number of splits and the data volume of the target information; it can also be determined solely based on the number of splits.

[0096] Optionally, after "splitting the above target information into m target sub-informations by setting the splitting formula of the above random coefficient", the above method further includes: clearing the above storage space.

[0097] It can be understood that after the above splitting process ends, it is necessary to restore the storage space applied previously to ensure the progress of subsequent or other algorithms and ensure the effective occupancy and utilization rate of the space in the first server.

[0098] In another embodiment of the present application, a specific implementation manner is also provided for transferring the splitting process from the original coordinate system to the first coordinate system before splitting the target information to simplify the splitting process. Exemplarily, the specific implementation of "splitting the above target information into m target sub-informations by setting the splitting formula of the above random coefficient" includes: confirming the first coordinate value of the above random coefficient in the original coordinate system; converting the first coordinate value into the second coordinate value in the target coordinate system.

[0099] Optionally, in the embodiment of the present application, the above original coordinates include any one of the following: standard projective coordinate system and affine coordinate system, and the above target coordinates include any one of the following: Jacobian weighted projective coordinate system.

[0100] Exemplarily, the operation type of the above target coordinate system is different from that of the first coordinate system.

[0101] The coordinate systems of the national secret elliptic curve finite field are introduced below.

[0102] The coordinate systems of the national secret elliptic curve finite field can be roughly divided into three types, namely 1) standard projective coordinate system; 2) affine coordinate system; 3) Jacobian weighted projective coordinate system

[0103] Among these three coordinate systems, the standard projective coordinate system and the affine coordinate system are relatively simple to implement, but if used in the splitting process, there are relatively complex mathematical operations, such as modular inverse operation and division operation, which have a significant impact on the operation performance. Although the Jacobian weighted projective coordinate system is more complex to implement, it avoids the above two operations and further optimizes the addition and double-point operation processes, resulting in a significant improvement in the operation speed.

[0104] Exemplarily, as Figure 2 shown, Figure 2Illustrate the conversion process of the elliptic curve finite field coordinate system: When determining to use the Jacobian projective coordinate system for the splitting process of the elliptic curve finite field, that is, in the case of splitting operations, it is necessary to convert the points in the standard projective coordinate system to the Jacobian projective coordinate system before the actual splitting process. After the operation is completed through the arithmetic module, the points in the Jacobian projective coordinate system are restored to the standard projective coordinate system.

[0105] Among them, the points in the above standard projective coordinate system can be the above splitting formula, that is, the random coefficients in Formula 2. To . In this way, after splitting using the random coefficients with the Jacobian projective coordinate system, the obtained target sub-information is also based on the points in the Jacobian projective coordinate system.

[0106] Optionally, splitting the above target information into m target sub-information by setting the above splitting formula of the random coefficients includes: splitting the above target information into m target sub-information by the splitting formula with the random coefficients with the above second coordinate value.

[0107] Exemplarily, the above m target sub-information are the sub-information in the above target coordinate system, and the coordinate values of the above m target sub-information are the third coordinate values.

[0108] Optionally, after splitting the above target information into m target sub-information by setting the above splitting formula of the random coefficients, the method further includes: updating the above m target sub-information from the third coordinate value in the above target coordinate system to the fourth coordinate value in the above original coordinate system.

[0109] It can be understood that after the splitting operation is completed and the effect of simplifying the splitting process operation has been achieved, it is still necessary to convert the m target sub-information in the above target coordinate system back to the original coordinate system again.

[0110] Optionally, for the process of converting the first coordinate value to the second coordinate value, that is, "converting the above first coordinate value to the second coordinate value in the target coordinate system", in the information sharing method provided in the embodiments of the present application, it includes: in the above original coordinate system, confirming the first coordinate value of the above random coefficient according to the first projection of the above random coefficient; converting the above first projection to the above target coordinate system to obtain and the second projection, and determining the second coordinate value of the above random coefficient in the target coordinate system according to the above second projection.

[0111] Optionally, for the process of converting the third coordinate value into the fourth coordinate value above, that is, "converting the first coordinate value above into the second coordinate value in the target coordinate system", in the information sharing method provided in the embodiments of the present application, it includes: in the above target coordinate system, obtaining the third projection corresponding to the third coordinate value of the above m target sub-information; converting the above third projection into the above original coordinate system and obtaining the fourth projection, and confirming the fourth coordinate value of the above m target sub-information in the original coordinate system according to the above fourth projection.

[0112] Figure 3 FIG. 4 is a schematic flowchart of an information sharing method provided by an embodiment of the present application. The execution subject of this method can be a second server. As Figure 3 shown, this method includes the following steps:

[0113] Step 401: When receiving the first target sub-information of any one of the m information-owning terminals to which the m target sub-information belongs, obtaining at least n - 1 target sub-information according to the combined threshold value n of the target sub-information.

[0114] In the embodiments of the present application, the above m target sub-information is: the information obtained after splitting the above target information, and the number of splits is less than the corresponding prime number P of the finite field of the national cryptographic elliptic curve.

[0115] In the embodiments of the present application, the above information-owning terminal, target sub-information, combined threshold value, finite field of the national cryptographic elliptic curve, and the corresponding prime number of the finite field of the national cryptographic elliptic curve, etc. can refer to the foregoing description and will not be elaborated here.

[0116] It can be understood that when any one of the m information-owning terminals pre-obtains the target information, it can first send the first target sub-information it owns to the second server to trigger the second server to send request information for obtaining at least n - 1 target sub-information to at least n - 1 other information-owning terminals to complete the preparation work of the combined target information.

[0117] It should be noted that the above second server can be a server different from the first server or the same server as the first server. Among them, when the second server is the same server as the first server, the second server should destroy the target information it received previously before receiving the first target sub-information.

[0118] Step 402: Combining the above at least n - 1 target sub-information and the first target sub-information into target information according to the above target combination formula and the finite field of the national cryptographic elliptic curve.

[0119] In the embodiments of the present application, any n of the above m target sub-information are combined to generate target information. The combined threshold value n is the minimum number of target sub-information for generating the target information. Each of the m target sub-information includes: sub-information content and combined threshold value n.

[0120] It can be understood that the above target combination formula can be the Lagrange interpolation formula. That is, as shown in Formula Four below:

[0121] Formula Four

[0122] Among them, the above Lagrange interpolation formula can restore n pieces of target sub-information (x i , y i ) to a secret.

[0123] It can be understood that in the embodiments of the present application, since each information holding terminal's target sub-information includes both sub-information content and combined threshold value n, in fact, it already knows the combined threshold value n during the combination process and sends the first target sub-information to the second server, triggering the second server to send request information for obtaining target sub-information to at least n - 1 other information holding terminals.

[0124] In another embodiment of the present application, a specific implementation manner for applying for the space used in the combination process in advance before actually combining the target sub-information is also provided. Exemplarily, before "combining the above at least n - 1 target sub-information into target information according to the above target combination formula and the above national secret elliptic curve finite field", the information sharing method provided by the present application includes: obtaining the storage space corresponding to combining the above at least n - 1 target sub-information and the first target sub-information according to the number of sub-information of the above at least n - 1 target sub-information.

[0125] Exemplarily, the above storage space is used to combine the above at least n - 1 target sub-information and the first target sub-information, and the memory capacity of the above storage space corresponds to the total number of the above at least n - 1 target sub-information and the first target sub-information.

[0126] Exemplarily, the above storage space is used to execute the combination of the above target information, and the memory capacity of the above storage space corresponds to the above combination number.

[0127] It can be understood that for the process of combining the above n target sub-information, it is completed through a preset algorithm and a preset combination formula (see the foregoing formula). During the process of executing the combination of the target information, in fact, it is necessary to apply for storage space in advance to carry out this combination process.

[0128] In one example, the above storage space can be the actual context memory required by the combination formula or algorithm in the second server. This context memory can also be understood as the process of initializing the context and then applying for the context memory.

[0129] Exemplarily, the above storage space can be jointly determined based on the number of combinations and the data volume of the target information; it can also be determined solely based on the number of combinations.

[0130] Optionally, after "combining the at least n - 1 target sub - information into target information according to the above target combination formula and the above national secret elliptic curve finite field", the method further includes: clearing the above storage space.

[0131] It can be understood that after the above combination process, it is necessary to restore the storage space previously applied for to ensure the progress of subsequent or other algorithms and to ensure the effective occupation and utilization rate of the space in the second server.

[0132] In another embodiment of the present application, a specific implementation manner is also provided for transferring the splitting process from the original coordinate system to the first coordinate system before combining the target information to simplify the combination process. Exemplarily, the specific implementation of "combining the at least n - 1 target sub - information and the first target sub - information into target information according to the above target combination formula and the above national secret elliptic curve finite field" includes: confirming the fifth coordinate value of the at least n - 1 target sub - information and the first target sub - information in the original coordinate system; converting the fifth coordinate value into the sixth coordinate value in the target coordinate system.

[0133] Exemplarily, the operation type of the above target coordinate system is different from that of the original coordinate system.

[0134] Optionally, in the embodiments of the present application, the above original coordinate includes any one of the following: standard projective coordinate system and affine coordinate system, and the above target coordinate includes any one of the following: Jacobian projective coordinate system.

[0135] It can be understood that the coordinate system for the national secret elliptic curve finite field can refer to the foregoing introduction.

[0136] It can be understood that during the combination process, since the coordinate system corresponding to the target sub - information is also in the standard projective coordinate system or the affine coordinate system, there are also relatively complex mathematical operations, such as modular inverse operation and division operation, which have a significant impact on the operation performance. Although the Jacobian projective coordinate system is more complex to implement, it avoids the above two operations and further optimizes the addition and double - point operation processes, significantly improving the operation speed.

[0137] Exemplarily, since the combination process is consistent with the aforementioned splitting process due to the transformation of the coordinate system, therefore, as Figure 2 shown, Figure 2 shows the conversion process of the elliptic curve finite field coordinate system: When it is determined to use the Jacobian projective coordinate system for the combination process of the elliptic curve finite field, that is, in the case of combination operations, it is necessary to convert the points in the standard projective coordinate system to the Jacobian projective coordinate system before the actual combination process. After the operation is completed through the arithmetic module, the points in the Jacobian projective coordinate system are restored to the standard projective coordinate system.

[0138] Among them, the points in the above standard projective coordinate system can be the coordinate values of the above target sub-information, that is, (x i , y i ). Thus, after combining with the random coefficients having the Jacobian projective coordinate system, the obtained target information is also based on the points in the Jacobian projective coordinate system.

[0139] Exemplarily, the "combining the at least n - 1 target sub-information and the first target sub-information into target information according to the above target combination formula and the above national cryptographic elliptic curve finite field" mentioned above includes: combining the at least n - 1 target sub-information and the first target sub-information into target information in the above target coordinate system according to the above target combination formula and the above national cryptographic elliptic curve finite field, and the above target information is the seventh coordinate value.

[0140] Exemplarily, after the "combining the at least n - 1 target sub-information and the first target sub-information into target information according to the above target combination formula and the above national cryptographic elliptic curve finite field" mentioned above, the method further includes: updating the above target information from the seventh coordinate value in the above target coordinate system to the eighth coordinate value in the above original coordinate system.

[0141] It can be understood that after completing the combination operation of combining the target sub-information, the effect of simplifying the combination process operation has been achieved, but it is still necessary to convert the target information in the above target coordinate system back to the original coordinate system again.

[0142] The embodiment of the present application also provides a computer-readable storage medium, on which a computer program is stored, and when the program is executed by a processor, it implements the training rule determination method described in the embodiment of the present application. For example, it can execute Figure 1 or Figure 3 each step of the method shown.

[0143] The embodiment of the present application provides a computer program product, which contains instructions, and when the instructions are run by a processor, it implements Figure 1 or Figure 3 each step of the method shown.

[0144] It should be noted that although the operations of the method of the present invention are described in a specific order in the accompanying drawings, this does not require or imply that these operations must be performed in that specific order, or that all the operations shown must be performed to achieve the desired result.

[0145] Figure 4 A block diagram of the first server according to an embodiment of the present application. Refer to Figure 4 , the first server includes a determination unit 601, an execution unit 602, and a transmission unit 603.

[0146] The determination unit 601 is configured to determine the number of splits m of the target information according to the data volume of the target information, where the number of splits is less than the corresponding prime number P of the finite field of the national cryptographic elliptic curve, and m is a positive integer;

[0147] The determination unit 601 is further configured to determine the combined threshold value n of the target information according to the number of splits, where n is a positive integer less than m;

[0148] The execution unit 602 is further configured to determine the random coefficients of the splitting formula matching the target information according to the finite field of the national cryptographic elliptic curve, and split the target information into m target sub-information by setting the splitting formula of the random coefficients, where the number of random coefficients is the same as the number of splits m of the target information;

[0149] The transmission unit 603 is configured to separately transmit the m target sub-information to m information-owning terminals;

[0150] Wherein, any n target sub-information among the m target sub-information are combined to generate the target information, the combined threshold value n is the minimum number of target sub-information for combining to generate the target information, and each target sub-information among the m target sub-information includes: sub-information content and combined threshold value n.

[0151] In one embodiment, the execution unit 602 is further configured to: obtain the storage space corresponding to splitting the target information according to the number of splits; clean the storage space; the storage space is used to execute the splitting of the target information, and the memory capacity of the storage space corresponds to the number of splits.

[0152] In one embodiment, the execution unit 602 is further configured to:

[0153] Convert the first coordinate value into a second coordinate value in a target coordinate system, where the operation type of the target coordinate system is different from that of the first coordinate system; split the target information into m target sub-information through a splitting formula with random coefficients of the second coordinate value, where the m target sub-information are sub-information in the target coordinate system, and the coordinate values of the m target sub-information are third coordinate values; update the m target sub-information from the third coordinate value in the target coordinate system to the fourth coordinate value in the original coordinate system.

[0154] In one embodiment, the original coordinate includes any one of the following: a standard projective coordinate system and an affine coordinate system, and the target coordinate includes any one of the following: a Jacobian weighted projective coordinate system.

[0155] In one embodiment, the execution unit 602 is specifically configured to: in the original coordinate system, confirm the first coordinate value of the random coefficient according to the first projection of the random coefficient; convert the first projection into the target coordinate system to obtain a second projection, and determine the second coordinate value of the random coefficient in the target coordinate system according to the second projection.

[0156] In one embodiment, the execution unit 602 is specifically configured to: in the target coordinate system, obtain a third projection corresponding to the third coordinate value of the m target sub-information; convert the third projection into the original coordinate system to obtain a fourth projection, and confirm the fourth coordinate value of the m target sub-information in the original coordinate system according to the fourth projection.

[0157] Figure 5 This is a block diagram of the first server according to an embodiment of the present application. Refer to Figure 5 This second server includes an acquisition unit 701 and an execution unit 702.

[0158] The acquisition unit 701 is configured to, when receiving a first target sub-information of any one of the m information owning terminals to which the m target sub-information belong, obtain at least n - 1 target sub-information according to the combined threshold value n of the target sub-information, where the m target sub-information are information obtained after splitting the target information, and the number of splits is less than the corresponding prime number P of the finite field of the national secret elliptic curve;

[0159] The execution unit 702 is configured to combine the at least n - 1 target sub-information and the first target sub-information into target information according to the target combination formula and the finite field of the national secret elliptic curve;

[0160] Among them, any n of the m target sub-information are combined to generate target information. The combined threshold value n is the minimum number of target sub-information for generating the target information. Each of the m target sub-information includes: sub-information content and combined threshold value n.

[0161] In one embodiment, the execution unit 702 is further configured to:

[0162] Obtain a storage space corresponding to combining the at least n - 1 target sub-information and the first target sub-information according to the number of sub-information of the at least n - 1 target sub-information;

[0163] Clean the storage space;

[0164] The storage space is used to combine the at least n - 1 target sub-information and the first target sub-information, and the memory amount of the storage space corresponds to the total number of the at least n - 1 target sub-information and the first target sub-information.

[0165] In one embodiment, the execution unit 702 is further configured to:

[0166] Confirm the fifth coordinate value of the at least n - 1 target sub-information and the first target sub-information in the original coordinate system;

[0167] Convert the fifth coordinate value into a sixth coordinate value in the target coordinate system, where the operation type of the target coordinate system is different from that of the original coordinate system;

[0168] Combine the at least n - 1 target sub-information and the first target sub-information into target information in the target coordinate system according to the target combination formula and the national secret elliptic curve finite field, and the target information is the seventh coordinate value;

[0169] Update the target information from the seventh coordinate value in the target coordinate system to the eighth coordinate value in the original coordinate system.

[0170] It should be understood that the various units recorded in the first server and the second server correspond to the respective steps in the method described in the drawings. Thus, the operations and features described above for the method also apply to the first server and the second server and the units included therein, and will not be repeated here. The first server and the second server can be pre-implemented in the browser or other security applications of the computer device, or can be loaded into the browser or its security application of the computer device by means of downloading, etc. The corresponding units in the first server and the second server can cooperate with the units in the computer device to implement the solution of the embodiments of the present application.

[0171] Among the several modules or units mentioned in the above detailed description, this division is not mandatory. In fact, according to the embodiments of the present disclosure, the features and functions of two or more modules or units described above can be embodied in one module or unit. Conversely, the features and functions of one module or unit described above can be further divided and embodied by multiple modules or units.

[0172] It should be noted that for the details not disclosed in the first server and the second server of the embodiments of the present application, please refer to the details disclosed in the above embodiments of the present application, and will not be elaborated here.

[0173] The following refers to Figure 6 , Figure 6 shows a schematic structural diagram of a computer device suitable for implementing the embodiments of the present application. As Figure 6 shown, the computer system 1700 includes a central processing unit (CPU) 1701, which can perform various appropriate actions and processes according to the program stored in the read-only memory (ROM) 1702 or the program loaded from the storage section 1708 into the random access memory (RAM) 1703. In the RAM 1703, various programs and data required for the operation instructions of the system are also stored. The CPU 1701, ROM 1702, and RAM 1703 are connected to each other via a bus 1704. The input / output (I / O) interface 1705 is also connected to the bus 1704.

[0174] The following components are connected to the I / O interface 1705; an input section 1706 including a keyboard, a mouse, etc.; an output section 1707 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc. and a speaker, etc.; a storage section 1708 including a hard disk, etc.; and a communication section 1709 including a network interface card such as a LAN card, a modem, etc. The communication section 1709 performs communication processing via a network such as the Internet. A drive 1710 is also connected to the I / O interface 1705 as required. A removable medium 1711, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 1710 as required, so that the computer program read from it can be installed into the storage section 1708 as required.

[0175] In particular, according to the embodiments of the present application, the above reference to the flowchart Figure 1 or Figure 3The described process can be implemented as a computer software program. For example, an embodiment of the present application includes a computer program product that includes a computer program carried on a computer-readable medium, and the computer program includes program code for performing the method shown in the flowchart. In such an embodiment, the computer program includes program code for performing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network through a communication section 1709 and / or installed from a removable medium 1711. When the computer program is executed by a central processing unit (CPU) 1701, the above-described functions defined in the system of the present application are performed.

[0176] It should be noted that the computer-readable medium shown in the present application can be a computer-readable signal medium or a computer-readable storage medium or any combination of the two. A computer-readable storage medium can be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the above. More specific examples of a computer-readable storage medium can include, but are not limited to: an electrical connection having one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present application, a computer-readable storage medium can be any tangible medium that contains or stores a program that can be used by or in conjunction with an instruction execution system, apparatus, or device. And in the present application, a computer-readable signal medium can include a data signal propagated in a baseband or as part of a carrier wave, which carries computer-readable program code. Such a propagated data signal can take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. A computer-readable signal medium can also be any computer-readable medium other than a computer-readable storage medium, which can send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device. The program code contained on the computer-readable medium can be transmitted using any appropriate medium, including but not limited to: wireless, wire, optical cable, RF, etc., or any suitable combination of the above.

[0177] The flowcharts and block diagrams in the accompanying drawings illustrate the possible architectures, functions, and operation instructions of systems, methods, and computer program products according to various embodiments of the present application. In this regard, each block in the flowchart or block diagram may represent a module, a program segment, or a part of code that contains one or more executable instructions for implementing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the blocks may occur in a different order than that marked in the accompanying drawings. For example, two connected blocks may actually be executed substantially in parallel, and they may sometimes be executed in the reverse order, depending on the functions involved. It should also be noted that each block in the block diagram and / or flowchart, as well as the combination of blocks in the block diagram and / or flowchart, can be implemented by a dedicated hardware-based system that executes the specified functions or operation instructions, or can be implemented by a combination of dedicated hardware and computer instructions.

[0178] The units or modules involved in the embodiments described in the present application can be implemented in software or in hardware. The described units or modules can also be provided in a processor. For example, it can be described as: a processor includes a first receiving module, a second receiving module, and a sending module. Among them, the names of these units or modules do not, in some cases, limit the units or modules themselves.

[0179] As another aspect, the present application also provides a computer-readable storage medium, which may be included in the electronic device described in the above embodiments, or may exist separately without being assembled into the electronic device. The above computer-readable storage medium stores one or more programs, and when the above programs are used by one or more processors to execute the information sharing method described in the present application.

[0180] The above description is only the preferred embodiments of the present application and the explanation of the applied technical principles. Those skilled in the art should understand that the scope of disclosure involved in the present application is not limited to the technical solutions formed by the specific combination of the above technical features, but should also cover other technical solutions formed by any combination of the above technical features or their equivalent features without departing from the foregoing disclosure concept. For example, the technical solutions formed by mutually replacing the above features with the (but not limited to) technical features having similar functions disclosed in the present application.

Claims

1. An information sharing method, characterized in that: Applied to the first server, comprising: According to the data volume of the target information, determine the number m of splits of the target information, the number of splits is less than the corresponding prime number P of the national secret elliptic curve finite field, and m is a positive integer; Determine a combination threshold value n of the target information according to the number of splits, where n is a positive integer less than m; According to the national secret elliptic curve finite field, determine the random coefficient of the splitting formula matching the target information, and split the target information into m target sub-information by setting the splitting formula of the random coefficient, the number of the random coefficients is the same as the number m of splits of the target information; Transmitting the m target sub-information to m information-owning terminals respectively; Wherein, any n target sub-information in the m target sub-information is combined to generate the target information, the combination threshold value n is the minimum number of target sub-information combinations to generate the target information, and each target sub-information in the m target sub-information includes: sub-information content and combination threshold value n; Wherein, determining the combined threshold value n of the target information according to the split number includes: According to the split number, the combination threshold value n of the target information is determined according to a preset rule, wherein the preset rule is a preset formula, and the preset formula is: .

2. The method according to claim 1, characterized in that Before determining the random coefficient corresponding to the splitting formula of the target information according to the national secret elliptic curve finite field, the method further includes: According to the number of splits, obtaining storage space corresponding to splitting the target information; After splitting the target information into m target sub-information by setting the splitting formula of the random coefficient, the method further includes: clearing the storage space; The storage space is used to execute the splitting of the target information, and the memory amount of the storage space corresponds to the number of splits.

3. The method according to claim 1, characterized in that Before splitting the target information into m target sub-information by setting the splitting formula of the random coefficient, the method further includes: Confirming a first coordinate value of the random coefficient in the original coordinate system; converting the first coordinate value into a second coordinate value in a target coordinate system, wherein the operation type of the target coordinate system is different from the operation type of the first coordinate system; The step of splitting the target information into m target sub-information by setting the splitting formula of the random coefficient includes: Splitting the target information into m target sub-information using a splitting formula with a random coefficient of the second coordinate value, wherein the m target sub-information is sub-information in the target coordinate system, and the coordinate values ​​of the m target sub-information are third coordinate values; After splitting the target information into m target sub-information by setting the splitting formula of the random coefficient, the method further includes: The m target sub-information are updated from the third coordinate value in the target coordinate system to the fourth coordinate value in the original coordinate system.

4. The method according to claim 3, characterized in that The original coordinates include any one of the following: a standard projective coordinate system and an affine coordinate system, and the target coordinates include any one of the following: a Jacob weighted projective coordinate system.

5. The method according to claim 3, characterized in that: The converting the first coordinate value into a second coordinate value in a target coordinate system includes: In the original coordinate system, confirming a first coordinate value of the random coefficient according to a first projection of the random coefficient; The first projection is transformed into the target coordinate system to obtain a second projection, and according to the second projection, a second coordinate value of the random coefficient in the target coordinate system is determined.

6. The method according to claim 3, characterized in that The updating of the m target sub-information from the third coordinate value in the target coordinate system to the fourth coordinate value in the original coordinate system includes: In the target coordinate system, obtaining a third projection corresponding to the third coordinate value of the m target sub-information; The third projection is transformed into the original coordinate system and a fourth projection is obtained, and fourth coordinate values ​​of the m target sub-information in the original coordinate system are confirmed according to the fourth projection.

7. An information sharing method, characterized in that: Applied to the second server, the method comprises: In the case of receiving the first target sub-information of any one of the m information owning terminals to which the m target sub-information belongs, obtaining at least n-1 target sub-information according to the combination threshold value n of the target sub-information, wherein the m target sub-information is: information obtained after splitting the target information, and the number of splits is less than the corresponding prime number P of the national secret elliptic curve finite field; According to the target combination formula and the national secret elliptic curve finite field, the at least n-1 target sub-information and the first target sub-information are combined into target information; Among them, any n target sub-information among the m target sub-information is combined to generate the target information, the combination threshold value n is the minimum number of target sub-information combinations to generate the target information, and each target sub-information among the m target sub-information includes: sub-information content and combination threshold value n.

8. The method according to claim 7, characterized in that Before combining the at least n-1 target sub-information into target information according to the target combination formula and the national secret elliptic curve finite field, the method further includes: According to the number of sub-information of the at least n-1 target sub-information, acquiring a storage space corresponding to a combination of the at least n-1 target sub-information and the first target sub-information; After combining the at least n-1 target sub-information into target information according to the target combination formula and the national secret elliptic curve finite field, the method further includes: clearing the storage space; The storage space is used to combine the at least n-1 target sub-information and the first target sub-information, and the memory capacity of the storage space corresponds to the total number of the at least n-1 target sub-information and the first target sub-information.

9. The method according to claim 7, characterized in that: Before combining the at least n-1 target sub-information and the first target sub-information into target information according to the target combination formula and the national secret elliptic curve finite field, the method further includes: Confirming fifth coordinate values ​​of the at least n-1 target sub-information and the first target sub-information in the original coordinate system; converting the fifth coordinate value into a sixth coordinate value in a target coordinate system, wherein the operation type of the target coordinate system is different from the operation type of the original coordinate system; The step of combining the at least n-1 target sub-information and the first target sub-information into target information according to the target combination formula and the national secret elliptic curve finite field includes: According to the target combination formula and the national secret elliptic curve finite field, the at least n-1 target sub-information and the first target sub-information are combined into target information in the target coordinate system, wherein the target information is the seventh coordinate value; After combining the at least n-1 target sub-information and the first target sub-information into target information according to the target combination formula and the national secret elliptic curve finite field, the method further includes: The target information is updated from the seventh coordinate value in the target coordinate system to the eighth coordinate value in the original coordinate system.

10. A first server, characterized in that: The first server comprises: A determination unit, used to determine the number m of splits of the target information according to the data volume of the target information, wherein the number of splits is less than the corresponding prime number P of the national secret elliptic curve finite field, and m is a positive integer; The determining unit is further configured to determine a combination threshold value n of the target information according to the number of splits, where n is a positive integer less than m; The execution unit is further used to determine the random coefficient of the splitting formula matching the target information according to the national secret elliptic curve finite field, and split the target information into m target sub-information by setting the splitting formula of the random coefficient, wherein the number of the random coefficients is the same as the number m of splits of the target information; A transmission unit, used for transmitting the m target sub-information to the m information-owning terminals respectively; Wherein, any n target sub-information in the m target sub-information is combined to generate the target information, the combination threshold value n is the minimum number of target sub-information combinations to generate the target information, and each target sub-information in the m target sub-information includes: sub-information content and combination threshold value n; The determination unit is further used to determine the combination threshold value n of the target information according to the number of splits and a preset rule, wherein the preset rule is a preset formula, and the preset formula is: .

11. A second server, characterized in that: The second server comprises: An acquisition unit is used to acquire at least n-1 target sub-information according to a combination threshold value n of the target sub-information when receiving the first target sub-information of any one of the m information-owning terminals to which the m target sub-information belongs, wherein the m target sub-information is information obtained after splitting the target information, and the number of splits is less than the corresponding prime number P of the national secret elliptic curve finite field; An execution unit, configured to combine the at least n-1 target sub-information and the first target sub-information into target information according to a target combination formula and the national secret elliptic curve finite field; Among them, any n target sub-information among the m target sub-information is combined to generate the target information, the combination threshold value n is the minimum number of target sub-information combinations to generate the target information, and each target sub-information among the m target sub-information includes: sub-information content and combination threshold value n.

Images