Privacy set intersection method and system based on exchangeable encryption

By adopting the dual encryption comparison method of interchangeable encryption and TEE in the privacy set interchange, the problem of insufficient security of interchange in the prior art is solved, and more efficient and safer intersection calculation is achieved.

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

Patent Information

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

AI Technical Summary

Technical Problem

The existing privacy collection interception method has security problems, especially the size of the privacy collection is easily exposed, resulting in insufficient privacy protection.

Method used

Using an interchangeable encryption method, dual encryption and comparison are performed through TEE (Trustable Execution Environment). The user side only encrypts once, and TEE completes the remaining encryption and comparison to ensure privacy and security.

Benefits of technology

Improves computing speed and efficiency, and can safely return the number or content of the intersection without revealing the size of the privacy set, enhancing security.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118944969A_ABST
    Figure CN118944969A_ABST
Patent Text Reader

Abstract

The invention discloses a privacy set intersection method and system based on exchangeable encryption, and the method comprises the steps: S1, encrypting a to-be-exchanged information set of a user A and a user B through employing a secret key E1 and a secret key E2, and obtaining an encrypted information set of the user A and the user B; s2, determining the intersection demands xa and xb, and synchronously sending the respective intersection demands and the own encryption information to the TEE; s3, carrying out secondary encryption on the encrypted information of the user A by using E2, carrying out secondary encryption on the encrypted information of the user B by using E1 to obtain a secondary encrypted information set of the user A and the user B, comparing the secondary encrypted information set of the user A with the secondary encrypted information set of the user B according to an intersection demand to obtain an intersection result, and sending the intersection result to the user A; the system comprises a user A encryption client, a user B encryption client and a TEE. Through the exchangeable encryption algorithm and the TEE, intersection is carried out on the basis of not leaking the content and the length of the privacy set, and higher privacy is achieved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of network security technology, and more particularly to a privacy set intersection method based on exchangeable encryption and a system thereof. Background Art

[0002] Private Set Intersection (PSI) means that the two parties obtain the intersection of their data without revealing any additional information. Here, additional information refers to any information other than the intersection of the data of the two parties.

[0003] The privacy-preserving set intersection protocol allows two parties holding their own sets to jointly calculate the intersection of the two sets. At the end of the protocol interaction, one or both parties should obtain the correct intersection and will not obtain any information from the other party's set other than the intersection.

[0004] Protecting the privacy of a collection is a natural and even necessary requirement in many scenarios. For example, when the collection is a user's address book or the genome of a user of a genetic diagnosis service, or when aligning data in vertical federated learning, such input must be protected by cryptographic means.

[0005] However, the existing privacy set intersection method still has security issues, especially it is easy to expose the size of one's own privacy set. In some application scenarios, the size of the privacy set is still valuable information.

[0006] Therefore, how to provide a secure and reliable privacy set intersection method based on exchangeable encryption is an urgent problem that technicians in this field need to solve. Summary of the invention

[0007] In view of this, the present invention provides a privacy set intersection method based on exchangeable encryption and a system thereof, which can effectively solve the problem of insufficient privacy security in the process of privacy set intersection method existing in the prior art.

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

[0009] A method for finding the intersection of private sets based on exchangeable encryption includes the following steps:

[0010] S1. Use key E1 to exchange information set M of user A = {m1,m2,...,m a} to encrypt and obtain the encrypted information set E1(m1), E1(m2),..., E1(m a ), using key E2 to exchange user B's information set N = {n1, n2, ..., n b} to encrypt and obtain the encrypted information set E2(n1), E2(n2), ..., E2(n b );

[0011] S2. User A and user B determine the intersection requirement x respectively. a and x b , and send their respective intersection requirements and their own encrypted information to TEE through a secure channel synchronously;

[0012] S3.TEE uses E2 to re-encrypt user A’s encrypted information and obtains user A’s re-encrypted information set E2(E1(m1)),E2(E1(m2)),...,E2(E1(m a )), use E1 to re-encrypt the encrypted information of user B, and obtain the secondary encrypted information set of user B E1(E2(n1)),E1(E2(n2)),...,E1(E2(n b )), according to the intersection requirement, the secondary encrypted information set of user A is compared with the secondary encrypted information set of user B to obtain the intersection result.

[0013] Preferably, before performing S1, TEE generates two exchangeable encryption keys E1 and E2 and sends them to user A and user B respectively through a secure channel.

[0014] Preferably, in S3, the secondary encrypted information set of user A is compared with the secondary encrypted information set of user B according to the intersection requirement, and the specific content of the intersection result is obtained as follows:

[0015] If the intersection demand x a or x b If x is 0, the intersection size is returned directly. a or x b If it is 1, the information in the intersection is decrypted and the intersection content is fed back through the secure channel.

[0016] A privacy set intersection system based on exchangeable encryption, comprising: a user A encryption client, a user B encryption client and TEE;

[0017] User A's encryption client is used to complete the exchange of user A's information set M = {m1, m2, ..., m a} to encrypt and obtain the encrypted information set E1(m1), E1(m2),..., E1(m a );Determine the intersection requirement x a , and x a Synchronize with its own encrypted information and send it to TEE through a secure channel;

[0018] User B's encryption client is used to complete the exchange of user B's information set N = {n1, n2, ..., n b} to encrypt and obtain the encrypted information set E2(n1), E2(n2), ..., E2(n b );Determine the intersection requirement x b , and x b Synchronize with its own encrypted information and send it to TEE through a secure channel;

[0019] TEE is used to re-encrypt user A's encrypted information using E2, and obtain user A's re-encrypted information set E2(E1(m1)),E2(E1(m2)),...,E2(E1(m a )), use E1 to re-encrypt the encrypted information of user B, and obtain the secondary encrypted information set of user B E1(E2(n1)),E1(E2(n2)),...,E1(E2(n b )), according to the intersection requirement, the secondary encrypted information set of user A is compared with the secondary encrypted information set of user B to obtain the intersection result.

[0020] Preferably, TEE is also used to generate two exchangeable encryption keys E1 and E2 and send them to user A and user B respectively through a secure channel.

[0021] Preferably, the secondary encrypted information set of user A is compared with the secondary encrypted information set of user B according to the intersection requirement, and the specific content of the intersection result is obtained as follows:

[0022] If the intersection demand x a or x b If x is 0, the intersection size is returned directly. a or x b If it is 1, the information in the intersection is decrypted and the intersection content is fed back through the secure channel.

[0023] It can be seen from the above technical solution that compared with the prior art, the present invention discloses a privacy set intersection method based on exchangeable encryption and a system thereof. The present invention adds a trusted execution environment TEE on the basis of exchangeable encryption. Users do not interact directly with each other, but interact through the intermediary of TEE. Moreover, the user side only performs encryption once, and the rest is completed by TEE. Compared with the method in the prior art that requires encryption more than twice on the user side, the present invention improves the computing speed and efficiency on the basis of effectively ensuring privacy security. In addition, through TEE calculation, the number of intersections or the content of the intersection can be returned according to the needs of both parties without disclosing the size of its own privacy set, which is more secure. BRIEF DESCRIPTION OF THE DRAWINGS

[0024] 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.

[0025] Figure 1 A flowchart of a method for finding the intersection of private sets based on exchangeable encryption provided by the present invention. DETAILED DESCRIPTION

[0026] 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.

[0027] The embodiment of the present invention discloses a privacy set intersection method based on exchangeable encryption, such as Figure 1 As shown, the following steps are included:

[0028] S1. Use key E1 to exchange information set M of user A = {m1,m2,...,m a} to encrypt and obtain the encrypted information set E1(m1), E1(m2),..., E1(m a ), using key E2 to exchange user B's information set N = {n1, n2, ..., n b} to encrypt and obtain the encrypted information set E2(n1), E2(n2), ..., E2(n b );

[0029] S2. User A and user B determine the intersection requirement x respectively. a and x b , and send their respective intersection requirements and their own encrypted information to TEE through a secure channel synchronously;

[0030] S3.TEE uses E2 to re-encrypt user A’s encrypted information and obtains user A’s re-encrypted information set E2(E1(m1)),E2(E1(m2)),...,E2(E1(m a )), use E1 to re-encrypt the encrypted information of user B, and obtain the secondary encrypted information set of user B E1(E2(n1)),E1(E2(n2)),...,E1(E2(n b)), according to the intersection requirement, the secondary encrypted information set of user A is compared with the secondary encrypted information set of user B to obtain the intersection result.

[0031] It should be noted that:

[0032] Private set intersection is to obtain the intersection of their data without revealing additional information about the participants.

[0033] Exchangeable encryption method, if an algorithm has the function of E1(E2(m))=E2(E1(m)), then the algorithm is an exchangeable encryption algorithm, which has different keys. The present invention can select any exchangeable encryption method according to the situation, such as the SRA exchange encryption method.

[0034] TEE builds a secure area on the CPU through software and hardware methods to ensure that the programs and data loaded on the TEE are protected in terms of confidentiality and integrity. TEE can support more operators and complex calculations, and can provide encryption and decryption algorithms, data security storage, application authentication, operating environment security verification, data code integrity verification, user interface security and other functions.

[0035] In order to further implement the above technical solution, before performing S1, TEE generates two exchangeable encryption keys E1 and E2 and sends them to user A and user B respectively through a secure channel.

[0036] In order to further implement the above technical solution, in S3, the secondary encrypted information set of user A is compared with the secondary encrypted information set of user B according to the intersection requirement, and the specific content of the intersection result is obtained as follows:

[0037] If the intersection demand x a or x b If x is 0, the intersection size is returned directly. a or x b If it is 1, the information in the intersection is decrypted and the intersection content is fed back through the secure channel.

[0038] A privacy set intersection system based on exchangeable encryption, comprising: a user A encryption client, a user B encryption client and TEE;

[0039] User A's encryption client is used to complete the exchange of user A's information set M = {m1, m2, ..., m a} to encrypt and obtain the encrypted information set E1(m1), E1(m2),..., E1(m a );Determine the intersection requirement x a , and x a Synchronize with its own encrypted information and send it to TEE through a secure channel;

[0040] User B's encryption client is used to complete the exchange of user B's information set N = {n1, n2, ..., n b} to encrypt and obtain the encrypted information set E2(n1), E2(n2), ..., E2(n b );Determine the intersection requirement x b , and x b Synchronize with its own encrypted information and send it to TEE through a secure channel;

[0041] TEE is used to re-encrypt user A's encrypted information using E2, and obtain user A's re-encrypted information set E2(E1(m1)),E2(E1(m2)),...,E2(E1(m a )), use E1 to re-encrypt the encrypted information of user B, and obtain the secondary encrypted information set of user B E1(E2(n1)),E1(E2(n2)),...,E1(E2(n b )), according to the intersection requirement, the secondary encrypted information set of user A is compared with the secondary encrypted information set of user B to obtain the intersection result.

[0042] In order to further implement the above technical solution, TEE is also used to generate two exchangeable encryption keys E1 and E2 and send them to user A and user B respectively through a secure channel.

[0043] In order to further implement the above technical solution, the secondary encrypted information set of user A is compared with the secondary encrypted information set of user B according to the intersection requirement, and the specific content of the intersection result is obtained as follows:

[0044] If the intersection demand x a or x b If it is 0, the intersection size is returned directly. If the intersection requirement is x a or x b If it is 1, the information in the intersection is decrypted and the intersection content is fed back through the secure channel.

[0045] The present invention proposes a method and system for finding the intersection of private sets based on exchangeable encryption. TEE generates two exchangeable encryption keys and sends them to user A and user B through a secure secret channel. User A and user B use their own keys E1 and E2 to encrypt the private set respectively, and send it to TEE through a secure channel. TEE uses the other party's key to encrypt the received information again and compare it. When the requirement of "only finding the intersection size" is obtained, the intersection size is returned; when the requirement of "returning the intersection" is obtained, the content of the intersection is returned. The present invention uses an exchangeable encryption algorithm and TEE to find the intersection without leaking the content and length of the private set, and finds the intersection size and intersection content, which has higher privacy.

[0046] 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.

[0047] 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 private set intersection method based on commutative encryption, characterized in that: The following steps are involved: S1. Use key E1 to exchange information set M of user A = {m1,m2,...,m a } to encrypt and obtain the encrypted information set E1(m1), E1(m2), ..., E1(m a ), use key E2 to exchange user B's information set N = {n1,n2,...,n b } to encrypt and obtain the encrypted information set E2(n1), E2(n2), ..., E2(n b ); S2. User A and user B determine the intersection requirement x respectively. a and x b , and send their respective intersection requirements and their own encrypted information to TEE through a secure channel synchronously; S3.TEE uses E2 to re-encrypt user A’s encrypted information and obtains user A’s re-encrypted information set E2(E1(m1)),E2(E1(m2)),...,E2(E1(m a )), use E1 to re-encrypt the encrypted information of user B, and obtain the secondary encrypted information set of user B E1(E2(n1)),E1(E2(n2)),...,E1(E2(n b )), according to the intersection requirement, the secondary encrypted information set of user A is compared with the secondary encrypted information set of user B to obtain the intersection result.

2. The method for finding intersection of private sets based on commutative encryption according to claim 1, characterized in that: Before performing S1, TEE generates two exchangeable encryption keys E1 and E2 and sends them to user A and user B respectively through a secure channel.

3. The method for finding intersection of private sets based on commutative encryption according to claim 1, characterized in that: In S3, the secondary encrypted information set of user A is compared with the secondary encrypted information set of user B according to the intersection requirement, and the specific content of the intersection result is obtained as follows: If the intersection demand x a or x b If it is 0, the intersection size is returned directly. If the intersection requirement is x a or x b If it is 1, the information in the intersection is decrypted and the intersection content is fed back through the secure channel.

4. The method for finding intersection of private sets based on commutative encryption according to claim 3, characterized in that: A public key specified by the user is set in TEE. After decrypting the information in the intersection, the decrypted content is encrypted with the public key and the intersection content is fed back through a secure channel.

5. A private set intersection system based on commutative encryption, characterized in that: include: User A encrypts the client, user B encrypts the client and TEE; User A encrypts the client, which is used to complete the exchange of information set M of user A using key E1 = {m1, m2, ..., m a } to encrypt and obtain the encrypted information set E1(m1), E1(m2), ..., E1(m a ); Determine the intersection requirement x a , and x a Synchronize with its own encrypted information and send it to TEE through a secure channel; User B's encryption client is used to complete the exchange of user B's information set N = {n1, n2, ..., n b } to encrypt and obtain the encrypted information set E2(n1), E2(n2), ..., E2(n b ); Determine the intersection requirement x b , and x b Synchronize with its own encrypted information and send it to TEE through a secure channel; TEE is used to re-encrypt user A's encrypted information using E2, and obtain user A's re-encrypted information set E2(E1(m1)),E2(E1(m2)),...,E2(E1(m a )), use E1 to re-encrypt the encrypted information of user B, and obtain the secondary encrypted information set of user B E1(E2(n1)),E1(E2(n2)),...,E1(E2(n b )), according to the intersection requirement, the secondary encrypted information set of user A is compared with the secondary encrypted information set of user B to obtain the intersection result.

6. The private set intersection system based on commutative encryption according to claim 5, characterized in that: TEE is also used to generate two exchangeable encryption keys E1 and E2, which are sent to user A and user B respectively through a secure channel.

7. The private set intersection system based on commutative encryption according to claim 5, characterized in that: According to the intersection requirement, the secondary encrypted information set of user A is compared with the secondary encrypted information set of user B. The specific content of the intersection result is: If the intersection demand x a or x b If it is 0, the intersection size is returned directly. If the intersection requirement is x a or x b If it is 1, the information in the intersection is decrypted and the intersection content is fed back through the secure channel.

8. The private set intersection system based on commutative encryption according to claim 7, characterized in that: The TEE is set with a public key specified by the user. After decrypting the information in the intersection, the decrypted content is encrypted with the public key and the intersection content is fed back through a secure channel.