Information transmission method, system, device and medium based on multi-party secure computing

Abstract

The present invention discloses an information transmission method, system, device and medium based on multi-party secure computing, which relates to the field of multi-party secure information transmission and includes the following steps: dividing the submitted data submitted by each participant into a parameter number of allocation shares through additive secret sharing processing; dividing the allocation data into a number of allocation single shares, and transmitting the allocation single shares to the corresponding participants through random transmission; reorganizing the allocation single shares to obtain receiving shares; the participants summarize the receiving shares they receive, and then transmit them to the aggregating party for final calculation; the present invention is used to solve the problems of existing multi-party secure information transmission technology that the security of the entire calculation process cannot be guaranteed and the encryption process is too complicated, resulting in the easy leakage of the participants' data and the encryption making the calculation efficiency slow.

Description

Technical Field

[0001] The present invention relates to the technical field of multi-party secure information transmission, and specifically to an information transmission method, system, device and medium based on multi-party secure computing. Background Art

[0002] Multi-party secure information transmission technology refers to an encryption protocol and communication method that aims to achieve secure information transmission between multiple parties while protecting the privacy and data confidentiality of the participants. This technology is based on cryptography and security protocols and allows multiple parties to communicate and calculate without revealing private data to each other.

[0003] Existing multi-party secure information transmission technology is usually implemented through multi-party secure computing technology, but multi-party secure computing technology cannot guarantee the security of the entire process. Therefore, the transmitted data is encrypted, and the existing multi-party secure information transmission technology uses overly complex encryption algorithms during encryption, which slows down the efficiency of multi-party secure computing. Multi-party secure computing itself has a certain degree of security and only needs to ensure the security of data distribution between participants. For example, in the patent application publication number: CN117097468A, a data transmission method, device, equipment and medium based on multi-party secure computing are disclosed. This scheme only transmits information based on the most basic multi-party secure computing technology and cannot guarantee the security of the entire calculation process. If someone intercepts all the additive secret fragments, the private data of the participants will be leaked. The existing multi-party secure information transmission technology also has the problem of being unable to guarantee the security of the entire calculation process and the encryption process is too complicated, which makes the data of the participants easy to leak and encryption slows down the calculation efficiency. Summary of the Invention

[0004] The present invention aims to solve one of the technical problems in the prior art to at least a certain extent, by obtaining the number of participants and marking it as the number of participants, dividing the submitted data submitted by each participant into a parameter number of allocation shares through additive secret sharing processing, and then dividing the allocation data into a number of allocation single shares, and transmitting the allocation single shares to the corresponding participants through random transmission. After the participants receive the allocation single shares, they reorganize the allocation single shares to obtain the received shares. Finally, the participants summarize the received shares they receive and transmit them to the aggregator for final calculation, so as to solve the problems that the existing multi-party secure information transmission technology still cannot guarantee the security of the entire calculation process and the encryption process is too complicated, which makes the participants' data easy to leak and encryption makes the calculation efficiency slow.

[0005] To achieve the above objectives, in a first aspect, the present application provides an information transmission method based on multi-party secure computing, comprising the following steps:

[0006] Obtain the number of participants, marked as the number of participants, and divide the submitted data submitted by each participant into parameter number allocation shares through additive secret sharing;

[0007] Divide the allocation data into a number of allocation order shares, and transmit the allocation order shares to the corresponding participants through random transmission;

[0008] After receiving the allocation order shares, the participants reorganize the allocation order shares to obtain the received shares;

[0009] The participants aggregate the received shares they receive and transmit them to the aggregator for final calculation.

[0010] Furthermore, obtaining the number of participants, marked as the number of participants, and dividing the submitted data submitted by each participant into parameter number allocation shares through additive secret sharing includes the following sub-steps:

[0011] Get the number of participants, mark it as the number of participants, number the participants, and use the symbol P n Indicates, where n is a positive integer and n is the sequence number of P, 1≤n≤m, and m is the number of parameters;

[0012] Obtain the number of digits in the submitted data and randomly generate (m-1) allocation shares, where the number of digits in the allocation shares is equal to the number of digits and the number of decimal places retained is the same as the submitted data;

[0013] The allocated shares are numbered by the symbol S n Indicates that n is the serial number of S, and only S1 to S exist. m-1 ;

[0014] By formula Calculate S m , where T is the submitted data, S m With S1 to S m-1 Together they constitute the distribution shares.

[0015] Furthermore, dividing the allocation data into a number of allocation order shares and transmitting the allocation order shares to corresponding participants through random transmission includes the following sub-steps:

[0016] S n Assign to P n , in the S n Transfer to P n Before, first S n Divided into a number of allotment units;

[0017] By random transmission, S n Transfer to P n .

[0018] Furthermore, S n Assign to P n , in the S n Transfer to P n Before, first S n The division into a number of allocation orders includes the following sub-steps:

[0019] S n The corresponding allocation share is marked as the share to be divided. Each digit in the share to be divided is numbered and represented as NUM in order from left to right. i , where i is a positive integer and i is the sequence number of NUM;

[0020] Starting from i=1, NUM i Convert the binary number to the number of digits, marked as E i , E i The number 0 in the string is randomly replaced by 0 or 1, and the number 1 is randomly replaced by 2 or 3. The resulting string is named the shallow encrypted string;

[0021] Increase the random i-bit digit in the shallow encrypted string by 4, and assign a single share to the resulting string mark bit;

[0022] Increase i by 1 and continue analyzing the allocation order shares until all NUM i Stop after the analysis is completed and get the number of allocated shares.

[0023] Furthermore, S n Transfer to P n The following sub-steps are included:

[0024] Get S n Corresponding allocation order share;

[0025] To P n During transmission, one allocation unit share is randomly selected for transmission each time, and the number of digital digits is transmitted continuously.

[0026] Furthermore, after receiving the allocation order shares, the participants reorganize the allocation order shares to obtain the received shares, including the following sub-steps:

[0027] P n After receiving the allocated order share, mark it as the received order share;

[0028] For any receiving order share, mark each digit in the receiving order share as the receiving judgment number, and use the symbol H j Indicates, where j is a positive integer and j is the serial number of H;

[0029] H jCompare with the first threshold and the second threshold, if H j is less than the first threshold, then the first processing signal is output; if H j If H is greater than or equal to the first threshold and less than the second threshold, the second processing signal is output; j is greater than or equal to the second threshold, outputting a third processed signal;

[0030] If the first processed signal is output, H j If the second processing signal is output, H j Change to 1; if the third processing signal is output, then H j Decrease by 4 and compare again with the first and second thresholds;

[0031] For all H j Perform analysis and count the number of times the third processing signal is output, marking it as the number of bit judgments;

[0032] Convert the modified receiving order share into a decimal number and mark it as the share to be grouped;

[0033] Perform the same processing on all receiving single shares to obtain a number of shares to be grouped, and arrange and combine the shares to be grouped in order from small to large according to the number of digits to obtain the receiving shares.

[0034] Furthermore, the participants aggregate their received shares and transmit them to the aggregator for final calculation, which includes the following sub-steps:

[0035] The participating party will receive the number of received shares, calculate the total number of received shares, and mark it as a single-party share;

[0036] The participants send their individual shares to the aggregator, who then aggregates and calculates all individual shares based on the calculation method preset by the participants to obtain the calculation result.

[0037] Feedback the calculation results to the participants.

[0038] In a second aspect, the present application provides an information transmission system based on multi-party secure computing, including a submission partitioning module, a data distribution module, a receiving and reassembling module, and a data aggregation module; the submission partitioning module, the data distribution module, and the data aggregation module are respectively data-connected to the receiving and reassembling module;

[0039] The submission partitioning module is used to obtain the number of participants, marked as the number of participants, and divide the submission data submitted by each participant into the number of parameters and allocation shares through additive secret sharing;

[0040] The data distribution module is used to divide the distribution data into a number of distribution order shares, and transmit the distribution order shares to the corresponding participants through random transmission;

[0041] The receiving and reorganizing module is used for the participants to reorganize the allocation order shares after receiving the allocation order shares to obtain the received shares;

[0042] The data aggregation module is used by the participants to aggregate the received shares they have received and then transmit them to the aggregation party for final calculation.

[0043] In a third aspect, the present application provides an electronic device comprising a processor and a memory, wherein the memory stores computer-readable instructions. When the computer-readable instructions are executed by the processor, the steps in the above method are performed.

[0044] In a fourth aspect, the present application provides a storage medium having a computer program stored thereon, and when the computer program is executed by a processor, the steps in the above method are executed.

[0045] Beneficial effects of the present invention: The present invention obtains the number of participants, divides the submitted data submitted by each participant into parameter-number allocation shares through additive secret sharing, and then divides the allocation data into a number of allocation single shares. The advantage is that in multi-party secure computing, numbers usually belong to the private information of the participants. The submitted data of the participants are first distributed based on the additive secret sharing method of multi-party secure computing. After the distribution is completed, it needs to be transmitted. During the transmission, the allocation shares are divided again and a certain simple encryption is performed. This can not only ensure the security of the private data of the participants during the transmission process, but also minimize the impact of the encryption and decryption process on the efficiency of the multi-party secure computing, thereby improving the security of the multi-party secure information transmission and the efficiency of the multi-party secure computing.

[0046] The present invention transmits the allocation order shares to the corresponding participants through random transmission. After receiving the allocation order shares, the participants reorganize the allocation order shares to obtain the received shares. Finally, the participants summarize the received shares they have received and transmit them to the aggregating party for final calculation. The advantage is that since only the allocation shares are simply encrypted to obtain the allocation order shares, it is necessary to improve the security of the data again during the transmission process. The random transmission method can prevent others from cracking the allocation order shares, further improving the security of multi-party security information transmission and the efficiency of multi-party security calculation. BRIEF DESCRIPTION OF THE DRAWINGS

[0047] Figure 1 It is a principle block diagram of the system of the present invention;

[0048] Figure 2A flow chart of the steps for receiving share reorganization of the present invention;

[0049] Figure 3 A schematic diagram of the relationship between the participants and the aggregator of the present invention;

[0050] Figure 4 is a flow chart of the steps of the method of the present invention;

[0051] Figure 5 A schematic diagram of the structure of the electronic device of the present invention DETAILED DESCRIPTION

[0052] The following will clearly and completely describe the technical solutions in the embodiments of the present invention in conjunction with the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative efforts are within the scope of protection of the present invention.

[0053] Example 1, please refer to Figure 1 As shown, the present application provides an information transmission system based on multi-party secure computing, including a submission division module, a data distribution module, a receiving and reorganizing module, and a data aggregation module; the submission division module, the data distribution module, and the data aggregation module are respectively connected to the receiving and reorganizing module;

[0054] The submission partitioning module is used to obtain the number of participants, marked as the number of participants, and divide the submission data submitted by each participant into parameter number allocation shares through additive secret sharing;

[0055] The submission partitioning module is configured with a submission partitioning strategy, which includes:

[0056] Get the number of participants, mark it as the number of participants, number the participants, and use the symbol P n Indicates, where n is a positive integer and n is the sequence number of P, 1≤n≤m, and m is the number of parameters;

[0057] In actual applications, the number of participants obtained is 3, that is, m=3. By numbering, P1 to P3 are obtained, where 1≤n≤3, representing participant A, participant B, and participant C, respectively. This embodiment uses the analysis process of participant A participating in a multi-party secure computation as an example for explanation. The analysis process for participants B and C is the same as that for participant A. For participant A, the submitted data obtained are "male percentage: 72.5%" and "female percentage: 27.5%", a total of two submitted data. In multi-party secure computation, the text portion is an interpretation of the data and is generally not private information. Therefore, there is no need to be responsible for its security. Only the numeric portion, i.e., the submitted data "72.5" and "27.5", is extracted.

[0058] Obtain the number of digits in the submitted data and randomly generate (m-1) allocation shares. The number of digits in the allocation shares is equal to the number of digits, and the number of decimal places retained is the same as the submitted data.

[0059] The allocated shares are numbered by the symbol S n Indicates that n is the serial number of S, and only S1 to S exist. m-1 ;

[0060] By formula Calculate S m , where T is the submitted data, S m With S1 to S m-1 jointly constitute the distribution share;

[0061] In actual applications, only one submitted data is analyzed at a time. For "72.5", the number of digits must include the digits after the decimal point, that is, the number of digits is 3. When the allocation order shares are subsequently reorganized, they can be divided according to the number of decimal places of the submitted data; m-1=2 allocation shares are randomly generated, namely 26.8 and 35.7; S1 is numbered as 26.8 and S2 is 35.7, and S3 is calculated as S3=72.5-(26.8+35.7)=10.0, that is, the allocation shares are 26.8, 35.7, and 10.0.

[0062] The data distribution module is used to divide the distribution data into a number of distribution order shares and transmit the distribution order shares to the corresponding participants through random transmission; the data distribution module includes a transmission division unit and a transmission unit;

[0063] The transmission partitioning unit is used to divide S n Assign to P n , in the S n Transfer to P n Before, first S n Divided into a number of allotment units;

[0064] The transmission partitioning unit is configured with a transmission partitioning strategy, which includes:

[0065] S n The corresponding allocation share is marked as the share to be divided. Each digit in the share to be divided is numbered and represented as NUM in order from left to right. i , where i is a positive integer and i is the sequence number of NUM;

[0066] Starting from i=1, NUM i Convert the binary number to the number of digits, marked as E i , E i The number 0 in the string is randomly replaced by 0 or 1, and the number 1 is randomly replaced by 2 or 3. The resulting string is named the shallow encrypted string;

[0067] In actual application, take S1 as an example, S1=26.8, the numbering is NUM1 is 2, NUM2 is 6, NUM3 is 8, starting from i=1, NUM i Convert the number of digits into a binary number, that is, convert the number 2 into a 3-digit binary number. However, the maximum value of a single decimal number represented by binary is 1001, which is 4 digits. Therefore, convert the number 2 into a 4-digit binary number. The number of digits will be used only when the number of digits is greater than or equal to 4. If it is less than 4, convert it into a 4-digit binary number. The conversion results are E1 = 0010, E2 = 0110, E3 = 1000. Then, convert E i The numbers in are randomly replaced, and the shallow encrypted string is E1=1030, E2=1230, E3=3011;

[0068] Increase the random i-bit digit in the shallow encrypted string by 4, and assign a single share to the resulting string mark bit;

[0069] Increase i by 1 and continue analyzing the allocation order shares until all NUM i After the analysis is completed, stop and get the number of allocated shares;

[0070] In actual applications, the random i-digit number in the shallow encrypted string is increased by 4 in order to be able to identify the position of the digit in the submitted data during subsequent reorganization, so as to reorganize it and further improve the encryption effect. The distribution order shares obtained by random addition are 1430, 1274 and 3455 respectively;

[0071] The transmission unit is used to transmit S n Transfer to P n ;

[0072] The transmission unit is configured with a transmission policy, which includes:

[0073] Get S n Corresponding allocation order share;

[0074] To P n During transmission, a share of the allocation list is randomly selected for transmission each time, and the number of digits transmitted is repeated continuously;

[0075] In actual applications, the allocation order shares corresponding to S1 are 1430, 1270 and 3051 respectively, and are transmitted to P1 three times. Each transmission randomly draws one allocation order share, and the transmitted allocation order shares no longer participate in the drawing, that is, 1430, 1274 and 3455 are transmitted in a random order. However, the submitted data listed in this embodiment comes from participant A, that is, from P1, so there is no need to transmit S1 to P1, because S1 is already in its local record. P1 only receives S1 from P2 and P3.

[0076] The receiving and reorganizing module is used for participants to reorganize the allocation order shares after receiving them to obtain the received shares;

[0077] The receiving and reassembling module is configured with a receiving and reassembling strategy, which includes:

[0078] P n After receiving the allocated order share, mark it as the received order share;

[0079] For any receiving order share, mark each digit in the receiving order share as the receiving judgment number, and use the symbol H j Indicates, where j is a positive integer and j is the serial number of H;

[0080] See also Figure 2 As shown, H j Compare with the first threshold and the second threshold, if H j is less than the first threshold, then the first processing signal is output; if H j If H is greater than or equal to the first threshold and less than the second threshold, the second processing signal is output; j is greater than or equal to the second threshold, outputting a third processed signal;

[0081] If the first processed signal is output, H j If the second processing signal is output, H j Change to 1; if the third processing signal is output, then H j Decrease by 4 and compare again with the first and second thresholds;

[0082] For all H j Perform analysis and count the number of times the third processing signal is output, marking it as the number of bit judgments;

[0083] In actual applications, in this embodiment, it is not necessary to transmit S1 to P1. However, to provide a specific example for illustrating the reassembly strategy, in this embodiment, it is assumed that P1 receives S1. The received single shares are 1274, 3455, and 1430. For "1274", H1 to H4 are numbered as 1, 2, 7, and 4, respectively. The first threshold is set to 2, and the second threshold is set to 4. The first and second thresholds are used to find 0 and 1 in the binary digits of the received single share. By comparison, if "1" is less than the first threshold, a first processing signal is output. If "2" is equal to the first threshold, a second processing signal is output. If "7" and "4" are greater than or equal to the second threshold, a third processing signal is output. That is, 1 is changed to 0, 2 is changed to 1, 7-4=3, 4-4=0. 3 and 0 are compared with the first and second thresholds again. If 3 is greater than the first threshold and less than the second threshold, the second processing signal is output. If 0 is less than the first threshold, the first processing signal is output. 3 is changed to 1, and 0 is changed to 0. H1 to H4 are 0, 1, 1, and 0, respectively. The number of bits judged is 2.

[0084] Convert the modified receiving order share into a decimal number and mark it as the share to be grouped;

[0085] Perform the same process on all receiving single shares to obtain a number of waiting-for-group shares, and arrange and combine the waiting-for-group shares in ascending order of the number of digits to obtain the receiving shares;

[0086] In actual application, the modified receiving share is 0110, which is converted to a decimal number of 6, and the digit judgment number is 2, that is, the number "6" is in the second place; by the same analysis, "1430" is reorganized into 2, which is in the first place, and "3455" is reorganized into 8, which is in the third place, so the receiving share is 268, but there is a decimal place in the submitted data, so 268 should also be modified to 1 as a decimal, and the actual receiving share is 26.8.

[0087] The data aggregation module is used by participants to aggregate the received shares and then transmit them to the aggregation party for final calculation;

[0088] The data aggregation module is configured with data aggregation strategies, which include:

[0089] See also Figure 3 As shown, the participant will receive the number of receiving shares, calculate the total number of receiving shares, and mark it as a single-party share;

[0090] The participants send their individual shares to the aggregator, who then aggregates and calculates all individual shares based on the calculation method preset by the participants to obtain the calculation result.

[0091] Feedback the calculation results to the participants;

[0092] In actual applications, there are MPC nodes between the participants and the aggregator to achieve multi-party secure computing; the relationship between the participants and the aggregator is as follows: Figure 3 As shown, the receiving shares of participant A are 26.8, 22.4 and 38.5 respectively. The unilateral share of the participant is calculated to be 87.7. At this time, 87.7 is transmitted to the aggregator for aggregation. By combining the unilateral shares of participant B and participant C, the average value of the three participants in this data can be obtained. At this time, no one can know or crack the actual submitted data of each participant; the preset calculation method is usually average calculation; through the aggregation of the aggregator, the calculation results of participant A, participant B and participant C are: male proportion: 68.2%, female proportion: 31.8%, and the calculation results are fed back to participant A, participant B and participant C.

[0093] Example 2, please refer to Figure 4 As shown, the present application provides an information transmission method based on multi-party secure computing, comprising the following steps:

[0094] Step S1, obtaining the number of participants, marked as the number of participants, and dividing the submitted data submitted by each participant into parameter number allocation shares through additive secret sharing. Step S1 includes the following sub-steps:

[0095] Step S101, obtain the number of participants, mark it as the number of participants, number the participants, and use the symbol P n Indicates, where n is a positive integer and n is the sequence number of P, 1≤n≤m, and m is the number of parameters;

[0096] Step S102: Obtain the number of digits in the submitted data and randomly generate (m-1) allocation shares. The number of digits in the allocation shares is equal to the number of digits, and the number of decimal places retained is the same as that of the submitted data.

[0097] Step S103: number the allocated shares, using the symbol S n Indicates that n is the serial number of S, and only S1 to S exist. m-1 ;

[0098] Step S104, by formula Calculate S m , where T is the submitted data, S m With S1 to S m-1 jointly constitute the distribution share;

[0099] Step S2: Divide the allocation data into a number of allocation order shares, and transmit the allocation order shares to the corresponding participants through random transmission. Step S2 includes the following sub-steps:

[0100] Step S201: n Assign to P n , in the S n Transfer to P n Before, first S n Divided into a number of allotment units;

[0101] Step S201 includes the following sub-steps:

[0102] Step S2011, S n The corresponding allocation share is marked as the share to be divided. Each digit in the share to be divided is numbered and represented as NUM in order from left to right. i , where i is a positive integer and i is the sequence number of NUM;

[0103] Step S2012, starting from i=1, NUM i Convert the binary number to the number of digits, marked as E i , E i The number 0 in the string is randomly replaced by 0 or 1, and the number 1 is randomly replaced by 2 or 3. The resulting string is named the shallow encrypted string;

[0104] Step S2013, increasing the random i-digit number in the shallow encrypted string by 4, and assigning a single share to the final string mark bit;

[0105] Step S2014, add one to i and continue analyzing the allocation order share until all NUM i After the analysis is completed, stop and get the number of allocated shares;

[0106] Step S202: S is transmitted randomly. n Transfer to P n ;

[0107] Step S202 includes the following sub-steps:

[0108] Step S2021, obtain S n Corresponding allocation order share;

[0109] Step S2022, send to P n During transmission, a share of the allocation list is randomly selected for transmission each time, and the number of digits transmitted is repeated continuously;

[0110] Step S3: After receiving the allocation order shares, the participants reorganize the allocation order shares to obtain the received shares. Step S3 includes the following sub-steps:

[0111] Step S301, P n After receiving the allocated order share, mark it as the received order share;

[0112] Step S302: for any receiving order share, mark each digit in the receiving order share as a receiving judgment number, and use the symbol H j Indicates, where j is a positive integer and j is the serial number of H;

[0113] Step S303: H j Compare with the first threshold and the second threshold, if H j is less than the first threshold, then the first processing signal is output; if H j If H is greater than or equal to the first threshold and less than the second threshold, the second processing signal is output; j is greater than or equal to the second threshold, outputting a third processed signal;

[0114] Step S304: If the first processed signal is output, then H j If the second processing signal is output, H j Change to 1; if the third processing signal is output, then H j Decrease by 4 and compare again with the first and second thresholds;

[0115] Step S305: for all H j Perform analysis and count the number of times the third processing signal is output, marking it as the number of bit judgments;

[0116] Step S306, converting the modified receiving order share into a decimal number and marking it as a share to be grouped;

[0117] Step S307: Perform the same process on all received single shares to obtain a number of shares to be grouped. The shares to be grouped are arranged and combined in ascending order of the number of digits to obtain received shares.

[0118] In step S4, the participants aggregate their received shares and transmit them to the aggregator for final calculation. Step S4 includes the following sub-steps:

[0119] In step S401, the participant will receive the number of received shares, calculate the total of received shares, and mark it as a single-party share;

[0120] In step S402, the participants send their individual shares to the aggregator, which aggregates and calculates all individual shares based on the calculation method preset by the participants to obtain a calculation result.

[0121] Step S403: Feedback the calculation results to the participants.

[0122] Example 3, please refer to Figure 5 As shown, Figure 5A schematic diagram of the structure of an electronic device is provided. The electronic device may include: a processor, a communication interface, a memory, and a communication bus, wherein the processor, the communication interface, and the memory communicate with each other via the communication bus. The memory stores computer-readable instructions, and the processor can call the instructions in the memory. When the computer-readable instructions are executed by the processor, the steps of the information transmission method based on multi-party secure computation are executed to achieve the following functions: dividing the submitted data submitted by each participant into a parameter number of allocation shares through additive secret sharing; dividing the allocation data into a number of allocation single shares, and transmitting the allocation single shares to the corresponding participants through random transmission; reorganizing the allocation single shares to obtain received shares; and the participants aggregating the received shares they receive and transmitting them to the aggregator for final calculation.

[0123] In addition, the logical instructions in the above-mentioned memory can be implemented in the form of a software functional unit and can be stored in a computer-readable storage medium when sold or used as an independent product. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art, or the part of the technical solution, can be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

[0124] Example 4. The present application also provides a computer-readable storage medium. The present application provides a storage medium on which a computer program is stored. When the computer program is executed by a processor, the steps in the information transmission method based on multi-party secure computing are executed to achieve the following functions: the submitted data submitted by each participant is divided into a parameter number of allocation shares through additive secret sharing processing; the allocation data is divided into a number of allocation single shares, and the allocation single shares are transmitted to the corresponding participants through random transmission; the allocation single shares are reorganized to obtain receiving shares; the participants summarize the receiving shares they receive, and then transmit them to the aggregating party for final calculation.

[0125] Through the description of the above embodiments, the embodiments of the present invention can be provided as methods, systems or computer program products. Based on this understanding, the above technical solutions, in essence or in other words, the part that contributes to the prior art, can be embodied in the form of a software product, which can be stored in a computer-readable storage medium, such as ROM / RAM, a magnetic disk, an optical disk, etc., and includes a number of instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment or certain parts of the embodiment.

[0126] In the embodiments provided in this application, it should be understood that the disclosed system or method can be implemented in other ways. The embodiments described above are merely illustrative. For example, the division of modules or units is only a logical function division. There may be other division methods in actual implementation. For example, multiple modules or units can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some communication interfaces, and the indirect coupling or communication connection of systems, modules and units can be electrical, mechanical or other forms.

[0127] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present application, rather than to limit them. Although the present application has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present application.

Claims

1. An information transmission method based on multi-party secure computing, characterized in that: The steps include: Obtain the number of participants, marked as the number of participants, and divide the submitted data submitted by each participant into parameter number allocation shares through additive secret sharing; Divide the allocation data into a number of allocation order shares, and transmit the allocation order shares to the corresponding participants through random transmission; After receiving the allocation order shares, the participants reorganize the allocation order shares to obtain the received shares; Participants aggregate their received shares and transmit them to the aggregator for final calculation; Obtain the number of participants, marked as the number of participants, and divide the submitted data submitted by each participant into the parameter number allocation shares through additive secret sharing, including the following sub-steps: Get the number of participants, mark it as the number of participants, number the participants, and use the symbol P n Indicates, where n is a positive integer and n is the sequence number of P, 1≤n≤m, and m is the number of parameters; Obtain the number of digits in the submitted data and randomly generate (m-1) allocation shares, where the number of digits in the allocation shares is equal to the number of digits and the number of decimal places retained is the same as the submitted data; The allocated shares are numbered by the symbol S n Indicates that n is the serial number of S, and only S1 to S exist. m-1 ; By formula Calculate S m , where T is the submitted data, S m With S1 to S m-1 jointly constitute the distribution share; Dividing the allocation data into a number of allocation order shares and transmitting the allocation order shares to the corresponding participants through random transmission includes the following sub-steps: S n Assign to P n , in the S n Transfer to P n Before, first S n Divided into a number of allotment units; By random transmission, S n Transfer to P n ; After receiving the allocation order shares, the participants reorganize the allocation order shares to obtain the received shares, which includes the following sub-steps: P n After receiving the allocated order share, mark it as the received order share; For any receiving order share, mark each digit in the receiving order share as the receiving judgment number, and use the symbol H j Indicates, where j is a positive integer and j is the serial number of H; H j Compare with the first threshold and the second threshold, if H j is less than the first threshold, then the first processing signal is output; if H j If H is greater than or equal to the first threshold and less than the second threshold, the second processing signal is output; j is greater than or equal to the second threshold, outputting a third processed signal; If the first processed signal is output, H j If the second processing signal is output, H j Change to 1; if the third processing signal is output, then H j Decrease by 4 and compare again with the first and second thresholds; For all H j Perform analysis and count the number of times the third processing signal is output, marking it as the number of bit judgments; Convert the modified receiving order share into a decimal number and mark it as the share to be grouped; Perform the same processing on all receiving single shares to obtain a number of shares to be grouped, and arrange and combine the shares to be grouped in order from small to large according to the number of digits to obtain the receiving shares.

2. The information transmission method based on multi-party secure computing according to claim 1, characterized in that: S n Assign to P n , in the S n Transfer to P n Before, first S n The division into a number of allocation orders includes the following sub-steps: S n The corresponding allocation share is marked as the share to be divided. Each digit in the share to be divided is numbered and represented as NUM in order from left to right. i , where i is a positive integer and i is the sequence number of NUM; Starting from i=1, NUM i Convert the binary number to the number of digits, marked as E i , E i The number 0 in the string is randomly replaced by 0 or 1, and the number 1 is randomly replaced by 2 or 3. The resulting string is named the shallow encrypted string; Increase the random i-bit digit in the shallow encrypted string by 4, and assign a single share to the resulting string mark bit; Increase i by 1 and continue analyzing the allocation order shares until all NUM i Stop after the analysis is completed and get the number of allocated shares.

3. The information transmission method based on multi-party secure computing according to claim 2, characterized in that: By random transmission, S n Transfer to P n The following sub-steps are included: Get S n Corresponding allocation order share; To P n During transmission, one allocation unit share is randomly selected for transmission each time, and the number of digital digits is transmitted continuously.

4. The information transmission method based on multi-party secure computing according to claim 3, characterized in that: Participants aggregate their received shares and transmit them to the aggregator for final calculation, which includes the following sub-steps: The participating party will receive the number of received shares, calculate the total number of received shares, and mark it as a single-party share; The participants send their individual shares to the aggregator, who then aggregates and calculates all individual shares based on the calculation method preset by the participants to obtain the calculation result. Feedback the calculation results to the participants.

5. An information transmission system based on multi-party secure computing, used to implement the information transmission method based on multi-party secure computing according to any one of claims 1 to 4, characterized in that: It includes a submission division module, a data allocation module, a receiving and reorganizing module and a data summary module; the submission division module, the data allocation module and the data summary module are respectively connected to the receiving and reorganizing module; The submission partitioning module is used to obtain the number of participants, marked as the number of participants, and divide the submission data submitted by each participant into the number of parameters and allocation shares through additive secret sharing; The data distribution module is used to divide the distribution data into a number of distribution order shares, and transmit the distribution order shares to the corresponding participants through random transmission; The receiving and reorganizing module is used for the participants to reorganize the allocation order shares after receiving the allocation order shares to obtain the received shares; The data aggregation module is used by the participants to aggregate the received shares they have received and then transmit them to the aggregation party for final calculation.

6. An electronic device, characterized in that: The method comprises a processor and a memory, wherein the memory stores computer-readable instructions, and when the computer-readable instructions are executed by the processor, the steps in the method according to any one of claims 1 to 4 are executed.

7. A storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 4 are executed.

Images