A multi-party privacy protection set intersection method and system based on function secret sharing
The multi-party privacy protection set intersection method using function secret sharing and oblivious linear computation addresses inefficiencies in existing protocols by enabling secure, parallel data sharing among multiple participants, ensuring privacy and reducing costs.
Patent Information
- Application Number
- CN202311737704.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2023-12-18
- Publication Date
- 2024-12-27
- Estimated Expiration
- 2043-12-18
AI Technical Summary
Existing multi-party privacy protection protocols are inefficient and costly, especially in scenarios involving more than two participants, and fail to protect privacy data effectively during data collaborative computing and mining.
A multi-party privacy protection set intersection method using function secret sharing and oblivious linear computation, enabling parallel computing and secure data sharing among multiple participants, where only one participant obtains the intersection result while others remain unaware.
The method ensures privacy protection by preventing participants other than the designated one from obtaining any information, while reducing communication and computing costs through parallel processing.
Smart Images
Figure CN117668916B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to a multi-party privacy protection set intersection method and system based on function secret sharing, belonging to the field of privacy computing technology and computer technology. Background Art
[0002] The statements in this section merely provide background information related to the present disclosure and do not necessarily constitute prior art.
[0003] With the rapid development of communication technology and network technology and the widespread application of mobile computing, cloud computing, and distributed computing, virtual networks are more closely connected with people's lives, and various applications of Internet big data have penetrated into people's social, shopping, travel and other aspects. While these applications allow people to enjoy more convenient services, they also put customer information, personal records, corporate operating data and other privacy data at risk. For example, the British consulting company Cambridge Analytica obtained the personal data of millions of Facebook users without the consent of Facebook users. Therefore, it is urgent to make data available but invisible and solve the problems of data security and privacy protection in the process of data collaborative computing and mining. Therefore, the issue of privacy protection in the era of big data has become the focus of scientific researchers and the industry. Privacy data protection originated from secure multiparty computation (MPC), which was proposed by Yao Qizhi using the millionaire problem. It means that each computing participant cannot obtain any other information except the calculation results, and solves the problem of how data holders who do not trust each other can calculate private data.
[0004] Private set intersection (PSI) is a hot topic in secure multi-party computation. It allows participants who each hold a private set to jointly calculate the set intersection in a distributed scenario without revealing any private information other than the intersection. In the traditional two-party private set intersection protocol, when only one party knows the intersection result, it is called a one-way PSI protocol, and when both parties know the intersection, it is called a two-way PSI protocol. PSI can be used in many real-world scenarios to solve many practical problems and ensure data security. Typical application scenarios of PSI include privacy-preserving similar document detection and online advertising conversion rate evaluation. Under the condition that data is held by different managers, PSI achieves a win-win situation of data privacy protection and information sharing. However, with the expansion of the scale of private data sharing, application scenarios with more than two participants are becoming more and more common, such as joint risk control, joint marketing, blacklist query, multi-factor verification, sample alignment, etc. Multi-party PSI has a similar technical foundation to two-party PSI but is essentially different. Summary of the invention
[0005] Aiming at the shortcomings of the existing technology, a ring version based on function secret sharing and oblivious linear computation provides a multi-party private set intersection method, which supports parallel computing and is competitive in terms of communication and computing costs.
[0006] The present invention can find the intersection of the participant sets without revealing the privacy data of the participants. This method is a secure multi-party computing framework that can resist semi-honest adversaries and supports parallel computing, which is competitive in communication and computing. After the protocol runs, only participant P1 obtains the intersection of the sets, and other participants cannot obtain any other information. The function is as follows:
[0007] Parameters: m participants: P i ,i∈[m]; each participant P i Input a set X of size n i ;
[0008] enter:
[0009] User P i Input set X i ,i∈[m];
[0010] Output:
[0011] Participant P1 obtains the set intersection:
[0012] Terminology explanation:
[0013] Function secret sharing (FSS): Function secret sharing (FSS) is a cryptographic primitive first proposed by Boyle et al. at the Eurocrypt conference in 2015. Its purpose is to achieve secure search and update of distributed data. Specifically, an m-party FSS scheme can convert a given function f:{0,1} n →G, where G is an Abelian group, split into m functions: f1,f2,…,f m , with keys k1, k2, …, k m Description, so that f(x) = f1(x) + f2(x) + ... + f m (x), and any subset of the secret key cannot leak the function f. FSS can be used to implement application scenarios such as private information retrieval (PIR) and anonymous messaging to privately read or write data from a distributed database.
[0014] Ring of oblivious linear function evaluation (Ring-OLE): Oblivious linear function evaluation (OLE) is a cryptographic protocol that allows two or more parties to jointly compute a linear function without leaking any other information. For example: Alice generates x∈F, Bob generates a, b∈F, and after running the OLE protocol, Alice obtains a·x+b∈F. Bob has no output. In the Ring-OLE protocol, a, b, x∈R is required. The present invention uses a quotient ring R=F[X] / <p(X)> , where each element can be represented by a polynomial of finite degree. For Ring-OLE with R = F[X], Alice generates x∈R, Bob generates a, b∈R, and after running the Ring-OLE protocol, Alice obtains a·x+b∈R. Standard OLE on F can be viewed as a special case of Ring-OLE, where the highest degree of the polynomial is 0.
[0015] Polynomial interpolation: Polynomial interpolation is a method of constructing a polynomial function from known data points in order to infer the value of unknown points. It is based on the assumption that given n+1 different data points (x0, y0), (x1, y1), …, (x;, y), there are only n+1 points that can be accurately fitted by an n-degree polynomial. Lagrange interpolation is a common method of polynomial interpolation. This paper uses Lagrange interpolation to construct a polynomial based on known points.
[0016] The technical solution of the present invention is:
[0017] A multi-party privacy protection set intersection method based on function secret sharing is run in a multi-party participation system, the multi-party participation system includes a participant P1 and m-1 participants other than the participant P1, and the m-1 participants other than the participant P1 sequentially form a ring; including:
[0018] The m-1 participants other than participant P1 perform the following operations: i Upon receiving the participant P i-1 After receiving the function tuple, it executes the Ring-OLE protocol with participant P1, and then sends its own function share after sharing the function secret to the next participant P. i+1 ; where i∈{1,2,…,m}, m refers to the total number of participants; P i refers to the i-th participant; P i-1 refers to the i-1th participant; Pi+1 refers to the i+1th participant;
[0019] Participant P1 is responsible for accumulation and intersection calculation of the accumulated multiple forms.
[0020] According to the preferred embodiment of the present invention, before the Ring-OLE protocol is executed, the participant P i Enter the collection it holds Refers to the participant P i The jth element in the input set; n refers to the size of the participant's input set.
[0021] Preferably, according to the present invention, before the Ring-OLE protocol is executed, the participant P1 constructs an n-order polynomial using the Lagrange interpolation method according to the set X1 it holds: in
[0022] According to the preferred embodiment of the present invention, before the Ring-OLE protocol is executed, m-1 participants P except participant P1 i According to the set X it holds i , use Lagrange interpolation to construct an n-degree polynomial: satisfy And use the function secret sharing algorithm FSS to Split into two n-degree polynomials: satisfy
[0023] At the same time, m-1 participants P except participant P1 i Random sampling generates an n-degree polynomial: And use the function secret sharing algorithm FSS to Split into two n-degree polynomials: satisfy
[0024] According to a preferred embodiment of the present invention, a multi-party privacy protection set intersection method based on function secret sharing specifically includes:
[0025] Party P2 sends two polynomials to party P3:
[0026] m-2 participants P except participants P1 and P2 i calculate: Participant P i The Ring-OLE protocol is executed with participant P1, and participant P1 obtains the polynomial At the same time, the participant Pi To the next participant P i+1 Send two polynomials Right now
[0027] For the participant P m , participant P m calculate: Participant P m The Ring-OLE protocol is executed with participant P1, and participant P1 obtains the polynomial Participant P m Send two polynomials to party P2
[0028] For participant P2, participant P2 calculates: The Ring-OLE protocol is executed between the participants P2 and P1, and the participant P1 obtains the polynomial
[0029] For participant P1, participant P1 calculates the polynomial:
[0030]
[0031] Right now Participant P1 obtains the set intersection element I = {x∈X1:p Q (x) = 0}.
[0032] A multi-party system includes a participant P1 and m-1 participants other than the participant P1;
[0033] Participant P i Upon receiving the participant P i-1 After receiving the function tuple, it executes the Ring-OLE protocol with participant P1, and then sends its own function share after sharing the function secret to the next participant P. i+1 ;
[0034] Where i∈{1,2,…,m}, m refers to the total number of participants; P i refers to the i-th participant; P i-1 refers to the i-1th participant; P i+1 Refers to the i+1th participant.
[0035] An electronic device includes a processor, a memory, a communication interface and one or more programs, wherein the one or more programs are stored in the memory and are configured to be executed by the processor, and the program includes instructions for executing the steps of a multi-party privacy-preserving set intersection method based on function secret sharing.
[0036] A computer-readable storage medium stores a computer program for electronic data exchange, wherein the computer program enables a computer to execute part or all of the steps described in a multi-party privacy-preserving set intersection method based on function secret sharing.
[0037] A computer program product, wherein the computer program product includes a non-transitory computer-readable storage medium storing a computer program, and the computer program is operable to enable a computer to execute part or all of the steps described in a multi-party privacy-preserving set intersection method based on function secret sharing.
[0038] The beneficial effects of the present invention are:
[0039] 1. The present invention proposes a multi-party privacy set intersection protocol. After the protocol is completed, only participant P1 can get the intersection of the sets, and other participants cannot obtain any information.
[0040] 2. The present invention supports parallel computing. u Get the participant P i-1 After sending the function secret share, the Ring-OLE protocol can be executed with the participant P1, and the function secret share can also be sent to the next participant. The protocol is competitive in terms of communication and computing costs. BRIEF DESCRIPTION OF THE DRAWINGS
[0041] The accompanying drawings constituting a part of the present disclosure are used to provide a further understanding of the present disclosure. The illustrative embodiments of the present disclosure and their descriptions are used to explain the present disclosure and do not constitute an improper limitation on the present disclosure.
[0042] Figure 1 This is a structural diagram of a multi-party participation system based on a multi-party privacy set intersection method based on function secret sharing;
[0043] Figure 2 Schematic diagram of the three-party private set intersection method based on function secret sharing. DETAILED DESCRIPTION
[0044] The present disclosure is further described below in conjunction with the accompanying drawings and embodiments.
[0045] It should be noted that the following detailed descriptions are exemplary and intended to provide further explanation of the present disclosure. Unless otherwise specified, all technical and scientific terms used herein have the same meanings as those commonly understood by those skilled in the art to which the present disclosure belongs.
[0046] It should be noted that the terms used herein are only for describing specific embodiments and are not intended to limit the exemplary embodiments according to the present disclosure. As used herein, unless the context clearly indicates otherwise, the singular form is also intended to include the plural form. In addition, it should be understood that when the terms "comprising" and / or "including" are used in this specification, it indicates the presence of features, steps, operations, devices, components and / or combinations thereof.
[0047] A multi-party privacy-preserving set intersection method based on function secret sharing runs on a multi-party participating system, such as Figure 1 As shown, the multi-party system includes participant P1 and m-1 participants other than participant P1, and the m-1 participants other than participant P1 sequentially form a ring; including:
[0048] The m-1 participants other than participant P1 perform the following operations: i Upon receiving the participant P i-1 After receiving the function tuple, it executes the Ring-OLE protocol with participant P1, and then sends its own function share after sharing the function secret to the next participant P. i+1 ; where i∈{1,2,…,m}, m refers to the total number of participants; P i refers to the i-th participant; P i-1 refers to the i-1th participant; P i+1 refers to the i+1th participant;
[0049] Participant P1 is responsible for accumulation and intersection calculation of the accumulated multiple forms.
[0050] In some specific embodiments of the present invention, before the Ring-OLE protocol is executed, the participant P i Enter the collection it holds Refers to the participant P i The jth element in the input set; n refers to the size of the participant's input set.
[0051] In some specific implementation schemes of the present invention, before the Ring-OLE protocol is executed, the participant P1 constructs an n-degree polynomial using the Lagrange interpolation method based on the set X1 it holds: in
[0052] In some specific embodiments of the present invention, before the Ring-OLE protocol is executed, m-1 participants P1 other than the participant P2 i According to the set X it holds i , use Lagrange interpolation to construct an n-degree polynomial: satisfy And use the function secret sharing algorithm FSS to Split into two n-degree polynomials: satisfy
[0053] At the same time, m-1 participants P except participant P1 i Random sampling generates an n-degree polynomial: And use the function secret sharing algorithm FSS to Split into two n-degree polynomials: satisfy
[0054] In some specific embodiments of the present invention, the multi-party privacy protection set intersection method based on function secret sharing specifically includes:
[0055] Party P2 sends two polynomials to party P3:
[0056] m-2 participants P except participants P1 and P2 i calculate: Participant P i The Ring-OLE protocol is executed with participant P1, and participant P1 obtains the polynomial At the same time, the participant P i To the next participant P i+1 Send two polynomials Right now All of them refer to constructing an n-degree polynomial based on the input set X1 of participant P1 using the Lagrange interpolation method:
[0057] For the participant P m , participant P m calculate: Participant P m The Ring-OLE protocol is executed with participant P1, and participant P1 obtains the polynomial Since except for participant P1, other participants form a ring, so participant P m Send two polynomials to party P2
[0058] For participant P2, participant P2 calculates: The Ring-OLE protocol is executed between the participants P2 and P1, and the participant P1 obtains the polynomial
[0059] For participant P1, participant P1 calculates the polynomial:
[0060]
[0061]
[0062] Right now It means constructing an n-degree polynomial based on the input set X2 of participant P2 using Lagrange interpolation method: Same reason Structure and Same principle.
[0063] Participant P1 obtains the set intersection element I = {x∈X1:p Q (x) = 0}.
[0064] In some specific implementation schemes of the present invention, taking the three-party privacy set intersection method as an example, the specific process is as follows: Figure 2 .
[0065] The preparation phase before the Ring-OLE protocol is executed:
[0066] Participant P i ,i∈[3], participant input
[0067] Participant P1 constructs an n-degree polynomial based on set X1 using Lagrange interpolation method: in
[0068] Participant P i ,i∈[2,3] according to the set X i , use Lagrange interpolation to construct an n-degree polynomial: satisfy And use the function secret sharing algorithm FSS to Split into two n-degree polynomials: satisfy At the same time, the participants P i Random sampling generates an n-degree polynomial: And use the function secret sharing algorithm FSS to Split into two n-degree polynomials: satisfy
[0069] Protocol operation phase:
[0070] Assume that the protocol starts with participant P2:
[0071] Party P2 sends two polynomials to party P3:
[0072] Participant P3 calculates: Then the Ring-OLE protocol is executed with participant P1, and participant P1 obtains Finally, participant P3 sends two polynomials to participant P2
[0073] Participant P2 calculates: Then the Ring-OLE protocol is executed with participant P1, and participant P1 obtains
[0074] Participant P1 calculates the polynomial:
[0075]
[0076] Participant P1 obtains the set intersection element I = {x∈X1:p Q (x) = 0}.
[0077] A multi-party system includes a participant P1 and m-1 participants other than the participant P1;
[0078] Participant P i Upon receiving the participant P i-1 After receiving the function tuple, it executes the Ring-OLE protocol with participant P1, and then sends its own function share after sharing the function secret to the next participant P. i+1 ;
[0079] Where i∈{1,2,…,m}, m refers to the total number of participants; P i refers to the i-th participant; P i-1 refers to the i-1th participant; P i+1 Refers to the i+1th participant.
[0080] An electronic device includes a processor, a memory, a communication interface and one or more programs, wherein the one or more programs are stored in the memory and are configured to be executed by the processor, and the program includes instructions for executing the steps of a multi-party privacy-preserving set intersection method based on function secret sharing.
[0081] A computer-readable storage medium stores a computer program for electronic data exchange, wherein the computer program enables a computer to execute part or all of the steps described in a multi-party privacy-preserving set intersection method based on function secret sharing.
[0082] A computer program product, wherein the computer program product includes a non-transitory computer-readable storage medium storing a computer program, and the computer program is operable to enable a computer to execute part or all of the steps described in a multi-party privacy-preserving set intersection method based on function secret sharing.
Claims
1. A multi-party privacy protection set intersection method based on function secret sharing, characterized in that: It runs in a multi-party participation system, which includes participant P1 and m-1 participants other than participant P1. The m-1 participants other than participant P1 form a ring in sequence. include: The m-1 participants other than participant P1 perform the following operations: i Upon receiving the participant P i-1 After receiving the function tuple, it executes the Ring-OLE protocol with participant P1, and then sends its own function share after sharing the function secret to the next participant P. i+1 ; where i∈{2, 3, ..., m-1}, m refers to the total number of participants; P i refers to the i-th participant; P i-1 refers to the i-1th participant; P i+1 refers to the i+1th participant; Participant P1 is responsible for accumulation and intersection calculation of the accumulated polynomials; Before the Ring-OLE protocol is executed, m-1 participants P except participant P1 i According to the set X it holds i , use Lagrange interpolation to construct an n-degree polynomial: satisfy And use the function secret sharing algorithm FSS Split into two n-degree polynomials: satisfy At the same time, m-1 participants P except participant P1 i Random sampling generates an n-degree polynomial: And use the function secret sharing algorithm FSS Split into two n-degree polynomials: satisfy The multi-party privacy protection set intersection method based on function secret sharing specifically includes: Party P2 sends two polynomials to party P3: m-2 participants P except participants P1 and P2 i calculate: Participant P i The Ring-OLE protocol is executed with participant P1, and participant P1 obtains the polynomial At the same time, the participant P i To the next participant P i+1 Send two polynomials Right now For the participant P m , participant P m calculate: Participant P m The Ring-OLE protocol is executed with participant P1, and participant P1 obtains the polynomial Participant P m Send two polynomials to party P2 For participant P2, participant P2 calculates: The Ring-OLE protocol is executed between the participants P2 and P1, and the participant P1 obtains the polynomial For participant P1, participant P1 calculates the polynomial: Right now Participant P1 obtains the set intersection element I = {x∈X1:p Q (x) = 0}.
2. According to the method of claim 1, the method is characterized in that: Before the Ring-OLE protocol is executed, the participant P i Enter the collection it holds Refers to the participant P i The jth element in the input set; n refers to the size of the participant's input set.
3. According to the method of claim 1, the method is characterized in that: Before the Ring-OLE protocol is executed, party P1 constructs an n-degree polynomial using the Lagrange interpolation method based on the set X1 it holds: in 4. An electronic device, characterized in that: It includes a processor, a memory, a communication interface and one or more programs, wherein the one or more programs are stored in the memory and are configured to be executed by the processor, and the program includes instructions for executing the steps of the multi-party privacy-preserving set intersection method based on function secret sharing as described in any one of claims 1-3.
5. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program for electronic data exchange, wherein the computer program enables a computer to execute part or all of the steps described in the multi-party privacy-preserving set intersection method based on function secret sharing as described in any one of claims 1 to 3.
6. A computer program product, characterized in that The above-mentioned computer program product includes a non-transitory computer-readable storage medium storing a computer program, and the above-mentioned computer program can be operated to enable a computer to execute part or all of the steps described in the multi-party privacy-preserving set intersection method based on function secret sharing as described in any one of claims 1-3.