Private data processing method and device, storage medium and electronic equipment

Abstract

The invention relates to a privacy data processing method and device, a storage medium and electronic equipment, and relates to the technical field of big data processing. According to the scheme, a first data set of a client side and a second data set of a service side are subjected to hidden tracking privacy intersection through exchangeable encryption, and an intersection index is obtained; the second data set is rearranged according to the first random sequence and the second random sequence in sequence between the service party and the client party, and the intersection index indicates the bit sequence of the intersection ciphertext in the rearranged second data set; the client side carries out secret sharing with the service side by adopting the feature set rearranged by the first random sequence through the switching network according to the second random sequence to obtain a first feature secret fragment, and the service side obtains a second feature secret fragment; and performing statistical function calculation based on the intersection index, the first feature secret fragment and the second feature secret fragment to obtain an intersection statistical feature value of the first data set and the second data set. The scheme does not depend on a third party, deployment is convenient, intersection and feature plaintexts are not exposed, and safety is high.

Description

Technical Field

[0001] The embodiments of the present disclosure relate to the technical field of big data processing, and in particular, to a method for processing privacy data, a device for processing privacy data, a computer-readable storage medium, and an electronic device. Background Art

[0002] Privacy-preserving computing is a crucial technology for ensuring data privacy and security in the big data era. To enable cross-domain, vertical federated learning for machine learning modeling, private set intersection (PSI) is the first step. This technique computes intersection features without exposing any additional data to any participating parties. It can be applied to a variety of scenarios, including precision advertising and contact discovery. PSI technology is becoming increasingly mature.

[0003] However, with the diversification of application scenarios, intersection feature calculation usually needs to rely on third-party trusted institutions, which has high deployment costs and can only ensure that additional information other than the intersection is not exposed, and the security of privacy protection is limited.

[0004] It should be noted that the information disclosed in the above background technology section is only used to enhance the understanding of the background of the present disclosure. Therefore, it may include not only information that constitutes prior art known to ordinary technicians in this field, but also information that does not constitute prior art known to ordinary technicians in this field. Summary of the Invention

[0005] The purpose of the present disclosure is to provide a method for processing privacy data, a device for processing privacy data, a computer-readable storage medium, and an electronic device, thereby overcoming, at least to a certain extent, the problem of how to obtain intersection features without leaking the intersection plaintext and feature plaintext due to the limitations and defects of related technologies.

[0006] According to one aspect of the present disclosure, a method for processing private data is provided, which is applied to a client side. The method for processing private data includes: based on a first data set, using exchangeable encryption to perform anonymous privacy intersection with a second data set of a service side to obtain an intersection index; the second data set is rearranged on the service side with a first random sorting, and then rearranged on the client side with a second random sorting; the intersection index includes the order of the intersection ciphertext in the second data set after exchangeable encryption and rearrangement on the client side; based on the second random sorting, secret sharing is performed with the service side using a feature set rearranged by the first random sorting through an exchange network to obtain first feature secret fragments; the feature set corresponds to the original second data set; the service side obtains the second feature secret fragments; statistical function calculation is performed based on the intersection index, the first feature secret fragments, and the second feature secret fragments to obtain statistical feature values ​​of the intersection of the first data set and the second data set.

[0007] In an example embodiment of the present disclosure, a switching network includes a control unit and conductors, each conductor corresponding to a random mask generated by a service party; after the service party rearranges the feature set based on a first random ordering, each feature value is masked with the random mask of the corresponding conductor and input into the corresponding conductor; based on a second random ordering, secrets are shared with the service party using the feature set rearranged by the first random ordering to obtain first feature secret fragments, including: determining the selection bit of each control unit in sequence based on the second random ordering, masking the feature values ​​in sequence according to the random mask of the selected conductor, and outputting them in the second random ordering after being transmitted along the selected conductor to obtain the first feature secret fragments.

[0008] In an exemplary embodiment of the present disclosure, the conductors include at least one unit input conductor and at least one unit output conductor corresponding to each control unit, and the conductors further include a starting input conductor and a terminating output conductor; after rearranging the feature set based on a first random order, the service party performs an exclusive OR operation on each feature value with a random mask corresponding to the starting input conductor to determine a first masked message transmitted on the starting input conductor; based on a second random order, the selection bit of each control unit is sequentially determined, so that the feature value is sequentially masked according to the random mask of the selected conductor, and sequentially transmitted along the selected conductor and then output in a second random order to obtain a first feature secret fragment, including: determining a selection bit for each control unit sequentially according to the second random order; determining a second masked message transmitted on a local path composed of the unit input conductor and the unit output conductor based on the selection bit; the second masked message is obtained by performing an exclusive OR operation on the random mask of the unit input conductor and the unit output conductor on the local path; and sequentially performing an exclusive OR operation on the first masked message and the second masked message transmitted on each local path on a global path from the starting input conductor to the corresponding terminating output conductor to obtain the first feature secret fragment.

[0009] In an example embodiment of the present disclosure, a control unit includes a permutation switch, the permutation switch including a first unit input wire and a first unit output wire corresponding to a bit sequence, and a second unit input wire and a second unit output wire corresponding to a bit sequence; determining a selection bit for each control unit according to a second random sort, including: determining the permutation switch as a direct connection selection bit based on the second random sort, so that the first unit input wire and the first unit output wire form a local path, and the second unit input wire and the second unit output wire form a local path; determining the permutation switch as an exchange selection bit based on the second random sort, so that the first unit input wire and the second unit output wire form a local path, and the second unit input wire and the first unit output wire form a local path.

[0010] In an exemplary embodiment of the present disclosure, the control unit includes a multiplexer, the multiplexer including kThe method comprises the following steps: determining a selection bit for each control unit according to a second random order, wherein the selection bit is a multiplexer, the selection bit is a multiplexer, and the selection bit is a target unit output wire; determining a selection bit for each control unit according to a second random order, ... k Select one of the selection bits to make k Optional unit input conductors k The selected target unit input wire and the target unit output wire form a local path.

[0011] In an exemplary embodiment of the present disclosure, the service party uses the random mask corresponding to the terminated output wire as the second characteristic secret fragment.

[0012] In an example embodiment of the present disclosure, based on a first data set, exchangeable encryption is used to perform anonymous and private intersection with a second data set of a service party to obtain an intersection index, including: rearranging the first data set in a third random order, mapping it to a predetermined elliptic curve, and encrypting it based on a first private key to obtain a first encryption result; sending the first encryption result to the service party; obtaining a second encryption result provided by the service party, the second encryption result is obtained by the service party rearranging the second data set in a first random order, mapping it to a predetermined elliptic curve, and encrypting it based on the second private key; rearranging the second encryption result in a second random order and encrypting it based on the first private key to obtain a third encryption result, and providing the third encryption result to the service party; obtaining a fourth encryption result provided by the service party, the fourth encryption result is obtained by the service party rearranging the first encryption result in a fourth random order and encrypting it based on the second private key; comparing the third encryption result with the fourth encryption result to obtain an intersection index of the intersection ciphertext in the third encryption result.

[0013] In an exemplary embodiment of the present disclosure, the statistical function includes at least one of a sum statistical function, a mean statistical function, a variance statistical function, a standard deviation statistical function, and an intersection potential statistical function.

[0014] According to one aspect of the present disclosure, a device for processing private data is provided, which is applied to a client side. The device for processing private data includes: a stealth and privacy intersection module, which is used to perform stealth and privacy intersection with a second data set of a service side based on a first data set by using exchangeable encryption to obtain an intersection index; the second data set is rearranged by a first random order on the service side, and then rearranged by a second random order on the client side; the intersection index includes the order of the intersection ciphertext in the second data set after exchangeable encryption and rearrangement by the client side; an oblivious transmission module, which is used to perform secret sharing with a feature set rearranged by the first random order through an exchange network with the service side based on the second random order to obtain a first feature secret fragment; the feature set corresponds to the original second data set; the service side obtains the second feature secret fragment; and a feature statistics module, which is used to perform statistical function calculation based on the intersection index, the first feature secret fragment and the second feature secret fragment to obtain a statistical feature value of the intersection of the first data set and the second data set.

[0015] According to one aspect of the present disclosure, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the method for processing privacy data described above is implemented.

[0016] According to one aspect of the present disclosure, there is provided an electronic device, including: a processor; and a memory for storing executable instructions for the processor; The processor is configured to execute any one of the above-mentioned methods for processing privacy data by executing the executable instructions.

[0017] The embodiments of the present disclosure provide a method for processing privacy data, a device for processing privacy data, a computer-readable storage medium, and an electronic device. In this solution, the client can use exchangeable encryption to perform anonymous and private intersection with the service party's second data set based on a local first data set to obtain an intersection index; during the anonymous and private intersection process, the second data set is rearranged by the service party and the client using a first random sort and a second random sort, respectively, and the aforementioned intersection index indicates the order of the intersection ciphertext in the second data set after exchangeable encryption and rearrangement by the client; on this basis, based on the second random sort, a feature set rearranged by the first random sort is used to perform secret sharing with the service party through an exchange network to obtain a first feature secret fragment, and the service party obtains a second feature secret fragment, which corresponds to the original second data set before being rearranged by the first random sort; a statistical function calculation is performed based on the intersection index, the first feature secret fragment, and the second feature secret fragment to obtain a statistical feature value of the intersection of the first data set and the second data set. In this solution, the client and service party holding the data can directly participate in the calculation without relying on a third party, which reduces deployment costs and improves deployment convenience. The two parties determine the intersection index only in the ciphertext state through the intersection of privacy sets, and do not obtain the plaintext data of the intersection. The feature set is rearranged based on the exchange network. The service party and the client party only obtain the rearranged feature secret fragments, and do not obtain the plaintext data of the feature set. The feature statistical function calculation is completed safely and efficiently, further enhancing security.

[0018] It is to be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0019] The accompanying drawings are incorporated into and constitute a part of the specification, illustrate embodiments consistent with the present disclosure, and together with the specification, are used to explain the principles of the present disclosure. Obviously, the drawings described below are only some embodiments of the present disclosure, and those skilled in the art can derive other drawings based on these drawings without inventive effort.

[0020] Figure 1 The following is a schematic diagram illustrating the steps of the privacy data processing method provided by the embodiment of the present disclosure.

[0021] Figure 2 The following schematically illustrates the control principle of a replacement switch in a switching network provided by an embodiment of the present disclosure.

[0022] Figure 3 The following schematically illustrates the control principle of a multiplexer in a switching network provided by an embodiment of the present disclosure.

[0023] Figure 4The following schematically illustrates a switching network control flow diagram provided by an embodiment of the present disclosure.

[0024] Figure 5 The following schematically shows a structural example diagram of a device for processing privacy data according to an exemplary embodiment of the present disclosure.

[0025] Figure 6 An electronic device for implementing a method for processing privacy data according to an exemplary embodiment of the present disclosure is schematically illustrated. DETAILED DESCRIPTION

[0026] Example embodiments will now be described more fully with reference to the accompanying drawings. However, example embodiments can be implemented in a variety of forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that the present disclosure will be more comprehensive and complete and will fully convey the concepts of the example embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, many specific details are provided to provide a full understanding of the embodiments of the present disclosure. However, those skilled in the art will appreciate that the technical solutions of the present disclosure may be practiced while omitting one or more of the specific details, or that other methods, components, devices, steps, etc. may be employed. In other cases, well-known technical solutions are not shown or described in detail to avoid obscuring various aspects of the present disclosure.

[0027] In addition, the accompanying drawings are merely schematic illustrations of the present disclosure and are not necessarily drawn to scale. Identical reference numerals in the figures denote identical or similar parts, and thus repetitive descriptions thereof will be omitted. Some of the block diagrams shown in the accompanying drawings are functional entities that do not necessarily correspond to physically or logically separate entities. These functional entities may be implemented in software, in one or more hardware modules or integrated circuits, or in different networks and / or processor devices and / or microcontroller devices.

[0028] The present disclosure is applied to a cross-domain statistical function scenario based on security. Among multiple parties, the client party can initiate a statistical function calculation for the characteristic values ​​corresponding to a specific data set to the service party. During the calculation process, the intersection plaintext is not displayed and the characteristic plaintext is not leaked. The calculation results of the statistical calculation are obtained by any one or both parties through negotiation, and it can be defaulted that at least the client party initiating the calculation obtains them. Figure 1 A flowchart of the steps of the method for processing privacy data provided in the embodiment of the present disclosure is shown as follows: Figure 1 As shown, when applied to the client side, the method may include the following steps 101 to 103.

[0029] Step 101: Based on the first data set, exchangeable encryption is used to perform an anonymous intersection with the second data set of the service party to obtain an intersection index; the second data set is rearranged by the service party using a first random order, and then rearranged by the client party using a second random order; the intersection index includes the bit order of the intersection ciphertext in the second data set after exchangeable encryption and rearrangement by the client party.

[0030] In an embodiment of the present disclosure, the client may initiate eigenvalue calculation of a corresponding statistical function to the service provider based on a first data set. The first data set may include object description information for eigenvalue calculation, which may be at least a portion of the data held locally by the client.

[0031] For example, the client can initiate the calculation of characteristic values ​​such as the cumulative total consumption, average monthly consumption, monthly consumption variance, and monthly consumption standard deviation for some users to the service provider. The service provider holds user information and characteristic values ​​of user consumption. The user information of the aforementioned users of the client is the first data set, and the user information held by the service provider is the second data set. The client uses exchangeable encryption to perform anonymous privacy intersection with the service provider to obtain the intersection index to indicate the order of the intersection ciphertext in the second data set after exchangeable encryption and re-arrangement during the anonymous privacy intersection process. The above scenario is for example only. The first data set can also be object description information including social media, operating organizations, etc., and the characteristic value calculation can also be a statistical calculation of characteristic values ​​such as the number of registrations, the number of placements, the number of conversions, the number of comments, and the number of transactions. The client can perform analysis and reasoning based on the characteristic values ​​obtained by statistical calculations, and conduct related business in the fields of interest recommendation, credit risk control, medical assistance, etc.

[0032] The principle of commutative encryption can be expressed as the following formula (1): (1) That is, for plaintext data m , key E k1 With key E k2 The encryption order is interchangeable without affecting the encryption result. When the client uses encryptable exchange to perform an anonymous intersection with the service provider, both parties first encrypt their local datasets using their own keys, then exchange the encryption results and encrypt them again using their own keys. Therefore, in this process, both parties only transmit confidential data, and the first dataset undergoes two encryption processes: first by the client and then by the service provider, while the second dataset undergoes two encryption processes: first by the service provider and then by the client. In commutative encryption, the encryption order does not affect the encryption result. Therefore, when the plaintext data is consistent, the corresponding ciphertext data is also consistent. The intersection index can then be determined based on the intersection ciphertext.

[0033] Furthermore, during the anonymous intersection process, each party can reorder the object descriptions in the dataset to conceal the order of the object descriptions from the other party and prevent the inference of private data based on the order. The second dataset can be encrypted after being reordered by the service provider based on the first random ordering. After being exchanged to the client, it can be reordered and encrypted based on the second random ordering. Because both parties have performed at least one random ordering reordering, neither the client nor the service provider can determine the order of the object descriptions corresponding to the intersection ciphertext in the original second dataset.

[0034] Step 102: Based on the second random sorting, the service provider shares secrets with the feature set rearranged by the first random sorting through the exchange network to obtain first feature secret fragments; the feature set corresponds to the original second data set; the service provider obtains second feature secret fragments.

[0035] In the disclosed embodiment, the feature set includes the feature values ​​corresponding to each piece of object description information in the original second data set. Since the intersection index indicates the positional order of the intersection ciphertext in the second data set, which has been rearranged according to the first random sorting and the second random sorting, and the feature values ​​in the feature set have a mapping relationship with the plaintext object description information in the original second data set, the process of rearranging the second data set can be repeated for the feature set so that the mapping relationship between the intersection ciphertext indicated by the intersection index and the rearranged feature values ​​is equivalent to the mapping relationship between the original second data set and the feature values ​​before the rearrangement.

[0036] A switching network (SN) is a network structure used for data transmission and conversion. Within a switching network, data transmission paths can be controlled, allowing input data to be reordered and resequenced during transmission. The design of a switching network can be adjusted based on specific service requirements and network topology. In the disclosed embodiment, a client can reorder a feature set provided by a service provider using a first random ordering through a switching network based on a second random ordering. The input data can be blinded within the switching network to conceal the transmission path, thereby constructing an OSN (Oblivious Switching Network) for secret sharing. This allows the client to obtain first feature secret fragments and the service provider to obtain second feature secret fragments.

[0037] Step 103: Perform statistical function calculation based on the intersection index, the first characteristic secret fragment, and the second characteristic secret fragment to obtain a statistical characteristic value of the intersection of the first data set and the second data set.

[0038] In the embodiment of the present disclosure, on the basis of obtaining the intersection index, the client obtaining the first characteristic secret fragment and the service party obtaining the second characteristic secret fragment, at least one specific statistical function calculation can be performed according to business needs to obtain the intersection statistical characteristic value corresponding to the first data set and the second data set. During the execution process, the client can obtain the characteristic secret fragment of the corresponding bit sequence from the first characteristic secret fragment according to the intersection index, and the service party can obtain the characteristic secret fragment of the corresponding bit sequence from the second characteristic secret fragment according to the intersection index, and then the client and the service party respectively calculate the preliminary secret statistical characteristic value based on the characteristic secret fragment, and the client obtains the service party's secret statistical characteristic value and the local secret statistical characteristic value to restore the intersection statistical characteristic value. In the actual calculation process, the corresponding calculation steps can be simplified or added according to the different statistical functions to obtain the corresponding intersection statistical characteristic value, and the embodiment of the present disclosure does not impose specific restrictions on this.

[0039] In an optional method embodiment of the present disclosure, the exchangeable encryption can be ECDH (Elliptic Curve Diffie–Hellman key exchange) encryption. The client and service provider can negotiate a predetermined elliptic curve to implement the exchange, thereby achieving anonymity and privacy. Based on this, step 101 can include steps A1 to A6.

[0040] Step A1: rearrange the first data set in a third random order, map it to a predetermined elliptic curve, and encrypt it based on a first private key to obtain a first encryption result.

[0041] On the client side, the first dataset can refer to the description of step 101 above, and to avoid repetition, it will not be repeated here. The client can reorder the first dataset using the third random ordering so that the object description information in the reordered first dataset conforms to the bit order of the third random ordering. The client can further hash the reordered first dataset, map it to the predetermined elliptic curve, and encrypt the reordered and hashed first dataset using the local first private key to obtain a first encryption result.

[0042] Step A2: Send the first encryption result to the service provider.

[0043] The client may provide the obtained first encryption result to the service provider.

[0044] Step A3: Obtain a second encryption result provided by the service provider, where the second encryption result is obtained by the service provider rearranging the second data set in the first random order, mapping it to a predetermined elliptic curve, and encrypting it based on the second private key.

[0045] On the service side, the second data set can refer to the description of step 101 above, and to avoid repetition, it is not further described here. The service side can reorder the second data set using the first random ordering so that the object description information in the reordered second data set conforms to the bit order of the first random ordering. The service side can further hash the reordered second data set, map it to the predetermined elliptic curve, and encrypt the reordered and hashed second data set using the local second private key to obtain a second encrypted result.

[0046] The service side may provide the second encryption result to the client side, and obtain the first encryption result from the client side.

[0047] The client can obtain the second encryption result provided by the service provider, thereby realizing the exchange of the first encryption result and the second encryption result.

[0048] Step A4: rearrange the second encryption result in a second random order and encrypt based on the first private key to obtain a third encryption result, and provide the third encryption result to the service provider.

[0049] On the client side, the obtained second encryption result can be rearranged using a second random sort so that the ciphertext in the second encryption result conforms to the bit order rearranged by the first random sort and the second random sort, and the rearranged second encryption result is encrypted using the local first private key to obtain a third encryption result.

[0050] The client may provide the third encryption result to the service provider.

[0051] Step A5: Obtain a fourth encryption result provided by the service provider. The fourth encryption result is obtained by the service provider rearranging the first encryption result in a fourth random order and encrypting the result based on the second private key.

[0052] On the service side, the first encryption result obtained can be rearranged using a fourth random sort so that the ciphertext in the first encryption result conforms to the bit order rearranged successively using the third random sort and the fourth random sort, and the rearranged first encryption result is encrypted using the local second private key to obtain a fourth encryption result.

[0053] The service side may provide the fourth encryption result to the client side.

[0054] The client can obtain the fourth encryption result provided by the service provider, thereby realizing the exchange of the third encryption result and the fourth encryption result.

[0055] Step A6: Compare the third encryption result with the fourth encryption result to obtain an intersection index of the intersection ciphertext in the third encryption result.

[0056] The client can compare the third and fourth encrypted results, which have been reordered and encrypted by both parties, and determine, based on the principle of commutative encryption, the intersection index of the intersection ciphertext in the third encrypted result. This index is equivalent to the index of the intersection element between the original second dataset, after being reordered using the first and second random sorting methods, and the original first dataset. However, no plaintext data is leaked during the interaction between steps A1 to A6.

[0057] On the service side, the third encryption result and the fourth encryption result, which have been rearranged and encrypted by both parties, may also be compared to obtain an intersection index. To avoid repetition, details are omitted here.

[0058] For example, referring to the above steps A1 to A6, assuming that the client C (Client) and Server S (Service), customer side C Holds the first dataset , which includes n User ID; Service Provider S Holds the second dataset and feature sets , which includes n One-to-one correspondence between user IDs and n Feature value, customer side C With the service provider S Negotiate and designate the client C Obtain the intersection statistical eigenvalue. Then the anonymous privacy intersection protocol is executed as shown in Table 1 below: Table 1

[0059] It should be noted that some of the steps in Table 1 above, which are executed locally on the client side and the service side, can be executed in parallel or sequentially. For example, there is no specific restriction on the execution order of steps 1 to 4 and steps 5 to 8. In the anonymous privacy exchange process shown in Table 1 above, the client side and the service side encrypt the user ID twice through local calculation and communication interaction. Since ECDH encryption is a commutative encryption, The intersection elements are , so that the intersection index can be correctly output without exposing the plaintext data; further, the first data set and the second data set are rearranged twice based on random sorting, so that the service party can hide the original bit order of the user identifier from the client, and the client cannot know the result of the comparison after the second rearrangement. The same applies to the client side.

[0060] In an optional method embodiment of the present disclosure, the aforementioned switching network may include a control unit and conductors. The conductors facilitate data exchange between the switching network and the outside world. Data can be input into the switching network through the conductors, transmitted through paths within the switching network, and then output from the conductors. Within the switching network, the conductors also connect control units to form a topological structure. The type and number of control units can be configured based on actual needs. By adjusting the control units, the data transmission path within the switching network can be controlled.

[0061] In a switching network, each wire corresponds to a random mask generated by a service provider. Masking can be performed based on this random mask during data transmission. After rearranging the feature set based on the first random order, the service provider masks each feature value with the random mask corresponding to the wire, and then transmits the masked feature value to the corresponding wire. When the masked feature value is transmitted to the control unit via the wire, step 102 may specifically include the following step B.

[0062] Step B: Based on the second random order, the selection bits of each control unit are determined in sequence, so that the characteristic values ​​are masked according to the random mask of the selected wires in sequence, and are transmitted along the selected wires in sequence and output in the second random order to obtain the first characteristic secret fragment.

[0063] In the disclosed embodiment, after the client inputs a feature value that has undergone a first random ordering and masking process at the service end, each control unit along the transmission path can determine a selected bit based on a second random ordering, causing the feature value to be transmitted along the wire pointed to by the selected bit, and then processed in each control unit according to the random mask of the selected wire. In a switching network, after sequentially transmitting along the selected wires, the feature value can be output in the second random ordering and masked based on the random mask to obtain the first feature secret fragment of the ciphertext. Because the output wire of each control unit in the switching network is also the input wire of the next adjacent control unit, and each wire corresponds to a random mask, the random masks of adjacent control units can cancel each other out along the entire transmission path. Furthermore, the random mask of the input wire of the first control unit in the entire transmission path can be offset by the random mask masked by the service end before input, while the output wire of the last control unit no longer has the random mask offset by the input wire of the next control unit. Therefore, the first feature secret fragment is in the form of each feature value masked with the random mask corresponding to the output wire of the last control unit, and the output bit order conforms to the bit order rearranged by the second random ordering based on the rearrangement of the first random ordering.

[0064] In an optional method embodiment of the present disclosure, the wires include at least one unit input wire and at least one unit output wire corresponding to each control unit, and the wires further include a starting input wire and an ending output wire.

[0065] In the disclosed embodiments, each control unit may have at least one unit input conductor and at least one unit output conductor, which can be flexibly adjusted based on the type of control unit and the network topology. For adjacent and interconnected control units in the network topology, the unit output conductor of each control unit is also the unit input conductor of the next control unit, and the unit input conductor of each control unit is also the unit output conductor of the previous control unit.

[0066] On this basis, conductors can also be divided into starting input conductors and ending output conductors based on the method of data transmission with the outside world of the switching network. The starting input conductors are the conductors that each transmission path in the network topology receives external data input, and the ending output conductors are the conductors that each transmission path in the network topology outputs data to the outside world. It should be noted that each starting input conductor is also the unit input conductor of the first control unit on the corresponding transmission path, and each ending output conductor is also the unit output conductor of the last control unit on the corresponding transmission path.

[0067] After rearranging the feature set based on the first random order, the service provider performs an exclusive OR operation on each feature value and the random mask of the corresponding starting input wire to determine the first mask message transmitted on the starting input wire.

[0068] In the embodiment of the present disclosure, the random mask corresponding to each conductor is generated by the service party. After the service party rearranges the feature set based on the first random order, it can determine the starting input conductor corresponding to each characteristic value. The number of starting input conductors and terminating output conductors in the switching network can correspond to the number of characteristic values ​​in the feature set, so that each characteristic value corresponds to a starting input conductor. The correspondence between the characteristic value and the starting input conductor can be determined based on the bit order correspondence. For example, after the feature set is rearranged based on the first random order, the characteristic value with the first bit order corresponds to the starting input conductor with the first bit order, the characteristic value with the second bit order corresponds to the starting input conductor with the second bit order, and so on. On this basis, the service party performs XOR on each characteristic value with the random mask corresponding to the starting input conductor to determine the first mask message transmitted on the starting input conductor.

[0069] The aforementioned step B may include the following steps B1 to B3.

[0070] Step B1: determining a selection bit for each control unit in turn according to the second random order.

[0071] In the embodiment of the present disclosure, the client can determine the selection bit for each control unit in sequence based on the second random sorting. For example, if the feature value that is ranked first after the feature set is rearranged based on the first random sorting is ranked fifth after the feature set is rearranged by the second random sorting, then the client can determine the selection bit for the control unit with the first-ranked starting input conductor as the unit input conductor and the control units on the subsequent transmission path in sequence, so that the unit output conductor of the last control unit on the global path of the feature value is the fifth-ranked terminating output conductor, and the selection bits of other control units can be determined in the same way. The global path includes the entire transmission path from the starting input conductor to the terminating output conductor.

[0072] Step B2: Determine a second mask message transmitted on the local path consisting of the unit input wires and the unit output wires according to the selection bit; the second mask message is obtained by performing a random mask exclusive OR of the unit input wires and the unit output wires on the local path.

[0073] In an embodiment of the present disclosure, a local path includes unit input wires and unit output wires based on a selection bit of a control unit. When the unit input wires include at least one unit input wire and at least one unit output wire, a combination of unit input wires and unit output wires on a local path can be determined based on the selection bit determined by the client, thereby performing an exclusive-OR operation on the random masks corresponding to the unit input wires and the random masks corresponding to the unit output wires to determine a second masked message transmitted on the local path.

[0074] Step B3: On the global path from the starting input wire to the corresponding terminating output wire, perform XOR on the first mask message and the second mask message transmitted on each local path in sequence to obtain a first characteristic secret fragment.

[0075] In the disclosed embodiment, each characteristic value corresponds to a global path from the starting input conductor to the corresponding terminating output conductor. This global path includes a first masked message provided by the service provider and a second masked message transmitted on the corresponding local path of each control unit. Based on this, the first and second masked messages are sequentially XORed, with the intermediate random masks canceling each other out, to obtain the first characteristic secret fragment, which is the XOR of the characteristic value and the random mask corresponding to the terminating output conductor.

[0076] In an optional method embodiment of the present disclosure, Figure 2 This is a schematic diagram of the control principle of the replacement switch in the switching network provided by the embodiment of the present disclosure. Figure 2 As shown, the control unit includes a replacement switch 200. The replacement switch 200 includes a first unit input conductor 211 and a first unit output conductor 212 corresponding to the bit sequence, and a second unit input conductor 221 and a second unit output conductor 222 corresponding to the bit sequence.

[0077] For example, when the bit sequence corresponding to the first unit input conductor 211 is 1, the bit sequence corresponding to the first unit output conductor 212 is also 1; when the bit sequence corresponding to the second unit input conductor 221 is 2, the bit sequence corresponding to the second unit output conductor 222 is also 2. The above specific bit sequences are for illustration only and may be adjusted based on the actual switching network structure and random reordering requirements.

[0078] The aforementioned step B1 includes the following step B11 or step B12.

[0079] Step B11: Determine the replacement switch as a direct connection selection position based on the second random order, so that the first unit input wire and the first unit output wire form a local path, and the second unit input wire and the second unit output wire form a local path.

[0080] In the disclosed embodiment, if the client determines that the permutation switch is a direct connection selection bit based on the second random order, the permutation switch does not perform bit order permutation. If the first unit input wire and the first unit output wire form a local path, the second masked message transmitted on the local path is obtained by XORing the random mask of the first unit input wire and the random mask of the first unit output wire. If the second unit input wire and the second unit output wire form a local path, the second masked message transmitted on the local path is obtained by XORing the random mask of the second unit input wire and the random mask of the second unit output wire.

[0081] like Figure 2 As shown, when the permutation switch is in the direct connection selection position, the first unit input conductor 211 with the position sequence 1 and the first unit output conductor 212 form a local path; the second unit input conductor 221 with the position sequence 2 and the second unit output conductor 222 form a local path. In this case, the transmission path in the permutation switch 200 is directly connected from position sequence 1 to position sequence 1, and directly connected from position sequence 2 to position sequence 2.

[0082] Step B12: Determine the permutation switch to be a swap selection bit based on the second random order, so that the first unit input wire and the second unit output wire form a local path, and so that the second unit input wire and the first unit output wire form a local path.

[0083] In the disclosed embodiment, the client determines that the permutation switch is a swap selection bit based on the second random order, and then performs a bit order swap on the permutation switch. If the first unit input wire and the second unit output wire form a local path, the second masked message transmitted on the local path is obtained by XORing the random mask of the first unit input wire and the random mask of the second unit output wire. If the second unit input wire and the first unit output wire form a local path, the second masked message transmitted on the local path is obtained by XORing the random mask of the second unit input wire and the random mask of the first unit output wire.

[0084] like Figure 2 As shown, when the permutation switch is in the swap selection position, the first unit input conductor 211 with position 1 and the second unit output conductor 222 with position 2 form a local path; the second unit input conductor 221 with position 2 and the first unit output conductor 212 with position 1 form a local path. In this case, the transmission path is swapped from position 1 to position 2 and then from position 2 to position 1 at the permutation switch 200.

[0085] In an optional method embodiment of the present disclosure, Figure 3 A schematic diagram of the control principle of a multiplexer in a switching network provided by an embodiment of the present disclosure, such as Figure 3 As shown, the control unit includes a multiplexer 300, which includes k There are optional cell input conductors 310 and target cell output conductors 320.

[0086] Among them, the k can be greater than one, thereby forming a k Choose one of the local paths.

[0087] The aforementioned step B1 includes the following step B13.

[0088] Step B13: Determine the multiplexer based on the second random order. k Select one of the selection bits to make k Optional unit input conductors k The selected target unit input wire and the target unit output wire form a local path.

[0089] In the embodiment of the present disclosure, the client side selects the multiplexer based on the second random order. k Select a target cell input wire from the optional cell input wires to determine k On this basis, the target unit input wire and the target unit output wire form a local path, and the second mask message transmitted on the local path is obtained by XORing the random mask of the target unit input wire and the random mask of the target unit output wire.

[0090] For example, Figure 3 As shown, the client side selects the multiplexer 300 based on the second random order. k Select a target unit input wire 311 from the optional unit input wires 310, and determine k At this time, the target unit input wire 311 and the target unit output wire 320 form a local path.

[0091] In an optional method embodiment of the present disclosure, based on the client obtaining the first characteristic secret fragment, the service provider uses the random mask corresponding to the terminated output wire as the second characteristic secret fragment.

[0092] For example, referring to the aforementioned steps B1 to B3, after performing the anonymous privacy intersection in the aforementioned Table 1, the oblivious exchange network protocol can be executed to implement feature rearrangement based on secret sharing, and the client can provide a second random sort , the service provider can provide the data obtained in step 6 of Table 1 above. The switching network is as described above and will not be described in detail here. The execution process of the oblivious switching network protocol is shown in Table 2 below:

[0093] The output in steps 5 and 6 above and can be recovered by arithmetic addition as . Thus with In actual implementation of Table 2 above, a switching network that is programmable, rearrangeable, and capable of performing oblivious transfer calculations, such as a Benes network or a Waksman network, can be selected. Alternatively, the switching network can be constructed and adjusted according to actual needs.

[0094] For example, Figure 4 This is a schematic diagram of the switching network control flow provided by the embodiment of the present disclosure. Assume that the service provider provides , the customer adopts The eigenvalue order after rearrangement should be .like Figure 4 As shown, the switching network includes the starting input conductor , terminate the output wires , the oval boxes represent the permutation switches in the switching network, and the swap selection bit or direct connection selection bit of each permutation switch is marked; the square boxes represent the corresponding starting input, and the rearranged bit sequence after each set of permutation switches, until the output after the last set of permutation switches is obtained, and the output rearranged by the second random sorting is obtained. Based on the second random sorting, the global path can be determined (indicated by black lines), (indicated by red lines), (indicated by yellow lines), (Indicated by green lines). In a global path, at the direct connection selection position, the unit input wire i With unit output wire j The subscripts are consistent, indicating the same bit order; at the exchange selection position, the unit input wire i With unit output wire j The subscripts of are swapped to indicate the order of the bits is swapped.

[0095] With global path For example, you can include the input start wire The first mask message transmitted on , local path The second mask message transmitted on , local path The second mask message transmitted on , local path The second mask message transmitted on As you can see, the local path 、 Select bits for swapping, local paths Select bit for direct connection.

[0096] In the global path , and 、 and 、 and 、 and If they are actually the same wire, then their corresponding random masks are also the same, so they cancel each other out in the XOR operation, thereby performing the XOR operation of the first mask message and the second mask message. .

[0097] Global Path 、 、 This can be deduced from the above, so that the client can obtain the first characteristic secret fragment , the service provider obtains the second characteristic secret fragment .

[0098] In an optional method embodiment of the present disclosure, the statistical function includes at least one of a sum statistical function, a mean statistical function, a variance statistical function, a standard deviation statistical function, and an intersection potential statistical function.

[0099] In the embodiment of the present disclosure, the client can initiate the calculation of one or more statistical functions to the service provider. Different statistical functions have corresponding calculation requirements, so that the implementation details of the aforementioned steps 101 to 103 can be adaptively adjusted. Among them, the intersection potential statistical function is used to calculate the number of intersection elements between the first data set and the second data set; the sum statistical function is used to calculate the intersection statistical sum of the eigenvalues ​​corresponding to the intersection elements between the first data set and the second data set; the mean statistical function is used to calculate the intersection statistical mean of each intersection element based on the sum and the intersection potential; the variance statistical function is used to calculate the intersection statistical variance based on the eigenvalues ​​and mean corresponding to the intersection elements between the first data set and the second data set; the standard deviation statistical function is used to calculate the intersection statistical standard deviation based on the arithmetic square root of the variance.

[0100] For example, the intersection potential statistics function may determine the number of intersection elements from the intersection index.

[0101] The Private Set Intersection Summation (PSI-SUM) statistical function can be used to perform statistical calculations based on the first characteristic secret fragments obtained by the client and the second characteristic secret fragments obtained by the server in Table 2. The specific implementation process can be shown in Table 3 below: Table 3

[0102] Referring to Table 3 above, the mean statistical function based on the intersection of privacy sets (PSI-MEAN) can be used to calculate the intersection statistical mean based on the intersection potential, feature statistics and value using the following formula (2): : (2) Referring to Table 2 and Table 3 above, the variance statistics function (PSI-VAR, PSI-Variance) and the standard deviation statistics function (PSI-SD, PSI-Standard Deviation) based on the intersection of privacy sets can be used to square the eigenvalues ​​during the execution of Table 2. The oblivious exchange network protocol is also implemented to achieve the square rearrangement of the eigenvalues ​​based on secret sharing, so that the client obtains the first square secret fragment of the eigenvalues ​​and the service obtains the second square secret fragment of the eigenvalues. Calculate according to the following formula (3): (3) And, the characteristic statistical standard deviation Calculate according to the following formula (4): (4) The disclosed embodiments provide a method for processing private data. In this solution, the client can use exchangeable encryption to perform anonymous and private intersection with the service party's second data set based on a local first data set to obtain an intersection index. During the anonymous and private intersection process, the second data set is rearranged by the service party and the client using a first random sort and a second random sort, respectively. The aforementioned intersection index indicates the order of the intersection ciphertext in the second data set after exchangeable encryption and rearrangement by the client. On this basis, based on the second random sort, a feature set rearranged by the first random sort is used to perform secret sharing with the service party through an exchange network to obtain a first feature secret fragment, and the service party obtains a second feature secret fragment. The feature set corresponds to the original second data set before being rearranged by the first random sort. A statistical function is calculated based on the intersection index, the first feature secret fragment, and the second feature secret fragment to obtain a statistical feature value of the intersection of the first data set and the second data set. In this solution, the client and service party holding the data can directly participate in the calculation without relying on a third party, which reduces deployment costs and improves deployment convenience. The two parties determine the intersection index only in the ciphertext state through the intersection of privacy sets, and do not obtain the plaintext data of the intersection. The feature set is rearranged based on the exchange network. The service party and the client party only obtain the rearranged feature secret fragments, and do not obtain the plaintext data of the feature set. The feature statistical function calculation is completed safely and efficiently, further enhancing security.

[0103] The following are embodiments of the apparatus disclosed herein, which can be used to implement the method embodiments disclosed herein. For details not disclosed in the apparatus embodiments disclosed herein, please refer to the method embodiments disclosed herein.

[0104] The exemplary embodiment of the present disclosure also provides a device for processing private data, which is applied to the client. Figure 5 As shown, the privacy data processing device may include: a stealth privacy intersection module 501, which is used to perform stealth privacy intersection with the second data set of the service party based on the first data set using exchangeable encryption to obtain an intersection index; the second data set is rearranged in a first random order on the service party, and then rearranged in a second random order on the client party; the intersection index includes the order of the intersection ciphertext in the second data set after exchangeable encryption and rearrangement on the client side; an oblivious transmission module 502, which is used to perform secret sharing with the service party based on the second random order through the exchange network using the feature set rearranged by the first random order to obtain a first feature secret fragment; the feature set corresponds to the original second data set; the service party obtains the second feature secret fragment; a feature statistics module 503, which is used to perform statistical function calculation based on the intersection index, the first feature secret fragment and the second feature secret fragment to obtain a statistical feature value of the intersection of the first data set and the second data set.

[0105] In an exemplary embodiment of the present disclosure, a switching network includes a control unit and conductors, each conductor corresponding to a random mask generated by a service party; the service party rearranges the feature set based on a first random order, masks each feature value with the random mask of the corresponding conductor, and inputs the mask into the corresponding conductor; the oblivious transmission module 502 is specifically used to determine the selection bit of each control unit in sequence based on a second random order, so that the feature values ​​are masked according to the random mask of the selected conductor in sequence, and are transmitted along the selected conductor in sequence and output in the second random order to obtain the first feature secret fragment.

[0106] In an exemplary embodiment of the present disclosure, the wires include at least one unit input wire and at least one unit output wire corresponding to each control unit, and the wires also include a starting input wire and a terminating output wire; after the service party rearranges the feature set based on the first random order, each feature value is XORed with the random mask of the corresponding starting input wire to determine the first masked message transmitted on the starting input wire; the oblivious transmission module 502 is specifically used to determine the selection bit for each control unit in turn according to the second random order; determine the second masked message transmitted on the local path composed of the unit input wire and the unit output wire according to the selection bit; the second masked message is obtained by XORing the random masks of the unit input wire and the unit output wire on the local path; on the global path from the starting input wire to the corresponding terminating output wire, the first masked message and the second masked message transmitted on each local path are XORed in turn to obtain the first feature secret fragment.

[0107] In an exemplary embodiment of the present disclosure, the control unit includes a permutation switch, which includes a first unit input wire and a first unit output wire corresponding to a bit sequence, and a second unit input wire and a second unit output wire corresponding to a bit sequence; the oblivious transmission module 502 is specifically used to determine, based on a second random sort, that the permutation switch is a direct connection selection bit, so that the first unit input wire and the first unit output wire form a local path, and the second unit input wire and the second unit output wire form a local path; based on the second random sort, determine that the permutation switch is an exchange selection bit, so that the first unit input wire and the second unit output wire form a local path, and the second unit input wire and the first unit output wire form a local path.

[0108] In an exemplary embodiment of the present disclosure, the control unit includes a multiplexer, the multiplexer includes k The oblivious transmission module 502 is specifically configured to determine the multiplexer is a plurality of optional unit input conductors and a target unit output conductor based on the second random order. k Select one of the selection bits to make k Optional unit input conductors kThe selected target unit input wire and the target unit output wire form a local path.

[0109] In an exemplary embodiment of the present disclosure, the service party uses the random mask corresponding to the terminated output wire as the second characteristic secret fragment.

[0110] In an exemplary embodiment of the present disclosure, the anonymous privacy intersection module 501 is specifically used to rearrange the first data set in a third random order, map it to a predetermined elliptic curve, and encrypt it based on the first private key to obtain a first encryption result; send the first encryption result to the service party; obtain a second encryption result provided by the service party, the second encryption result is obtained by the service party rearranging the second data set in the first random order, mapping it to a predetermined elliptic curve, and encrypting it based on the second private key; rearrange the second encryption result in a second random order and encrypt it based on the first private key to obtain a third encryption result, and provide the third encryption result to the service party; obtain a fourth encryption result provided by the service party, the fourth encryption result is obtained by the service party rearranging the first encryption result in a fourth random order and encrypting it based on the second private key; compare the third encryption result with the fourth encryption result to obtain the intersection index of the intersection ciphertext in the third encryption result.

[0111] In an exemplary embodiment of the present disclosure, the statistical function includes at least one of a sum statistical function, a mean statistical function, a variance statistical function, a standard deviation statistical function, and an intersection potential statistical function.

[0112] The specific details of each module in the above-mentioned privacy data processing device have been described in detail in the corresponding privacy data processing method, so they will not be repeated here.

[0113] It should be noted that although several modules or units of the device for action execution are mentioned in the detailed description above, this division is not mandatory. In fact, according to the embodiments of the present disclosure, the features and functions of two or more modules or units described above can be concretized in one module or unit. Conversely, the features and functions of one module or unit described above can be further divided into multiple modules or units to be concretized.

[0114] Furthermore, although the steps of the method of the present disclosure are described in a particular order in the accompanying drawings, this does not require or imply that the steps must be performed in this particular order, or that all steps shown must be performed to achieve the desired results. Additionally or alternatively, some steps may be omitted, multiple steps may be combined into one step, and / or one step may be decomposed into multiple steps.

[0115] In exemplary embodiments of the present disclosure, an electronic device capable of implementing the above-described method is also provided. Those skilled in the art will appreciate that various aspects of the present disclosure can be implemented as systems, methods, or program products. Therefore, various aspects of the present disclosure can be specifically implemented in the following forms: a complete hardware implementation, a complete software implementation (including firmware, microcode, etc.), or an implementation that combines hardware and software aspects, which may be collectively referred to herein as a "circuit," "module," or "system."

[0116] Refer to the following Figure 6 hereinafter, an electronic device 600 according to this embodiment of the present disclosure is described. Figure 6 The electronic device 600 shown is merely an example and should not limit the functions and scope of use of the embodiments of the present disclosure.

[0117] like Figure 6 As shown, electronic device 600 is implemented as a general-purpose computing device. Components of electronic device 600 may include, but are not limited to, the aforementioned at least one processing unit 610, the aforementioned at least one storage unit 620, a bus 630 connecting various system components (including storage unit 620 and processing unit 610), and a display unit 640.

[0118] The storage unit stores program codes, which can be executed by the processing unit 610, so that the processing unit 610 performs the steps described in the "Exemplary Method" section of the present disclosure according to various exemplary embodiments. For example, the processing unit 610 can perform the following steps: Figure 1 The method of handling private data shown in .

[0119] The storage unit 620 may include a readable medium in the form of a volatile storage unit, such as a random access memory unit (RAM) 6201 and / or a cache memory unit 6202 , and may further include a read-only memory unit (ROM) 6203 .

[0120] The storage unit 620 may also include a program / utility 6204 having a set (at least one) of program modules 6205, such program modules 6205 including but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which or some combination may include an implementation of a network environment.

[0121] Bus 630 may represent one or more of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.

[0122] The electronic device 600 can also communicate with one or more external devices 700 (e.g., a keyboard, pointing device, Bluetooth device, etc.), one or more devices that enable a user to interact with the electronic device 600, and / or any device that enables the electronic device 600 to communicate with one or more other computing devices (e.g., a router, modem, etc.). This communication can occur via an input / output (I / O) interface 650. Furthermore, the electronic device 600 can communicate with one or more networks (e.g., a local area network (LAN), a wide area network (WAN), and / or a public network such as the Internet) via a network adapter 660. As shown, the network adapter 660 communicates with other modules of the electronic device 600 via a bus 630. It should be understood that, although not shown in the figure, other hardware and / or software modules can be used in conjunction with the electronic device 600, including but not limited to microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems.

[0123] Through the description of the above embodiments, it will be readily understood by those skilled in the art that the example embodiments described herein can be implemented via software or via a combination of software and necessary hardware. Therefore, the technical solutions according to the embodiments of the present disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (such as a CD-ROM, USB flash drive, or mobile hard drive) or on a network and includes several instructions for enabling a computing device (such as a personal computer, server, terminal device, or network device) to execute the methods according to the embodiments of the present disclosure.

[0124] In exemplary embodiments of the present disclosure, a computer-readable storage medium is also provided, on which is stored a program product capable of implementing the aforementioned methods of this specification. In some possible implementations, various aspects of the present disclosure may also be implemented in the form of a program product comprising program code. When the program product is executed on a terminal device, the program code is configured to cause the terminal device to execute the steps described in the "Exemplary Methods" section of this specification according to various exemplary embodiments of the present disclosure.

[0125] According to an embodiment of the present disclosure, a program product for implementing the above-mentioned method can be a portable compact disc read-only memory (CD-ROM) and include program code, and can be run on a terminal device, such as a personal computer. However, the program product of the present disclosure is not limited thereto. In this document, a readable storage medium can be any tangible medium containing or storing a program, which can be used by or in conjunction with an instruction execution system, apparatus, or device.

[0126] The program product may utilize any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. The readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or component, or any combination thereof. More specific examples (a non-exhaustive list) of readable storage media include: an electrical connection having one or more wires, a portable disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof.

[0127] A computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, which carries readable program code. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. A readable signal medium may also be any readable medium other than a readable storage medium that can transmit, propagate, or transfer a program for use by or in conjunction with an instruction execution system, apparatus, or device.

[0128] The program code embodied on the readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

[0129] Program code for performing the operations of the present disclosure may be written in any combination of one or more programming languages, including object-oriented programming languages ​​such as Java, C++, and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user's computing device, partially on the user's device, as a standalone software package, partially on the user's computing device and partially on a remote computing device, or entirely on a remote computing device or server. In cases involving a remote computing device, the remote computing device may be connected to the user's computing device via any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computing device (e.g., via the Internet using an Internet service provider).

[0130] Furthermore, the figures above are merely illustrative of the processes included in the methods according to exemplary embodiments of the present disclosure and are not intended to be limiting. It is readily understood that the processes illustrated in the figures above do not indicate or limit the temporal order of these processes. Furthermore, it is readily understood that these processes may be executed synchronously or asynchronously, for example, in multiple modules.

[0131] Other embodiments of the present disclosure will readily occur to those skilled in the art after considering the specification and practicing the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the present disclosure that follow from the general principles of the present disclosure and include common knowledge or customary techniques in the art not invented herein. The specification and examples are to be considered as exemplary only, with the true scope and spirit of the present disclosure being indicated by the claims.

Claims

1. A method for processing private data, characterized in that: Applied to the client, the method for processing the privacy data includes: Based on the first data set, a private intersection is performed with a second data set on the service side using exchangeable encryption to obtain an intersection index; the second data set is rearranged on the service side using a first random ordering, and then rearranged on the client side using a second random ordering; the intersection index includes the bit order of the intersection ciphertext in the second data set after exchangeable encryption and rearrangement on the client side; Based on the second random ordering, secret sharing is performed with the service provider via an exchange network using the feature set rearranged by the first random ordering to obtain first feature secret fragments; the feature set corresponds to the original second data set; and the service provider obtains second feature secret fragments; A statistical function calculation is performed based on the intersection index, the first secret feature fragment, and the second secret feature fragment to obtain a statistical feature value of the intersection of the first data set and the second data set.

2. The method for processing private data according to claim 1, characterized in that: The switching network includes a control unit and wires, each of the wires corresponding to a random mask generated by the service provider; The service provider rearranges the feature set based on the first random order, masks each feature value with the random mask corresponding to the wire, and inputs the mask into the corresponding wire; and based on the second random order, performs secret sharing with the service provider using the feature set rearranged by the first random order through a switching network to obtain a first feature secret fragment, including: Based on the second random order, the selection bit of each control unit is determined in sequence, so that the characteristic value is masked according to the random mask of the selected wire in sequence, and is transmitted along the selected wire in sequence and output in the second random order to obtain the first characteristic secret fragment.

3. The method for processing private data according to claim 2, characterized in that: The conductors include at least one unit input conductor and at least one unit output conductor corresponding to each control unit, and the conductors also include a starting input conductor and a terminating output conductor; The service party rearranges the feature set based on the first random order, performs exclusive OR operation on each feature value and the random mask corresponding to the starting input wire, and determines the first mask message transmitted on the starting input wire; the selection bit of each control unit is sequentially determined based on the second random order, so that the feature values ​​are sequentially masked according to the random mask of the selected wire, and are sequentially transmitted along the selected wire and output in the second random order to obtain the first feature secret fragment, including: determining a selection bit for each of the control units in turn according to the second random order; Determining a second mask message transmitted on a local path composed of the unit input wire and the unit output wire according to the selection bit; the second mask message is obtained by performing an exclusive OR operation of the random mask on the unit input wire and the unit output wire on the local path; On a global path from the starting input wire to the corresponding terminating output wire, the first mask message and the second mask message transmitted on each of the local paths are sequentially XORed to obtain a first characteristic secret fragment.

4. The method for processing private data according to claim 3, characterized in that: The control unit includes a replacement switch, and the replacement switch includes a first unit input wire and a first unit output wire corresponding to the bit sequence, and a second unit input wire and a second unit output wire corresponding to the bit sequence; The step of determining a selection bit for each control unit according to the second random ordering includes: Determining the replacement switch as a direct connection selection bit based on the second random order, so that the first unit input wire and the first unit output wire form the local path, and so that the second unit input wire and the second unit output wire form the local path; The permutation switch is determined to swap selection bits based on the second random order, so that the first unit input wire and the second unit output wire form the local path, and the second unit input wire and the first unit output wire form the local path.

5. The method for processing private data according to claim 3, characterized in that: The control unit includes a multiplexer, the multiplexer including k Optional cell input wires and target cell output wires; The step of determining a selection bit for each control unit according to the second random ordering includes: The multiplexer is determined to be based on the second random order k Select one of the selection bits to make k The optional unit input wire k The selected target unit input wire and the target unit output wire form the local path.

6. The method for processing private data according to claim 3, characterized in that: The service provider uses the random mask corresponding to the terminated output wire as the second characteristic secret fragment.

7. The method for processing private data according to claim 1, characterized in that: The method of performing an anonymous intersection with the service provider's second data set using exchangeable encryption based on the first data set to obtain an intersection index includes: Rearranging the first data set in a third random order, mapping the data set to a predetermined elliptic curve, and encrypting the data set based on a first private key to obtain a first encryption result; Sending the first encryption result to the service provider; Obtaining a second encryption result provided by the service provider, where the second encryption result is obtained by the service provider rearranging the second data set in the first random order, mapping the second data set to a predetermined elliptic curve, and encrypting the data set based on a second private key; Rearranging the second encryption result in the second random order and encrypting the result based on the first private key to obtain a third encryption result, and providing the third encryption result to the service provider; Obtaining a fourth encryption result provided by the service provider, where the fourth encryption result is obtained by the service provider rearranging the first encryption result in a fourth random order and encrypting the result based on the second private key; The third encryption result is compared with the fourth encryption result to obtain an intersection index of the intersection ciphertext in the third encryption result.

8. The method for processing private data according to any one of claims 1 to 7, characterized in that: The statistical function includes at least one of a sum statistical function, a mean statistical function, a variance statistical function, a standard deviation statistical function, and an intersection potential statistical function.

9. A device for processing private data, characterized in that: Applied to the client side, the privacy data processing device includes: a privacy-anonymous intersection module configured to perform privacy-anonymous intersection on a first data set with a second data set on a service provider using exchangeable encryption to obtain an intersection index; the second data set is rearranged on the service provider using a first random ordering and then rearranged on the client provider using a second random ordering; the intersection index comprises the order of the intersection ciphertext in the second data set after exchangeable encryption and rearrangement on the client provider; an oblivious transfer module, configured to perform secret sharing with the service provider via a switching network based on the second random ordering, using a feature set rearranged by the first random ordering, to obtain first feature secret fragments; the feature set corresponds to an original second data set; and the service provider obtains second feature secret fragments; A feature statistics module is used to perform statistical function calculation based on the intersection index, the first feature secret fragment and the second feature secret fragment to obtain a statistical feature value of the intersection of the first data set and the second data set.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the method for processing privacy data according to any one of claims 1 to 8 is implemented.

11. An electronic device, characterized in that: include: processor; as well as a memory for storing executable instructions of the processor; The processor is configured to execute the privacy data processing method according to any one of claims 1 to 8 by executing the executable instructions.

Images