Secret transmission method, storage medium and system based on oblivious key-value pair storage

Abstract

The present invention relates to a secret transmission method, storage medium, and system based on oblivious key-value pair storage. By applying the OKVS data structure decoding to align data sets and hide key-value pair relationships, this method solves the problem of being unable to designate the first participant as the result party, or when the first participant is the result party, only obtaining the intersection size but not the actual intersection data. By applying the low-communication and high-performance characteristics of the OKVS data structure encoding and decoding, the invention replaces the two-party private intersection protocol portion of traditional schemes, reducing overall communication volume, shortening protocol runtime, and improving protocol execution efficiency. Specifically, the present invention implements a multi-party private intersection scheme that allows the first participant to obtain the intersection through n or n-1 OKVS encoding and decoding, without leaking additional information, with lower performance overhead and communication volume.

Description

Technical Field

[0001] The present invention relates to the field of data transmission, and in particular to a secret transmission method, storage medium and system based on oblivious key-value pair storage. Background Art

[0002] The Chinese application, publication number CN115883080A, discloses a "lightweight vertical federated learning privacy-preserving data alignment method." Its main steps are: dividing all participants into three parts by setting the number of colluding parties; executing a zero-sharing protocol and distributing the key to each participant to defend against collusion attacks; all participants use their keys to encrypt the original dataset, encode it into an OKVS data structure, and send it to the designated result party, which decodes the received OKVS structure; finally, the result party XORs the decoded dataset and compares and calculates the multi-party intersection. In this patent, each participant holds a partial share of the zero-sharing protocol, satisfying the property that when the same element exists in the datasets of all parties, the zero-share shares corresponding to that element of all participants are XORed to zero. One participant is designated as the result party to collect the zero-share shares of the other participants, and the multi-party intersection is calculated through comparison.

[0003] The Chinese application, publication number CN115276985A, discloses a "fair multi-party private set intersection algorithm based on enhanced VOLE." Its main steps are: dividing the participating parties into servers and clients, determining the public matrix and parameters; executing a zero-sharing protocol between clients to obtain an anti-collusion factor; executing the Vector Oblivious Linear Evaluation (VOLE) protocol to obtain an element-wise encryption blinding factor; the client packages the set into a linear vector by encoding it into an OKVS data structure, hiding the set plaintext, and encryption-blinding it using the element-wise encryption blinding factor. The set is then sent to the server, which removes the anti-collusion factor and sends it back to the client, where the client locally removes the encryption blinding factor to obtain the multi-party intersection. This scheme only allows participants who are clients to obtain multi-party intersection; it does not support unbalanced data sets (data set sizes between different participants are not equal). When the client packages the set into a linear vector and sends it to the server in an encrypted and blinded manner, the server needs to XOR all the linear vectors from the client to eliminate the anti-collusion factor. At this time, if the data set sizes between the clients are not equal, the structure of the linear vector will be inconsistent, and the anti-collusion factor cannot be eliminated, and thus the multi-party intersection cannot be obtained.

[0004] The main shortcomings of the Chinese application with publication number CN115883080A are: the inability to designate the first participant as the result party; and the ability to specify only one result party for intersection, while other participants are unable to obtain the intersection. The main shortcomings of the Chinese application with publication number CN115276985A are: the inability of the server-side participant to obtain the multi-party intersection, and its unsupport for scenarios with unbalanced datasets. As can be seen, the main shortcomings of the above-mentioned traditional solutions are as follows: the inability to designate the first participant as the result party; and the ability to specify only one result party for intersection, while other participants are unable to obtain the intersection. In practice, specifying only one participant for intersection is limited and cannot meet functional requirements such as sample alignment in federated learning. When the participants are equal, other participants also need to obtain the intersection. Due to the limitations of the solution process, only two parties hold datasets with implicit intersection. Furthermore, the traditional two-party private intersection protocol only supports one of the two parties obtaining the intersection. In other words, the traditional solution ultimately requires the two parties holding the datasets with implicit intersection to execute the two-party private intersection protocol, and only one of them can obtain the final multi-party intersection.

[0005] The simplest solution to ensure that every participant obtains the intersection is to execute the multi-party private intersection protocol multiple times, changing the designated participant to obtain the intersection each time. This simple solution has many drawbacks and limitations, such as long time consumption, high communication rounds, and a high proportion of repetitive work, making it difficult to deploy in real-world applications.

[0006] Therefore, how to improve it is a technical problem that needs to be solved urgently in this field. Summary of the Invention

[0007] To solve at least one of the above technical problems, the present invention provides a secret transmission method based on oblivious key-value pair storage, comprising:

[0008] Set n participants, respectively denoted as , input the private data set held by each participant, and confirm the encryption algorithm, oblivious key-value pair algorithm, encoding algorithm, and decoding algorithm;

[0009] Each participant generates a private key and distributes it to the corresponding participant; Unknown and P n-1 Commonly held key; P n and Unknown The key held;

[0010] Participants and , use all the keys you hold to encrypt your own private data set, and encode the key-value pair data and , sent to the participants respectively and ; ;

[0011] Participants and , respectively taking their own data sets as input and decoding the received key-value pair data and , and then use your own key to calculate the encrypted data and , according to the encrypted data and Calculate key-value pair data and , sent to participants ; or directly shuffle and send to the participants ;

[0012] If the participants and , encrypt the data and Calculate key-value pair data and , sent to participants , then the participants Key-value pair data and Decode and compare the decoding results to obtain the elements in the multi-party intersection;

[0013] If the participants and , the decoded data and Directly shuffle and send to , then participate Find the intersection of two data , sent to and and Each party holds and Compare with the intersection to get the elements in the multi-party intersection; or , take the elements in the multi-party intersection as the key, and the intersection corresponding to the multi-party intersection elements As a value, the encoded OKVS data structure is obtained or , sent to ; OKVS data structure or Decode the data in the decoder and compare the decoded result with the private data set to obtain the elements in the multi-party intersection.

[0014] Furthermore, each participant generates a private key and distributes it to the corresponding participant, specifically:

[0015] Participants Randomly generate a key , and Send to ,in Participants Randomly generate a key , and Send to .

[0016] Furthermore, the step of obtaining the element in the multi-party intersection is specifically as follows: comparing each row of the data, if a row is equal, then the original data set indexed by the row is the element in the multi-party intersection.

[0017] Further, step 1: set The parties jointly execute the agreement, which are respectively , each holding a private dataset , Indicates the size of the data set; the encryption algorithm is expressed as , which can be a hash algorithm; encoding algorithm, expressed as , decoding algorithm, expressed as ;

[0018] Step 2: Generate random, uniformly distributed keys , and Send to ,in ; Generate random, uniformly distributed keys , and Send to ;

[0019] Step 3: Use your own key to encrypt your private dataset, and use your private dataset as the key and the encrypted dataset as the value to encode the key-value pair data: OKVS data ,Will Send to ; Use your own key to encrypt your private dataset, and use your private dataset as the key and the encrypted dataset as the value to encode the key-value pair data: OKVS data structure ,Will Send to ;

[0020] Take your own dataset as input and decode the OKVS data structure ,calculate ; Take your own dataset as input and decode the OKVS data structure ,calculate ; and hold and , calculate the OKVS data structure respectively and , and send it to ;

[0021] Step 4: Participants , using one's own private dataset For input, respectively for key-value pair data and Decode and get the decoded data and , compare each row, if a row is equal, it means that the row index is The original data set is the element in the multi-party intersection;

[0022] Will and Equal elements in are sent to and After data comparison, and Get the elements in the multi-party intersection; The intersection element index The decoded values ​​are sent back to After data comparison, Get the elements of the multi-party intersection.

[0023] Furthermore, data comparison is specifically to store the original data into a hash table and then perform a search and comparison.

[0024] Further, step 1: set The parties jointly execute the agreement, which are respectively , each holding a private dataset , Indicates the size of the data set; the encryption algorithm is expressed as , which can be a hash algorithm; encoding algorithm, expressed as , decoding algorithm, expressed as ;

[0025] Step 2: Generate random, uniformly distributed keys , and Send to ,in ; Generate random, uniformly distributed keys , and Send to ;

[0026] Step 3: Use your own key to encrypt your private dataset, and use your private dataset as the key and the encrypted dataset as the value to encode the key-value pair data: OKVS data ,Will Send to ; Use your own key to encrypt your private dataset, and use your private dataset as the key and the encrypted dataset as the value to encode the key-value pair data: OKVS data structure ,Will Send to ;

[0027] Take your own dataset as input and decode the OKVS data structure ,calculate ; Take your own dataset as input and decode the OKVS data structure ,calculate ; and Respectively and After shuffling, send to ;

[0028] Step 4:

[0029] Received from and After the data set is shuffled, find the intersection of the two data sets , get the encrypted intersection data and send them to and ,After the two participants locally calculate and find the original data corresponding to the encrypted intersection data, the multi-party intersection data is obtained;

[0030] The real multi-party intersection element is used as the key, and the multi-party intersection element corresponds to As the value, the key-value pair data is obtained after encoding , sent to ; Input your own data set into the key-value pair data Decode it and get the data set , when the dataset An element and When they are equal, we know that the corresponding original input dataset elements are intersection elements; The intersection element index The decoded values ​​are sent back to After data comparison, Get the elements of the multi-party intersection.

[0031] On the other hand, the present invention also provides a computer-readable storage medium storing a computer program for executing any of the above-mentioned covert transmission methods.

[0032] In another aspect, the present invention provides a computer system comprising the above-mentioned computer-readable storage medium and one or more processors;

[0033] The processor is configured to run the computer program.

[0034] The present invention provides a secret transmission method, storage medium and system based on oblivious key-value pair storage. By decoding the OKVS data structure to align the data set and hide the key-value pair relationship characteristics, the problem of being unable to specify the first participant as the result party or the first participant as the result party can only obtain the intersection size but not the real intersection data is solved. The invention replaces the two-party privacy intersection protocol part in the traditional solution by applying the characteristics of low communication volume and high performance of the OKVS data structure encoding and decoding, which can reduce the total communication volume, reduce the protocol running time, and improve the protocol execution efficiency. Specifically, the present invention can reduce the total communication volume, reduce the protocol running time, and improve the protocol execution efficiency. or The OKVS codec implements a multi-party privacy intersection solution that allows the first participant to obtain the intersection without leaking additional information, with lower performance overhead and communication volume. BRIEF DESCRIPTION OF THE DRAWINGS

[0035] Figure 1 A flowchart of an embodiment of the covert transmission method of the present invention;

[0036] Figure 2 Schematic diagram of the flow of the first embodiment of the covert transmission method of the present invention;

[0037] Figure 3 FIG. 4 is a flow chart of a second embodiment of the covert transmission method of the present invention. DETAILED DESCRIPTION

[0038] 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. All other embodiments obtained by ordinary technicians in this field based on the embodiments of the present invention without making any creative efforts shall fall within the scope of protection of the present invention.

[0039] It should be noted that if the embodiments of the present invention involve directional indications, such as up, down, left, right, front, back, etc., such directional indications are only used to explain the relative positional relationship and movement of various components in a specific posture. If the specific posture changes, the directional indications will also change accordingly. In addition, if the embodiments of the present invention involve descriptions such as "first, second", "step one, step two", etc., such descriptions are only for descriptive purposes and cannot be understood as indicating or implying their relative importance, implicitly indicating the number of the indicated technical features, or indicating the execution order of the method. Those skilled in the art can understand that anything that does not violate the main points of the invention under the technical concept of the invention should be included in the scope of protection of the present invention.

[0040] Explanation of technical terms:

[0041] Multiparty Private Set Intersection (MP-PSI): Three or more parties own their own private datasets and jointly execute a multiparty private set intersection protocol. Except for the designated party that obtains the intersection data, no additional information other than the size of each party's dataset and the size of the intersection is disclosed to any other party.

[0042] Fair multi-party private intersection: Each participant has its own private dataset and jointly executes the multi-party private intersection protocol. All participants can obtain the intersection data without leaking any additional information to any participant except the size of each dataset and the size of the intersection.

[0043] Oblivious Key-Value Store (OKVS): This structure takes a list of key-value pairs as input and returns a special data structure. When decoding this structure, it accepts a key. If the key exists in the encoded list, it outputs the value corresponding to that key. Otherwise, it outputs an indistinguishable random value. This structure is used to conceal the key-value relationship when exchanging secret values ​​within the protocol, ensuring that no additional information is leaked to the other party.

[0044] like Figure 1As shown, the present invention provides a secret transmission method based on oblivious key-value pair storage, which relates to the field of secure multi-party computing technology and can be used for data processing and analysis. Common cryptographic primitives can be optionally used to achieve multi-party privacy intersection, which can be used for multi-party data alignment in federated learning to ensure secret data transmission and avoid information leakage and unequal sharing during data sharing. The method includes:

[0045] Step 1: Setup and input: Set n participants, denoted as , input the private data set held by each participant, and confirm the encryption algorithm, oblivious key-value pair algorithm, encoding algorithm, and decoding algorithm;

[0046] Specifically, through step 1, the initialization protocol is completed; n participants can be selected to jointly execute the protocol, which are recorded as , each holding a private dataset , Indicates the size of the data set; the encryption algorithm is expressed as , which can be a hash algorithm; encoding algorithm, expressed as , decoding algorithm, expressed as .

[0047] Step 2: Key distribution: Each participant generates a private key and distributes it to the corresponding participant; Unknown jointly held keys; and Unknown The key held;

[0048] Specifically, the key generation method and distribution method can be set arbitrarily by those skilled in the art, as long as the above requirements are met; more specifically, the private key is randomly generated, and optional , is a random uniform key; after it is distributed to the corresponding participants, Contains except k n All keys except Each participant holds at least one key; Including All keys except

[0049] Example:

[0050] Participants Randomly generate a key , and Send to ,in Participants Randomly generate a key , and Send to ;

[0051] Step 3: Oblivious key-value storage: Encode and decode the oblivious key-value storage data structure to hide the key-value pair relationship;

[0052] Participants and , use the key held by the party to encrypt the private data set, and encode the key-value pair data and , sent to the participants respectively and ; ;

[0053] Participants and , respectively taking their own data sets as input and decoding the received key-value pair data and , get the data and , optional For decoding The value is XORed and encrypted using the party's key; For decoding The value is XORed and encrypted using the own key; according to the data and Calculate key-value pair data and , sent to participants ; or directly shuffle and send to the participants ;

[0054] Step 4: Calculate the intersection

[0055] If the participants and , the data and Calculate key-value pair data and , sent to participants , then the participants , taking one's own private data set as input, respectively and Decode and get the decoded data and , to obtain the elements in the multi-party intersection; preferably, the step of obtaining the elements in the multi-party intersection can be optionally as follows: comparing each row of the data, if a row is equal, then the original data set indexed by the row is the element in the multi-party intersection.

[0056] If the participants and , the data and Directly shuffle and send to , then the participants Find the intersection of two data , sent to and and Compare your own private data with the intersection to get the elements in the intersection;

[0057] or , take the elements in the multi-party intersection as the key, and the intersection corresponding to the multi-party intersection elements As a value, the encoded OKVS data structure is obtained , sent to ; Your own data set Input to OKVS data structure Decode it and get the data set , compared with one's own private data set, and get the elements in the multi-party intersection; for example, when the data set An element and When they are equal, we know that the corresponding original input dataset elements are intersection elements.

[0058] The intersection element index The decoded values ​​are sent back to After data comparison, Get the elements in the multi-party intersection; for example, when right The decoded value and When the secret values ​​encrypted using the held key are equal, it can be known that the corresponding original input dataset elements are intersection elements.

[0059] In this embodiment, the present invention provides a secret transmission method based on oblivious key-value pair storage. By decoding the OKVS data structure to align the data set and hide the key-value pair relationship characteristics, the problem of being unable to specify the first participant as the result party or the first participant as the result party can only obtain the intersection size but not the real intersection data is solved. The invention replaces the two-party privacy intersection protocol part in the traditional solution by applying the characteristics of low communication volume and high performance of the OKVS data structure encoding and decoding, which can reduce the total communication volume, reduce the protocol running time, and improve the protocol execution efficiency. Specifically, the present invention can reduce the total communication volume, reduce the protocol running time, and improve the protocol execution efficiency. The OKVS codec implements a multi-party privacy intersection solution that allows the first participant to obtain the intersection without leaking additional information, with lower performance overhead and communication volume.

[0060] Example 1, as Figure 2 As shown:

[0061] Step 1: Setup The parties jointly execute the agreement, which are respectively , each holding a private dataset , Indicates the size of the data set; the encryption algorithm is expressed as , which can be a hash algorithm; encoding algorithm, expressed as , decoding algorithm, expressed as .

[0062] Step 2: Generate random, uniformly distributed keys , and Send to ,in . Generate random, uniformly distributed keys , and Send to .

[0063] Step 3:

[0064] Use your own key to encrypt your private dataset, and use your private dataset as the key and the encrypted dataset as the value to encode the key-value pair data: OKVS data ,Will Send to ; Use your own key to encrypt your private dataset, and use your private dataset as the key and the encrypted dataset as the value to encode the key-value pair data: OKVS data structure ,Will Send to ;

[0065] Take your own dataset as input and decode the OKVS data structure ,calculate ; Take your own dataset as input and decode the OKVS data structure ,calculate ; and hold and , calculate the OKVS data structure respectively and , and send it to ;

[0066] Step 4:

[0067] Participants , using one's own private dataset For input, respectively for key-value pair data and Decode and get the decoded data and , compare each row, if a row is equal, it means that the row index is The original data are the elements in the multi-party intersection.

[0068] Send the elements in the multi-party intersection to other participants, and other participants will compare the data and obtain the elements in the multi-party intersection. Will and Equal rows are sent to and Due to the characteristics of the OKVS data structure, when and When there are equal rows in The decoding gets the correct value, that is, it matches the correct intersection, so or This can be done by comparing the dataset used when encoding the OKVS data structure. or , each obtains the real multi-party intersection data.

[0069] The intersection element index The decoded values ​​are sent back to After data comparison, Get the elements in the multi-party intersection; for example, when right The decoded value and When the encrypted values ​​using the held key are equal, it can be known that the corresponding original input data set elements are intersection elements. In this embodiment, Unknown Generated key , so it is not possible to receive the OKVS data structure or Reverse The original dataset; , ,Right now: Only encode your own data set into the OKVS data structure and send it to , will not receive additional information from other participants, nor will it know the original data sets of other parties; Unknown The key held, therefore receiving the OKVS data structure Therefore, each party cannot obtain the original dataset of the other party, but can decode the elements of the multi-party intersection through oblivious key-value storage. This is a secret transmission method for multi-party fair and private intersection without leaking additional information.

[0070] Steps 1 and 2 are the same as those in Example 1;

[0071] Step 3:

[0072] Use your own key to encrypt your private dataset, and use your private dataset as the key and the encrypted dataset as the value to encode the key-value pair data: OKVS data ,Will Send to ; Use your own key to encrypt your private dataset, and use your private dataset as the key and the encrypted dataset as the value to encode the key-value pair data: OKVS data structure ,Will Send to ;

[0073] Take your own dataset as input and decode the OKVS data structure ,calculate ; Take your own dataset as input and decode the OKVS data structure ,calculate ; and Respectively and After shuffling, send to ;

[0074] Step 4:

[0075] Received from and After the data set is shuffled, find the intersection of the two data sets , get the encrypted intersection data and send them to and ,After the two participants locally calculate and find the original data corresponding to the encrypted intersection data, the multi-party intersection data is obtained;

[0076] The real multi-party intersection element is used as the key, and the multi-party intersection element corresponds to As the value, the key-value pair data is obtained after encoding , sent to ; Your own data set Input to key-value pair data Decode it and get the data set , when the dataset An element and When they are equal, we know that the corresponding original input dataset elements are intersection elements.

[0077] In this embodiment, the same Unknown Generated key , so it is impossible to pass the received encrypted data set and OKVS data structure Reverse infer the original data of other participants; Only send your own data set to the encrypted , and receive Compare and intersect the encrypted dataset subsets obtained; Only know Generated key , so it receives OKVS data structure sent When Therefore, the multi-party fair privacy intersection scheme of the present invention will not leak additional information.

[0078] By applying the OKVS encoding and decoding characteristics, this invention solves the problem of being unable to designate the first participant as the result party, or when the first participant is the result party, only the intersection size can be obtained but not the actual intersection data. This fair multi-party private intersection scheme optimizes and improves the traditional multi-party private intersection scheme process, achieving a single execution of the multi-party private intersection task while allowing all participants to obtain the intersection without leaking additional information to any participant. By increasing the number of communication rounds and computational complexity, a simple and high-performance fair multi-party private intersection scheme is achieved, and the increased resource consumption is far less than the additional resource consumption caused by executing traditional multi-party private intersection schemes multiple times.

[0079] The traditional multi-party privacy intersection solution only supports specifying one participant to obtain the intersection. In the scenario where multiple participants need to obtain the intersection, it is necessary to execute the traditional multi-party privacy intersection solution multiple times and exchange the roles of the participants in each execution to ensure that each party obtains the intersection. Compared with the traditional solution, the multi-party fair privacy intersection solution of the present invention has a better performance in terms of the number of participants holding the same person. and The two parties perform a two-party privacy request protocol, only through or The OKVS codec achieves a multi-party private intersection solution that allows the first participant to obtain the intersection, without leaking any additional information, resulting in lower performance overhead and communication traffic. Furthermore, the present invention allows all participants to obtain the intersection in a single protocol execution without leaking any additional information. Compared to traditional schemes that execute multiple times, our scheme offers a simple structure, low communication rounds, and efficient protocol, resulting in excellent performance and adaptability to a wider range of application scenarios, such as sample alignment in federated learning.

[0080] On the other hand, the present invention further provides a computer storage medium storing executable program code; the executable program code is used to execute any of the above-mentioned data generation methods or image recognition methods.

[0081] On the other hand, the present invention also provides a terminal device, including a memory and a processor; the memory stores program code that can be executed by the processor; the program code is used to execute any of the above-mentioned data generation methods or image recognition methods.

[0082] Exemplarily, the program code may be divided into one or more modules / units, which are stored in the memory and executed by the processor to implement the present invention. The one or more modules / units may be a series of computer program instruction segments capable of performing specific functions, which are used to describe the execution process of the program code in the terminal device.

[0083] The terminal device may be a computing device such as a desktop computer, laptop, PDA, or cloud server. The terminal device may include, but is not limited to, a processor and memory. Those skilled in the art will appreciate that the terminal device may also include input / output devices, network access devices, buses, and the like.

[0084] The processor may be a central processing unit (CPU), other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or any conventional processor, etc.

[0085] The memory may be an internal storage unit of the terminal device, such as a hard disk or memory. Alternatively, the memory may be an external storage device of the terminal device, such as a plug-in hard disk, a SmartMedia Card (SMC), a Secure Digital (SD) card, a flash memory card, etc. Furthermore, the memory may include both an internal storage unit of the terminal device and an external storage device. The memory is used to store the program code and other programs and data required by the terminal device. The memory may also be used to temporarily store data that has been output or is about to be output.

[0086] The above-mentioned image recognition method, computer storage medium and terminal device are created based on the above-mentioned data generation method. Their technical functions and beneficial effects are not repeated here. The various technical features of the above-mentioned embodiments can be combined arbitrarily. In order to make the description concise, not all possible combinations of the various technical features in the above-mentioned embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0087] The above-described embodiments merely illustrate several implementations of the present invention. While the descriptions are relatively specific and detailed, they should not be construed as limiting the scope of the present invention. It should be noted that a person skilled in the art would be able to make numerous variations and improvements without departing from the spirit of the present invention, and all such variations and improvements fall within the scope of protection of the present invention.

Claims

1. A secret transmission method based on oblivious key-value pair storage, characterized in that: include: set up Participants, respectively , input the private data set held by each participant, and confirm the encryption algorithm, oblivious key-value pair algorithm, encoding algorithm, and decoding algorithm; Each participant generates a private key and distributes it to the corresponding participant; Unknown and jointly held keys; and Unknown The key held; Participants and , use all the keys you hold to encrypt your own private data set, and encode the key-value pair data and , sent to the participants respectively and ; ; Participants and , respectively taking their own data sets as input and decoding the received key-value pair data and , get the decoded data and , according to the decoded data and Calculate key-value pair data and , sent to participants ; or directly shuffle and send to the participants ; If the participants and , encrypt the decoded data with your own key to obtain and , encoding key-value pair data and , sent to participants , then the participants Key-value pair data and Decode and compare the decoding results to obtain the elements in the multi-party intersection; If the participants and , encrypt the decoded data with your own key to obtain and , and then send it to , then the participants Find the intersection of two data , sent to and and Each party holds and Compare with the intersection to get the elements in the multi-party intersection; or , the intersection corresponding to the multi-party intersection elements After encoding, the OKVS data structure is obtained or , sent to ; OKVS data structure or Decode and compare the decoding result with your own private data set to obtain the elements in the multi-party intersection.

2. The secret transmission method according to claim 1, characterized in that: Each participant generates a private key and distributes it to the corresponding participant, specifically: Participants Randomly generate a key , and Send to ,in Participants Randomly generate a key , and Send to .

3. The secret transmission method according to claim 1, characterized in that: The steps for obtaining the elements in the multi-party intersection are as follows: comparing each row of the data; if a row is equal, the original data set indexed by the row is the element in the multi-party intersection.

4. The secret transmission method according to claim 1, characterized in that: Specifically: Step 1: Setup The parties jointly execute the agreement, which are respectively , each holding a private dataset , Indicates the size of the data set; the encryption algorithm is expressed as , which can be a hash algorithm; encoding algorithm, expressed as , decoding algorithm, expressed as ; Step 2: Generate random, uniformly distributed keys , and Send to ,in ; Generate random, uniformly distributed keys , and Send to ; Step 3: Use your own key to encrypt your private dataset, and use your private dataset as the key and the encrypted dataset as the value to encode the key-value pair data: OKVS data ,Will Send to ; Use your own key to encrypt your private dataset, and use your private dataset as the key and the encrypted dataset as the value to encode the key-value pair data: OKVS data structure ,Will Send to ; Take your own dataset as input and decode the OKVS data structure ,calculate ; Take your own dataset as input and decode the OKVS data structure ,calculate ; and hold and , calculate the OKVS data structure respectively and , and send it to ; Step 4: Participants , using one's own private dataset For input, respectively for key-value pair data and Decode and get the decoded data and , compare each row, if a row is equal, it means that the row index is The original data are the elements in the multi-party intersection; Will and Equal elements in are sent to and After data comparison, and Get the elements in the multi-party intersection; The intersection element index The decoded values ​​are sent back to After data comparison, Get the elements of the multi-party intersection.

5. The secret transmission method according to claim 4, characterized in that: Specifically: data comparison, specifically storing the original data in a hash table, and then performing search and comparison.

6. The secret transmission method according to claim 1, characterized in that: Specifically: Step 1: Setup The parties jointly execute the agreement, which are respectively , each holding a private dataset , Indicates the size of the data set; the encryption algorithm is expressed as , which can be a hash algorithm; encoding algorithm, expressed as , decoding algorithm, expressed as ; Step 2: Generate random, uniformly distributed keys , and Send to ,in ; Generate random, uniformly distributed keys , and Send to ; Step 3: Use your own key to encrypt your private dataset, and use your private dataset as the key and the encrypted dataset as the value to encode the key-value pair data: OKVS data ,Will Send to ; Use your own key to encrypt your private dataset, and use your private dataset as the key and the encrypted dataset as the value to encode the key-value pair data: OKVS data structure ,Will Send to ; Take your own dataset as input and decode the OKVS data structure ,calculate ; Take your own dataset as input and decode the OKVS data structure ,calculate ; and Respectively and After shuffling, send to ; Step 4: Received from and After the data set is shuffled, find the intersection of the two data sets , get the encrypted intersection data and send them to and ,After the two participants locally calculate and find the original data corresponding to the encrypted intersection data, the multi-party intersection data is obtained; The real multi-party intersection element is used as the key, and the multi-party intersection element corresponds to As the value, the key-value pair data is obtained after encoding , sent to ; Input your own data set into the key-value pair data Decode it and get the data set , when the dataset An element and When they are equal, we know that the corresponding original input dataset elements are intersection elements; The intersection element index The decoded values ​​are sent back to After data comparison, Get the elements of the multi-party intersection.

7. A computer-readable storage medium, characterized in that A computer program for executing the secret transmission method according to any one of claims 1 to 6 is stored thereon.

8. A computer system, characterized in that: comprising the computer-readable storage medium of claim 7 and one or more processors; The processor is configured to run the computer program.

Images