Data sharing methods, devices, equipment and storage media

The use of oblivious pseudo-random functions and secret sharing protocols enhances data sharing security and accuracy by hiding screening thresholds from the data provider, addressing the limitations of existing methods.

CN115603905BActive Publication Date: 2024-12-03CCB FINTECH CO LTD
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202211219631.3
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-09-30
Publication Date
2024-12-03
Estimated Expiration
2042-09-30

AI Technical Summary

Technical Problem

Existing data sharing methods, such as privacy set intersection, lack accuracy and security due to the inability to use features or judgment conditions beyond the sample set dimension, leading to potential data leakage when additional screening conditions are shared with the data provider.

Method used

Implementing an oblivious pseudo-random function calculation protocol and additive/multiplicative secret sharing methods to generate and process secret slices, ensuring data security by keeping screening thresholds hidden from the data provider, and using oblivious transfer to determine data intersections without revealing sensitive information.

Benefits of technology

Ensures privacy and security during data sharing by preventing leakage of screening thresholds, enhancing accuracy and effectiveness of data intersection calculations.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN115603905B_ABST
    Figure CN115603905B_ABST
Patent Text Reader

Abstract

The present disclosure provides a data sharing method, device, equipment and storage medium, which can be applied to the fields of big data technology and encryption technology. The method includes: interacting with a data provider based on an oblivious pseudo-random function calculation protocol to determine a first sample mask set of a first set of samples to be matched; using an additive secret sharing method and a multiplication secret re-sharing method to respectively generate a first multiplication secret slice and a second multiplication secret slice; based on an oblivious transfer protocol, using the symbol value of each first slice element in the first multiplication secret slice and the symbol value of each second slice element in the second multiplication secret slice to process a random number set to obtain a first screening mask set; performing intersection calculation based on the first sample mask set, the first screening mask set and the first double mask set to determine a data intersection from at least one first sample to be matched.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present disclosure relates to the field of information security technology, and in particular to a data sharing method, device, equipment, medium and program product. Background Art

[0002] Data sharing, interaction and collaboration help to better leverage the value of data and empower related scenarios and institutions. As the demand for data security and privacy protection continues to increase, security risks such as data leakage need to be avoided during data sharing and collaboration between institutions.

[0003] In the related art, methods such as privacy set intersection are usually used to extract and screen samples shared by data providers and data demanders, and to protect data outside the sample intersection from being leaked. However, the privacy set intersection method in the related art can only perform intersection screening in the dimension of the sample set, and cannot use other features contained in the sample and its judgment conditions as the basis for screening. If screening is required based on other features or judgment conditions, the other features or judgment conditions need to be sent to the data provider, which is not conducive to the privacy protection of the data demander. Therefore, in the related art, when conducting data sharing interactive collaboration, there are at least technical problems of poor accuracy and low data security. Summary of the invention

[0004] In view of the above problems, the present disclosure provides a data sharing method, apparatus, device, medium and program product.

[0005] One aspect of the present disclosure provides a data sharing method, which is applied to a data demand side. The method includes: interacting with a data provider based on an inadvertent pseudo-random function calculation protocol to determine a first sample mask set of a first set of samples to be matched, wherein the first set of samples to be matched includes at least one first sample to be matched; based on a preset screening threshold, using an additive secret sharing method and a multiplicative secret re-sharing method to generate a first multiplication secret slice and a second multiplication secret slice respectively, wherein the first multiplication secret slice includes n first slice elements, and the second multiplication secret slice includes n second slice elements. prime, wherein the above n is a positive integer; in response to receiving the random number set sent by the above data provider, based on the oblivious transfer protocol, processing the above random number set using the sign value of each first slice element in the above first multiplication secret slice and the sign value of each second slice element in the above second multiplication secret slice to obtain a first screening mask set; and in response to receiving the first double mask set sent by the above data provider, performing intersection calculation based on the first sample mask set, the first screening mask set and the first double mask set to determine a data intersection from at least one of the above first samples to be matched.

[0006] Another aspect of the present disclosure provides a data sharing method, which is applied to a data provider, and the method includes: interacting with a data demander based on an oblivious pseudo-random function calculation protocol to determine a second sample mask set of a second to-be-matched sample set; using an additive secret sharing method and a multiplicative secret re-sharing method to respectively generate a third multiplication secret slice and a fourth multiplication secret slice, wherein the third multiplication secret slice includes n fifth slice elements, and the fourth multiplication secret slice includes n sixth slice elements, where n is a positive integer; based on an oblivious transfer protocol, using each of the fifth slice elements in the third multiplication secret slice The initial random number set is processed by using the symbol value of each of the sixth slice elements in the fourth multiplication secret slice to obtain a random number set, and the random number set is sent to the data demand end, wherein the initial random number set includes multiple third random number elements, and the third random number elements include three unequal random numbers; the second sample mask set is embedded with the initial random number set to obtain a first double mask set; and the first double mask set is sent to the data demand end, wherein the data demand end is configured to perform intersection calculation based on the first double mask set to determine the data intersection.

[0007] Another aspect of the present disclosure provides a data sharing device, which is configured at a data demand end, and the device includes: a first determination module, which is used to interact with a data provider end based on an inadvertent pseudo-random function calculation protocol to determine a first sample mask set of a first set of samples to be matched, wherein the first set of samples to be matched includes at least one first sample to be matched; a first generation module, which is used to generate a first multiplication secret slice and a second multiplication secret slice respectively based on a preset screening threshold by using an additive secret sharing method and a multiplication secret re-sharing method, wherein the first multiplication secret slice includes n first slice elements, and the second multiplication secret slice includes n second slice elements. The first processing module is used for, in response to receiving the random number set sent by the data provider, processing the random number set based on the oblivious transfer protocol using the sign value of each first slice element in the first multiplication secret slice and the sign value of each second slice element in the second multiplication secret slice to obtain a first screening mask set; and the first calculation module is used for, in response to receiving the first double mask set sent by the data provider, performing intersection calculation based on the first sample mask set, the first screening mask set and the first double mask set to determine a data intersection from at least one of the first samples to be matched.

[0008] Another aspect of the present disclosure provides a data sharing device, which is configured at a data providing end, and the device includes: a second determining module, which is used to interact with a data demand end based on an oblivious pseudo-random function calculation protocol to determine a second sample mask set of a second to-be-matched sample set; a second generating module, which is used to generate a third multiplication secret slice and a fourth multiplication secret slice respectively by using an additive secret sharing method and a multiplication secret re-sharing method, wherein the third multiplication secret slice includes n fifth slice elements, and the fourth multiplication secret slice includes n sixth slice elements, and the n is a positive integer; a second processing module, which is used to generate a third multiplication secret slice and a fourth multiplication secret slice respectively by using an additive secret sharing method and a multiplication secret re-sharing method, wherein the third multiplication secret slice includes n fifth slice elements, and the fourth multiplication secret slice includes n sixth slice elements, and the n is a positive integer; The initial random number set is processed by the sign value of the slice element and the sign value of each of the sixth slice elements in the fourth multiplication secret slice to obtain a random number set, and the random number set is sent to the data demand end, wherein the initial random number set includes multiple third random number elements, and the third random number elements include three unequal random numbers; a second calculation module is used to use the initial random number set to perform embedded calculation on the second sample mask set to obtain a first double mask set; and a sending module is used to send the first double mask set to the data demand end, wherein the data demand end is configured to perform intersection calculation based on the first double mask set to determine the data intersection.

[0009] Another aspect of the present disclosure provides an electronic device, comprising: one or more processors; and a memory for storing one or more programs, wherein when the one or more programs are executed by the one or more processors, the one or more processors execute the above method.

[0010] Another aspect of the present disclosure further provides a computer-readable storage medium having executable instructions stored thereon, which, when executed by a processor, causes the processor to perform the above method.

[0011] Another aspect of the present disclosure further provides a computer program product, including a computer program, which implements the above method when executed by a processor.

[0012] According to the data sharing method, device, equipment, medium and program product provided by the present disclosure, for the first set of samples to be matched determined by the data demand end, the first sample mask set is determined by using the inadvertent pseudo-random function calculation protocol to interact with the data provider end, and then the multiplication secret is re-shared based on the preset screening threshold, and the obtained multiplication secret fragment is inadvertently transmitted to obtain the first screening mask set, and then the privacy intersection is performed based on the received first double mask set, and the first sample mask set and the first screening mask set, so that the data intersection of the first set of samples to be matched and the second set of samples to be matched on the data provider end can be determined without leaking the preset screening threshold and ensuring the security of the samples. Therefore, the technical problems of poor accuracy and low data security in the related art when performing data sharing interactive collaboration are at least partially solved, effectively ensuring the privacy security during data sharing, and improving the accuracy of data sharing. BRIEF DESCRIPTION OF THE DRAWINGS

[0013] The above contents and other objects, features and advantages of the present disclosure will become more apparent through the following description of the embodiments of the present disclosure with reference to the accompanying drawings, in which:

[0014] Figure 1 The application scenario diagram of the data sharing method and device according to the embodiments of the present disclosure is schematically shown.

[0015] Figure 2 A flowchart of a data sharing method applied to a data demand side according to an embodiment of the present disclosure is schematically shown.

[0016] Figure 3 The flowchart of the method for generating the first multiplication secret fragment and the second multiplication secret fragment according to the embodiment of the present disclosure is schematically shown.

[0017] Figure 4 The flowchart of inadvertent transmission of data demand side according to an embodiment of the present disclosure is schematically shown.

[0018] Figure 5 The flowchart of the intersection calculation method according to the embodiment of the present disclosure is schematically shown.

[0019] Figure 6 The flowchart of the data sharing method applied to the data provider according to the embodiment of the present disclosure is schematically shown.

[0020] Figure 7 The structural block diagram of a data sharing device configured at a data demand end according to an embodiment of the present disclosure is schematically shown.

[0021] Figure 8 The structural block diagram of a data sharing device configured at a data providing end according to an embodiment of the present disclosure is schematically shown.

[0022] Fig. 9 A block diagram of an electronic device suitable for implementing a data sharing method according to an embodiment of the present disclosure is schematically shown. DETAILED DESCRIPTION

[0023] Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. However, it should be understood that these descriptions are exemplary only and are not intended to limit the scope of the present disclosure. In the following detailed description, for ease of explanation, many specific details are set forth to provide a comprehensive understanding of the embodiments of the present disclosure. However, it is apparent that one or more embodiments may also be implemented without these specific details. In addition, in the following description, descriptions of known structures and technologies are omitted to avoid unnecessary confusion of the concepts of the present disclosure.

[0024] The terms used herein are only for describing specific embodiments and are not intended to limit the present disclosure. The terms "comprise", "include", etc. used herein indicate the existence of the features, steps, operations and / or components, but do not exclude the existence or addition of one or more other features, steps, operations or components.

[0025] All terms (including technical and scientific terms) used herein have the meanings commonly understood by those skilled in the art, unless otherwise defined. It should be noted that the terms used herein should be interpreted as having a meaning consistent with the context of this specification, and should not be interpreted in an idealized or overly rigid manner.

[0026] When using expressions such as "at least one of A, B, and C, etc.", they should generally be interpreted according to the meaning of the expression commonly understood by those skilled in the art (for example, "a system having at least one of A, B, and C" should include but is not limited to a system having A alone, B alone, C alone, A and B, A and C, B and C, and / or A, B, C, etc.).

[0027] In the technical solution of the present disclosure, the collection, storage, use, processing, transmission, provision, disclosure and application of the data involved (such as but not limited to identity identification and business identification) comply with the provisions of relevant laws and regulations, take necessary confidentiality measures, and do not violate public order and good morals.

[0028] Data sharing, interaction and collaboration help to better leverage the value of data and empower related scenarios and institutions. As the demand for data security and privacy protection continues to increase, data leakage and other security risks need to be avoided during data sharing and collaboration between institutions. In related technologies, methods such as privacy set intersection are usually used to extract and screen samples shared by both parties, and protect data outside the sample intersection from being leaked. It is widely used in scenarios such as joint marketing, federated learning, advertising, and customer recovery.

[0029] However, the privacy set intersection method in the related art can only perform intersection screening in the dimension of the sample set, and cannot use other features contained in the sample and its judgment conditions as the basis for screening. If screening is required based on other features or judgment conditions, the other features or judgment conditions need to be sent to the data provider, which is not conducive to the privacy protection of the data demander. Taking the sample screening scenario between the data demander and the data provider as an example, when the data demander hopes that the sample set of its own party and the sample set of the other party meet the screening conditions, for example, for the sample "registration time ≠ 2021" which is not equal to the judgment condition, a conditional privacy intersection is performed, then the additional screening condition "registration time ≠ 2021" can only be sent to the data provider, and this method will cause the screening conditions to be leaked, which is not conducive to the privacy protection of the data demander.

[0030] In view of this, the embodiments of the present disclosure provide a data sharing method, apparatus, device, medium and program product, which can support the intersection of privacy sets that are not equal to the strategy when sharing data between the data demand side and the data provider side, thereby effectively protecting the sample set and screening added privacy of the data demand side. The data provider side cannot recognize any valid information about the screening conditions, thereby achieving a higher level of privacy protection effect, and realizing safer, more accurate and more effective sample intersection and data sharing.

[0031] Specifically, the data sharing method can be applied to a data demand end, and the method includes: interacting with a data provider end based on an oblivious pseudo-random function calculation protocol to determine a first sample mask set of a first set of samples to be matched, wherein the first set of samples to be matched includes at least one first sample to be matched; based on a preset screening threshold, using an additive secret sharing method and a multiplication secret re-sharing method to generate a first multiplication secret slice and a second multiplication secret slice respectively, wherein the first multiplication secret slice includes n first slice elements, and the second multiplication secret slice includes n second slice elements, and n is a positive integer; in response to receiving a random number set sent by the data provider end, based on an oblivious transfer protocol, using the sign value of each first slice element in the first multiplication secret slice and the sign value of each second slice element in the second multiplication secret slice to process the random number set to obtain a first screening mask set; and in response to receiving a first dual mask set sent by the data provider end, performing intersection calculation based on the first sample mask set, the first screening mask set and the first dual mask set to determine a data intersection from at least one first sample to be matched.

[0032] Figure 1 The application scenario diagram of the data sharing method and device according to the embodiments of the present disclosure is schematically shown.

[0033] like Figure 1 As shown, the application scenario 100 according to this embodiment may include a first terminal device 101 , a second terminal device 102 , a third terminal device 103 and a network 104 .

[0034] The first terminal device 101, the second terminal device 102, and the third terminal device 103 may be any type of electronic device, including but not limited to a smart phone, a tablet computer, a laptop computer, a desktop computer, etc. In some application scenarios, the first terminal device 101, the second terminal device 102, and the third terminal device 103 may also be replaced by a server or a server cluster.

[0035] The network 104 is used to provide a medium for a communication link between the first terminal device 101, the second terminal device 102, and the third terminal device 103. The network 104 may include various connection types, such as wired, wireless communication links, or optical fiber cables.

[0036] Any one of the first terminal device 101, the second terminal device 102, and the third terminal device 103 (for example, the first terminal device 101) can be used as a data demand end, and another terminal device other than the terminal device (for example, the second terminal device 102) can be used as a data provider end. That is, the data sharing method applied to the data demand end provided in the embodiment of the present disclosure can be executed by the first terminal device 101, and the data sharing method applied to the data provider end can be executed by the second terminal device 102. Accordingly, the data sharing device configured at the data demand end provided in the embodiment of the present disclosure can be set in the first terminal device 101, and the data sharing device configured at the data provider end can be set in the second terminal device 102, so as to realize data sharing between the first terminal device 101 and the second terminal device 102.

[0037] It should be understood that Figure 1 The number of terminal devices and networks in the embodiment is only for illustration. Any number of terminal devices and networks may be provided according to implementation requirements.

[0038] The following will be based on Figure 1 The scene described by Figure 2 to Figure 6 The data sharing method of the disclosed embodiment is described in detail.

[0039] Figure 2 A flowchart of a data sharing method applied to a data demand side according to an embodiment of the present disclosure is schematically shown.

[0040] like Figure 2 As shown, the data sharing method of this embodiment includes operations S210 to S240.

[0041] In operation S210, an interaction is performed with a data provider based on an inadvertent pseudo-random function calculation protocol to determine a first sample mask set of a first set of samples to be matched, wherein the first set of samples to be matched includes at least one first sample to be matched.

[0042] In operation S220, based on a preset screening threshold, a first multiplication secret slice and a second multiplication secret slice are generated respectively using an addition secret sharing method and a multiplication secret re-sharing method, the first multiplication secret slice includes n first slice elements, the second multiplication secret slice includes n second slice elements, and n is a positive integer.

[0043] In operation S230, in response to receiving a set of random numbers sent by a data provider, based on an oblivious transfer protocol, the set of random numbers is processed using the sign value of each first slice element in the first multiplication secret slice and the sign value of each second slice element in the second multiplication secret slice to obtain a first screening mask set.

[0044] In operation S240, in response to receiving the first dual mask set sent by the data provider, an intersection calculation is performed based on the first sample mask set, the first screening mask set and the first dual mask set to determine a data intersection from at least one first sample to be matched.

[0045] According to an embodiment of the present disclosure, the first set of samples to be matched can be represented as A={ID1, ..., ID m}, where ID k It can represent the kth first sample to be matched. The first sample to be matched can be an identification code such as an identity identifier, a business identifier, etc. that can be bound one-to-one with the identified object.

[0046] According to an embodiment of the present disclosure, an oblivious pseudo-random function (OPRF) calculation protocol may be a type of pseudo-random function calculation protocol, in which a function value receiver may randomly generate a random number r, and a sender may generate a random number s. The receiver and the sender may interact with each other through a calculation protocol to enable the receiver to obtain the value of a random function F(r, s) without knowing s. The random function F(·) used in the oblivious pseudo-random function calculation protocol may be agreed upon in advance between the data demand end and the data provider end, and the specific representation of the random function is not limited herein.

[0047] According to the embodiments of the present disclosure, when implementing the oblivious pseudo-random function calculation protocol, the data provider can generate a random number s, and after two-end interaction, the data provider can obtain the value of the random function, that is, the first sample mask set, without knowing the random number s. Since the change of the random number s will cause the change of the value of the random function, in this way, the first sample mask set generated each time the data is shared is different, thereby effectively ensuring the forward security of data sharing.

[0048] According to an embodiment of the present disclosure, the generated first sample mask set can be expressed as S={F(ID1,s),...,F(ID m , s)}={s1,…,s m}.

[0049] According to an embodiment of the present disclosure, after obtaining the first sample mask set, a cuckoo hash filter or other means may be used to process the first sample mask set to improve retrieval and matching performance.

[0050] According to an embodiment of the present disclosure, the preset screening threshold may be a value related to the screening condition when sharing data, and the preset screening threshold may be a real number determined by the data demand side according to a specific application scenario. For example, if the screening condition based on the not equal to policy is "registration time ≠ 2022", then the preset screening threshold may be set to 2022 accordingly.

[0051] According to the embodiments of the present disclosure, additive secret sharing can also be referred to as secret sharing (SS). When implementing additive secret sharing, for private data a, both parties can each master a random value x0, x1, satisfying a=x0+x1, x0, x1 is called the additive secret slice of a, and can also be recorded as (x0, x1)=[a]. Through the secret sharing mechanism, multi-party privacy calculations such as addition, subtraction, and multiplication can be realized.

[0052] According to the embodiment of the present disclosure, multiplicative re-sharing can be that for private data a, both parties have a random value u0, u1, satisfying a = u0·u1, which can also be expressed as (u0, u1) = In the initial state, both parties can each master the addition secret slice [a] of a, and without opening the private data a, each party can obtain the multiplication slice of a through the privacy algorithm. .

[0053] According to an embodiment of the present disclosure, an oblivious transfer (OT) protocol may be a type of cryptographic protocol that enables a data sender to send two copies of data to a data receiver, for example, x0 and x1, respectively. However, the data receiver can only receive one of the copies of data according to its own needs. For example, the data receiver can select one copy of data from x0 and x1 based on the value of a judgment identifier. This method ensures that the data sender cannot know the specific data received by the data receiver. Specifically, using the oblivious transfer method, for a set of random numbers, the data demander can selectively receive data from the set of random numbers based on the sign value of each first slice element in the first multiplication secret slice and the sign value of each second slice element in the second multiplication secret slice. The obtained first screening mask set is unknown to the data provider, so data security can be guaranteed during data transmission.

[0054] According to the data sharing method provided by the present disclosure, for the first set of samples to be matched determined by the data demand end, the first sample mask set is determined by using the inadvertent pseudo-random function calculation protocol to interact with the data provider end, and then the multiplication secret is re-shared based on the preset screening threshold, and the obtained multiplication secret fragment is inadvertently transmitted to obtain the first screening mask set, and then the privacy intersection is performed based on the received first double mask set, and the first sample mask set and the first screening mask set, so that the data intersection of the first set of samples to be matched and the second set of samples to be matched on the data provider end can be determined without leaking the preset screening threshold and ensuring the security of the samples. Therefore, the technical problems of poor accuracy and low data security in the related art when performing data sharing interactive collaboration are at least partially solved, effectively ensuring the privacy security during data sharing, and improving the accuracy of data sharing.

[0055] According to an embodiment of the present disclosure, the data provider may be configured with a second set of samples to be matched, the second set of samples to be matched includes n sample elements, and the sample elements include second samples to be matched and sample features. The second set of samples to be matched may be a full set of samples of the data provider, or a set of samples screened by the data provider according to certain rules.

[0056] In the following, the first set of samples to be matched is represented as A = {ID1, ..., ID m }, the second set of samples to be matched is expressed as As an example, the data sharing process between the data demand side and the data provider side is further explained. In the above formula, ID k It can represent the kth first sample to be matched, It can represent the kth second sample to be matched, x k represents the kth sample feature, m, n and k are all positive integers, and n≥m, n≥k.

[0057] Figure 3 The flowchart of the method for generating the first multiplication secret fragment and the second multiplication secret fragment according to the embodiment of the present disclosure is schematically shown.

[0058] like Figure 3 As shown, the method for generating the first multiplication secret slice and the second multiplication secret slice may include operations S301 to S305, and the method of operations S301 to S305 may be used to implement operation S220.

[0059] In operation S301 , a first screening condition and a second screening condition are determined based on a preset screening threshold using a not equal to screening strategy.

[0060] In operation S302, an additive secret sharing method is used to interact with a data provider based on a preset screening threshold to generate a first additive secret slice for a first screening condition, and the data provider is configured to generate a second additive secret slice for the first screening condition.

[0061] In operation S303, using the multiplication secret re-sharing method, based on the first additive secret slice, interacting with the data provider to generate a first multiplication secret slice about the first screening condition, the data provider is configured to generate a third multiplication secret slice about the first screening condition.

[0062] In operation S304, the additive secret sharing method is used to interact with the data provider based on a preset screening threshold to generate a third additive secret slice about the second screening condition, and the data provider is configured to generate a fourth additive secret slice about the second screening condition.

[0063] In operation S305, the multiplication secret re-sharing method is used to interact with the data provider based on the third addition secret slice to generate a second multiplication secret slice about the second screening condition, and the data provider is configured to generate a fourth multiplication secret slice about the second screening condition.

[0064] According to an embodiment of the present disclosure, taking the preset screening threshold a as an example, the first screening condition that can be determined using the inequality screening strategy can be expressed as xa, and the second screening condition can be expressed as ax.

[0065] According to an embodiment of the present disclosure, operation S302 may specifically include the following operations:

[0066] Based on a preset screening threshold, a first secret slice and a second secret slice are randomly generated, wherein the sum of the first secret slice and the second secret slice is the preset screening threshold; the second secret slice is sent to a data provider, wherein the data provider is configured to randomly generate a kth first feature slice and a kth second feature slice for the kth sample feature, generate a kth third slice element based on the kth second feature slice and the second secret slice, generate a second additive secret slice based on the n third slice elements, and send n first feature slices to a data demander; and in response to receiving the n first feature slices, for the kth first feature slice, generate a kth fourth slice element based on the kth first feature slice and the first secret slice, and generate a first additive secret slice based on the n fourth slice elements.

[0067] According to the embodiments of the present disclosure, taking the preset screening threshold a as an example, the data demand end can randomly generate a first secret slice a1 and a second secret slice a2 based on the preset screening threshold a, and satisfy a1+a2=a. The first secret slice a1 can be used to generate a first addition secret slice at the data demand end, and the second secret slice a2 can be sent to the data provider end for generating a second addition secret slice at the data provider end.

[0068] According to an embodiment of the present disclosure, the data provider may generate n sample features x1, ..., x2 in the second set of samples to be matched. n Perform additive secret sharding, that is, for any sample feature x k , randomly generate the first feature slice y k and the second feature slice z k , the sharding result can be expressed as [x1],…,[xn ], where [x k ]=(y k , z k ), satisfying x k =y k +z k . n first feature fragments y1,…,y n It can be used to send to the data demand side as the basis for the data demand side to generate the first addition secret fragment, n second feature fragments z1, ..., z n It can be used as a basis for the data provider to generate the second addition secret fragment.

[0069] According to an embodiment of the present disclosure, after receiving the second secret fragment a2, the data provider performs a k , z′ can be calculated k =z k -a2 is used as the kth third shard element. Accordingly, the second additive secret shard with respect to the first screening condition xa can be expressed as z′1,…,z′ n .

[0070] According to an embodiment of the present disclosure, upon receiving n first feature fragments y1, ..., y n Afterwards, for the first feature slice y k , we can calculate y′ k =y k -a1 is used as the kth fourth shard element. Accordingly, the first additive secret shard with respect to the first screening condition xa can be expressed as y′1,…,y′ n .

[0071] According to an embodiment of the present disclosure, the sharding result of the first addition secret sharing method can be expressed as [x k -a]=(y′ k , z′ k ), k=1,…,n.

[0072] According to an embodiment of the present disclosure, operation S303 may specifically include the following operations:

[0073] Obtaining the kth first preset parameter and the kth second preset parameter from the preset parameter group, wherein the data provider is configured to obtain the kth third preset parameter and the kth fourth preset parameter from the preset parameter group, wherein the kth first preset parameter, the kth second preset parameter, the kth third preset parameter and the kth fourth preset parameter meet the preset condition; calculating the kth first characteristic element based on the kth fourth slice element, the kth first preset parameter and the kth second preset parameter; sending the kth first characteristic element to the data provider, wherein the data provider is configured to Based on the kth first characteristic element and the kth third preset parameter, the kth fifth sharding element is calculated, and based on the kth third sharding element, the kth fourth preset parameter and the kth fifth sharding element, the kth second characteristic element is calculated, and the kth second characteristic element is sent to the data demander; based on the kth first preset parameter and the kth second characteristic element, the kth first sharding element is calculated; and based on the n first sharding elements, a first multiplication secret shard is generated, wherein the data provider is configured to generate a third multiplication secret shard based on the n fifth sharding elements.

[0074] According to an embodiment of the present disclosure, the preset parameter group may be n groups of multiplication triplets, wherein the kth group of multiplication triplets may be expressed as (e k , f k ,[g k ]), the multiplication triple satisfies g k =e k ·f k .

[0075] According to an embodiment of the present disclosure, the preset parameter group can be generated by the data demand end and the data provider end according to the agreement, or it can be generated by a trusted third party and distributed during the data sharing process.

[0076] According to an embodiment of the present disclosure, the kth first preset parameter may be e k , the kth third preset parameter can be f k The kth second preset parameter g′ k and the kth fourth preset parameter g″ k It can be g in the multiplication triple k By performing addition slicing, we can obtain (g′ k , g″ k )=[g k ], i.e. g′ k +g″ k =g k .

[0077] According to an embodiment of the present disclosure, the preset condition may be, for example, the following constraint condition: g′ k +g″k =e k ·f k .

[0078] According to an embodiment of the present disclosure, the data demand side can be based on the kth fourth fragment element y′ k , the kth first preset parameter e k and the kth second preset parameter g′ k , calculate the kth first characteristic element p k , as shown in formula (1):

[0079]

[0080] According to an embodiment of the present disclosure, the n first characteristic elements calculated by the data demand side can be sent to the data provider side. After receiving the n first characteristic elements, the data provider side can calculate the first characteristic elements based on the kth first characteristic element p k and the kth third preset parameter f k , calculate the kth fifth slice element v k , as shown in formula (2):

[0081] v k =f k +p k (2)

[0082] According to an embodiment of the present disclosure, based on n fifth shard elements, the third multiplication secret shard generated by the data demand side can be expressed as v1, ..., v n .

[0083] According to an embodiment of the present disclosure, the data demand side can also be based on the kth third fragment element z′ k , the kth fourth preset parameter g″ k and the kth fifth slice element v k , calculate the kth second characteristic element q k , as shown in formula (3):

[0084]

[0085] According to an embodiment of the present disclosure, the n second characteristic elements calculated by the data provider can be sent to the data demander. After receiving the n second characteristic elements, the data demander can calculate the n second characteristic elements based on the kth first preset parameter e k and the kth second characteristic element q k , calculate the kth first slice element u k , as shown in formula (4):

[0086] u k =e k+q k (4)

[0087] According to an embodiment of the present disclosure, based on n first shard elements, the first multiplication secret shard generated by the data demand end can be expressed as u1, ..., u n .

[0088] According to an embodiment of the present disclosure, the sharding result of the first multiplication secret re-sharing can be expressed as (u k , v k )= <x k -a>, satisfying u k ·v k =x k -a.

[0089] According to an embodiment of the present disclosure, in the sharding result of the first multiplication secret re-sharing, v k The value of is not equal to zero, that is, when u k ·v k =x k -a=0, then u k =0, v k ≠0. At this time, the data demander can use u k =0 to judge x k =a, and the data provider cannot k The value of x k Is it equal to a, thereby ensuring that the preset screening threshold set by the data demander will not be leaked during the data sharing process.

[0090] According to an embodiment of the present disclosure, the addition secret sharing method implemented in operation S304, that is, the second addition secret sharing, can be implemented by a method similar to operation S302, by replacing the first screening condition in the method of operation S302 with the second screening condition, which will not be described in detail here.

[0091] According to an embodiment of the present disclosure, the sharding result of the second addition secret sharing method can be expressed as in, can be expressed as the kth element of the third additive secret shard, It can be represented as the kth element of the fourth additive secret shard.

[0092] According to an embodiment of the present disclosure, the multiplication secret re-sharing method implemented by operation S305, that is, the second multiplication secret re-sharing can be implemented by a method similar to operation S303, and the first screening condition in the method of operation S303 is replaced by the second screening condition, which will not be repeated here.

[0093] According to an embodiment of the present disclosure, the sharding result of the second multiplication secret re-sharing method can be expressed as satisfy in, can be expressed as the kth element of the second multiplication secret shard, can be represented as the kth element of the fourth multiplication secret shard.

[0094] According to an embodiment of the present disclosure, by combining the application of the additive secret sharing method and the multiplicative secret re-sharing method, the sample features in the second set of samples to be matched at the data provider end can be shared with the data demander end without leakage, so as to provide a basis for sample matching at the data demander end, thereby effectively improving data security.

[0095] Figure 4 The flowchart of inadvertent transmission of data demand side according to an embodiment of the present disclosure is schematically shown.

[0096] like Figure 4 As shown, the data demand end performing oblivious transmission may include operations S401 to S403, and the methods of operations S401 to S403 may be used to implement operation S230.

[0097] According to an embodiment of the present disclosure, the random number set may include a first random number set and a second random number set.

[0098] In operation S401, in response to receiving a first random number set, based on an oblivious transfer protocol, the first random number set is processed using a sign value of each first slice element in a first multiplication secret slice to obtain a first screening mask subset.

[0099] In operation S402, in response to receiving the second random number set, based on the oblivious transfer protocol, the second random number set is processed using the sign value of each second slice element in the second multiplication secret slice to obtain a second screening mask subset.

[0100] In operation S403, the first screening mask subset and the second screening mask subset are concatenated to obtain a first screening mask set.

[0101] According to an embodiment of the present disclosure, the data demand end may perform two oblivious transmissions. Accordingly, the method of operation S401 may complete the first oblivious transmission, and the method of operation S402 may complete the second oblivious transmission.

[0102] According to an embodiment of the present disclosure, the first random number set may include n first random number elements, and the first random number elements include two unequal random numbers.

[0103] According to an embodiment of the present disclosure, operation S401 may specifically include the following operations:

[0104] In response to receiving a first random number set, for the kth first random number element, two random numbers of the kth first random number element are selected based on the sign value of the kth first slice element to obtain a first target random number, where k is a positive integer less than or equal to n; and a first screening mask subset is generated based on the n first target random numbers that correspond one-to-one to the n first random number elements respectively.

[0105] Specifically, in the first oblivious transmission process, for the kth first random number element, the symbol value u′ of the kth first fragment element can be calculated first: k =sig(u k ). In the selection process, if u′ k =1, then the random number on the left of the kth first random number element can be selected as the first target random number θ k ; if u′ k = -1, then the random number on the right side of the kth first random number element can be selected as the first target random number θ k ; if u′ k =0, then one of the two random numbers of the kth first random number element can be randomly selected as the first target random number θ k .

[0106] According to an embodiment of the present disclosure, the second random number set may include n second random number elements, and the second random number elements include two unequal random numbers.

[0107] According to an embodiment of the present disclosure, operation S402 may specifically include the following operations:

[0108] In response to receiving a second random number set, for the kth second random number element, two random numbers of the kth second random number element are selected based on the sign value of the kth second slice element to obtain a second target random number, where k is a positive integer less than or equal to n; and a second screening mask subset is generated based on the n second target random numbers that correspond one-to-one to the n second random number elements respectively.

[0109] Specifically, in the second oblivious transmission process, for the kth second random number element, the symbol value of the kth second fragment element can be calculated first. During the selection process, if Then the random number on the left side of the kth second random number element can be selected as the second target random number θ′ k ;like Then the random number on the right side of the kth second random number element can be selected as the second target random number θ′ k ;like Then we can randomly select one of the two random numbers of the kth second random number element as the second target random number θ′ k .

[0110] According to an embodiment of the present disclosure, the first screening mask set obtained by splicing can be expressed as (θ1, ..., θ n ;θ′1,…,θ′ n ), that is, its dimension should be 2n.

[0111] According to an embodiment of the present disclosure, using an oblivious transmission method, for a random number set, a data demander can selectively receive data from the random number set based on the symbol value of each first slice element in the first multiplication secret slice and the symbol value of each second slice element in the second multiplication secret slice, and the obtained first screening mask set is unknown to the data provider, thereby ensuring data security during data transmission.

[0112] Figure 5 The flowchart of the intersection calculation method according to the embodiment of the present disclosure is schematically shown.

[0113] like Figure 5 As shown, the intersection calculation method may include operations S501 to S503 , and the methods of operations S501 to S503 may be used to implement operation S240 .

[0114] In operation S501 , in response to receiving a first dual mask set, an embedding calculation is performed on the first dual mask set using a first screening mask set to obtain a second dual mask set.

[0115] In operation S502, an intersection calculation is performed on the second dual mask set and the first sample mask set to obtain an intersection set, wherein the intersection set includes intersection elements.

[0116] In operation S503, a sample matching the intersection element is determined from at least one first sample to be matched to obtain a data intersection.

[0117] According to an embodiment of the present disclosure, the embedding calculation may be to obtain a vector or a set based on two vectors or sets of the same length by using vector addition, vector multiplication, or the like.

[0118] According to an embodiment of the present disclosure, operation S501 may specifically include the following operations:

[0119] Performing dimensionality reduction processing on the first filtering mask set to obtain a second filtering mask set, wherein the second filtering mask set includes n first filtering mask elements; using a hash function to calculate each first filtering mask element in the second filtering mask set to obtain a first hash mask set; and in response to receiving the first double mask set, using the first hash mask set to embed the first double mask set to obtain a second double mask set.

[0120] According to an embodiment of the present disclosure, since the dimension of the first screening mask set is 2n, it is necessary to perform dimensionality reduction processing on the first screening mask set, and the method of dimensionality reduction processing is not limited. The second screening mask set obtained after dimensionality reduction processing can be expressed as (θ1+θ′1, …, θ n +θ′ n ), accordingly, the kth first screening mask element can be expressed as θ k +θ′ k .

[0121] According to an embodiment of the present disclosure, a hash function is used to calculate each first screening mask element in the second screening mask set, and the obtained first hash mask set can be expressed as H(θ1+θ′1), ..., H(θ n +θ′ n ).

[0122] According to an embodiment of the present disclosure, the first dual mask set may be as shown in formula (5):

[0123]

[0124] In formula (5), It can be expressed as a second sample mask set determined by the data provider based on the second sample set B to be matched.

[0125] According to an embodiment of the present disclosure, the first double mask set is embedded and calculated using the first hash mask set to obtain the second double mask set T2 as shown in formula (6):

[0126]

[0127] According to an embodiment of the present disclosure, the intersection calculation between sets can be to compare two set elements at the same position in two sets. If the two set elements are consistent, it can be determined that the value of the corresponding intersection element in the output intersection is not zero; if the two set elements are inconsistent, it can be determined that the value of the corresponding intersection element is zero. Specifically, the intersection calculation is performed on the second dual mask set T2 and the first sample mask set S, and the intersection set I obtained can be shown as formula (7):

[0128] I=S2∩T2={I1,…,Il} (7)

[0129] In the formula, I1,…,I l Can represent intersection elements.

[0130] According to the embodiments of the present disclosure, when determining the data intersection, the position information of the intersection elements that are not zero can be determined first, and the first to-be-matched sample in the first to-be-matched sample set corresponding to the position information is the target sample, and the combination of the target samples is the data intersection. Specifically, the data intersection C can be expressed as

[0131] Figure 6 The flowchart of the data sharing method applied to the data provider according to the embodiment of the present disclosure is schematically shown.

[0132] like Figure 6 The data sharing method applied to the data provider may include operations S610 to S650.

[0133] In operation S610, an interaction is performed with a data demand end based on an oblivious pseudo-random function calculation protocol to determine a second sample mask set of a second to-be-matched sample set.

[0134] In operation S620, a third multiplication secret slice and a fourth multiplication secret slice are generated respectively using an addition secret sharing method and a multiplication secret re-sharing method, wherein the third multiplication secret slice includes n fifth slice elements, and the fourth multiplication secret slice includes n sixth slice elements, where n is a positive integer.

[0135] In operation S630, based on the oblivious transfer protocol, the initial random number set is processed using the symbol value of each fifth slice element in the third multiplication secret slice and the symbol value of each sixth slice element in the fourth multiplication secret slice to obtain a random number set, and the random number set is sent to the data demand end, wherein the initial random number set includes multiple third random number elements, and the third random number elements include three unequal random numbers.

[0136] In operation S640, an embedding calculation is performed on the second sample mask set using the initial random number set to obtain a first dual mask set.

[0137] In operation S650, a first dual mask set is sent to a data demand end, wherein the data demand end is configured to perform an intersection calculation based on the first dual mask set to determine a data intersection.

[0138] According to the embodiments of the present disclosure, a cryptographic technology route combining oblivious transmission, extended oblivious transmission, oblivious pseudo-random function, secret sharing, multiplicative secret re-sharing and privacy set intersection is used. By performing multiplicative secret re-sharing between sample features and comparison screening conditions, the symbol values ​​of the multiplicative secret slices are obliviously transmitted, and extended oblivious transmission technology is used to achieve performance optimization. Finally, based on the oblivious pseudo-random function, the sample and screening condition judgment are merged to achieve a unequal strategy privacy set intersection scheme that can protect the screening conditions from being leaked and protect the security of samples outside the intersection, thereby achieving the privacy, effectiveness and efficiency of the scheme.

[0139] According to an embodiment of the present disclosure, the initial random number set may be n random number elements (α k , β k , γ k ), and satisfies α k ≠β k ≠γ k .

[0140] According to an embodiment of the present disclosure, operation S630 may specifically include the following operations:

[0141] Based on the oblivious transfer protocol, the initial random number set is processed using the symbol value of each fifth slice element in the third multiplication secret slice to obtain a first random number set; based on the oblivious transfer protocol, the initial random number set is processed using the symbol value of each sixth slice element in the fourth multiplication secret slice to obtain a second random number set; the first random number set and the second random number set are concatenated to obtain a random number set; and the random number set is sent to the data demand end.

[0142] According to an embodiment of the present disclosure, similar to the data demander, the data provider may also perform two oblivious transmissions to respectively generate and send a first random number set and a second random number set.

[0143] According to an embodiment of the present disclosure, based on the oblivious transfer protocol, processing the initial random number set using the symbol value of each fifth slice element in the third multiplication secret slice to obtain the first random number set may include the following operations:

[0144] Based on the first preset rule, according to the symbol value of the kth fifth slice element, two random numbers are selected from the three random numbers of the kth third random number element to obtain a first random number element; and based on the n first random number elements that respectively correspond one-to-one to the n third random number elements, the first random number set is generated.

[0145] Specifically, in the first oblivious transmission process, for the kth third random number element, the symbol value v′ of the kth third slice element can be calculated first. k =sig(v k ). The selection based on the first preset rule may be, for example: if v′ k =1, the first random number element can be configured If v′ k =-1, then the first random number element can be configured

[0146] According to an embodiment of the present disclosure, based on the oblivious transfer protocol, the initial random number set is processed using the symbol value of each sixth slice element in the fourth multiplication secret slice to obtain the second random number set, which may specifically include the following operations:

[0147] Based on the second preset rule, according to the symbol value of the kth sixth slice element, two random numbers are selected from the three random numbers of the kth third random number element to obtain a second random number element; and based on the n second random number elements that correspond one-to-one to the n third random number elements, a second random number set is generated.

[0148] Specifically, in the second oblivious transmission process, for the kth second random number element, the symbol value of the kth sixth fragment element can be calculated first. The selection based on the second preset rule may be, for example: Then you can configure the second random number element like Then you can configure the second random number element

[0149] According to the embodiment of the present disclosure, after the data demand end completes two oblivious transmissions, the first screening mask set (θ1+θ′1, …, θ n +θ′ n ) can follow the following rules: satisfy u′ k =v′ k When θ k =α k ;u′ k ≠v′ k When θ k =β k ;u′ k =0, θ k =α k or β k 1 / 2 probability each; When θ′ k =α k ; When θ k =γk ;u′ k =0, θ k =α k or γ k 1 / 2 probability each.

[0150] According to an embodiment of the present disclosure, operation S640 may specifically include the following operations:

[0151] A third screening mask set is determined from the initial random number set, wherein the third screening mask set includes n second screening mask elements, and the second screening mask elements include a first screening mask feature and a second screening mask feature; a hash function is used to respectively calculate the first screening mask feature and the second screening mask feature of each second screening mask element in the third screening mask set to obtain a second hash mask set; and the second sample mask set is embeddedly calculated using the second hash mask set to obtain a first double mask set.

[0152] According to an embodiment of the present disclosure, the third screening mask set is determined from the initial random number set. For example, {(α1+β1, α1+γ1), ..., (α n +β n , α n +γ k )} as the third screening mask set, correspondingly, the first screening mask feature can be expressed as α k +β k , the second screening mask feature can be expressed as α k +γ k .

[0153] According to an embodiment of the present disclosure, a hash function is used to respectively calculate the first screening mask feature and the second screening mask feature of each second screening mask element in the third screening mask set, and the obtained second hash mask set can be expressed as {(H(α1+β1), H(α1+γ1)), ..., (H(α n +β n ), H(α n +γ n ))}.

[0154] According to an embodiment of the present disclosure, the second sample mask set is embedded and calculated using the second hash mask set to obtain the first double mask set as shown in the above formula (5), which will not be repeated here.

[0155] In some embodiments, after obtaining the first dual mask set, multiple dual mask elements in the first dual mask set may be further Perform random shuffling to obtain a third dual mask set. In these embodiments, operation S650 may include the following operations:

[0156] The third dual mask set is sent to the data demand end, wherein the data demand end is configured to perform intersection calculation based on the third dual mask set to determine the data intersection.

[0157] Based on the above data sharing method, the present disclosure also provides a data sharing device. Figure 7-Figure 8 The device is described in detail.

[0158] Figure 7 The structural block diagram of a data sharing device configured at a data demand end according to an embodiment of the present disclosure is schematically shown.

[0159] like Figure 7 As shown, the data sharing device 700 configured at the data demand end may include a first determination module 710 , a first generation module 720 , a first processing module 730 and a first calculation module 740 .

[0160] The first determination module 710 is used to interact with the data provider based on the inadvertent pseudo-random function calculation protocol to determine a first sample mask set of a first set of samples to be matched, wherein the first set of samples to be matched includes at least one first sample to be matched.

[0161] The first generation module 720 is used to generate a first multiplication secret slice and a second multiplication secret slice respectively based on a preset screening threshold by using an additive secret sharing method and a multiplication secret re-sharing method, wherein the first multiplication secret slice includes n first slice elements, and the second multiplication secret slice includes n second slice elements, where n is a positive integer.

[0162] The first processing module 730 is used to process the random number set in response to receiving the random number set sent by the data provider, based on the oblivious transfer protocol, using the symbol value of each first slice element in the first multiplication secret slice and the symbol value of each second slice element in the second multiplication secret slice to obtain a first screening mask set.

[0163] The first calculation module 740 is used to perform intersection calculation based on the first sample mask set, the first screening mask set and the first dual mask set in response to receiving the first dual mask set sent by the data provider, so as to determine the data intersection from at least one first sample to be matched.

[0164] According to the data sharing method, device, equipment, medium and program product provided by the present disclosure, for the first set of samples to be matched determined by the data demand end, the first sample mask set is determined by using the inadvertent pseudo-random function calculation protocol to interact with the data provider end, and then the multiplication secret is re-shared based on the preset screening threshold, and the obtained multiplication secret fragment is inadvertently transmitted to obtain the first screening mask set, and then the privacy intersection is performed based on the received first double mask set, and the first sample mask set and the first screening mask set, so that the data intersection of the first set of samples to be matched and the second set of samples to be matched on the data provider end can be determined without leaking the preset screening threshold and ensuring the security of the samples. Therefore, the technical problems of poor accuracy and low data security in the related art when performing data sharing interactive collaboration are at least partially solved, effectively ensuring the privacy security during data sharing, and improving the accuracy of data sharing.

[0165] According to an embodiment of the present disclosure, the random number set includes a first random number set and a second random number set.

[0166] According to an embodiment of the present disclosure, the first processing module 730 includes a first processing unit, a second processing unit, and a third processing unit.

[0167] The first processing unit is configured to, in response to receiving the first random number set, process the first random number set based on an oblivious transfer protocol using a sign value of each first slice element in a first multiplication secret slice to obtain a first screening mask subset.

[0168] The second processing unit is configured to, in response to receiving the second random number set, process the second random number set based on the oblivious transfer protocol using the sign value of each second slice element in the second multiplication secret slice to obtain a second screening mask subset.

[0169] The third processing unit is used to concatenate the first screening mask subset and the second screening mask subset to obtain a first screening mask set.

[0170] According to an embodiment of the present disclosure, the first random number set includes n first random number elements, and the first random number elements include two unequal random numbers.

[0171] According to an embodiment of the present disclosure, the first processing unit includes a first processing sub-unit and a second processing sub-unit.

[0172] The first processing subunit is used to select two random numbers of the kth first random number element based on the sign value of the kth first slice element for the kth first random number element in response to receiving the first random number set, so as to obtain a first target random number, wherein k is a positive integer less than or equal to n.

[0173] The second processing subunit is used to generate a first screening mask subset based on n first target random numbers corresponding one-to-one to the n first random number elements respectively.

[0174] According to an embodiment of the present disclosure, the second random number set includes n second random number elements, and the second random number elements include two unequal random numbers.

[0175] According to an embodiment of the present disclosure, the second processing unit includes a third processing sub-unit and a fourth processing sub-unit.

[0176] The third processing subunit is used to select two random numbers of the kth second random number element based on the sign value of the kth second slice element for the kth second random number element in response to receiving the second random number set, so as to obtain a second target random number, wherein k is a positive integer less than or equal to n.

[0177] The fourth processing subunit is used to generate a second screening mask subset based on the n second target random numbers that correspond one-to-one to the n second random number elements respectively.

[0178] According to an embodiment of the present disclosure, the first calculation module 740 includes a first calculation unit, a second calculation unit, and a third calculation unit.

[0179] The first calculation unit is configured to, in response to receiving the first dual mask set, perform embedding calculation on the first dual mask set using the first screening mask set to obtain a second dual mask set.

[0180] The second calculation unit is used to perform intersection calculation on the second dual mask set and the first sample mask set to obtain an intersection set, wherein the intersection set includes intersection elements.

[0181] The third calculation unit is used to determine a sample matching the intersection element from the at least one first sample to be matched, so as to obtain a data intersection.

[0182] According to an embodiment of the present disclosure, the first computing unit includes a first computing subunit, a second computing subunit, and a third computing subunit.

[0183] The first computing subunit is used to perform dimensionality reduction processing on the first screening mask set to obtain a second screening mask set, wherein the second screening mask set includes n first screening mask elements.

[0184] The second calculation subunit is used to calculate each first screening mask element in the second screening mask set by using a hash function to obtain a first hash mask set.

[0185] The third calculation subunit is configured to, in response to receiving the first dual mask set, perform embedding calculation on the first dual mask set using the first hash mask set to obtain a second dual mask set.

[0186] According to an embodiment of the present disclosure, the first generation module 720 includes a first generation unit, a second generation unit, a third generation unit, a fourth generation unit, and a fifth generation unit.

[0187] The first generating unit is used to determine the first screening condition and the second screening condition based on a preset screening threshold by using a not equal to screening strategy.

[0188] The second generating unit is used to interact with the data provider based on a preset screening threshold using an additive secret sharing method to generate a first additive secret slice about the first screening condition, wherein the data provider is configured to generate a second additive secret slice about the first screening condition.

[0189] The third generating unit is used to interact with the data provider based on the first additive secret slice by using the multiplication secret re-sharing method to generate a first multiplication secret slice about the first screening condition, wherein the data provider is configured to generate a third multiplication secret slice about the first screening condition.

[0190] The fourth generating unit is used to interact with the data provider based on a preset screening threshold using an additive secret sharing method to generate a third additive secret slice about the second screening condition, wherein the data provider is configured to generate a fourth additive secret slice about the second screening condition.

[0191] The fifth generating unit is used to interact with the data provider based on the third additive secret slice using the multiplication secret re-sharing method to generate a second multiplication secret slice about the second screening condition, wherein the data provider is configured to generate a fourth multiplication secret slice about the second screening condition.

[0192] According to an embodiment of the present disclosure, the data provider is configured with a second set of samples to be matched, the second set of samples to be matched includes n sample elements, and the sample elements include second samples to be matched and sample features.

[0193] According to an embodiment of the present disclosure, the second generation unit includes a first generation subunit, a second generation subunit and a third generation subunit.

[0194] The first generating subunit is configured to randomly generate a first secret slice and a second secret slice based on a preset screening threshold, wherein the sum of the first secret slice and the second secret slice is the preset screening threshold.

[0195] The second generating subunit is used to send the second secret slice to the data provider, wherein the data provider is configured to randomly generate the kth first feature slice and the kth second feature slice for the kth sample feature, generate the kth third slice element based on the kth second feature slice and the second secret slice, generate the second additive secret slice based on the n third slice elements, and send n first feature slices to the data demander, wherein k is a positive integer less than or equal to n.

[0196] The third generating subunit is used for generating, in response to receiving n first feature slices, a kth fourth slice element based on the kth first feature slice and the first secret slice for the kth first feature slice, and generating a first additive secret slice based on the n fourth slice elements.

[0197] According to an embodiment of the present disclosure, the third generation unit includes a fourth generation subunit, a fifth generation subunit, a sixth generation subunit, a seventh generation subunit and an eighth generation subunit.

[0198] The fourth generating subunit is used to obtain the kth first preset parameter and the kth second preset parameter from the preset parameter group, wherein the data provider is configured to obtain the kth third preset parameter and the kth fourth preset parameter from the preset parameter group, wherein the kth first preset parameter, the kth second preset parameter, the kth third preset parameter and the kth fourth preset parameter meet the preset conditions.

[0199] The fifth generating subunit is used to calculate the kth first characteristic element based on the kth fourth slice element, the kth first preset parameter and the kth second preset parameter.

[0200] The sixth generation subunit is used to send the kth first characteristic element to the data provider, wherein the data provider is configured to calculate the kth fifth sharding element based on the kth first characteristic element and the kth third preset parameter, and calculate the kth second characteristic element based on the kth third sharding element, the kth fourth preset parameter and the kth fifth sharding element, and send the kth second characteristic element to the data demander.

[0201] The seventh generating subunit is used to calculate the kth first slice element based on the kth first preset parameter and the kth second characteristic element.

[0202] The eighth generation subunit is used to generate a first multiplication secret slice based on the n first slice elements, wherein the data provider is configured to generate a third multiplication secret slice based on the n fifth slice elements.

[0203] Figure 8The structural block diagram of a data sharing device configured at a data providing end according to an embodiment of the present disclosure is schematically shown.

[0204] like Figure 8 As shown, the data sharing device 800 configured at the data providing end may include a second determining module 810 , a second generating module 820 , a second processing module 830 , a second calculating module 840 and a sending module 850 .

[0205] The second determination module 810 is configured to interact with the data demand end based on the inadvertent pseudo-random function calculation protocol to determine a second sample mask set of the second to-be-matched sample set.

[0206] The second generation module 820 is used to generate a third multiplication secret slice and a fourth multiplication secret slice respectively by using an addition secret sharing method and a multiplication secret re-sharing method, wherein the third multiplication secret slice includes n fifth slice elements, and the fourth multiplication secret slice includes n sixth slice elements, where n is a positive integer.

[0207] The second processing module 830 is used to process the initial random number set based on the oblivious transfer protocol, using the symbol value of each fifth slice element in the third multiplication secret slice and the symbol value of each sixth slice element in the fourth multiplication secret slice, to obtain a random number set, and send the random number set to the data demand end, wherein the initial random number set includes multiple third random number elements, and the third random number elements include three unequal random numbers.

[0208] The second calculation module 840 is used to perform embedding calculation on the second sample mask set by using the initial random number set to obtain a first double mask set.

[0209] The sending module 850 is used to send the first dual mask set to the data demand end, wherein the data demand end is configured to perform intersection calculation based on the first dual mask set to determine the data intersection.

[0210] According to an embodiment of the present disclosure, the second processing module 830 includes a fourth processing unit, a fifth processing unit, a sixth processing unit, and a seventh processing unit.

[0211] The fourth processing unit is used to process the initial random number set based on the oblivious transfer protocol using the sign value of each fifth slice element in the third multiplication secret slice to obtain a first random number set.

[0212] The fifth processing unit is used to process the initial random number set based on the oblivious transfer protocol using the sign value of each sixth slice element in the fourth multiplication secret slice to obtain a second random number set.

[0213] The sixth processing unit is used to concatenate the first random number set and the second random number set to obtain a random number set.

[0214] The seventh processing unit is used to send a random number set to the data demand end.

[0215] According to an embodiment of the present disclosure, the fourth processing unit includes a fifth processing sub-unit and a sixth processing sub-unit.

[0216] The fifth processing subunit is used to select two random numbers from the three random numbers of the kth third random number element based on the first preset rule and according to the symbol value of the kth fifth slice element to obtain a first random number element.

[0217] The sixth processing subunit is used to generate a first random number set based on the n first random number elements that correspond one-to-one to the n third random number elements respectively.

[0218] According to an embodiment of the present disclosure, the fifth processing unit includes a seventh processing sub-unit and an eighth processing sub-unit.

[0219] The seventh processing subunit is used to select two random numbers from the three random numbers of the kth third random number element based on the second preset rule and according to the symbol value of the kth sixth slice element to obtain a second random number element.

[0220] The eighth processing subunit is used to generate a second random number set based on the n second random number elements that correspond one-to-one to the n third random number elements respectively.

[0221] According to an embodiment of the present disclosure, the second calculation module 840 includes a fourth calculation unit, a fifth calculation unit, and a sixth calculation unit.

[0222] The fourth computing unit is used to determine a third screening mask set from the initial random number set, wherein the third screening mask set includes n second screening mask elements, and the second screening mask elements include the first screening mask feature and the second screening mask feature.

[0223] The fifth calculation unit is used to use a hash function to respectively calculate the first screening mask feature and the second screening mask feature of each second screening mask element in the third screening mask set to obtain a second hash mask set.

[0224] The sixth calculation unit is used to perform embedding calculation on the second sample mask set by using the second hash mask set to obtain a first dual mask set.

[0225] According to an embodiment of the present disclosure, the data sharing device 800 may further include a third processing module.

[0226] The third processing module is used to randomly shuffle the multiple dual mask elements in the first dual mask set to obtain a third dual mask set.

[0227] According to an embodiment of the present disclosure, the sending module includes a sending unit.

[0228] The sending unit is used to send a third dual mask set to the data demand end, wherein the data demand end is configured to perform intersection calculation based on the third dual mask set to determine the data intersection.

[0229] According to an embodiment of the present disclosure, any multiple modules among the first determination module 710, the first generation module 720, the first processing module 730 and the first calculation module 740, or the second determination module 810, the second generation module 820, the second processing module 830, the second calculation module 840 and the sending module 850 can be combined into one module for implementation, or any one of the modules can be split into multiple modules. Alternatively, at least part of the functions of one or more of these modules can be combined with at least part of the functions of other modules and implemented in one module. According to an embodiment of the present disclosure, the first determination module 710, the first generation module 720, the first processing module 730 and the first calculation module 740, or at least one of the second determination module 810, the second generation module 820, the second processing module 830, the second calculation module 840 and the sending module 850 can be at least partially implemented as a hardware circuit, such as a field programmable gate array (FPGA), a programmable logic array (PLA), a system on a chip, a system on a substrate, a system on a package, an application specific integrated circuit (ASIC), or can be implemented by hardware or firmware such as any other reasonable way of integrating or packaging the circuit, or implemented in any one of the three implementation methods of software, hardware and firmware or in an appropriate combination of any of them. Alternatively, the first determination module 710, the first generation module 720, the first processing module 730 and the first calculation module 740, or at least one of the second determination module 810, the second generation module 820, the second processing module 830, the second calculation module 840 and the sending module 850 can be at least partially implemented as a computer program module, which can perform corresponding functions when the computer program module is executed.

[0230] Fig. 9 A block diagram of an electronic device suitable for implementing a data sharing method according to an embodiment of the present disclosure is schematically shown.

[0231] like Fig. 9As shown, the electronic device 900 according to an embodiment of the present disclosure includes a processor 901, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 902 or a program loaded from a storage part 908 into a random access memory (RAM) 903. The processor 901 may include, for example, a general-purpose microprocessor (e.g., a CPU), an instruction set processor and / or a related chipset and / or a special-purpose microprocessor (e.g., an application-specific integrated circuit (ASIC)), etc. The processor 901 may also include an onboard memory for caching purposes. The processor 901 may include a single processing unit or multiple processing units for performing different actions of the method flow according to an embodiment of the present disclosure.

[0232] In RAM 903, various programs and data required for the operation of electronic device 900 are stored. Processor 901, ROM 902 and RAM 903 are connected to each other via bus 904. Processor 901 performs various operations of the method flow according to the embodiment of the present disclosure by executing the program in ROM 902 and / or RAM 903. It should be noted that the program can also be stored in one or more memories other than ROM 902 and RAM 903. Processor 901 can also perform various operations of the method flow according to the embodiment of the present disclosure by executing the program stored in the one or more memories.

[0233] According to an embodiment of the present disclosure, the electronic device 900 may further include an input / output (I / O) interface 905, which is also connected to the bus 904. The electronic device 900 may further include one or more of the following components connected to the I / O interface 905: an input portion 906 including a keyboard, a mouse, etc.; an output portion 907 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage portion 908 including a hard disk, etc.; and a communication portion 909 including a network interface card such as a LAN card, a modem, etc. The communication portion 909 performs communication processing via a network such as the Internet. A drive 910 is also connected to the I / O interface 905 as needed. A removable medium 911, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 910 as needed, so that a computer program read therefrom is installed into the storage portion 908 as needed.

[0234] The present disclosure also provides a computer-readable storage medium, which may be included in the device / apparatus / system described in the above embodiments; or may exist independently without being assembled into the device / apparatus / system. The above computer-readable storage medium carries one or more programs, and when the above one or more programs are executed, the method according to the embodiment of the present disclosure is implemented.

[0235] According to an embodiment of the present disclosure, a computer-readable storage medium may be a non-volatile computer-readable storage medium, for example, may include but is not limited to: a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof. In the present disclosure, a computer-readable storage medium may be any tangible medium containing or storing a program, which may be used by or in combination with an instruction execution system, an apparatus, or a device. For example, according to an embodiment of the present disclosure, a computer-readable storage medium may include the ROM 902 and / or RAM 903 described above and / or one or more memories other than ROM 902 and RAM 903.

[0236] The embodiment of the present disclosure also includes a computer program product, which includes a computer program, and the computer program contains program code for executing the method shown in the flowchart. When the computer program product is run in a computer system, the program code is used to enable the computer system to implement the data sharing method provided by the embodiment of the present disclosure.

[0237] The above functions defined in the system / device of the embodiment of the present disclosure are performed when the computer program is executed by the processor 901. According to the embodiment of the present disclosure, the system, device, module, unit, etc. described above can be implemented by a computer program module.

[0238] In one embodiment, the computer program may be based on a tangible storage medium such as an optical storage device, a magnetic storage device, etc. In another embodiment, the computer program may also be transmitted and distributed in the form of a signal on a network medium, and downloaded and installed through the communication part 909, and / or installed from a removable medium 911. The program code contained in the computer program may be transmitted using any appropriate network medium, including but not limited to: wireless, wired, etc., or any suitable combination of the above.

[0239] In such an embodiment, the computer program can be downloaded and installed from the network through the communication part 909, and / or installed from the removable medium 911. When the computer program is executed by the processor 901, the above functions defined in the system of the embodiment of the present disclosure are performed. According to the embodiment of the present disclosure, the system, device, means, module, unit, etc. described above can be implemented by a computer program module.

[0240] According to an embodiment of the present disclosure, the program code for executing the computer program provided by the embodiment of the present disclosure can be written in any combination of one or more programming languages. Specifically, these computing programs can be implemented using high-level process and / or object-oriented programming languages, and / or assembly / machine languages. Programming languages ​​include, but are not limited to, Java, C++, python, "C" language or similar programming languages. The program code can be executed entirely on the user computing device, partially on the user device, partially on the remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device can be connected to the user computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or can be connected to an external computing device (for example, using an Internet service provider to connect through the Internet).

[0241] The flow charts and block diagrams in the accompanying drawings illustrate the possible architecture, functions and operations of the systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each box in the flow chart or block diagram can represent a module, a program segment, or a part of a code, and the above-mentioned module, program segment, or a part of a code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram or flow chart, and the combination of the boxes in the block diagram or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0242] It will be appreciated by those skilled in the art that the features described in the various embodiments and / or claims of the present disclosure may be combined and / or combined in a variety of ways, even if such combinations and / or combinations are not explicitly described in the present disclosure. In particular, the features described in the various embodiments and / or claims of the present disclosure may be combined and / or combined in a variety of ways without departing from the spirit and teachings of the present disclosure. All of these combinations and / or combinations fall within the scope of the present disclosure.

[0243] The embodiments of the present disclosure are described above. However, these embodiments are only for illustrative purposes and are not intended to limit the scope of the present disclosure. Although the embodiments are described above separately, this does not mean that the measures in the various embodiments cannot be used in combination to advantage. The scope of the present disclosure is defined by the attached claims and their equivalents. Without departing from the scope of the present disclosure, those skilled in the art may make a variety of substitutions and modifications, which should all fall within the scope of the present disclosure.

Claims

1. A data sharing method, applied to a data demand side, comprising: Interacting with a data provider based on an inadvertent pseudo-random function calculation protocol to determine a first sample mask set of a first set of samples to be matched, wherein the first set of samples to be matched includes at least one first sample to be matched; Based on a preset screening threshold, using an additive secret sharing method and a multiplication secret re-sharing method to generate a first multiplication secret slice and a second multiplication secret slice respectively, wherein the first multiplication secret slice includes n first slice elements, and the second multiplication secret slice includes n second slice elements, where n is a positive integer; In response to receiving the random number set sent by the data provider, based on an oblivious transfer protocol, the random number set is processed using the sign value of each first slice element in the first multiplication secret slice and the sign value of each second slice element in the second multiplication secret slice to obtain a first screening mask set; and In response to receiving the first dual mask set sent by the data provider, performing intersection calculation based on the first sample mask set, the first screening mask set and the first dual mask set to determine a data intersection from at least one of the first samples to be matched; Wherein, the random number set includes a first random number set and a second random number set; Wherein, in response to receiving the random number set sent by the data provider, based on the oblivious transfer protocol, the random number set is processed using the sign value of each first slice element in the first multiplication secret slice and the sign value of each second slice element in the second multiplication secret slice to obtain a first screening mask set, including: In response to receiving the first set of random numbers, based on the oblivious transfer protocol, processing the first set of random numbers using a sign value of each first slice element in the first multiplication secret slice to obtain a first screening mask subset; In response to receiving the second set of random numbers, based on the oblivious transfer protocol, processing the second set of random numbers using the sign value of each second slice element in the second multiplication secret slice to obtain a second screening mask subset; and concatenating the first screening mask subset and the second screening mask subset to obtain the first screening mask set; Wherein, in response to receiving the first dual mask set sent by the data provider, performing intersection calculation based on the first sample mask set, the first screening mask set and the first dual mask set to determine a data intersection from at least one of the first samples to be matched, includes: In response to receiving the first dual mask set, performing embedding calculation on the first dual mask set using the first screening mask set to obtain a second dual mask set; Performing intersection calculation on the second dual mask set and the first sample mask set to obtain an intersection set, wherein the intersection set includes intersection elements; and Determine a sample matching the intersection element from at least one of the first samples to be matched, to obtain a data intersection; The method of generating the first multiplication secret fragment and the second multiplication secret fragment respectively by using the addition secret sharing method and the multiplication secret re-sharing method based on the preset screening threshold comprises: Determine the first screening condition and the second screening condition based on the preset screening threshold by using the not equal screening strategy; Using the additive secret sharing method, interacting with the data provider based on the preset screening threshold to generate a first additive secret slice about the first screening condition, wherein the data provider is configured to generate a second additive secret slice about the first screening condition; Using the multiplication secret re-sharing method, interacting with the data provider based on the first additive secret slice to generate the first multiplication secret slice about the first screening condition, wherein the data provider is configured to generate a third multiplication secret slice about the first screening condition; Using the additive secret sharing method, interacting with the data provider based on the preset screening threshold to generate a third additive secret slice about the second screening condition, wherein the data provider is configured to generate a fourth additive secret slice about the second screening condition; and Utilizing the multiplication secret re-sharing method, interacting with the data provider based on the third addition secret slice to generate the second multiplication secret slice regarding the second screening condition, wherein the data provider is configured to generate a fourth multiplication secret slice regarding the second screening condition.

2. The method according to claim 1, wherein: The first random number set includes n first random number elements, and the first random number elements include two unequal random numbers; Wherein, in response to receiving the first set of random numbers, based on the oblivious transfer protocol, processing the first set of random numbers using the sign value of each first slice element in the first multiplication secret slice to obtain a first screening mask subset includes: In response to receiving the first random number set, for a kth first random number element, select two random numbers of the kth first random number element based on a sign value of the kth first slice element to obtain a first target random number, wherein k is a positive integer less than or equal to n; and The first screening mask subset is generated based on n first target random numbers corresponding one-to-one to n first random number elements respectively.

3. The method according to claim 1, wherein: The second random number set includes n second random number elements, and the second random number elements include two unequal random numbers; Wherein, in response to receiving the second set of random numbers, based on the oblivious transfer protocol, processing the second set of random numbers using the sign value of each second slice element in the second multiplication secret slice to obtain a second screening mask subset includes: In response to receiving the second random number set, for a kth second random number element, select two random numbers of the kth second random number element based on the sign value of the kth second slice element to obtain a second target random number, wherein k is a positive integer less than or equal to n; and The second screening mask subset is generated based on the n second target random numbers corresponding one-to-one to the n second random number elements respectively.

4. The method according to claim 1, wherein: In response to receiving the first dual mask set, using the first screening mask set to perform embedding calculation on the first dual mask set to obtain a second dual mask set, comprising: Performing dimensionality reduction processing on the first screening mask set to obtain a second screening mask set, wherein the second screening mask set includes n first screening mask elements; Using a hash function to calculate each of the first screening mask elements in the second screening mask set to obtain a first hash mask set; and In response to receiving the first dual mask set, embedding calculation is performed on the first dual mask set using the first hash mask set to obtain the second dual mask set.

5. The method according to claim 1, wherein: The data provider is configured with a second set of samples to be matched, the second set of samples to be matched includes n sample elements, and the sample elements include second samples to be matched and sample features; The method of using the additive secret sharing method to interact with the data provider based on the preset screening threshold to generate a first additive secret slice about the first screening condition, wherein the data provider is configured to generate a second additive secret slice about the first screening condition, including: Based on the preset screening threshold, randomly generate a first secret slice and a second secret slice, wherein the sum of the first secret slice and the second secret slice is the preset screening threshold; sending the second secret slice to the data provider, wherein the data provider is configured to randomly generate a kth first feature slice and a kth second feature slice for the kth sample feature, generate a kth third slice element based on the kth second feature slice and the second secret slice, generate the second additive secret slice based on n third slice elements, and send n first feature slices to the data demander, wherein k is a positive integer less than or equal to n; and In response to receiving n first feature slices, for the kth first feature slice, generating a kth fourth slice element based on the kth first feature slice and the first secret slice, and generating the first additive secret slice based on the n fourth slice elements.

6. The method according to claim 5, wherein: The method of using the multiplication secret re-sharing method to interact with the data provider based on the first addition secret slice to generate the first multiplication secret slice about the first screening condition, wherein the data provider is configured to generate a third multiplication secret slice about the first screening condition, comprising: Obtaining a kth first preset parameter and a kth second preset parameter from a preset parameter group, wherein the data provider is configured to obtain a kth third preset parameter and a kth fourth preset parameter from the preset parameter group, wherein the kth first preset parameter, the kth second preset parameter, the kth third preset parameter, and the kth fourth preset parameter meet a preset condition; Calculate the kth first characteristic element based on the kth fourth slice element, the kth first preset parameter and the kth second preset parameter; Sending the kth first characteristic element to the data provider, wherein the data provider is configured to calculate the kth fifth sharding element based on the kth first characteristic element and the kth third preset parameter, and calculate the kth second characteristic element based on the kth third sharding element, the kth fourth preset parameter and the kth fifth sharding element, and send the kth second characteristic element to the data demander; Based on the kth first preset parameter and the kth second characteristic element, calculate and obtain the kth first slice element; and The first multiplication secret slice is generated based on n first slice elements, wherein the data provider is configured to generate the third multiplication secret slice based on n fifth slice elements.

7. A data sharing method, applied to a data provider, comprising: Interacting with the data demand end based on an inadvertent pseudo-random function calculation protocol to determine a second sample mask set of a second to-be-matched sample set; Generate a third multiplication secret slice and a fourth multiplication secret slice respectively by using an addition secret sharing method and a multiplication secret re-sharing method, wherein the third multiplication secret slice includes n fifth slice elements, and the fourth multiplication secret slice includes n sixth slice elements, where n is a positive integer; Based on the oblivious transfer protocol, the initial random number set is processed using the symbol value of each of the fifth slice elements in the third multiplication secret slice and the symbol value of each of the sixth slice elements in the fourth multiplication secret slice to obtain a random number set, and the random number set is sent to the data demand end, wherein the initial random number set includes a plurality of third random number elements, and the third random number elements include three unequal random numbers; Using the initial random number set to perform embedding calculation on the second sample mask set to obtain a first double mask set; and The first double mask set is sent to the data demand end, wherein the data demand end is configured to perform intersection calculation based on the first double mask set to determine the data intersection; wherein, based on the oblivious transfer protocol, the initial random number set is processed using the symbol value of each of the fifth slice elements in the third multiplication secret slice and the symbol value of each of the sixth slice elements in the fourth multiplication secret slice to obtain a random number set, and the random number set is sent to the data demand end, including: Based on the oblivious transfer protocol, using the sign value of each of the fifth slice elements in the third multiplication secret slice to process the initial random number set to obtain a first random number set; Based on the oblivious transfer protocol, using the sign value of each sixth slice element in the fourth multiplication secret slice to process the initial random number set to obtain a second random number set; concatenating the first random number set and the second random number set to obtain the random number set; and Sending the random number set to the data demand end; The method of using the addition secret sharing method and the multiplication secret re-sharing method to generate the third multiplication secret slice and the fourth multiplication secret slice respectively includes: When the data demand end uses the additive secret sharing method to interact with the data provider end based on a preset screening threshold, a second additive secret slice about the first screening condition is generated, wherein the data demand end is configured to use a not equal to screening strategy to determine the first screening condition and the second screening condition based on the preset screening threshold, and the data demand end is configured to generate a first additive secret slice about the first screening condition; When the data demand end uses the multiplication secret re-sharing method to interact with the data provider end based on the first addition secret slice, the third multiplication secret slice related to the first screening condition is generated; When the data demand side uses the additive secret sharing method to interact with the data provider side based on the preset screening threshold, a fourth additive secret slice about the second screening condition is generated, wherein the data demand side is configured to generate a third additive secret slice about the second screening condition; and When the data demand end uses the multiplication secret re-sharing method to interact with the data provider based on the third addition secret slice, the fourth multiplication secret slice related to the second screening condition is generated.

8. The method according to claim 7, wherein: The method of processing the initial random number set based on the oblivious transfer protocol using the sign value of each of the fifth slice elements in the third multiplication secret slice to obtain a first random number set includes: Based on the first preset rule, according to the symbol value of the kth fifth slice element, two random numbers are selected from the three random numbers of the kth third random number element to obtain a first random number element; and The first random number set is generated based on the n first random number elements corresponding one-to-one to the n third random number elements respectively.

9. The method according to claim 7, wherein: The method of processing the initial random number set based on the oblivious transfer protocol using the sign value of each sixth slice element in the fourth multiplication secret slice to obtain a second random number set includes: Based on the second preset rule, according to the symbol value of the kth sixth slice element, two random numbers are selected from the three random numbers of the kth third random number element to obtain a second random number element; and The second random number set is generated based on the n second random number elements corresponding one-to-one to the n third random number elements respectively.

10. The method according to claim 7, wherein: The embedding calculation of the second sample mask set by using the initial random number set to obtain a first double mask set includes: Determine a third screening mask set from the initial random number set, wherein the third screening mask set includes n second screening mask elements, and the second screening mask elements include a first screening mask feature and a second screening mask feature; Using a hash function, respectively calculate the first screening mask feature and the second screening mask feature of each of the second screening mask elements in the third screening mask set to obtain a second hash mask set; and The second sample mask set is embedded and calculated by using the second hash mask set to obtain the first dual mask set.

11. The method according to claim 7, further comprising: Randomly shuffle the multiple dual mask elements in the first dual mask set to obtain a third dual mask set; The sending of the first dual mask set to the data demand end, wherein the data demand end is configured to perform intersection calculation based on the first dual mask set to determine a data intersection, includes: The third dual mask set is sent to the data demand end, wherein the data demand end is configured to perform intersection calculation based on the third dual mask set to determine a data intersection.

12. A data sharing device, configured at a data demand end, comprising: A first determination module is configured to interact with a data provider based on an inadvertent pseudo-random function calculation protocol to determine a first sample mask set of a first set of samples to be matched, wherein the first set of samples to be matched includes at least one first sample to be matched; A first generating module, configured to generate a first multiplication secret slice and a second multiplication secret slice respectively based on a preset screening threshold value by using an addition secret sharing method and a multiplication secret re-sharing method, wherein the first multiplication secret slice includes n first slice elements, the second multiplication secret slice includes n second slice elements, and n is a positive integer; a first processing module, configured to, in response to receiving a random number set sent by the data provider, process the random number set using a sign value of each first slice element in the first multiplication secret slice and a sign value of each second slice element in the second multiplication secret slice based on an oblivious transfer protocol to obtain a first screening mask set; and a first calculation module, configured to, in response to receiving a first dual mask set sent by the data provider, perform intersection calculation based on the first sample mask set, the first screening mask set and the first dual mask set, so as to determine a data intersection from at least one of the first samples to be matched; Wherein, the random number set includes a first random number set and a second random number set; Wherein, the first processing module is specifically used for: In response to receiving the first set of random numbers, based on the oblivious transfer protocol, processing the first set of random numbers using a sign value of each first slice element in the first multiplication secret slice to obtain a first screening mask subset; In response to receiving the second set of random numbers, based on the oblivious transfer protocol, processing the second set of random numbers using the sign value of each second slice element in the second multiplication secret slice to obtain a second screening mask subset; and concatenating the first screening mask subset and the second screening mask subset to obtain the first screening mask set; Wherein, the first calculation module is specifically used for: In response to receiving the first dual mask set, performing embedding calculation on the first dual mask set using the first screening mask set to obtain a second dual mask set; Performing intersection calculation on the second dual mask set and the first sample mask set to obtain an intersection set, wherein the intersection set includes intersection elements; and Determine a sample matching the intersection element from at least one of the first samples to be matched, to obtain a data intersection; Wherein, the first generating module is specifically used for: Determine the first screening condition and the second screening condition based on the preset screening threshold by using the not equal screening strategy; Using the additive secret sharing method, interacting with the data provider based on the preset screening threshold to generate a first additive secret slice about the first screening condition, wherein the data provider is configured to generate a second additive secret slice about the first screening condition; Using the multiplication secret re-sharing method, interacting with the data provider based on the first additive secret slice to generate the first multiplication secret slice about the first screening condition, wherein the data provider is configured to generate a third multiplication secret slice about the first screening condition; Using the additive secret sharing method, interacting with the data provider based on the preset screening threshold to generate a third additive secret slice about the second screening condition, wherein the data provider is configured to generate a fourth additive secret slice about the second screening condition; and Utilizing the multiplication secret re-sharing method, interacting with the data provider based on the third addition secret slice to generate the second multiplication secret slice regarding the second screening condition, wherein the data provider is configured to generate a fourth multiplication secret slice regarding the second screening condition.

13. A data sharing device, configured at a data provider, comprising: A second determination module, configured to interact with a data demand end based on an inadvertent pseudo-random function calculation protocol to determine a second sample mask set of a second to-be-matched sample set; a second generation module, configured to generate a third multiplication secret slice and a fourth multiplication secret slice respectively by using an addition secret sharing method and a multiplication secret re-sharing method, wherein the third multiplication secret slice includes n fifth slice elements, and the fourth multiplication secret slice includes n sixth slice elements, where n is a positive integer; a second processing module, configured to process an initial random number set based on an oblivious transfer protocol using a sign value of each of the fifth slice elements in the third multiplication secret slice and a sign value of each of the sixth slice elements in the fourth multiplication secret slice to obtain a random number set, and send the random number set to the data demand end, wherein the initial random number set includes a plurality of third random number elements, and the third random number elements include three unequal random numbers; a second calculation module, configured to perform embedding calculation on the second sample mask set using the initial random number set to obtain a first double mask set; and A sending module, configured to send the first dual mask set to the data demand end, wherein the data demand end is configured to perform an intersection calculation based on the first dual mask set to determine a data intersection; Wherein, the second processing module is specifically used for: Based on the oblivious transfer protocol, using the sign value of each of the fifth slice elements in the third multiplication secret slice to process the initial random number set to obtain a first random number set; Based on the oblivious transfer protocol, using the sign value of each sixth slice element in the fourth multiplication secret slice to process the initial random number set to obtain a second random number set; concatenating the first random number set and the second random number set to obtain the random number set; and Sending the random number set to the data demand end; Wherein, the second generating module is specifically used for: When the data demand end uses the additive secret sharing method to interact with the data provider end based on a preset screening threshold, a second additive secret slice about the first screening condition is generated, wherein the data demand end is configured to use a not equal to screening strategy to determine the first screening condition and the second screening condition based on the preset screening threshold, and the data demand end is configured to generate a first additive secret slice about the first screening condition; When the data demand end uses the multiplication secret re-sharing method to interact with the data provider end based on the first addition secret slice, the third multiplication secret slice related to the first screening condition is generated; When the data demand side uses the additive secret sharing method to interact with the data provider side based on the preset screening threshold, a fourth additive secret slice about the second screening condition is generated, wherein the data demand side is configured to generate a third additive secret slice about the second screening condition; and When the data demand end uses the multiplication secret re-sharing method to interact with the data provider based on the third addition secret slice, the fourth multiplication secret slice related to the second screening condition is generated.

14. An electronic device comprising: one or more processors; a storage device for storing one or more programs, When the one or more programs are executed by the one or more processors, the one or more processors execute the method according to any one of claims 1 to 6 or the method according to any one of claims 7 to 11.

15. A computer-readable storage medium having executable instructions stored thereon, which, when executed by a processor, causes the processor to execute the method according to any one of claims 1 to 6 or the method according to any one of claims 7 to 11.

16. A computer program product, comprising a computer program, wherein when the computer program is executed by a processor, the method according to any one of claims 1 to 6 or the method according to any one of claims 7 to 11 is implemented.

Citation Information

Patent Citations

  • Private data access method, device, equipment and system based on secret sharing

    CN112148755A

  • Multi-party joint information value calculation method, related equipment and storage medium

    CN114401079A