Information processing method, apparatus, device, and medium

Abstract

This disclosure provides an information processing method applicable to the field of information security. The method includes: in response to detecting a query request from an information queryer, constructing a shared information table at the starting node of a shared information transmission chain, wherein the shared information table includes node-shared information generated by the starting node according to a local differential privacy algorithm; according to the transmission order of the shared information transmission chain, transmitting the shared information table sequentially from the starting node to each other node in the shared information transmission chain except for the starting node, until reaching the ending node of the shared information transmission chain, so that each other node updates the node-shared information in the shared information table according to a local differential privacy algorithm; and sending the updated shared information table to the information queryer through the ending node. This disclosure also provides an information processing apparatus, device, storage medium, and program product.

Description

Technical Field

[0001] This disclosure relates to the field of information security, specifically to an information processing method, apparatus, device, medium, and program product. Background Technology

[0002] A negative list can be a list of individuals or legal entities with negative credit behavior. Relevant organizations or institutions can create negative lists based on their actual operations, but the information in different institutions' negative lists may differ. By reasonably sharing negative list information from different institutions, operational risks can be effectively reduced.

[0003] In the process of realizing the inventive concept disclosed herein, the inventors discovered that information security issues such as information leakage may exist in the process of sharing negative list information, posing a significant threat to information privacy protection. Summary of the Invention

[0004] In view of the above problems, this disclosure provides information processing methods, apparatus, equipment, media and program products.

[0005] According to a first aspect of this disclosure, an information processing method is provided, comprising:

[0006] In response to the detection of a query request from an information querier, a shared information table is constructed at the starting node of the shared information transmission chain. The shared information transmission chain includes multiple nodes, which are used to generate node shared information. The starting node is located at the beginning of the shared information transmission chain, and the shared information table includes node shared information generated by the starting node according to a local differential privacy algorithm.

[0007] According to the transmission order of the aforementioned shared information transmission chain, the shared information table is transmitted sequentially from the starting node to each other node in the shared information transmission chain, until it reaches the ending node of the shared information transmission chain. This allows each other node to update the node-shared information in the shared information table according to its local differential privacy algorithm.

[0008] The updated shared information table is sent to the information querying party through the aforementioned termination node.

[0009] According to embodiments of this disclosure, each of the other nodes updates the node sharing information in the aforementioned shared information table based on a local differential privacy algorithm, including:

[0010] Each other node adds node noise information to its plaintext information according to the local differential privacy algorithm described above, generating new node shared information.

[0011] The new node sharing information is added to the storage location of the shared information table to obtain the updated shared information table, which includes multiple different storage locations.

[0012] According to embodiments of this disclosure, the new node sharing information is added to the storage location of the shared information table to obtain an updated shared information table, including:

[0013] According to preset random rules or preset order, the new node shared information is added to the storage location in the shared information table.

[0014] According to embodiments of this disclosure, before sending the updated shared information table to the information querying party via the aforementioned termination node, the method further includes:

[0015] Based on the key provided by the information querying party, the shared information of each node in the updated shared information table is encrypted to generate an encrypted shared information table.

[0016] According to embodiments of this disclosure, the above information processing method further includes:

[0017] An information query table is constructed at the aforementioned starting node, wherein the aforementioned information query table is used to store the aforementioned query request and the operation information of the aforementioned starting node for constructing the aforementioned shared information table;

[0018] According to the transmission order of the above-mentioned shared information transmission chain, the above-mentioned information query table is transmitted from the above-mentioned starting node to each other node in the above-mentioned shared information transmission chain except for the above-mentioned starting node, until it is transmitted to the end node of the above-mentioned shared information transmission chain.

[0019] Add the update operation information of each other node to the above shared information table to the above information query table to obtain the updated information query table.

[0020] According to embodiments of this disclosure, each of the other nodes updates the node sharing information in the aforementioned shared information table based on a local differential privacy algorithm, including:

[0021] Obtain the aforementioned information query table from the previous node in the aforementioned shared information transmission chain;

[0022] The information query table is validated according to the preset validation rules to obtain the information validation results;

[0023] If the above information verification result indicates that the verification is successful, the node sharing information in the above shared information table is updated according to the above local differential privacy algorithm.

[0024] According to embodiments of this disclosure, the above information processing method further includes:

[0025] The aforementioned query request, the operation information of the aforementioned starting node for constructing the aforementioned shared information table, and the update operation information of each other node for updating the aforementioned shared information table are sent to the blockchain network so that the aforementioned blockchain network can generate blocks based on the received information. The aforementioned blockchain network is constructed based on multiple nodes of the aforementioned shared information transmission chain.

[0026] A second aspect of this disclosure provides an information processing apparatus, comprising:

[0027] A construction module is used to construct a shared information table at the starting node of the shared information transmission chain in response to the detection of a query request from the information query party. The shared information transmission chain includes multiple nodes, which are used to generate node shared information. The starting node is located at the beginning of the shared information transmission chain, and the shared information table includes node shared information generated by the starting node according to the local differential privacy algorithm.

[0028] The transmission module is configured to, according to the transmission order of the shared information transmission chain, sequentially transmit the shared information table from the starting node to each other node in the shared information transmission chain (excluding the starting node) until it reaches the ending node of the shared information transmission chain, so that each other node updates the node-shared information in the shared information table according to its local differential privacy algorithm; and

[0029] The sending module is used to send the updated shared information table to the information querying party through the aforementioned end node.

[0030] A third aspect of this disclosure provides an electronic device comprising: one or more processors; and a memory for storing one or more programs, wherein when the one or more programs are executed by the one or more processors, the one or more processors perform the information processing method described above.

[0031] A fourth aspect of this disclosure also provides a computer-readable storage medium having executable instructions stored thereon, which, when executed by a processor, cause the processor to perform the information processing method described above.

[0032] The fifth aspect of this disclosure also provides a computer program product, including a computer program that, when executed by a processor, implements the above-described information processing method. Attached Figure Description

[0033] The foregoing contents, as well as other objects, features, and advantages of this disclosure, will become clearer from the following description of embodiments with reference to the accompanying drawings, in which:

[0034] Figure 1This diagram illustrates an application scenario of the information processing method and apparatus according to embodiments of the present disclosure.

[0035] Figure 2 A flowchart illustrating an information processing method according to an embodiment of the present disclosure is shown schematically.

[0036] Figure 3 This illustration schematically shows a flowchart of how each of the other nodes, according to an embodiment of the present disclosure, updates the node-shared information in the shared information table based on a local differential privacy algorithm;

[0037] Figure 4a This diagram illustrates an application scenario of the information processing method according to an embodiment of the present disclosure.

[0038] Figure 4b This diagram illustrates an application scenario of an information processing method according to another embodiment of the present disclosure.

[0039] Figure 5 A flowchart illustrating an information processing method according to another embodiment of the present disclosure is shown schematically;

[0040] Figure 6 A schematic block diagram of an information processing apparatus according to an embodiment of the present disclosure is shown; and

[0041] Figure 7 A block diagram schematically illustrates an electronic device suitable for implementing an information processing method according to an embodiment of the present disclosure. Detailed Implementation

[0042] The embodiments of the present disclosure will now be described with reference to the accompanying drawings. However, it should be understood that these descriptions are exemplary only and are not intended to limit the scope of the disclosure. In the following detailed description, numerous specific details are set forth to provide a thorough understanding of the embodiments of the present disclosure for ease of explanation. However, it will be apparent that one or more embodiments may be practiced without these specific details. Furthermore, descriptions of well-known structures and techniques are omitted in the following description to avoid unnecessarily obscuring the concepts of the present disclosure.

[0043] The terminology used herein is for the purpose of describing particular embodiments only and is not intended to limit this disclosure. The terms “comprising,” “including,” etc., as used herein indicate the presence of the stated features, steps, operations, and / or components, but do not exclude the presence or addition of one or more other features, steps, operations, or components.

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

[0045] When using expressions such as "at least one of A, B, and C", they should generally be interpreted in accordance with the meaning that is commonly understood by a person skilled in the art (e.g., "a system having at least one of A, B, and C" should include, but is not limited to, a system having A alone, a system having B alone, a system having C alone, a system having A and B, a system having A and C, a system having B and C, and / or a system having A, B, and C, etc.).

[0046] In practical applications of information sharing, when different information sharing parties query user information for the same target user, the different information sharing parties can generate encrypted shared information based on local differential privacy algorithms, and each information sharing party can send the encrypted shared information to the information query party.

[0047] However, this information sharing method is vulnerable to brute-force attacks and poses a risk of leaking user information.

[0048] For example, when the information sharing party is a financial institution such as a bank, a party that does not have the right to query information can still query user information from the information sharing party.

[0049] The information sharing party adds noise to the user information according to the local differential algorithm to generate encrypted shared information A, which can be represented by formula (1).

[0050] A = M + R; (1)

[0051] In formula (1), M represents user information, such as identification information used to characterize that the user has a negative list identifier, M is plaintext information, and R represents noise information.

[0052] If an information queryer without access to the information sharing platform queries the same user's information multiple times from the same information sharing party, they can obtain a set of shared information (A1, A2, ... A...) for the same user. n Furthermore, information querying parties who do not have information querying permissions can use formula (2) to access the information set (A1, A2, ... A... n By performing a brute-force attack, the user's information M can be obtained from the same information sharing party.

[0053]

[0054] In formula (2), M represents user information, i.e., plaintext information, and Ri represents noise information. Since the noise information is generated by the same information sharing party based on the local difference algorithm, when n→∞, This allows information seekers without access to information to obtain user information M from the information sharing party, thereby threatening the user's information security.

[0055] Embodiments of this disclosure provide an information processing method, including:

[0056] In response to a detected query request from an information querier, a shared information table is constructed at the starting node of the shared information transmission chain. This chain comprises multiple nodes, each generating node-shared information. The starting node is located at the beginning of the chain, and the shared information table includes node-shared information generated by the starting node using a local differential privacy algorithm. Following the transmission order of the shared information transmission chain, the shared information table is sequentially transmitted from the starting node to each of the other nodes in the chain, until it reaches the ending node. This allows each node to update the node-shared information in its shared information table according to its local differential privacy algorithm. Finally, the updated shared information table is sent to the information querier through the ending node.

[0057] According to embodiments of this disclosure, the shared information transmission chain includes a shared information table constructed by each node providing shared information, with the table built at the starting node of the chain. The constructed shared information table can be transmitted to different nodes according to the transmission order of the shared information transmission chain. Each node updates the node-shared information in the shared information table according to a local differential privacy algorithm, thereby preventing the node-shared information from being decrypted during brute-force attacks on the same node's shared information. This enhances the security of the node-shared information generated by each node and avoids information leakage.

[0058] In the technical solution disclosed herein, the collection, storage, use, processing, transmission, provision, disclosure, and application of user personal information comply with the provisions of relevant laws and regulations, necessary confidentiality measures have been taken, and there is no violation of public order and good morals.

[0059] In the technical solution disclosed herein, the user's authorization or consent is obtained before acquiring or collecting the user's personal information.

[0060] Figure 1 The illustration shows an application scenario of the information processing method and apparatus according to embodiments of the present disclosure.

[0061] like Figure 1As shown, application scenario 100 according to this embodiment may include terminal devices 101, 102, 103, network 104, and servers 105, 106, 107. Network 104 is used as a medium to provide a communication link between terminal devices 101, 102, 103 and servers 105, 106, 107. Network 104 may include various connection types, such as wired or wireless communication links or fiber optic cables, etc.

[0062] Users can use terminal devices 101, 102, and 103 to interact with servers 105, 106, and 107 via network 104 to receive or send messages, etc. Various communication client applications can be installed on terminal devices 101, 102, and 103, such as shopping applications, web browser applications, search applications, instant messaging tools, email clients, social media platform software, etc. (for example only).

[0063] Terminal devices 101, 102, and 103 can be various electronic devices with displays and web browsing capabilities, including but not limited to smartphones, tablets, laptops, and desktop computers.

[0064] Servers 105, 106, and 107 can be servers providing various services, such as backend management servers supporting websites browsed by users using terminal devices 101, 102, and 103 (this is just an example). The backend management server can analyze and process received user requests and other data, and feed back the processing results (such as web pages, information, or data obtained or generated based on user requests) to the terminal devices. Servers 105, 106, and 107 can transmit information to each other via wired, wireless communication links, or fiber optic cables, etc.

[0065] It should be noted that the information processing method provided in the embodiments of this disclosure can generally be executed by servers 105, 106, and 107. Correspondingly, the information processing device provided in the embodiments of this disclosure can generally be located in servers 105, 106, and 107. The information processing method provided in the embodiments of this disclosure can also be executed by a server or server cluster that is different from servers 105, 106, and 107 and is capable of communicating with terminal devices 101, 102, and 103 and / or servers 105, 106, and 107. Correspondingly, the information processing device provided in the embodiments of this disclosure can also be located in a server or server cluster that is different from servers 105, 106, and 107 and is capable of communicating with terminal devices 101, 102, and 103 and / or servers 105, 106, and 107.

[0066] It should be understood that Figure 1The number of terminal devices, networks, and servers shown is merely illustrative. Depending on implementation needs, any number of terminal devices, networks, and servers can be included.

[0067] The following will be based on Figure 1 The described scene, through Figures 2-5 The information processing method of the disclosed embodiments will be described in detail.

[0068] Figure 2 A flowchart illustrating an information processing method according to an embodiment of the present disclosure is shown schematically.

[0069] like Figure 2 As shown, the information processing method includes operations S210 to S230.

[0070] In operation S210, in response to detecting a query request from the information querying party, a shared information table is constructed at the starting node of the shared information transmission chain. The shared information transmission chain includes multiple nodes, which are used to generate node shared information. The starting node is located at the beginning of the shared information transmission chain, and the shared information table includes node shared information generated by the starting node according to the local differential privacy algorithm.

[0071] In operation S220, according to the transmission order of the shared information transmission chain, the shared information table is transmitted from the starting node to each other node in the shared information transmission chain except the starting node, until it is transmitted to the ending node of the shared information transmission chain, so that each other node can update the node shared information in the shared information table according to the local differential privacy algorithm.

[0072] According to embodiments of this disclosure, a shared information transmission chain may include multiple nodes arranged in a preset order. Therefore, the shared information transmission chain may include a start node and an end node. The start node can parse a query request and, based on the parsing result, provide the information queryer with shared information corresponding to the query request. Since the shared information of each node may be unencrypted plaintext information, each node in the shared information transmission chain encrypts its own plaintext information using a local differential privacy algorithm to generate shared information corresponding to each node.

[0073] It should be noted that query requests can be sent in parallel by the querying party to each node in the shared information transmission chain, or they can be recorded in the shared information table.

[0074] According to embodiments of this disclosure, nodes may include financial institutions such as banks, and multiple different financial institutions may act as nodes to form a shared information transmission chain. Shared information may include negative list information generated by the financial institutions acting as nodes based on historical data of the same user. Historical data may include historical repayment data, historical loan data, loan fund usage data, account freeze data, etc. Therefore, negative list information can be identifying information used to characterize negative behavior.

[0075] In operation S230, the updated shared information table is sent to the information query party through the end node.

[0076] According to embodiments of this disclosure, the transmission order of the shared information transmission chain can correspond to a preset arrangement order of each node. In the shared information transmission chain, each node after the starting node can add the node-shared information corresponding to that node to the shared information table after obtaining the shared information table sent by the previous node, thereby updating the node-shared information in the shared information table.

[0077] According to embodiments of this disclosure, after the end node of the shared information transmission chain updates the node shared information in the shared information table, the end node sends the updated shared information table to the information querying party. The information querying party can decrypt the updated shared information table according to a relevant decryption algorithm, thereby obtaining the plaintext information of each node in the shared information transmission chain, and thus obtaining the shared information of each node corresponding to the query request.

[0078] According to embodiments of this disclosure, the shared information transmission chain includes a shared information table constructed by each node providing shared information, with the table built at the starting node of the chain. The constructed shared information table can be transmitted to different nodes according to the transmission order of the shared information transmission chain. Each node updates the node-shared information in the shared information table according to a local differential privacy algorithm, thereby preventing the node-shared information from being decrypted during brute-force attacks on the same node's shared information. This enhances the security of the node-shared information generated by each node and avoids information leakage.

[0079] It should be noted that the information processing method provided according to the embodiments of this disclosure complies with the provisions of relevant laws and regulations, and the information querying party sends the query request with the authorization of the relevant agency or under the conditions stipulated by relevant laws and regulations.

[0080] Figure 3 The illustration shows a flowchart of how each of the other nodes, according to an embodiment of the present disclosure, updates the node-shared information in the shared information table based on a local differential privacy algorithm.

[0081] like Figure 3As shown, each of the other nodes updates the node shared information in the shared information table according to the local differential privacy algorithm, including operations S310 to S320.

[0082] When operating S310, each other node adds node noise information to the node's plaintext information according to the local differential privacy algorithm to generate new node shared information;

[0083] In operation S320, new node shared information is added to the storage location of the shared information table to obtain the updated shared information table, which includes multiple different storage locations.

[0084] According to embodiments of this disclosure, the node plaintext information may include shared information corresponding to the query request. Each node in the shared information transmission chain adds node noise information to its plaintext information based on a local differential privacy algorithm, as represented by formula (3).

[0085] A i =M i +R i (3)

[0086] In formula (3), M i This represents plaintext information about nodes, such as identifiers used to indicate that a user is on a negative list. i Indicates noise information.

[0087] It should be noted that, since the local differential privacy algorithm is suitable for large amounts of information, such as millions of pieces of information, each node can generate shared information for the same node's plaintext information according to preset rules. That is, the plaintext information of the same node is repeatedly sampled to expand the amount of shared information and meet the computational accuracy of the local differential privacy algorithm.

[0088] According to the embodiments of this disclosure, since the node shared information corresponding to each node in the shared information transmission chain is stored in multiple different storage locations in the shared information table, it can avoid information query terminals without information query permissions from repeatedly obtaining a large amount of node shared information for the same node, and prevent the node plaintext information from being brute-forced.

[0089] According to embodiments of this disclosure, adding new node sharing information to the storage location of the sharing information table to obtain an updated sharing information table may include the following operations.

[0090] According to preset random rules or preset order, new node shared information is added to the storage location in the shared information table.

[0091] According to embodiments of this disclosure, the preset order may include, for example, the order of different storage locations in the shared information table, but is not limited to this. It may also include the reverse order of the order of different storage locations in the shared information table. Those skilled in the art can design it according to the actual situation.

[0092] According to embodiments of this disclosure, the randomization rule may include randomly adding node-shared information corresponding to different nodes to the storage location of the shared information table, thereby avoiding obtaining node-shared information corresponding to the same node by repeatedly querying the same storage location of the shared information table, and further enhancing the security of the shared information.

[0093] To clearly illustrate the information processing methods provided in this disclosure, the following will refer to... Figure 4a , Figure 4b Embodiments of this disclosure are described in conjunction with Embodiments 1 and 2.

[0094] Figure 4a The diagram illustrates an application scenario of the information processing method according to an embodiment of the present disclosure.

[0095] like Figure 4a As shown in Embodiment 1, the information querying party 410 can send a query request 411 to the constructed shared information transmission chain 420. The query request 411 may include a query request for the identification information of the same user, such as a query request for the credit identification information of the same user.

[0096] It should be understood that credit identification information may include identification information indicating that the user has a positive list identifier, as well as identification information indicating that the user has a negative list identifier.

[0097] According to the transmission order, the shared information transmission chain 420 may include nodes 421, 422, 423, and 424. In the shared information transmission chain 420, node 421 can be the starting node, and node 424 can be the ending node. After detecting query request 411, a shared information table 430 can be constructed at the starting node, i.e., node 421. The shared information table 430 constructed at node 421 may include node shared information A1 generated by node 421 according to the local differential privacy algorithm. This node shared information A1 is stored in the corresponding storage location of the shared information table 430 according to a preset order.

[0098] The shared information table 430 can be passed from node 421 to nodes 422, 423, and 424 sequentially according to the transmission order of the shared information transmission chain 420, until it reaches the final node, node 424. At nodes 422, 423, and 424, each node can obtain node shared information A2, A3, and A4 according to a local differential privacy algorithm, and add the node shared information A2, A3, and A4 to the storage location in the shared information table 430 in a preset order. At the final node, node 424, the updated shared information table 430 is obtained. Then, the updated shared information table 430 is sent to the information query party 410 through node 424.

[0099] According to embodiments of this disclosure, the node-shared information of each node can be obtained by formula (3).

[0100] A i =M i +R i (3)

[0101] In formula (3), M i This represents the plaintext information of the node, specifically the identifier used to indicate that the user is on a negative list. R i Indicates noise information.

[0102] In this embodiment, the node plaintext information M i When the identifier information indicates that the user has a positive list identifier, the value can be 0. Node plaintext information M i When the identifier information indicates that the user has a negative list identifier, the value can be 1.

[0103] After obtaining the updated shared information table 430, the information query party 410 can parse the updated shared information table 430 to obtain the node shared information A1, A2, A3, and A4 provided by each node of the shared information transmission chain 420. The information query party 410 can use formula (4) to aggregate the node shared information to obtain user identification data P used to represent the user's credit identification information.

[0104]

[0105] In formula (4), when n→∞, This allows us to obtain user identification data P. If user identification data P is greater than or equal to a preset credit threshold, it can be determined that the user has a negative list identifier. If user identification data P is less than the preset credit threshold, it can be determined that the user has a positive list identifier.

[0106] It should be noted that, in this embodiment, the information querying party may be, for example, a financial management institution that has the authority to query relevant information, and each node in the shared information transmission chain may include a financial institution that stores user credit identification information.

[0107] Figure 4b The diagram illustrates an application scenario of an information processing method according to another embodiment of the present disclosure.

[0108] like Figure 4b As shown, the difference between Embodiment 2 and Embodiment 1 is that node 421 stores the node sharing information A1 generated by the local differential privacy algorithm in a random storage location in the sharing information table 430 according to a preset random rule.

[0109] Furthermore, at nodes 422, 423, and 424, each node can obtain node shared information A2, A3, and A4 according to the local differential privacy algorithm. Then, according to the preset random rules, the node shared information A2, A3, and A4 are randomly added to different storage locations in the shared information table 430. This avoids obtaining the node shared information corresponding to the same node by querying the same storage location of the shared information table multiple times, thereby further enhancing the security of the shared information.

[0110] According to embodiments of this disclosure, before sending the updated shared information table to the information querier via the end node, the method further includes:

[0111] Based on the key provided by the information querying party, the shared information of each node in the updated shared information table is encrypted to generate an encrypted shared information table.

[0112] According to embodiments of this disclosure, for example, a symmetric encryption algorithm can be used to encrypt the shared information of each node in the updated shared information table, thereby further enhancing the security of the encrypted shared information table and preventing information leakage during the process of sending the shared information table to the information querying party.

[0113] According to embodiments of this disclosure, encrypting the shared information of each node in the updated shared information table can further upgrade the encryption level of the node shared information, thereby preventing the leakage of node shared information during the process of sending the updated shared information table to the information querying party.

[0114] Figure 5 A flowchart illustrating an information processing method according to another embodiment of the present disclosure is shown schematically.

[0115] like Figure 5 As shown, the information processing method may also include operations S510 to S530.

[0116] In operation S510, an information query table is built at the starting node. The information query table is used to store query requests and operation information used by the starting node to build a shared information table.

[0117] During operation S520, according to the transmission order of the shared information transmission chain, the information query table is transmitted from the starting node to each other node in the shared information transmission chain except the starting node, until it is transmitted to the ending node of the shared information transmission chain.

[0118] In operation S530, update operation information of each other node updating the shared information table is added to the information query table to obtain the updated information query table.

[0119] According to embodiments of this disclosure, the information query table constructed at the starting node can record query requests from information queryers, as well as operation information used by the starting node to construct the shared information table. When the information query table is passed to the ending node, since update operation information of each other node updating the shared information table is added to the information query table, the updated information query table can record every operation information for querying the shared information. The relevant information security endpoint can obtain and parse the information query table to trace the illegal operation information of the information queryer and each node in the shared information transmission chain, thereby maintaining the information security of the shared information.

[0120] According to embodiments of this disclosure, each other node updating the node-shared information in the shared information table based on a local differential privacy algorithm may include the following operations.

[0121] Obtain the information query table from the previous node in the shared information transmission chain; verify the information query table according to the preset verification rules to obtain the information verification result; if the information verification result indicates that the verification is successful, update the node shared information in the shared information table according to the local differential privacy algorithm.

[0122] According to embodiments of this disclosure, the preset verification rules may include rules for verifying the compliance of the permissions of the executing entity of the operation information, and may also include rules for verifying the compliance of the operation type of the operation information in the information query table.

[0123] For example, in the case where preset verification rules are used to verify the compliance of operation types in the information query table, the current node obtains the information query table from the previous node in the shared information transmission chain, uses the preset verification rules to verify the operation types in the information query table, and obtains the information verification result. If the information verification result shows that the operation types in the information query table meet the compliance requirements, the verification can be considered successful. If the verification is successful, the current node can update the node-shared information in the shared information table according to the local differential privacy algorithm.

[0124] If the information verification result indicates that the operation type of the operation information in the information query table does not meet compliance requirements, such as if a modification operation exists, it indicates that the verification failed. The current node may not generate node-shared information and can send information security warning notifications as needed. This can interrupt the transmission process of the information sharing table, prevent the shared information from being tampered with, and ensure information security.

[0125] According to embodiments of this disclosure, the information processing method may further include the following operations.

[0126] The system sends query requests, operation information for the starting node to build the shared information table, and update operation information for each other node to update the shared information table to the blockchain network, so that the blockchain network can generate blocks based on the received information. The blockchain network is built by multiple nodes based on the shared information transmission chain.

[0127] According to embodiments of this disclosure, based on the immutability, distributed ledger, and traceability characteristics of blockchain networks, the blockchain network records query requests from information query parties, operation information of the starting node used to construct the shared information table, and update operation information of each other node updating the shared information table. This allows each node in the shared information transmission chain to obtain operation information on the shared information table through the blockchain network before the node sharing information updates the shared information table, thus promptly detecting operation information on the shared information table by unauthorized users and further ensuring the information security of shared information.

[0128] According to embodiments of this disclosure, a blockchain network can be constructed based on multiple nodes of a shared information transmission chain. Therefore, each node of the shared information transmission chain can verify the query requests, operation information for constructing the shared information table, and update operation information recorded in the block, thereby promptly detecting illegal operation information in the query requests, operation information for constructing the shared information table, and update operation information, so as to prevent users without information query permissions from querying shared information and further improve information security.

[0129] Based on the above information processing method, this disclosure also provides an information processing apparatus. The following will be combined with... Figure 6 The device is described in detail.

[0130] Figure 6 A schematic block diagram of an information processing apparatus according to an embodiment of the present disclosure is shown.

[0131] like Figure 6 As shown, the information processing device 600 includes a construction module 601, a transmission module 602, and a sending module 603.

[0132] The construction module 601 is used to construct a shared information table at the starting node of the shared information transmission chain in response to the detection of a query request from the information query party. The shared information transmission chain includes multiple nodes, which are used to generate node shared information. The starting node is located at the beginning of the shared information transmission chain, and the shared information table includes node shared information generated by the starting node according to the local differential privacy algorithm.

[0133] The transmission module 602 is used to transmit the shared information table from the starting node to each other node in the shared information transmission chain according to the transmission order of the shared information transmission chain, until it is transmitted to the ending node of the shared information transmission chain, so that each other node can update the node shared information in the shared information table according to the local differential privacy algorithm.

[0134] The sending module 603 is used to send the updated shared information table to the information query party through the end node.

[0135] According to embodiments of this disclosure, the transmission module may include a generation unit and a first update unit.

[0136] The generation unit is used by each other node to add node noise information to the plaintext information of the node according to the local differential privacy algorithm, and generate new node shared information.

[0137] The first update unit is used to add new node shared information to the storage location of the shared information table to obtain the updated shared information table, which includes multiple different storage locations.

[0138] According to embodiments of this disclosure, the first update unit may include an update subunit.

[0139] The update sub-unit is used to add new node shared information to the storage location in the shared information table according to preset random rules or preset order.

[0140] According to embodiments of this disclosure, the information processing apparatus may further include an encryption module.

[0141] The encryption module is used to encrypt the shared information of each node in the updated shared information table based on the key provided by the information query party, and generate an encrypted shared information table.

[0142] According to embodiments of this disclosure, the information processing apparatus may further include an information query table construction module, an information query table transmission module, and an information query table update module.

[0143] The information query table construction module is used to build an information query table at the starting node. The information query table is used to store query requests and operation information used by the starting node to build a shared information table.

[0144] The information query table transmission module is used to transmit the information query table from the starting node to each other node in the shared information transmission chain, according to the transmission order of the shared information transmission chain, until it is transmitted to the ending node of the shared information transmission chain.

[0145] The information query table update module is used to add the update operation information of each other node to the shared information table to the information query table, so as to obtain the updated information query table.

[0146] According to embodiments of this disclosure, the transmission module may include an acquisition unit, a verification unit, and a second update unit.

[0147] The acquisition unit is used to obtain the information query table from the previous node in the shared information transmission chain.

[0148] The verification unit is used to verify the information query table according to preset verification rules and obtain the information verification result.

[0149] The second update unit is used to update the node shared information in the shared information table according to the local differential privacy algorithm, provided that the information verification result characterization verification passes.

[0150] According to embodiments of this disclosure, the information processing apparatus may further include an operation information sending module.

[0151] The operation information sending module is used to send query requests, operation information for the starting node to build the shared information table, and update operation information for each other node to update the shared information table to the blockchain network, so that the blockchain network can generate blocks based on the received information. The blockchain network is built by multiple nodes based on the shared information transmission chain.

[0152] According to embodiments of this disclosure, any plurality of modules among the construction module 601, the transmission module 602, and the sending module 603 can be combined into one module, or any one of these modules can be split into multiple modules. Alternatively, at least a portion of the functionality of one or more of these modules can be combined with at least a portion of the functionality of other modules and implemented in one module. According to embodiments of this disclosure, at least one of the construction module 601, the transmission module 602, and the sending module 603 can be at least partially implemented as hardware circuitry, such as a field-programmable gate array (FPGA), a programmable logic array (PLA), a system-on-a-chip, a system-on-a-substrate, a system-on-package, an application-specific integrated circuit (ASIC), or implemented in hardware or firmware by any other reasonable means of integrating or packaging circuitry, or implemented in any one of software, hardware, and firmware methods, or in a suitable combination of any of these. Alternatively, at least one of the construction module 601, the transmission module 602, and the sending module 603 can be at least partially implemented as a computer program module, which, when run, can perform corresponding functions.

[0153] Figure 7 A block diagram schematically illustrates an electronic device suitable for implementing an information processing method according to an embodiment of the present disclosure.

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

[0155] RAM 703 stores various programs and data required for the operation of electronic device 700. Processor 701, ROM 702, and RAM 703 are interconnected via bus 704. Processor 701 performs various operations of the method flow according to embodiments of the present disclosure by executing programs in ROM 702 and / or RAM 703. It should be noted that the programs may also be stored in one or more memories other than ROM 702 and RAM 703. Processor 701 may also perform various operations of the method flow according to embodiments of the present disclosure by executing programs stored in said one or more memories.

[0156] According to embodiments of this disclosure, the electronic device 700 may further include an input / output (I / O) interface 705, which is also connected to a bus 704. The electronic device 700 may also include one or more of the following components connected to the I / O interface 705: an input section 706 including a keyboard, mouse, etc.; an output section 707 including a cathode ray tube (CRT), liquid crystal display (LCD), etc., and a speaker, etc.; a storage section 708 including a hard disk, etc.; and a communication section 709 including a network interface card such as a LAN card, modem, etc. The communication section 709 performs communication processing via a network such as the Internet. A drive 710 is also connected to the I / O interface 705 as needed. A removable medium 711, such as a disk, optical disk, magneto-optical disk, semiconductor memory, etc., is installed on the drive 710 as needed so that computer programs read from it can be installed into the storage section 708 as needed.

[0157] This disclosure also provides a computer-readable storage medium, which may be included in the device / apparatus / system described in the above embodiments; or it may exist independently and not assembled into the device / apparatus / system. The computer-readable storage medium carries one or more programs that, when executed, implement the method according to the embodiments of this disclosure.

[0158] According to embodiments of this disclosure, the computer-readable storage medium may be a non-volatile computer-readable storage medium, such as, but not limited to: portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination thereof. In this disclosure, the computer-readable storage medium may be any tangible medium that contains or stores a program that can be used by or in conjunction with an instruction execution system, apparatus, or device. For example, according to embodiments of this disclosure, the computer-readable storage medium may include ROM 702 and / or RAM 703 and / or one or more memories other than ROM 702 and RAM 703 described above.

[0159] Embodiments of this disclosure also include a computer program product comprising a computer program containing program code for performing the methods shown in the flowchart. When the computer program product is run on a computer system, the program code is used to enable the computer system to implement the information processing methods provided in the embodiments of this disclosure.

[0160] When the computer program is executed by the processor 701, it performs the functions defined in the system / apparatus of this disclosure embodiments. According to embodiments of this disclosure, the systems, apparatuses, modules, units, etc., described above can be implemented by computer program modules.

[0161] In one embodiment, the computer program may rely on a tangible storage medium such as an optical storage device or a magnetic storage device. In another embodiment, the computer program may also be transmitted and distributed in the form of signals over a network medium, and may be downloaded and installed via the communication section 709, and / or installed from a removable medium 711. The program code contained in the computer program can be transmitted using any suitable network medium, including but not limited to: wireless, wired, etc., or any suitable combination thereof.

[0162] In such an embodiment, the computer program can be downloaded and installed from a network via the communication section 709, and / or installed from the removable medium 711. When the computer program is executed by the processor 701, it performs the functions defined in the system of this disclosure embodiment. According to embodiments of this disclosure, the systems, devices, apparatuses, modules, units, etc., described above can be implemented by computer program modules.

[0163] According to embodiments of this disclosure, program code for executing the computer programs provided in embodiments of this disclosure can be written in any combination of one or more programming languages. Specifically, these computational programs can be implemented using high-level procedural and / or object-oriented programming languages, and / or assembly / machine languages. Programming languages ​​include, but are not limited to, languages ​​such as Java, C++, Python, "C", or similar programming languages. The program code can execute entirely on the user's computing device, partially on the user's device, partially on a remote computing device, or entirely on a remote computing device or server. In cases involving remote computing devices, the remote computing device can 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 it can be connected to an external computing device (e.g., via the Internet using an Internet service provider).

[0164] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of this disclosure. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions indicated in the blocks may occur in a different order than those indicated in the drawings. For example, two consecutively indicated blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in a block diagram or flowchart, and combinations of blocks in a block diagram or flowchart, may be implemented using a dedicated hardware-based system that performs the specified function or operation, or using a combination of dedicated hardware and computer instructions.

[0165] Those skilled in the art will understand that the features described in the various embodiments and / or claims of this disclosure can be combined or combined in various ways, even if such combinations or combinations are not explicitly described in this disclosure. In particular, the features described in the various embodiments and / or claims of this disclosure can be combined or combined in various ways without departing from the spirit and teachings of this disclosure. All such combinations and / or combinations fall within the scope of this disclosure.

[0166] The embodiments of this disclosure have been described above. However, these embodiments are for illustrative purposes only and are not intended to limit the scope of this disclosure. Although various embodiments have been described above, this does not mean that the measures in the various embodiments cannot be used advantageously in combination. The scope of this disclosure is defined by the appended claims and their equivalents. Various substitutions and modifications can be made by those skilled in the art without departing from the scope of this disclosure, and all such substitutions and modifications should fall within the scope of this disclosure.

Claims

1. An information processing method comprising: constructing, in response to detecting a query request from an information querying party, a shared information table at a starting node of a shared information passing chain, wherein the shared information passing chain comprises a plurality of nodes configured to generate node shared information, the starting node is located at a starting position of the shared information passing chain, and the shared information table comprises node shared information generated by the starting node according to a local differential privacy algorithm; passing, from the starting node, the shared information table to each node other than the starting node in the shared information passing chain in a passing order of the shared information passing chain until the shared information table is passed to an ending node of the shared information passing chain, so that each node other than the starting node updates the node shared information in the shared information table according to a local differential privacy algorithm, the node shared information comprising blacklist information representing identification information of a person with a negative behavior; and sending, by the ending node, the updated shared information table to the information querying party.

2. The method of claim 1, wherein, The updating, by each node other than the starting node, of the node shared information in the shared information table according to the local differential privacy algorithm comprises: adding, by each node other than the starting node, node noise information to node plaintext information according to the local differential privacy algorithm to generate new node shared information; and adding the new node shared information to a storage location in the shared information table to obtain an updated shared information table, wherein the shared information table comprises a plurality of different storage locations.

3. The method of claim 2, wherein, The adding of the new node shared information to the storage location in the shared information table to obtain the updated shared information table comprises: adding the new node shared information to the storage location in the shared information table according to a preset random rule or a preset order.

4. The method of claim 1, wherein, Before the sending, by the ending node, of the updated shared information table to the information querying party, the method further comprises: encrypting each node shared information in the updated shared information table according to a key provided by the information querying party to generate an encrypted shared information table.

5. The method of claim 1, further comprising: constructing, at the starting node, an information query table, wherein the information query table is configured to store the query request and operation information of the starting node for constructing the shared information table; passing, from the starting node, the information query table to each node other than the starting node in the shared information passing chain in the passing order of the shared information passing chain until the information query table is passed to the ending node of the shared information passing chain; and adding, to the information query table, operation information of each node for updating the shared information table to obtain an updated information query table.

6. The method of claim 5, wherein, The updating, by each node other than the starting node, of the node shared information in the shared information table according to the local differential privacy algorithm comprises: obtaining the information query table from a previous node of the shared information passing chain; checking the information query table according to a preset checking rule to obtain an information checking result; and adding the information checking result to the shared information table. In a case where the information check result represents that the check passes, according to the local differential privacy algorithm, the node shared information in the shared information table is updated.

7. The method of claim 1, further comprising: sending, to a blockchain network, the query request, operation information of the starting node for constructing the shared information table, and update operation information of each of the other nodes for updating the shared information table, so that the blockchain network generates a block based on the received information, wherein the blockchain network is constructed based on the plurality of nodes of the shared information passing chain.

8. An information processing apparatus, comprising: a construction module configured to, in response to detecting a query request from an information query party, construct a shared information table at a starting node of a shared information passing chain, wherein the shared information passing chain comprises a plurality of nodes configured to generate node shared information, the starting node is located at a starting position of the shared information passing chain, and the shared information table comprises node shared information generated by the starting node according to a local differential privacy algorithm; a passing module configured to pass, according to a passing order of the shared information passing chain, the shared information table from the starting node to each of the other nodes of the shared information passing chain except the starting node, until the shared information table is passed to an ending node of the shared information passing chain, so that each of the other nodes updates node shared information in the shared information table according to the local differential privacy algorithm, the node shared information comprising negative list information representing identification information of a person with a negative behavior; and a sending module configured to send the updated shared information table to the information query party through the ending node.

9. An electronic device, comprising: one or more processors; a storage device for storing one or more programs, wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method according to any one of claims 1-7.

10. A computer-readable storage medium having stored thereon executable instructions that, when executed by a processor, cause the processor to perform the method according to any one of claims 1-7.

11. A computer program product comprising a computer program that, when executed by a processor, implements the method according to any one of claims 1-7.

Images