Secure multi-party computing method and system for secret sharing

By using encryption matrix to calculate the multiplication results in secure multi-party calculations, the problems of large amount and low efficiency of multiplication and decomposition operations in the prior art are solved, fast and secure secret sharing calculations are realized, and communication overhead is reduced.

CN118984223APending Publication Date: 2024-11-19BEIJING MICROCHIP SENSING TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411252834.1
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-09-09
Publication Date
2024-11-19

AI Technical Summary

Technical Problem

The existing multiplication and decomposition methods are problematic in secure multi-party calculations with large amounts of computation and low execution efficiency, which cannot effectively guarantee data privacy and reduce communication overhead.

Method used

A secure multi-party calculation method is adopted to multiply the secret sharing block through the first and second communication parties, and the encrypted matrix and multiplication values ​​are sent to the trusted execution environment TEE for decryption, and the multiplication result is calculated using the encrypted matrix. Reduces communication overhead and improves security.

Benefits of technology

It realizes secret shared computing with fast computing speed, less time and high security, reducing communication overhead and improving computing efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118984223A_ABST
    Figure CN118984223A_ABST
Patent Text Reader

Abstract

The invention discloses a secure multi-party computing method and system for secret sharing, and the method comprises the steps: a first communication party carries out the secret sharing of a secret x, obtains secret sharing blocks [x] A and [x] B, and transmits the secret sharing block [x] B to a second communication party; the second communication party performs secret sharing on the secret y to obtain secret sharing blocks [y] A and [y] B, and sends the secret sharing block [y] A to the first communication party; the first communication party multiplies the secret sharing blocks [x] A and [y] A to obtain a first encryption matrix, and sends the encrypted first encryption matrix and a multiplication value to the TEE; the second communication party multiplies the secret sharing blocks [y] B and [x] B to obtain a second encryption matrix, and transmits the transpose and multiplication value of the encrypted second encryption matrix to the TEE; and the TEE performs decryption to obtain decrypted data. The method is high in operation speed and less in time consumption, and compared with multiple interactive operations, the TEE is safer, and the communication overhead is reduced.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of network communication technology, and more particularly to a secure multi-party computing method and system for secret sharing. Background Art

[0002] The popularity of the Internet and the development of mobile Internet have led to the continuous generation of data in production, operation and daily life. Massive data has become an asset of enterprises. At the same time, since these data often contain sensitive information of users, protecting these data has also become the responsibility of enterprises. Some data mining projects need to be based on data from different enterprises. When enterprises participate in such data mining projects, they must ensure that their original data will not be leaked.

[0003] Secure multi-party computing (MPC) provides a solution to this data island phenomenon, allowing multiple data owners to perform collaborative computing without mutual trust, output computing results, and ensure that no party can obtain any information other than the computing results they deserve. MPC enables multiple data owners to obtain the use value of all data while protecting the privacy of their original data content. Therefore, secure multi-party computing plays an important role in scenarios such as electronic elections, electronic voting, secret sharing, and threshold signatures.

[0004] Among them, secret sharing is a way to manage secret information. Secret sharing consists of two parts: secret splitting and secret reconstruction. In the process of secret splitting, the secret is split and managed by different participants. In the process of secret reconstruction, a single participant cannot recover the secret information, and multiple participants need to collaborate to recover it. In a two-party secure computing protocol, the communicating entities Alice and Bob can decompose the shared secret in different ways. The two common methods are multiplication decomposition and addition decomposition. However, the existing multiplication decomposition method has the problems of large amount of calculation and low execution efficiency.

[0005] Therefore, how to provide an efficient secure multi-party computing method and system for secret sharing is an urgent problem to be solved by those skilled in the art. Summary of the invention

[0006] In view of this, the present invention provides a secure multi-party computing method and system for secret sharing, which has fast computing speed and saves time. Compared with multiple interactive operations, TEE is more secure and reduces communication overhead.

[0007] In order to achieve the above object, the present invention adopts the following technical solution:

[0008] A secure multi-party computing method for secret sharing, comprising:

[0009] S1: The first communication party shares the secret x, obtains the secret sharing block [x]A and the secret sharing block [x]B, and sends the secret sharing block [x]B to the second communication party;

[0010] The second communication party performs secret sharing on the secret y, obtains secret sharing block [y]A and secret sharing block [y]B, and sends the secret sharing block [y]A to the first communication party;

[0011] S2: The first communication party multiplies the secret sharing block [x]A and the secret sharing block [y]A to obtain a first encryption matrix, encrypts the first encryption matrix and the multiplication value, and sends the encrypted multiplication calculation value and the encrypted first encryption matrix to the trusted execution environment TEE at the same time;

[0012] The second communication party multiplies the secret sharing block [y]B and the secret sharing block [x]B to obtain a second encryption matrix, encrypts the transpose and multiplication value of the second encryption matrix, and sends the encrypted multiplication calculation value and the encrypted transpose of the second encryption matrix to the trusted execution environment TEE at the same time;

[0013] S3: The trusted execution environment TEE performs decryption to obtain decrypted data.

[0014] Preferably, the first encryption matrix [[x]A, [y]A] is generated by placing the secret sharing block [x]A at the first position of the matrix and placing the secret sharing block [y]A at the second position of the matrix;

[0015] The second encryption matrix [[y]B, [x]B] is generated by placing the secret sharing block [y]B at the first position of the matrix and placing the secret sharing block [x]B at the second position of the matrix.

[0016] Preferably, the calculation formula for trusted execution environment TEE decryption is:

[0017] x*y=[[x]A,[y]A]*[[y]B,[x]B] T +[x]A*[y]A+[y]B*[x]B

[0018] Where [[x]A, [y]A] represents the first encryption matrix, [[y]B, [x]B] T represents the transpose of the second encryption matrix, and * represents multiplication.

[0019] A secure multi-party computing system for secret sharing, comprising: a first communication party, a second communication party and a trusted execution environment TEE;

[0020] The first communication party includes a first secret sharing unit, a first communication unit, a first computing unit and a first TEE interaction unit;

[0021] The second communication party includes a second secret sharing unit, a second communication unit, a second computing unit, and a second TEE interaction unit;

[0022] The first secret sharing unit is used to secretly share the secret x of the first communication party to obtain a secret sharing block [x]A and a secret sharing block [x]B;

[0023] The second secret sharing unit is used to secretly share the secret y of the second communication party to obtain a secret sharing block [y]A and a secret sharing block [y]B;

[0024] The first communication unit and the second communication unit perform data transmission, the first communication unit sends a secret sharing block [x] B to the second communication unit, and the second communication unit sends a secret sharing block [y] A to the first communication unit;

[0025] The first operation unit is used to multiply the secret sharing block [x]A and the secret sharing block [y]A of the first communication party to obtain a first encryption matrix, and encrypt the first encryption matrix and the multiplication value;

[0026] The second operation unit is used to multiply the secret sharing block [y]B and the secret sharing block [x]B of the second communication party to obtain a second encryption matrix, and encrypt the transposition and multiplication value of the second encryption matrix;

[0027] The first TEE interaction unit is used to send the encrypted first encryption matrix and the encrypted first communication party multiplication calculation value to the trusted execution environment TEE;

[0028] The second TEE interaction unit is used to send the encrypted transpose of the second encryption matrix and the encrypted second communication party multiplication calculation value to the trusted execution environment TEE;

[0029] The trusted execution environment TEE is used to perform decryption based on the transposition of the first encryption matrix and the second encryption matrix to obtain decrypted data.

[0030] Preferably, the first encryption matrix [[x]A, [y]A] is generated by placing the secret sharing block [x]A at the first position of the matrix and placing the secret sharing block [y]A at the second position of the matrix;

[0031] The second encryption matrix [[y]B, [x]B] is generated by placing the secret sharing block [y]B at the first position of the matrix and placing the secret sharing block [x]B at the second position of the matrix.

[0032] Preferably, the calculation formula for trusted execution environment TEE decryption is:

[0033] x*y=[[x]A,[y]A]*[[y]B,[x]B] T+[x]A*[y]A+[y]B*[x]B

[0034] Where [[x]A, [y]A] represents the first encryption matrix, [[y]B, [x]B] T represents the transpose of the second encryption matrix, and * represents multiplication.

[0035] It can be seen from the above technical solution that compared with the prior art, the present invention discloses a secure multi-party computing method and system for secret sharing, which has a fast computing speed and saves time. Compared with multiple interactive calculations, TEE is more secure and reduces communication overhead. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0037] Figure 1 The accompanying drawing is a flow chart of a secure multi-party computing method for secret sharing provided by the present invention.

[0038] Figure 2 The accompanying drawing is a structural diagram of a secure multi-party computing system for secret sharing provided by the present invention. DETAILED DESCRIPTION

[0039] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. 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 creative work are within the scope of protection of the present invention.

[0040] The embodiment of the present invention discloses a secure multi-party computing method for secret sharing, such as Figure 1 As shown, including:

[0041] S1: The first communication party performs secret sharing of the secret x, that is, the first communication party randomly selects a random number as a secret sharing block [x]A, subtracts the random number from the secret X as a secret sharing block [x]B, obtains the secret sharing block [x]A and the secret sharing block [x]B, and then sends the secret sharing block [x]B to the second communication party;

[0042] The second communication party performs secret sharing of the secret y, that is, the second communication party randomly selects a random number as a secret sharing block [y]A, subtracts the random number from the secret y as a secret sharing block [y]B, obtains the secret sharing block [y]A and the secret sharing block [y]B, and then sends the secret sharing block [y]A to the first communication party;

[0043] S2: The first communication party multiplies the secret sharing block [x]A and the secret sharing block [y]A to obtain a first encryption matrix [[x]A, [y]A], encrypts the first encryption matrix [[x]A, [y]A] and the multiplication value, and sends the encrypted multiplication calculation value [x]A*[y]A and the encrypted first encryption matrix [[x]A, [y]A] to the trusted execution environment TEE;

[0044] The second communication party multiplies the secret sharing block [y]B and the secret sharing block [x]B to obtain the second encryption matrix [[y]B, [x]B], and transposes the second encryption matrix [[y]B, [x]B] T and the multiplication value is encrypted, and the encrypted multiplication calculation value and the transpose of the encrypted second encryption matrix [[y]B, [x]B] are T Then send it to TEE;

[0045] S3: TEE performs decryption, and the calculation formula is: x*y=[[x]A,[y]A]*[[y]B,[x]B] T +[x]A*[y]A+[y]B*[x]B, get the decrypted data.

[0046] The first encryption matrix [[x]A, [y]A] is generated by placing the secret sharing block [x]A at the first position of the matrix and placing the secret sharing block [y]A at the second position of the matrix;

[0047] The second encryption matrix [[y]B, [x]B] is generated by placing the secret sharing block [y]B at the first position of the matrix and placing the secret sharing block [x]B at the second position of the matrix.

[0048] That is, the matrix is ​​generated by putting the self-generated secret sharing block in front and the received secret sharing block in the back.

[0049] The embodiment of the present invention discloses a secure multi-party computing system for secret sharing, such as Figure 2 As shown, it includes: a first communication party, a second communication party and a TEE;

[0050] The first communication party includes a first secret sharing unit, a first communication unit, a first computing unit and a first TEE interaction unit;

[0051] The second communication party includes a second secret sharing unit, a second communication unit, a second computing unit, and a second TEE interaction unit;

[0052] The first secret sharing unit is used to secretly share the secret x of the first communication party to obtain a secret sharing block [x]A and a secret sharing block [x]B;

[0053] The second secret sharing unit is used to secretly share the secret y of the second communication party to obtain a secret sharing block [y]A and a secret sharing block [y]B;

[0054] The first communication unit and the second communication unit perform data transmission, the first communication unit sends a secret sharing block [x] B to the second communication unit, and the second communication unit sends a secret sharing block [y] A to the first communication unit;

[0055] The first operation unit is used to multiply the secret sharing block [x]A and the secret sharing block [y]A of the first communication party to obtain a first encryption matrix, and encrypt the first encryption matrix and the multiplication value;

[0056] The second operation unit is used to multiply the secret sharing block [y]B and the secret sharing block [x]B of the second communication party to obtain a second encryption matrix, and encrypt the transposition and multiplication value of the second encryption matrix;

[0057] The first TEE interaction unit is used to send the encrypted first encryption matrix and the encrypted first communication party multiplication calculation value to the TEE;

[0058] The second TEE interaction unit is used to send the encrypted transpose of the second encryption matrix and the encrypted second communication party multiplication calculation value to the TEE;

[0059] TEE is a secure area built on the CPU, which is used to decrypt based on the transpose of the first encryption matrix and the second encryption matrix. The calculation formula is:

[0060] x*y=[[x]A,[y]A]*[[y]B,[x]B] T +[x]A*[y]A+[y]B*[x]B, get the decrypted data.

[0061] The first encryption matrix [[x]A, [y]A] is generated by placing the secret sharing block [x]A at the first position of the matrix and placing the secret sharing block [y]A at the second position of the matrix;

[0062] The second encryption matrix [[y]B, [x]B] is generated by placing the secret sharing block [y]B at the first position of the matrix and placing the secret sharing block [x]B at the second position of the matrix.

[0063] That is, the matrix is ​​generated by putting the self-generated secret sharing block in front and the received secret sharing block in the back.

[0064] In this specification, each embodiment is described in a progressive manner, and each embodiment focuses on the differences from other embodiments. The same or similar parts between the embodiments can be referred to each other. For the device disclosed in the embodiment, since it corresponds to the method disclosed in the embodiment, the description is relatively simple, and the relevant parts can be referred to the method part.

[0065] The above description of the disclosed embodiments enables one skilled in the art to implement or use the present invention. Various modifications to these embodiments will be apparent to one skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of the present invention. Therefore, the present invention will not be limited to the embodiments shown herein, but rather to the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. A secure multi-party computing method for secret sharing, characterized in that: include: S1: The first communication party shares the secret x, obtains the secret sharing block [x]A and the secret sharing block [x]B, and sends the secret sharing block [x]B to the second communication party; The second communication party performs secret sharing on the secret y, obtains secret sharing block [y]A and secret sharing block [y]B, and sends the secret sharing block [y]A to the first communication party; S2: The first communication party multiplies the secret sharing block [x]A and the secret sharing block [y]A to obtain a first encryption matrix, encrypts the first encryption matrix and the multiplication value, and sends the encrypted multiplication calculation value and the encrypted first encryption matrix to the trusted execution environment TEE at the same time; The second communication party multiplies the secret sharing block [y]B and the secret sharing block [x]B to obtain a second encryption matrix, encrypts the transpose and multiplication value of the second encryption matrix, and sends the encrypted multiplication calculation value and the encrypted transpose of the second encryption matrix to the trusted execution environment TEE at the same time; S3: The trusted execution environment TEE performs decryption to obtain decrypted data.

2. A secure multi-party computing method for secret sharing according to claim 1, characterized in that: The first encryption matrix [[x]A, [y]A] is generated by placing the secret sharing block [x]A at the first position of the matrix and placing the secret sharing block [y]A at the second position of the matrix; The second encryption matrix [[y]B, [x]B] is generated by placing the secret sharing block [y]B at the first position of the matrix and placing the secret sharing block [x]B at the second position of the matrix.

3. A secure multi-party computing method for secret sharing according to claim 1, characterized in that: The calculation formula for trusted execution environment TEE decryption is: x*y=[[x]A,[y]A]*[[y]B,[x]B] T +[x]A*[y]A+[y]B*[x]B Where [[x]A, [y]A] represents the first encryption matrix, [[y]B, [x]B] T represents the transpose of the second encryption matrix, and * represents multiplication.

4. A secure multi-party computing system for secret sharing, characterized in that: include: A first communication party, a second communication party and a trusted execution environment TEE; The first communication party includes a first secret sharing unit, a first communication unit, a first computing unit and a first TEE interaction unit; The second communication party includes a second secret sharing unit, a second communication unit, a second computing unit, and a second TEE interaction unit; The first secret sharing unit is used to secretly share the secret x of the first communication party to obtain a secret sharing block [x]A and a secret sharing block [x]B; The second secret sharing unit is used to secretly share the secret y of the second communication party to obtain a secret sharing block [y]A and a secret sharing block [y]B; The first communication unit and the second communication unit perform data transmission, the first communication unit sends a secret sharing block [x] B to the second communication unit, and the second communication unit sends a secret sharing block [y] A to the first communication unit; The first operation unit is used to multiply the secret sharing block [x]A and the secret sharing block [y]A of the first communication party to obtain a first encryption matrix, and encrypt the first encryption matrix and the multiplication value; The second operation unit is used to multiply the secret sharing block [y]B and the secret sharing block [x]B of the second communication party to obtain a second encryption matrix, and encrypt the transposition and multiplication value of the second encryption matrix; The first TEE interaction unit is used to send the encrypted first encryption matrix and the encrypted first communication party multiplication calculation value to the trusted execution environment TEE; The second TEE interaction unit is used to send the encrypted transpose of the second encryption matrix and the encrypted second communication party multiplication calculation value to the trusted execution environment TEE; The trusted execution environment TEE is used to perform decryption based on the transposition of the first encryption matrix and the second encryption matrix to obtain decrypted data.

5. A secure multi-party computing system for secret sharing according to claim 4, characterized in that: The first encryption matrix [[x]A, [y]A] is generated by placing the secret sharing block [x]A at the first position of the matrix and placing the secret sharing block [y]A at the second position of the matrix; The second encryption matrix [[y]B, [x]B] is generated by placing the secret sharing block [y]B at the first position of the matrix and placing the secret sharing block [x]B at the second position of the matrix.

6. A secure multi-party computing system for secret sharing according to claim 4, characterized in that: The calculation formula for trusted execution environment TEE decryption is: x*y=[[x]A,[y]A]*[[y]B,[x]B] T +[x]A*[y]A+[y]B*[x]B Where [[x]A, [y]A] represents the first encryption matrix, [[y]B, [x]B] T represents the transpose of the second encryption matrix, and * represents multiplication.