Information sharing method, first server and second server

Abstract

The invention discloses an information sharing method, a first server, a second server, equipment and a medium, and generally relates to the technical field of computers, in particular to the technical field of authentication. The method comprises the following steps: determining the splitting number m of target information according to the data volume of the target information; according to the splitting number, a combination threshold value n of the target information is determined, and n is a positive integer smaller than m; determining a random coefficient of a splitting formula matched with the target information according to the national secret elliptic curve finite field, and splitting the target information into m pieces of target sub-information by setting the splitting formula of the random coefficient; and respectively transmitting the m pieces of target sub-information to m pieces of information owning terminals. The security of the secret information can be ensured, and the contribution efficiency and the recovery efficiency of the secret are improved.

Description

Technical Field

[0001] The present disclosure generally relates to the field of communication technology, and more particularly to an information sharing method, a first server and a second server. Background Art

[0002] With the continuous development of communication technology, people have more and more types of information that can be transmitted through communication technology, and at the same time, the requirements for transmitted information are becoming more and more complex. Among them, transmitting information through communication technology 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 method, split into multiple parts, and then the multiple parts of the secret information are transmitted to multiple secret receiving parties respectively. In this way, the secret of each part is meaningless when it exists alone, and only after the preset conditions are met and spliced ​​together can the complete secret information be obtained. This method of processing and transmitting secrets protects the confidentiality and security of the secrets.

[0004] However, this method of splitting and combining secrets requires obtaining the secrets of all secret-receiving parties in order to obtain the secret. In fact, it is too dependent on each sharing party, which may lead to problems such as low efficiency in secret recovery and complex calculations. Summary of the invention

[0005] In view of the above-mentioned defects or deficiencies in the related art, it is desired to provide an information sharing method, a first server and a second server, which can solve the problem that the secrets of all secret receiving parties need to be obtained in order to obtain the secret. In fact, the dependence on each sharing party is too strong, which may lead to problems such as low secret recovery efficiency and complex calculation. While ensuring the security of secret information, the contribution efficiency and recovery efficiency of the secret are improved.

[0006] In a first aspect, an information sharing method is provided, which is applied to a first server, and the method includes: 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; 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.

[0007] In the present application, the first server first determines the number m (m is a positive integer) of splits of the target information according to the data volume of the target information, and the number of splits is less than the corresponding prime number P of the national secret elliptic curve finite field; then, according to the above number of splits, the combination threshold value n of the target information is determined, and n is a positive integer less than m; then, according to the above national secret elliptic curve finite field, the random coefficient of the splitting formula matching the target information is determined, and the target information is split into m target sub-information by setting the splitting formula of the random coefficient, and the number of random coefficients is the same as the number m of splits of the target information; the above m target sub-information is transmitted to the m information owning terminals respectively; wherein, any n target sub-information among the above m target sub-information is combined to generate the target information, the above combination threshold value n is the minimum number of target sub-information combinations to generate the target information, and each of the above m target sub-information includes: sub-information content and combination threshold value n. In this way, the number of splits of the target information is determined by the prime number P corresponding to the national secret elliptic curve finite field, and the number of target sub-information generated after the split is further determined according to the number of splits to determine the minimum number of target information generated by the target sub-information combination, that is, the combination threshold value m, which is less than the previous number of splits. Therefore, the target information can be restored without all sub-information after the target sub-information is split by the national secret elliptic curve finite field, 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 target sub-information information to be provided by the information-owning terminals to restore the target information.

[0008] In a second aspect, an information sharing method is provided, which is applied to a second server, and the method includes: 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.

[0009] In a third aspect, a first server is provided, the first server comprising: 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; 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.

[0010] In a fourth aspect, a second server is provided, the second server comprising: An acquisition unit is used to, upon receiving the first target sub-information of any one of the m information-owning terminals to which the m target sub-information belongs, acquire at least n-1 target sub-information according to a 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 a corresponding prime number P of a 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 the 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.

[0011] In a fifth aspect, a computer device is provided, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the program, the method described in the first aspect or the second aspect is implemented.

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

[0013] In a seventh aspect, a computer program product is provided. The computer program product includes instructions, and the instructions are executed by a processor to implement the method described in the first aspect or the second aspect.

[0014] Additional aspects and advantages of the present invention will be given in part in the following description and in part will be obvious from the following description, or will be learned through practice of the present invention. BRIEF DESCRIPTION OF THE DRAWINGS

[0015] Other features, objects and advantages of the present application will become more apparent by reading the detailed description of non-limiting embodiments made with reference to the following drawings: Figure 1 One of the flow charts of the information sharing method provided in the embodiment of the present application; Figure 2 The second flowchart of the information sharing method provided in the embodiment of the present application; Figure 3 The third flowchart of the information sharing method provided in the embodiment of the present application; Figure 4 A schematic diagram of the structure of a first server provided in an embodiment of the present application; Figure 5 A schematic diagram of the structure of a second server provided in an embodiment of the present application; Figure 6 A schematic diagram of the structure of a computer device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0016] The present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It is to be understood that the specific embodiments described herein are only used to explain the relevant invention, rather than to limit the invention. It is also necessary to explain that, for ease of description, only the parts related to the invention are shown in the accompanying drawings.

[0017] It should be noted that, in the absence of conflict, the embodiments and features in the embodiments of the present application may be combined with each other. The following is a description of the relevant background of the present application.

[0018] As mentioned above, the information transmission process 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), each of which is meaningless or almost meaningless when it exists independently. When predefined conditions are met (for example, the owner of a sub-secret initiates a request for combining secrets through other servers), other secrets will be collected and combined again to restore the complete secret information.

[0019] This sharing scheme belongs to the distributed information processing technology, which was originally proposed by Shamir and Blakely in 1978. It is mainly used in scenarios such as secure communication and distributed system management, and improves 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 leaks 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 number limit is met, the original secret can still be safely recovered.

[0020] At present, there are several secret information sharing schemes in related technologies: 1. Smir threshold scheme: This is the most famous type of secret information sharing technology, created by Adi Shamir. It uses polynomial interpolation and random point generation to achieve the division of secret information. Any combination of a predefined number of participants can recalculate the original secret information, and any combination less than this number cannot recover the original secret.

[0021] 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 sub-secret information mentioned above. This involves an additional mechanism or protocol to verify whether each participant's share is valid and whether the secret information can be correctly reconstructed from these shares. This helps prevent fraud and increase the transparency and security of the system.

[0022] 3. Multi-party computation: This scheme is closely related to secret information sharing, although not strictly a type of secret information sharing technology. It allows multiple participants to perform joint computations without revealing their inputs. In this case, secret information sharing can serve as the basis for a security protocol that protects the privacy of the participants and ensures that the results can only be accessed under the right combination of conditions.

[0023] 4. Ring signatures and threshold signatures: Although not secret sharing information technologies in the traditional sense, they have similarities with secret information management. Ring signatures allow a participant (that is, the owner of the sub-secret information) to sign a message without revealing who the participant is until a certain number of other participants come together to verify the signature. Similarly, the threshold signature scheme allows multiple participants to jointly generate a valid digital signature.

[0024] 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 approach, secret information is stored on the blockchain and can only be accessed when predefined conditions are met (such as reaching a certain number of transactions or validator confirmations).

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

[0026] However, in the above-mentioned existing secret information sharing scheme, all secret information owners must output the secrets before the original secret information can be combined and generated. In this way, the dependence on each sharing party is actually too strong, which may lead to problems such as low efficiency of secret recovery and complex calculation.

[0027] Based on this, the present application proposes an information sharing method, a first server and a second server, which can solve the problem that the secrets of all secret receiving parties need to be obtained in order to obtain the secret. In fact, the dependence on each sharing party is too strong, which may lead to problems such as low secret recovery efficiency and complex calculation. While ensuring the security of secret information, the contribution efficiency and recovery efficiency of the secret are improved.

[0028] Figure 1 FIG. 1 is a flow chart of an information sharing method provided by an embodiment of the present application, and the execution subject of the method may be a first server. Figure 1 As shown, the method comprises the following steps: Step 301: Determine the number m of splits of the target information according to the data volume of the target information.

[0029] In the embodiment of the present application, the above-mentioned 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.

[0030] It is understandable that the national secret elliptic curve finite field refers to the finite field (Finite Field), also known as the Galois Field, used by the China National Cryptography Administration (SM2 elliptic curve public key cryptography algorithm). Finite fields are the basic mathematical structure of elliptic curve cryptography, and the security of the SM2 algorithm relies on elliptic curve operations on finite fields.

[0031] The national secret elliptic curve finite field includes the following three elements: 1) Finite field: The SM2 algorithm is based on a finite field (Galois Field), usually represented as Fp, where p is a large prime number, which is also the "corresponding prime number P of the national secret elliptic curve finite field" mentioned above.

[0032] 2) Elliptic curve equation: The elliptic curve equation used by SM2 is as shown in the following formula 1: Formula 1 Where a and b are constants in the finite field Fp.

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

[0034] In an embodiment of the present application, the above-mentioned target information may include target secret information.

[0035] It is understandable that the target secret information may be information that can be divided into several parts or shares. For example, the target information may be key information.

[0036] Exemplarily, the number of splits of the target information may be determined according to the actual data volume of the target information.

[0037] Exemplarily, the number of splits of the target information may also be determined based on the data volume of the target information and the information-owning terminal that plans to hold the target sub-information.

[0038] Step 302: Determine the combination threshold n of the target information according to the above split number.

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

[0040] It can be understood that after the above-mentioned number of splits is determined, the combination threshold value n of the target information can be determined according to the number of splits and a preset rule.

[0041] Furthermore, after the target information is split into m target sub-information, assuming that the target information needs to be generated by combining the target sub-information later, the number of target sub-information required for the combination process should actually be less than m, that is, the target information can be restored without all the target sub-information.

[0042] Furthermore, although the target information can be restored without all the target sub-information, the minimum number of target sub-information should be limited. For example, assuming that the number of split target information is 5, the number of target information generated by combining target sub-information should be at least 3 or 4. In an example, the preset rule for determining the combined threshold value n may be a preset formula. Specifically, the preset formula is shown in the following formula 2: Formula 2 That is, in Formula 2, it is necessary to round up the ratio of m to 2. Based on Formula 2, assuming that the number of splits is m=5, then n=3.

[0043] It can be understood that after determining the number of splits, the combined threshold value can be calculated by the above formula 2. At the same time, since the requirement that the combined threshold value is less than the number of splits is set in advance, after setting the combined threshold value, the first server can also combine formula 2 and "the combined threshold value is less than the number of splits" to detect whether the combined threshold value meets the preset requirements. After satisfying the value obtained after calculating formula 2 and the above and "the combined threshold value is less than the number of splits", it can be considered that the combined threshold value meets the preset requirements for detection.

[0044] Step 303: According to the above-mentioned national secret elliptic curve finite field, determine the random coefficient of the splitting formula that matches the above-mentioned target information, and split the target information into m target sub-information by setting the splitting formula of the above-mentioned random coefficient.

[0045] In the embodiment of the present application, the number of the above-mentioned random coefficients is the same as the number m of splits of the above-mentioned target information.

[0046] It can be understood that the process of executing the target information splitting based on the above-mentioned national secret elliptic curve finite field is completed through a preset splitting formula. At the same time, in order to ensure the high confidentiality of the target information splitting process and the non-repetitiveness 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.

[0047] In the embodiment of the present application, the splitting formula is shown in the following formula 3: Formula 3 in, , That is the aforementioned finite field Fp. to This is the random coefficient in the aforementioned splitting formula.

[0048] It can be understood that the information splitting process is based on the aforementioned finite field calculation, and through Formula 3, the target information is split into m pieces of target sub-information.

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

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

[0051] In the embodiment of the present application, the above-mentioned m target sub-information is preset in advance by the terminal, and can also be customized by the user.

[0052] It is understandable that after the target information is split, the corresponding information-owning terminal may be pre-set in the first server. The first server may transmit the m target sub-information to the m information-owning terminals after splitting the m target sub-information.

[0053] In an embodiment of the present application, any n target sub-information among the above-mentioned m target sub-information are combined to generate 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.

[0054] It is understandable that after the first server splits the target information, each target sub-information is meaningless or has little substantive meaning. At this time, in the process of the first server transmitting the m target sub-information from the first server to the m information-owning terminals, there will be no information leakage problem.

[0055] Furthermore, 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 content, for the embodiment of the present application, it is not necessary to obtain all the target sub-information again, that is, to obtain m target sub-information again to complete the combination of target information, but only n target sub-information is needed to complete the combination of target information. Among them, the n target sub-information is any n of the m sub-information.

[0056] It can be understood that, after splitting, in the process of sending the m target sub-information to the m information-owning terminals, the sensitive information that may exist in the m target sub-information can be sent only to some of the m information-owning terminals, without allowing all the information-owning terminals to hold the sensitive information, thereby improving privacy without affecting the subsequent combination to restore the target information.

[0057] In this way, the robustness of the information splitting and combining process can be greatly increased. By setting the splitting process of the present application, while ensuring the security of the target information splitting and combining, it can be ensured that any combination of all information-owning terminals that meets the threshold can recreate the original secret information, thereby avoiding the situation where some of the information-owning terminals cannot provide the target sub-information or the target sub-information is lost, resulting in the target information being unable to be restored. 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 security.

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

[0059] In another embodiment of the present application, a specific implementation method is provided for applying for the space used in the splitting process in advance before actually splitting the target information. For example, before the "determining the random coefficient corresponding to the splitting formula of the above target information according to the above national secret elliptic curve finite field", the information sharing method provided by the present application includes: obtaining the storage space corresponding to the splitting of the above target information according to the above number of splits.

[0060] Exemplarily, 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.

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

[0062] In an example, the storage space may be the actual context memory required by the splitting formula or splitting algorithm in the first server. The context memory may also be understood as a process of initializing the context and applying for context memory.

[0063] Exemplarily, the storage space may be determined based on both the number of splits and the amount of data of the target information; or it may be determined based solely on the number of splits.

[0064] Optionally, after the aforementioned “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.

[0065] It is understandable that after the above splitting process is completed, it is necessary to restore the previously applied storage space to ensure the subsequent or other algorithms to ensure the effective occupation and utilization of the space in the first server.

[0066] In another embodiment of the present application, a specific implementation method is provided in which the splitting process needs to be transferred from the original coordinate system to the first coordinate system before splitting the target information to ensure the simplification of the splitting process. Exemplarily, the specific implementation of "split the target information into m target sub-information by setting the splitting formula of the random coefficient" mentioned above includes: confirming the first coordinate value of the random coefficient in the original coordinate system; converting the first coordinate value into the second coordinate value in the target coordinate system.

[0067] Optionally, in an embodiment of the present application, 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.

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

[0069] The following is an introduction to the coordinate system of the national secret elliptic curve finite field.

[0070] The coordinate systems of the finite field of the national secret elliptic curve can be roughly divided into three types: 1) standard projective coordinate system; 2) affine coordinate system; 3) Jacob weighted projective coordinate system Among these three coordinate systems, the standard projective coordinate system and the affine coordinate system are relatively simple to implement, but if they are used in the splitting process, there are more complex mathematical operations, such as modular inverse operations and division operations, which have a significant impact on the calculation performance. Although the Jacob weighted projective coordinate system is more complex to implement, it avoids the above two operations and further optimizes the addition and doubling point calculation processes, significantly improving the calculation speed.

[0071] For example, Figure 2 As shown, Figure 2 The conversion process of the elliptic curve finite field coordinate system is shown: when it is determined to use the Jacob weighted projective coordinate system to perform the splitting process of the elliptic curve finite field, that is, the splitting operation, it is necessary to convert the points of the standard projective coordinate system to the Jacob weighted projective coordinate system before the actual splitting process. After the operation is completed through the arithmetic module, the points of the Jacob weighted projective coordinate system are restored to the standard projective coordinate system.

[0072] Among them, the points of the above standard projective coordinate system can be the above splitting formula, that is, the random coefficient in formula 2 to In this way, after splitting using the random coefficients with the Jacob weighted projection coordinate system, the obtained target sub-information is also based on the points in the Jacob weighted projection coordinate system.

[0073] Optionally, the above-mentioned target information is split into m target sub-information by setting the splitting formula of the above-mentioned random coefficient, including: splitting the above-mentioned target information into m target sub-information by using a splitting formula with a random coefficient of the above-mentioned second coordinate value.

[0074] Exemplarily, 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.

[0075] Optionally, after splitting the target information into m target sub-information by setting the splitting formula of the random coefficient, the method further includes: updating 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.

[0076] It is understandable that after the splitting operation is completed, the effect of simplifying the splitting process operation has been achieved, but it is still necessary to transform the m target sub-information in the above target coordinate system into the original coordinate system again.

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

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

[0079] Figure 3 FIG. 1 is a flow chart of an information sharing method provided by an embodiment of the present application, and the execution subject of the method may be a second server. Figure 3 As shown, the method comprises the following steps: Step 401: upon receiving the first target sub-information of any one of the m information owning terminals to which the m target sub-information belong, obtaining at least n-1 target sub-information according to the combination threshold value n of the target sub-information.

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

[0081] In the embodiment of the present application, the above-mentioned information including the terminal, target sub-information, combined threshold value, national secret elliptic curve finite field and the corresponding prime numbers of the national secret elliptic curve finite field can refer to the above description and will not be repeated here.

[0082] It can be understood that, when any one of the m information-owning terminals pre-acquires 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 a request message for obtaining at least n-1 target sub-information to at least other n-1 information-owning terminals to complete the preparation work of combining the target information.

[0083] It should be noted that the second server may be a server different from the first server or the same server as the first server. In the case where the second server is the same server as the first server, the second server shall destroy the target information it has previously received before receiving the first target sub-information.

[0084] Step 402: According to the above target combination formula and the above national secret elliptic curve finite field, the above at least n-1 target sub-information and the first target sub-information are combined into target information.

[0085] In an embodiment of the present application, any n target sub-information among the above-mentioned m target sub-information is combined to generate the target information, the above-mentioned combination threshold value n is the minimum number of target sub-information combinations to generate the above-mentioned target information, and each target sub-information among the above-mentioned m target sub-information includes: sub-information content and combination threshold value n.

[0086] It is understandable that the above target combination formula may be a Lagrange interpolation formula, as shown in the following formula 4: Formula 4 Among them, the above Lagrange interpolation formula can convert n pieces of target sub-information (x i ,y i ) is restored to secret.

[0087] It can be understood that in the embodiment of the present application, since the target sub-information of each information holding terminal includes sub-information content and combination threshold value n, it actually already knows the combination threshold value n during the combination process, and sends the combination threshold value n to the second server by sending the first target sub-information, triggering the second server to send a request message to at least n-1 other information holding terminals to obtain the target sub-information.

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

[0089] Exemplarily, 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.

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

[0091] It can be understood that the process of combining the above-mentioned n target sub-information is completed through a preset algorithm and a preset combination formula (see the aforementioned formula for details). In the process of executing the combined target information, it is actually necessary to apply for storage space in advance to carry out the combination process.

[0092] In an example, the storage space may be the actual context memory required by the combination formula or combination algorithm in the second server. The context memory may also be understood as a process of initializing the context and applying for context memory.

[0093] Exemplarily, the storage space may be determined based on both the number of combinations and the amount of data of the target information; or may be determined based solely on the number of combinations.

[0094] Optionally, after the aforementioned “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 above method further includes: clearing the above storage space.

[0095] It is understandable that after the above combination process is completed, it is necessary to restore the previously applied storage space to ensure the subsequent or other algorithms are carried out and to ensure the effective occupation and utilization of the space in the second server.

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

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

[0098] Optionally, in an embodiment of the present application, 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.

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

[0100] It is understandable that, in 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, it also has more complex mathematical operations, such as modular inverse operations and division operations, which have a significant impact on the computing performance. Although the Jacob weighted projective coordinate system is more complex to implement, it avoids the above two operations and further optimizes the addition and doubling point operations, significantly improving the computing speed.

[0101] Exemplarily, the combination process is consistent with the above-mentioned splitting process because the transformation of the coordinate system is consistent with the above-mentioned splitting process. Therefore, Figure 2 As shown, Figure 2 The conversion process of the coordinate system of the elliptic curve finite field is shown: when it is determined to use the Jacob weighted projective coordinate system to perform the combination process of the elliptic curve finite field, that is, the combination operation, it is necessary to convert the points of the standard projective coordinate system to the Jacob weighted projective coordinate system before the actual combination process. After the operation is completed through the arithmetic module, the points of the Jacob weighted projective coordinate system are restored to the standard projective coordinate system.

[0102] The point of the standard projective coordinate system can be the coordinate value of the target sub-information, that is, (x i ,y i ). In this way, after combining with the random coefficients of the Jacob weighted projection coordinate system, the target information obtained is also based on the points in the Jacob weighted projection coordinate system.

[0103] Exemplarily, the aforementioned “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: combining 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.

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

[0105] It is understandable that after the combination operation of the combined target sub-information is completed, the effect of simplifying the combination process operation has been achieved, but it is still necessary to transform the target information in the above target coordinate system into the original coordinate system again.

[0106] The present application also provides a computer-readable storage medium on which a computer program is stored. When the program is executed by a processor, the training rule determination method described in the present application is implemented. For example, the following can be executed: Figure 1 or Figure 3 The individual steps of the method are shown.

[0107] The present invention provides a computer program product, which includes instructions that are executed by a processor when the processor executes the instructions. Figure 1 or Figure 3 The individual steps of the method are shown.

[0108] It should be noted that although the operations of the method of the present invention are described in a particular order in the drawings, this does not require or imply that the operations must be performed in this particular order or that all illustrated operations must be performed to achieve desired results.

[0109] Figure 4 This is a block diagram of a first server according to an embodiment of the present application. Figure 4 The first server includes a determining unit 601, an executing unit 602 and a transmitting unit 603.

[0110] A determination unit 601 is 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 601 is further configured to determine a combination threshold n of the target information according to the number of splits, where n is a positive integer less than m; The execution unit 602 is further configured to determine a random coefficient of a 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 603, configured to transmit the m target sub-information to the m information-owning terminals respectively; 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.

[0111] In one embodiment, the execution unit 602 is also used to: obtain the storage space corresponding to the splitting of the target information according to the number of splits; clean up 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.

[0112] In one embodiment, the execution unit 602 is further configured to: The first coordinate value is converted into a second coordinate value in a target coordinate system, wherein the operation type of the target coordinate system is different from that of the first coordinate system; the target information is split 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 under the target coordinate system, and the coordinate value of the m target sub-information is a third coordinate value; the m target sub-information is updated from the third coordinate value under the target coordinate system to the fourth coordinate value under the original coordinate system.

[0113] In one embodiment, 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.

[0114] In one embodiment, the execution unit 602 is specifically used to: confirm the first coordinate value of the random coefficient in the original coordinate system according to the first projection of the random coefficient; transform 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.

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

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

[0117] An acquisition unit 701 is configured to, upon receiving first target sub-information of any one of the m information-owning terminals to which the m target sub-information belongs, acquire at least n-1 target sub-information according to a combination threshold value n of the target sub-information, wherein the m target sub-information is information obtained by splitting the target information, and the number of splits is less than a corresponding prime number P of a national secret elliptic curve finite field; An execution unit 702 is used 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 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.

[0118] In one embodiment, the execution unit 702 is further configured to: 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; 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.

[0119] In one embodiment, the execution unit 702 is further configured to: 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; 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; 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.

[0120] It should be understood that the units recorded in the first server and the second server correspond to the steps in the method described in the accompanying drawings. Therefore, the operations and features described above for the method are also applicable to the first server and the second server and the units contained therein, and will not be repeated here. The first server and the second server can be pre-implemented in the browser or other security application of the computer device, or can be loaded into the browser or its security application of the computer device by downloading or the like. 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 embodiment of the present application.

[0121] For 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. On the contrary, the features and functions of one module or unit described above can be further divided into multiple modules or units to be embodied.

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

[0123] Reference below Figure 6 , Figure 6 A schematic diagram of the structure of a computer device suitable for implementing the embodiments of the present application is shown. Figure 6 As 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 part 1708 to 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, the ROM 1702, and the RAM 1703 are connected to each other through a bus 1704. An input / output (I / O) interface 1705 is also connected to the bus 1704.

[0124] 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 needed. 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 needed, so that a computer program read therefrom is installed into the storage section 1708 as needed.

[0125] In particular, according to an embodiment of the present application, the above reference flow chart 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, which includes a computer program carried on a computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In such an embodiment, the computer program includes a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network through the communication part 1709, and / or installed from a removable medium 1711. When the computer program is executed by the central processing unit (CPU) 1701, the above-mentioned functions defined in the system of the present application are executed.

[0126] It should be noted that the computer-readable medium shown in the present application may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with 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 may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, device or device. In the present application, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, which carries a computer-readable program code. This propagated data signal may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Computer-readable signal media may also be any computer-readable medium such as a computer-readable storage medium that can send, propagate or transmit a program for use by or in conjunction with an instruction execution system, device or device. The program code contained on the computer-readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, optical cable, RF, etc., or any suitable combination of the above.

[0127] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, functions and operating instructions of the system, method and computer program product according to various embodiments of the present application. In this regard, each box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the aforementioned module, program segment or a part of a code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some implementations as replacements, the functions marked in the box can also occur in a sequence different from that marked in the accompanying drawings. For example, the boxes represented by two connections can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram and / or flow chart, and the combination of the boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operating instruction, or can be implemented with a combination of dedicated hardware and computer instructions.

[0128] The units or modules involved in the embodiments described in the present application may be implemented by software or hardware. The units or modules described may also be set in a processor. For example, it may be described as: a processor includes a first receiving module, a second receiving module, and a sending module. The names of these units or modules do not, in some cases, constitute limitations on the units or modules themselves.

[0129] As another aspect, the present application further provides a computer-readable storage medium, which may be included in the electronic device described in the above embodiment, or may exist independently without being assembled into the electronic device. 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.

[0130] The above description is only a preferred embodiment of the present application and an explanation of the technical principles used. Those skilled in the art should understand that the scope of disclosure involved in the present application is not limited to the technical solution formed by a 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 aforementioned disclosed concept. For example, the above features are replaced with the technical features with similar functions disclosed in the present application (but not limited to) by each other to form a technical solution.

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; 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.

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; 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.

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