Blacklist obfuscation method and device based on secret sharing network and determination system

Abstract

The application provides a black list confusion method and device based on a secret sharing network and a judgment system. The method comprises the following steps: a confusion node receives secret shares sent by N bank nodes; wherein, the black list data of each bank node is regarded as a secret, the secret is split into N secret shares, and the N secret shares are sent to N confusion nodes respectively, N is a natural number greater than or equal to 3; the confusion node sums and encrypts the received secret shares to obtain confusion data; and the confusion node sends the confusion data to a judgment node; wherein, the confusion data is used by the judgment node to judge whether the secret is a black list. Based on the secret sharing network, the secret splitting algorithm and the secret confusion, the application can prevent brute force cracking, so that the black list customer data of the shared banks can be shared under the premise of ensuring data security and confidentiality, and the interference of the random value of the local differential privacy algorithm is avoided, and the judgment result is more accurate.

Description

Technical Field

[0001] This application relates to the financial field, and in particular to a blacklist obfuscation method and apparatus based on a secret sharing network. Background Technology

[0002] To improve blacklist management and mitigate operational and reputational risks associated with blacklist-related business, banks need to utilize richer data for risk control. If all banks could share their blacklist data, risk control could be based on big data. However, due to security and data confidentiality considerations, disclosing or sharing blacklist data carries certain risks.

[0003] Existing data security methods, such as personalized local differential privacy-based data collection methods, involve users adding perturbations to the original data, and the server aggregating and statistically analyzing the perturbated data to estimate the frequency distribution of the original data.

[0004] However, the above methods cannot solve the problem of brute-force attacks that make multiple requests for the same data. Moreover, when the sampled data is not large enough, the noise after aggregation cannot be eliminated within a controllable threshold, thus affecting the accuracy of the final result.

[0005] The purpose of this application is to provide a blacklist obfuscation method and apparatus based on a secret sharing network, which can prevent brute-force attacks, thereby sharing blacklist customer data between banks while ensuring data security and confidentiality, and avoiding interference from random values ​​of local differential privacy algorithms, resulting in more accurate judgment results. Summary of the Invention

[0006] This application provides a blacklist obfuscation method based on a secret sharing network, the method comprising:

[0007] The obfuscation node receives secret shares sent by N bank nodes; wherein, the blacklist data of each bank node is used as a secret, and the secret of each bank node is split into N secret shares and sent to the N obfuscation nodes respectively, where N is a natural number greater than or equal to 3;

[0008] The obfuscated node sums and encrypts the received secret shares to obtain obfuscated data; and

[0009] The obfuscated node sends the obfuscated data to the determination node; wherein the obfuscated data is used by the determination node to determine whether the secret is on the blacklist.

[0010] In a specific embodiment, the number of bank nodes is the same as the number of obfuscated nodes, and the determination node receives N obfuscated data sent by N obfuscated nodes.

[0011] In a specific embodiment, the secret of each bank node is split into N secret shares and sent to N obfuscation nodes respectively, including:

[0012] A secret sequence is randomly generated, the secret sequence containing multiple equally sized secret shares;

[0013] The secret sequence is subjected to interval testing and outlier testing;

[0014] If the verification passes, the secret is split into multiple secret shares according to the secret sequence.

[0015] In a specific embodiment, the interval test refers to testing the Nth secret share r N Does it meet the following conditions:

[0016] r N ∈[-k,k],

[0017] Where N is a natural number greater than or equal to 3, and k is a constant greater than a preset value.

[0018] In a specific embodiment, the outlier detection refers to testing any element r in the set C. i Does it meet the following conditions:

[0019] (1)

[0020] (2)

[0021] Wherein, the set C refers to the set {r1, r2, ... r} composed of the secret shares. N The subset obtained by removing any element from}, where k is a constant greater than the preset value.

[0022] In a specific embodiment, the determination node sums up the N obfuscated data received and determines whether the secret is on the blacklist based on the summation result.

[0023] This application also provides a computer device, including a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, it implements the above-described blacklist obfuscation method based on a secret sharing network.

[0024] This application also provides a computer-readable storage medium storing a computer program that performs the above-described blacklist obfuscation method based on a secret sharing network.

[0025] This application provides a blacklist obfuscation device based on a secret sharing network, the device comprising:

[0026] A receiving unit is used to receive secret shares sent by N bank nodes; wherein, the blacklist data of each bank node is used as a secret, and the secret of each bank node is split into N secret shares and sent to the N obfuscated nodes respectively, where N is a natural number greater than or equal to 3.

[0027] The processing unit sums and encrypts the received secret shares to obtain obfuscated data; and

[0028] The sending unit sends the obfuscated data to the determination node; wherein the obfuscated data is used by the determination node to determine whether the secret is on the blacklist.

[0029] This application provides a blacklist determination system based on a secret sharing network, the system comprising:

[0030] A bank node is used to treat blacklist data as a secret, split the secret into multiple secret shares, and send them to multiple obfuscation nodes respectively;

[0031] A confusion node, configured to sum and encrypt multiple received secret shares to obtain confused data, and send the confused data to a decision node; and

[0032] A determination node is used to determine whether the secret is on a blacklist based on the received obfuscated data.

[0033] In this embodiment of the application, based on a secret sharing network, secret splitting algorithm and secret obfuscation are used to prevent brute-force attacks, thereby sharing blacklist customer data between banks while ensuring data security and confidentiality, and avoiding interference from random values ​​of local differential privacy algorithms, resulting in more accurate judgment results. Attached Figure Description

[0034] To more clearly illustrate the technical solutions of the embodiments of this application, the drawings used in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0035] Figure 1 This is a flowchart of a blacklist obfuscation method based on a secret sharing network in an embodiment of this application;

[0036] Figure 2 This is a schematic diagram of a secret sharing network according to an embodiment of this application;

[0037] Figure 3 This is a flowchart illustrating the splitting secret in an embodiment of this application;

[0038] Figure 4 This is another schematic diagram of a secret sharing network according to an embodiment of this application;

[0039] Figure 5 This is a schematic diagram of a blacklist obfuscation device based on a secret sharing network according to an embodiment of this application;

[0040] Figure 6 This is a schematic diagram of a blacklist determination system based on a secret sharing network according to an embodiment of this application;

[0041] Figure 7 This is a schematic diagram of a bank node according to an embodiment of this application;

[0042] Figure 8 This is another schematic diagram of the blacklist determination system based on a secret sharing network according to an embodiment of this application;

[0043] Figure 9 This is a schematic diagram of a computer device according to an embodiment of this application. Detailed Implementation

[0044] Referring to the accompanying drawings, the foregoing and other features of this application will become apparent from the following description. Specific embodiments of this application are specifically disclosed in the description and drawings, illustrating partial implementations in which the principles of this application may be employed. It should be understood that this application is not limited to the described embodiments; rather, it includes all modifications, variations, and equivalents falling within the scope of the appended claims.

[0045] In embodiments of this application, the term "and / or" includes any one and all combinations of one or more of the terms listed in association. The terms "comprising," "including," "having," etc., refer to the presence of the stated features, elements, components, or assemblies, but do not exclude the presence or addition of one or more other features, elements, components, or assemblies.

[0046] In the embodiments of this application, the singular forms "a," "the," etc., may include the plural forms and should be broadly interpreted as "a kind" or "a class" rather than limited to the meaning of "an." Furthermore, the term "the" should be understood to include both the singular and plural forms unless the context explicitly indicates otherwise. Additionally, the term "according to" should be understood as "at least partially based on…," and the term "based on" should be understood as "at least partially based on…," unless the context explicitly indicates otherwise.

[0047] This application provides a blacklist obfuscation method based on a secret sharing network. Figure 1This is a flowchart of a blacklist obfuscation method based on a secret sharing network, as described in an embodiment of this application. Figure 1 As shown, the method includes:

[0048] Step 11: The obfuscated node receives secret shares sent by N bank nodes; wherein, the blacklist data of each bank node is used as a secret, and the secret of each bank node is split into N secret shares and sent to N obfuscated nodes respectively, where N is a natural number greater than or equal to 3;

[0049] Step 12: The obfuscated node sums and encrypts the received secret shares to obtain obfuscated data; and

[0050] Step 13: The obfuscated node sends the obfuscated data to the determination node; wherein, the obfuscated data is used by the determination node to determine whether the secret is on the blacklist.

[0051] As can be seen from the above embodiments, this application, based on a secret sharing network, can prevent brute-force attacks through secret splitting algorithms and secret obfuscation. Even if information from multiple nodes is intercepted, the secret cannot be recovered. Thus, under the premise of ensuring data security and confidentiality, it can share blacklist customer data between banks and avoid interference from random values ​​of local differential privacy algorithms, resulting in more accurate judgment results.

[0052] In some embodiments, blacklist data is used as secret S, and secret sharing technology is used to split secret S.

[0053] The core idea of ​​secret sharing is to divide a secret into appropriate shares, each of which can be managed by different participants. A single participant cannot recover the secret information; only through the collaboration of several participants can the secret be recovered. More importantly, if any participant within a given group encounters a problem, the secret can still be fully recovered. Secret sharing is a cryptographic technique that divides and stores secrets to prevent them from becoming too centralized, thereby distributing risk and tolerating intrusion. It is an important means of information security and data confidentiality. Secret sharing involves two parameters, for example, t and n, which can be called (t, n) secret sharing. Here, n represents the number of shares into which the secret is divided, and t indicates that at least t shares are needed to recover the secret; any number of shares less than t will not yield any relevant information about the secret.

[0054] For example, the secret S is randomly split into a sequence of secret components (S1, S2, ..., S...). N ),in Each component after splitting is random and of uniform size. Through this splitting, even if N-1 secret components are obtained, the secret cannot be restored or deduced, thereby improving security.

[0055] Figure 2 This is a schematic diagram of a secret sharing network according to an embodiment of this application. Figure 2 As shown, the secret-sharing network consists of three layers. The first layer consists of bank nodes. At each bank node, the secret is split and shared. There are N bank nodes, denoted as 10⁻¹, 10⁻², ..., 10⁻ⁿ. The blacklist data of bank nodes 10⁻¹, 10⁻², ..., 10⁻ⁿ are denoted as secrets S₁, S₂, ..., Sₙ. N N is a natural number greater than or equal to 3. The second layer of network nodes are obfuscation nodes, which obfuscate the split secret shares. There are N obfuscation nodes, denoted as 20-1, 20-2, ..., 20-N. The number of obfuscation nodes is the same as the number of bank nodes. The third layer of network nodes are decision nodes, which determine whether a customer is on the blacklist based on the obfuscated data. There is one decision node, denoted as 30.

[0056] Figure 3 This is a flowchart illustrating the splitting of secrets in an embodiment of this application. For example... Figure 3 As shown, the steps to decipher the secret are as follows:

[0057] Step 111: Randomly generate a secret sequence, wherein the secret sequence contains multiple equally sized secret shares;

[0058] In some embodiments, the secret S is randomly split into a secret sequence (r1, r2, ..., r N The secret sequence contains multiple secret shares of equal size, r i = rand(-1,1)*k, Where i = 1, 2, ..., N-1, and k is a constant greater than a preset value, for example, 1 x 10^2. 5 A relatively large constant, N, is a natural number greater than or equal to 3, and its number is the same as the number of obfuscated nodes and bank nodes. If the secret S is a blacklisted customer, then S = 1; otherwise, S = 0.

[0059] Step 112: Perform interval testing and outlier testing on the randomly generated secret sequence. If the tests pass, proceed to step 113; if the tests fail, return to step 111.

[0060] In some embodiments, interval testing refers to testing the secret share r N Is it within the interval [-k, k], i.e., r? N ∈[-k,k].

[0061] In some embodiments, outlier detection refers to: defining a set C, which represents the set {r1, r2, ... r...}. N The subset formed by removing any element from set C. There are N sets C. For all sets C, examine each element r in set C. i Does it meet the following two conditions:

[0062] (1)

[0063] (2)

[0064] The degrees of freedom for the secret share are N-1. Outlier testing aims to prevent the secret S from being inferred from the N-1 secret shares. Assuming secret S is a non-blacklisted customer, then S = 0. Assume r... N =k-0.1, then Assume r1, r2, ... r N-1 Leaked, due to r i If the value is in the range [-k, k], then it can be deduced that the secret S is definitely not equal to 1; otherwise, r N =1-(-k+0.1)=k+0.9, which is outside the range [-k,k], so it can be deduced that the secret S=0, and the secret has been leaked.

[0065] Step 113: Divide the secret into multiple secret shares according to the randomly generated secret sequence.

[0066] For example, the secret sequence contains N secret shares r i Encryption is performed using the public key of the corresponding obfuscation node, and then the data is sent to that obfuscation node. For example, secret share r1 is encrypted using the public key of obfuscation node 20-1 to obtain secret component S1, and secret component S1 is sent to obfuscation node 20-1. Similarly, secret share r... N The secret component S is obtained by encrypting the public key of the corresponding obfuscated node 20-N. N and the secret component S N Send to obfuscated node 20-N. Thus, even if a certain secret component S... i If intercepted by other obfuscated nodes, it is impossible to recover the corresponding secret share r. i .

[0067] Figure 4 This is another schematic diagram of a secret sharing network according to an embodiment of this application. Figure 4 In this example, the number of bank nodes and obfuscation nodes is 3.

[0068] like Figure 4As shown, the secret S1 of bank node 10-1 is split into a secret sequence containing 3 secret shares, which are denoted as S1, S2, S3, S4, S5, S6, S7, S8, S9, S10, S11, S10 ... 11 S 12 and S 13 The secret share S of bank node 10-1 11 S 12 and S 13 Send the data to obfuscation nodes 20-1, 20-2, and 20-3 respectively. Similarly, send the secret share S of bank node 10-2. 21 S 22 and S 23 Send the secret share S of bank node 10-3 to obfuscation nodes 20-1, 20-2, and 20-3 respectively. 31 S 32 and S 33 Send them to obfuscation nodes 20-1, 20-2 and 20-3 respectively.

[0069] like Figure 4 As shown, the secret share S received by node 20-1 from 3 bank nodes is confused. 11 S 21 and S 31 Summation and encryption are performed to obtain obfuscated data p1, where, Similarly, the secret share S received by node 20-2 from the three bank nodes will be confused. 12 S 22 and S 32 Summation and encryption are performed to obtain obfuscated data p2. The secret share S received by obfuscated node 20-3 from the three bank nodes is then processed. 13 S 23 and S 33 Summation and encryption are performed to obtain obfuscated data p3. By obfuscating the secret share, even if the obfuscated data is intercepted, the secret share cannot be recovered, thus protecting the secret.

[0070] like Figure 4 As shown, the three obfuscated data points p1, p2, and p3 received by decision node 30 are summed, i.e. If the summation result is greater than or equal to 1, then the secret is in the blacklist; otherwise, it is not in the blacklist.

[0071] As mentioned above, by splitting the secret S into N equally sized secret shares according to the above method, even if N-1 secret shares are intercepted, the secret cannot be recovered or deduced. Thus, this method has a protection strength of N-1 dimensions.

[0072] In some embodiments, obfuscated node 20-i can be merged into bank node 10-i. Since the bank node can prevent leakage caused by the combination of N bank nodes, the protection strength can be increased from N-1 dimensions to N dimensions.

[0073] The above specific applications are merely examples; other implementation methods will not be described in detail.

[0074] Based on the same inventive concept, this application also provides a blacklist obfuscation device based on a secret sharing network. Since the principle behind the problem solved by the blacklist obfuscation device based on a secret sharing network is similar to that of the blacklist obfuscation method based on a secret sharing network, the implementation of the blacklist obfuscation device based on a secret sharing network can refer to the implementation of the blacklist obfuscation method based on a secret sharing network; repeated details will not be elaborated further.

[0075] Figure 5 This is a schematic diagram of a blacklist obfuscation device based on a secret sharing network, according to an embodiment of this application. Figure 5 As shown, the blacklist obfuscation device 1 based on a secret sharing network provided in this application embodiment includes a receiving unit 201, a processing unit 202, and a sending unit 203.

[0076] The receiving unit 201 is used to receive secret shares sent by N bank nodes; wherein, the blacklist data of each bank node is used as a secret, and the secret of each bank node is split into N secret shares and sent to the N obfuscated nodes respectively, where N is a natural number greater than or equal to 3.

[0077] Processing unit 202 is used to sum and encrypt the received secret share to obtain obfuscated data.

[0078] The sending unit 203 is used to send the obfuscated data to the determination node; wherein the obfuscated data is used by the determination node to determine whether the secret is on the blacklist.

[0079] As can be seen from the above embodiments, this application, based on a secret sharing network, can prevent brute-force attacks through secret splitting algorithms and secret obfuscation. Even if information from multiple nodes is intercepted, the secret cannot be recovered. Thus, under the premise of ensuring data security and confidentiality, it can share blacklist customer data between banks and avoid interference from random values ​​of local differential privacy algorithms, resulting in more accurate judgment results.

[0080] The blacklist obfuscation device 1 based on a secret sharing network provided in this application embodiment may include the obfuscation node 20 described above, or may be set in the obfuscation node 20 described above.

[0081] Based on the same inventive concept, embodiments of this application also provide a blacklist determination system based on a secret sharing network.

[0082] Figure 6 This is a schematic diagram of a blacklist determination system based on a secret sharing network, according to an embodiment of this application. Figure 6 As shown, the blacklist determination system 3 based on a secret sharing network provided in this application embodiment includes a bank node 10, a confusion node 20, and a determination node 30.

[0083] In some embodiments, bank node 10 is used to split the blacklist data into multiple secret shares and send them to multiple obfuscation nodes 20 respectively. The number of bank nodes 10 is N, and each bank node 10 is denoted as 10-1, 10-2, ..., 10-N.

[0084] In some embodiments, the obfuscation node 20 is used to sum and encrypt the received multiple secret shares to obtain obfuscated data, and then send the obfuscated data to the decision node 30. There are N obfuscation nodes 20, and each obfuscation node 20 is denoted as 20-1, 20-2, ..., 20-N.

[0085] In some embodiments, the determination node 30 is used to determine whether a secret is on a blacklist based on the received obfuscated data. There is one determination node 30.

[0086] As can be seen from the above embodiments, this application, based on a secret sharing network, can prevent brute-force attacks through secret splitting algorithms and secret obfuscation. Even if information from multiple nodes is intercepted, the secret cannot be recovered. Thus, under the premise of ensuring data security and confidentiality, it can share blacklist customer data between banks and avoid interference from random values ​​of local differential privacy algorithms, resulting in more accurate judgment results.

[0087] Figure 7 This is a schematic diagram of bank node 10 according to an embodiment of this application. Figure 7 As shown, the bank node 10 provided in this application embodiment includes a random generation unit 101, a verification unit 102, a splitting unit 103, and a sending unit 104.

[0088] In some embodiments, the random generation unit 101 is used to randomly generate a secret sequence, the secret sequence comprising a plurality of equally sized secret shares.

[0089] In some embodiments, the testing unit 102 is used to perform interval testing and outlier testing on the randomly generated secret sequence.

[0090] In some embodiments, if the verification is successful, the splitting unit 103 is used to split the secret into multiple secret shares according to a randomly generated secret sequence.

[0091] In some embodiments, the sending unit 104 is used to encrypt multiple secret shares and send them sequentially to the obfuscation node.

[0092] Figure 8 This is another schematic diagram of a blacklist determination system based on a secret sharing network, as described in this application. Figure 8 In the example, the number of both the obfuscated node 20 and the bank node 10 is 3.

[0093] like Figure 8 As shown, bank node 10-1 splits secret S1 into a secret sequence containing 3 secret shares, which are denoted as S1, S2, S3, S4, S5, S6, S7, S8, S9, S10 ... 11 S 12 and S 13 Bank node 10-1 will transfer the secret share S 11 S 12 and S 13 The secret share S is sent to obfuscation nodes 20-1, 20-2, and 20-3 respectively. Similarly, bank node 10-2 sends the secret share S. 21 S 22 and S 23 The secret share S is sent to obfuscation nodes 20-1, 20-2, and 20-3 respectively. Bank node 10-3 will then send the secret share S. 31 S 32 and S 33 Send them to obfuscation nodes 20-1, 20-2 and 20-3 respectively.

[0094] like Figure 8 As shown, the obfuscated node 20-1 receives the secret share S from the three bank nodes. 11 S 21 and S 31 Summation and encryption are performed to obtain obfuscated data p1, where, Similarly, the obfuscated node 20-2 will receive the secret share S from the three bank nodes. 12 S 22 and S 32 Summation and encryption are performed to obtain obfuscated data p2. Obfuscated nodes 20-3 receive the secret shares S from the three bank nodes. 13 S 23 and S 33 Summation and encryption are performed to obtain obfuscated data p3. By obfuscating the secret share, even if the obfuscated data is intercepted, the secret share cannot be recovered, thus protecting the secret.

[0095] like Figure 8 As shown, the decision node 30 sums the three received confused data points p1, p2, and p3, i.e. If the summation result is greater than or equal to 1, then the secret is in the blacklist; otherwise, it is not in the blacklist.

[0096] This application also provides a computer device. Figure 9 This is a schematic diagram of a computer device according to an embodiment of this application. The computer device 2 includes a memory 21, a processor 22, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, it implements the blacklist obfuscation method based on a secret sharing network described above.

[0097] This application also provides a computer-readable storage medium storing a computer program that performs the above-described blacklist obfuscation method based on a secret sharing network.

[0098] This application also provides a computer program product, which includes a computer program that, when executed by a processor, implements the above-described blacklist obfuscation method based on a secret sharing network.

[0099] It should be noted that the acquisition, storage, use, and processing of data in the technical solution of this application all comply with the relevant provisions of national laws and regulations.

[0100] The user information in this application embodiment is obtained through legal and compliant means, and the acquisition, storage, use, and processing of user information are authorized and agreed upon by the user.

[0101] While this application provides the method operation steps as described in the embodiments or flowcharts, more or fewer operation steps may be included based on conventional or non-inventive labor. The order of steps listed in the embodiments is merely one possible execution order among many and does not represent the only execution order. In actual device or client product execution, the methods shown in the embodiments or drawings can be executed sequentially or in parallel (e.g., in a parallel processor or multi-threaded processing environment).

[0102] Those skilled in the art will understand that the embodiments of this specification can be provided as methods, apparatus (systems), or computer program products. Therefore, the embodiments of this specification can take the form of entirely hardware embodiments, entirely software embodiments, or embodiments combining software and hardware aspects. Furthermore, this application can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0103] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of this application. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart... Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0104] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0105] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0106] The various embodiments in this specification are described in a progressive manner. Similar or identical parts between embodiments can be referred to mutually. Each embodiment focuses on its differences from other embodiments. In particular, the system embodiments are relatively simple in description because they are fundamentally similar to the method embodiments; relevant parts can be referred to the descriptions in the method embodiments. In this document, relational terms such as "first" and "second" are used merely to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. The terms "upper," "lower," etc., indicating orientation or positional relationships based on the orientation or positional relationships shown in the accompanying drawings, are only for the convenience of describing this application and simplifying the description, and do not indicate or imply that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore should not be construed as a limitation of this application.

[0107] Unless otherwise expressly specified and limited, the terms "installation," "connection," and "linking" should be interpreted broadly. For example, they can refer to fixed connections, detachable connections, or integral connections; mechanical connections or electrical connections; direct connections or indirect connections through an intermediate medium; and internal connections between two components. Those skilled in the art can understand the specific meaning of the above terms in this application according to the specific circumstances. It should be noted that, without conflict, the embodiments and features in the embodiments of this application can be combined with each other. This application is not limited to any single aspect, nor to any single embodiment, nor to any combination and / or substitution of these aspects and / or embodiments. Moreover, each aspect and / or embodiment of this application can be used alone or in combination with one or more other aspects and / or embodiments.

[0108] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of this application, and are not intended to limit them. Although this application has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some or all of the technical features. Such modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the scope of the technical solutions of the embodiments of this application, and they should all be covered within the scope of the claims and specification of this application.

Claims

1. A blacklist obfuscation method based on a secret sharing network, characterized in that, The method includes: The obfuscation node receives secret shares sent by N bank nodes; wherein, the blacklist data of each bank node is used as a secret, and the secret of each bank node is split into N secret shares and sent to the N obfuscation nodes respectively, where N is a natural number greater than or equal to 3; The obfuscated node sums and encrypts the received secret shares to obtain obfuscated data; and The obfuscation node sends the obfuscated data to the determination node; wherein, the obfuscated data is used by the determination node to determine whether the secret is on the blacklist; In this process, the secret of each bank node is split into N secret shares and sent to N obfuscation nodes respectively, including: A secret sequence is randomly generated, the secret sequence containing multiple equally sized secret shares; The secret sequence is subjected to interval testing and outlier testing; If the verification passes, the secret is then split into multiple secret shares according to the secret sequence.

2. The method as described in claim 1, characterized in that, The number of bank nodes is the same as the number of obfuscated nodes, and the determination node receives N obfuscated data sent by N obfuscated nodes.

3. The method as described in claim 1, characterized in that, The interval test includes testing the Nth secret share r N Does it meet the following conditions: r N ∈[-k,k], Where N is a natural number greater than or equal to 3, and k is a constant greater than a preset value.

4. The method as described in claim 1, characterized in that, The outlier detection includes any element r in the test set C. i Does it meet the following conditions: (1) (2) Wherein, the set C is the set {r1, r2, ... r} composed of the secret shares. N The subset obtained by removing any element from}, where k is a constant greater than a preset value.

5. The method as described in claim 1, characterized in that, The decision node sums the N received obfuscated data and determines whether the secret is on the blacklist based on the summation result.

6. A computer device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the computer program, it implements the blacklist obfuscation method based on a secret sharing network as described in any one of claims 1 to 5.

7. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program that performs the blacklist obfuscation method based on a secret sharing network as described in any one of claims 1 to 5.

8. A blacklist obfuscation device based on a secret sharing network, characterized in that, The device includes: A receiving unit is configured to receive secret shares sent by N bank nodes; wherein, the blacklist data of each bank node is used as a secret, and the secret of each bank node is divided into N secret shares and sent to N obfuscation nodes respectively, where N is a natural number greater than or equal to 3; and A processing unit is used to sum and encrypt the received secret shares to obtain obfuscated data; A sending unit is used to send the obfuscated data to a determination node; wherein the obfuscated data is used by the determination node to determine whether the secret is on a blacklist; The bank node includes a random generation unit, a verification unit, and a splitting unit; The random generation unit is used to randomly generate a secret sequence, the secret sequence containing multiple equally sized secret shares; The inspection unit is used to perform interval inspection and outlier inspection on the secret sequence; The splitting unit is used to split the secret into multiple secret shares according to the secret sequence if the verification passes.

9. A blacklist determination system based on a secret sharing network, characterized in that, The system includes: A bank node is used to treat blacklist data as a secret, split the secret into multiple secret shares, and send them to multiple obfuscation nodes respectively; A confusion node, configured to sum and encrypt multiple received secret shares to obtain confused data, and send the confused data to a decision node; and A determination node is used to determine whether the secret is on a blacklist based on the received obfuscated data; The bank node includes a random generation unit, a verification unit, and a splitting unit; The random generation unit is used to randomly generate a secret sequence, the secret sequence containing multiple equally sized secret shares; The inspection unit is used to perform interval inspection and outlier inspection on the secret sequence; The splitting unit is used to split the secret into multiple secret shares according to the secret sequence if the verification passes.

Images