CN114676445A - Information processing method, device, equipment and medium - Google Patents

Information processing method, device, equipment and medium Download PDF

Info

Publication number
CN114676445A
CN114676445A CN202210308517.1A CN202210308517A CN114676445A CN 114676445 A CN114676445 A CN 114676445A CN 202210308517 A CN202210308517 A CN 202210308517A CN 114676445 A CN114676445 A CN 114676445A
Authority
CN
China
Prior art keywords
node
information
shared information
shared
information table
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202210308517.1A
Other languages
Chinese (zh)
Inventor
胡俊秀
暨光耀
黎观平
蔡妙娜
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Industrial and Commercial Bank of China Ltd ICBC
Original Assignee
Industrial and Commercial Bank of China Ltd ICBC
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Industrial and Commercial Bank of China Ltd ICBC filed Critical Industrial and Commercial Bank of China Ltd ICBC
Priority to CN202210308517.1A priority Critical patent/CN114676445A/en
Publication of CN114676445A publication Critical patent/CN114676445A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/602—Providing cryptographic facilities or services

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Software Systems (AREA)
  • General Health & Medical Sciences (AREA)
  • Computer Hardware Design (AREA)
  • Computer Security & Cryptography (AREA)
  • Health & Medical Sciences (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Bioethics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Information Transfer Between Computers (AREA)
  • Storage Device Security (AREA)

Abstract

The disclosure provides an information processing method which can be applied to the field of information security. The information processing method includes: in response to detecting a query request from an information query party, constructing a shared information table at a starting node of a shared information transfer chain, wherein the shared information table comprises node shared information generated by the starting node according to a local differential privacy algorithm; according to the transmission sequence of the shared information transmission chain, transmitting the shared information table from the starting node to each node except the starting node in the shared information transmission chain in sequence until the shared information table is transmitted to the ending node of the shared information transmission chain, so that each 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 inquiry party through the end node. The present disclosure also provides an information processing apparatus, a device, a storage medium, and a program product.

Description

Information processing method, device, equipment and medium
Technical Field
The present disclosure relates to the field of information security, and in particular, to an information processing method, apparatus, device, medium, and program product.
Background
The negative list may be a list of agents or legal persons recording negative credit behavior, and the relevant organization or organization may construct the negative list according to actual operation conditions, but information in the negative lists of different organizations may not be the same. By reasonably sharing the negative list information of different organizations, the operation risk of the organizations can be effectively reduced.
In the process of implementing the inventive concept disclosed by the present disclosure, the inventors found that in the process of sharing negative list information, information security problems such as information leakage may exist, which poses a great threat to information privacy protection.
Disclosure of Invention
In view of the above, the present disclosure provides an information processing method, apparatus, device, medium, and program product.
According to a first aspect of the present disclosure, there is provided an information processing method including:
in response to detecting a query request from an information query party, constructing a shared information table at a starting node of a shared information transfer chain, wherein the shared information transfer chain comprises a plurality of nodes, the nodes are used for generating node shared information, the starting node is located at the starting position of the shared information transfer chain, and the shared information table comprises the node shared information generated by the starting node according to a local differential privacy algorithm;
according to the transmission sequence of the shared information transmission chain, transmitting the shared information table from the initial node to each node except the initial node in the shared information transmission chain in sequence until transmitting the shared information table to the end node of the shared information transmission chain, so that each node updates the node shared information in the shared information table according to a local differential privacy algorithm; and
and sending the updated shared information table to the information inquiry party through the end node.
According to the embodiment of the present disclosure, each of the other nodes updates the node shared information in the shared information table according to a local differential privacy algorithm, including:
each other node adds 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 sharing information to a storage position in the sharing information table to obtain an updated sharing information table, wherein the sharing information table comprises a plurality of different storage positions.
According to an embodiment of the present disclosure, adding the new node sharing information to a storage location in the sharing information table, and obtaining an updated sharing information table includes:
and adding the new node sharing information to the storage position in the sharing information table according to a preset random rule or a preset sequence.
According to an embodiment of the present disclosure, before sending the updated shared information table to the information querying party through the end node, the method further includes:
and encrypting the shared information of each node in the updated shared information table according to the key provided by the information inquirer to generate an encrypted shared information table.
According to an embodiment of the present disclosure, the information processing method further includes:
constructing an information lookup table at the start node, wherein the information lookup table is used for storing the query request and operation information used by the start node for constructing the shared information table;
according to the transmission sequence of the shared information transmission chain, transmitting the information lookup table from the initial node to each node except the initial node in the shared information transmission chain in sequence until transmitting to the end node of the shared information transmission chain;
and adding the updating operation information of each other node updating the shared information table to the information query table to obtain an updated information query table.
According to the embodiment of the present disclosure, each of the other nodes updates the node shared information in the shared information table according to a local differential privacy algorithm, including:
obtaining the information look-up table from the last node of the shared information transfer chain;
according to a preset check rule, checking the information query table to obtain an information check result;
and under the condition that the information verification result represents that verification passes, updating the node shared information in the shared information table according to the local differential privacy algorithm.
According to an embodiment of the present disclosure, the information processing method further includes:
and sending the query request, the operation information used by the starting node for constructing the shared information table and the update operation information for updating the shared information table by each other node to a blockchain network so that the blockchain network generates blocks based on the received information, wherein the blockchain network is constructed based on a plurality of nodes of the shared information transfer chain.
A second aspect of the present disclosure provides an information processing apparatus comprising:
a building module, configured to build a shared information table at a start node of a shared information transfer chain in response to detecting a query request from an information querying party, where the shared information transfer chain includes a plurality of nodes, the nodes are configured to generate node shared information, the start node is located at a start position of the shared information transfer chain, and the shared information table includes node shared information generated by the start node according to a local differential privacy algorithm;
a transmission module, configured to transmit the shared information table from the start node to each of the other nodes except the start node in the shared information transmission chain in sequence according to a transmission sequence of the shared information transmission chain until the shared information table is transmitted to an end node of the shared information transmission chain, so that each of the other nodes updates node shared information in the shared information table according to a local differential privacy algorithm; and
and the sending module is used for sending the updated shared information table to the information inquiry party through the end node.
A third aspect of the present disclosure provides an electronic device, comprising: one or more processors; a memory 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 above-described information processing method.
The fourth aspect of the present disclosure also provides a computer-readable storage medium having stored thereon executable instructions that, when executed by a processor, cause the processor to perform the above-mentioned information processing method.
The fifth aspect of the present disclosure also provides a computer program product comprising a computer program which, when executed by a processor, implements the above-described information processing method.
Drawings
The foregoing and other objects, features and advantages of the disclosure will be apparent from the following description of embodiments of the disclosure, which proceeds with reference to the accompanying drawings, in which:
fig. 1 schematically shows an application scenario diagram of an information processing method and apparatus according to an embodiment of the present disclosure;
FIG. 2 schematically shows a flow chart of an information processing method according to an embodiment of the present disclosure;
FIG. 3 schematically illustrates a flow chart of each of the other nodes updating the node shared information in the shared information table according to a local differential privacy algorithm, according to an embodiment of the present disclosure;
fig. 4a schematically shows an application scenario of an information processing method according to an embodiment of the present disclosure;
fig. 4b schematically shows an application scenario of an information processing method according to another embodiment of the present disclosure;
FIG. 5 schematically shows a flow chart of an information processing method according to another embodiment of the present disclosure;
fig. 6 schematically shows a block diagram of the structure of an information processing apparatus according to an embodiment of the present disclosure; and
fig. 7 schematically shows a block diagram of an electronic device adapted to implement an information processing method according to an embodiment of the present disclosure.
Detailed Description
Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. It should be understood that the description is illustrative only and is not intended to limit the scope of the present disclosure. In the following detailed description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the embodiments of the disclosure. It may be evident, however, that one or more embodiments may be practiced without these specific details. Moreover, in the following description, descriptions of well-known structures and techniques are omitted so as to not unnecessarily obscure the concepts of the present disclosure.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. The terms "comprises," "comprising," and the like, as used herein, specify the presence of stated features, steps, operations, and/or components, but do not preclude the presence or addition of one or more other features, steps, operations, or components.
All terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art unless otherwise defined. It is noted that the terms used herein should be interpreted as having a meaning that is consistent with the context of this specification and should not be interpreted in an idealized or overly formal sense.
Where a convention analogous to "at least one of A, B and C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B and C" would include but not be limited to systems that have a alone, B alone, C alone, a and B together, a and C together, B and C together, and/or A, B, C together, etc.).
In an actual application scenario of information sharing, in the process that information sharing parties with different information querying directions query user information for the same target user, different information sharing parties can generate encrypted shared information according to a local differential privacy algorithm, and each information sharing party sends the encrypted shared information to the information querying party respectively.
However, the information sharing method is easy to crack violently, and the risk of revealing the user information exists.
For example, in the case where the information sharing party is a financial institution such as a bank, an information inquiring party who does not obtain the information inquiry authority may inquire the user information with respect to the information sharing party.
The information sharing party adds noise to the user information according to a local difference algorithm to generate encrypted shared information A, and the shared information A can be represented by formula (1).
A＝M+R； (1)
In formula (1), M represents user information, such as identification information for characterizing that the user has a negative list identification, M is plaintext information, and R represents noise information.
Under the condition that the information inquiry direction without acquiring the information inquiry authority is the same as the information sharing party and the user information of the same user is inquired for a plurality of times, the shared information set (A) aiming at the same user can be acquired1、A2、...An). Further, the information inquiring party who does not obtain the information inquiring authority can use the formula (2) to inquire the shared information set (A)1、A2、...An) And (4) carrying out brute force cracking to obtain the user information M of the user on the same information sharing party.
Figure BDA0003563092620000051
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 according to the local difference algorithm, when n → ∞,
Figure BDA0003563092620000061
and the information inquiring party which does not obtain the information inquiring authority obtains the user information M in the information sharing party, thereby threatening the information security of the user.
An embodiment of the present disclosure provides an information processing method, including:
in response to detecting a query request from an information query party, constructing a shared information table at a starting node of a shared information transfer chain, wherein the shared information transfer chain comprises a plurality of nodes, the nodes are used for generating node shared information, the starting node is located at the starting position of the shared information transfer chain, and the shared information table comprises node shared information generated by the starting node according to a local differential privacy algorithm; according to the transmission sequence of the shared information transmission chain, transmitting the shared information table from the initial node to each node except the initial node in the shared information transmission chain in sequence until the shared information table is transmitted to the end node of the shared information transmission chain, so that each 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 inquiry party through the end node.
According to the embodiment of the disclosure, the shared information transfer chain comprises a shared information table constructed by each node providing shared information and constructed at the initial node of the shared information transfer chain. The constructed shared information table can be transmitted at different nodes according to the transmission sequence of the shared information transmission chain, and each node updates the node shared information in the shared information table according to the local differential privacy algorithm, so that the node shared information can be prevented from being decrypted when the node shared information provided by the same node is violently cracked, the safety of the node shared information generated by each node can be improved, and information leakage is avoided.
In the technical scheme of the disclosure, the collection, storage, use, processing, transmission, provision, disclosure, application and other processing of the personal information of the related user are all in accordance with the regulations of related laws and regulations, necessary confidentiality measures are taken, and the customs of the public order is not violated.
In the technical scheme of the disclosure, before the personal information of the user is acquired or collected, the authorization or the consent of the user is acquired.
Fig. 1 schematically shows an application scenario diagram of an information processing method and apparatus according to an embodiment of the present disclosure.
As shown in fig. 1, the application scenario 100 according to this embodiment may include terminal devices 101, 102, 103, a network 104, and servers 105, 106, 107. The network 104 is used to provide a medium for communication links between the terminal devices 101, 102, 103 and the servers 105, 106, 107. Network 104 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.
The user may use the terminal devices 101, 102, 103 to interact with the servers 105, 106, 107 via the network 104 to receive or send messages or the like. The terminal devices 101, 102, 103 may have installed thereon various communication client applications, such as shopping applications, web browser applications, search applications, instant messaging tools, mailbox clients, social platform software, etc. (by way of example only).
The terminal devices 101, 102, 103 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
The servers 105, 106, 107 may be servers providing various services, such as a background management server (for example only) providing support for websites browsed by users using the terminal devices 101, 102, 103. The background management server may analyze and perform other processing on the received data such as the user request, and feed back a processing result (e.g., a webpage, information, or data obtained or generated according to the user request) to the terminal device. The servers 105, 106, 107 may communicate information therebetween via wired, wireless communication links, or fiber optic cables, among other communication networks.
It should be noted that the information processing method provided by the embodiments of the present disclosure may be generally executed by the servers 105, 106, and 107. Accordingly, the information processing apparatus provided by the embodiments of the present disclosure may be generally provided in the servers 105, 106, 107. The information processing method provided by the embodiment of the present disclosure may also be executed by a server or a server cluster different from the servers 105, 106, 107 and capable of communicating with the terminal devices 101, 102, 103 and/or the servers 105, 106, 107. Accordingly, the information processing apparatus provided in the embodiments of the present disclosure may also be provided in a server or a server cluster different from the servers 105, 106, 107 and capable of communicating with the terminal devices 101, 102, 103 and/or the servers 105, 106, 107.
It should be understood that the number of terminal devices, networks, and servers in fig. 1 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
The information processing method of the disclosed embodiment will be described in detail below with fig. 2 to 5 based on the scenario described in fig. 1.
Fig. 2 schematically shows a flow chart of an information processing method according to an embodiment of the present disclosure.
As shown in fig. 2, the information processing method includes operations S210 to S230.
In operation S210, in response to detecting a query request from an information querying party, a shared information table is constructed at a start node of a shared information transfer chain, where the shared information transfer chain includes a plurality of nodes, the nodes are used to generate node shared information, the start node is located at a start position of the shared information transfer chain, and the shared information table includes node shared information generated by the start node according to a local differential privacy algorithm.
In operation S220, the shared information table is sequentially transferred from the start node to each of the other nodes except the start node in the shared information transfer chain according to the transfer order of the shared information transfer chain until the end node of the shared information transfer chain is transferred, so that each of the other nodes updates the node shared information in the shared information table according to the local differential privacy algorithm.
According to an embodiment of the present disclosure, the shared information transfer chain may include a plurality of nodes formed according to a preset arrangement order, and thus the shared information transfer chain may include a start node and an end node. The initial node can analyze the query request and provide the shared information corresponding to the query request to the information inquiry party according to the analysis result. Because the shared information of each node can be node plaintext information which is not encrypted, each node of the shared information transmission chain encrypts the node plaintext information of each node according to a local differential privacy algorithm to generate node shared information corresponding to each node.
It should be noted that the query request may be sent by the query party to each node in the shared information transfer chain in parallel, or may be recorded in the shared information table.
According to the embodiment of the disclosure, the node may include a financial institution such as a bank, and a plurality of different financial institutions may be used as nodes to form a shared information transfer chain. The shared information may include negative list information generated for historical data of the same user by the financial institution as the node. The historical data may include historical repayment data, historical loan data, loan fund usage data, account freeze data, and the like. Thus, the negative list information may be identification information for characterizing a negative behavior.
In operation S230, the updated shared information table is transmitted to the information inquirer through the end node.
According to an embodiment of the present disclosure, a transfer order of the shared information transfer chain may correspond to a preset arrangement order of each node. In the shared information transfer chain, after each node after the start node acquires the shared information table sent by the previous node, the node shared information corresponding to the node may be added to the shared information table, so as to update the node shared information in the shared information table.
According to the embodiment of the disclosure, after the end node of the shared information transfer chain updates the node shared information in the shared information table, the end node sends the updated shared information table to the information inquiring party. The information inquiring party can decrypt the updated shared information table according to the related decryption algorithm, so that the node plaintext information of each node in the shared information transmission chain can be obtained, and the shared information of each node corresponding to the inquiry request can be obtained.
According to the embodiment of the disclosure, the shared information transfer chain comprises a shared information table constructed by each node providing shared information and constructed at the initial node of the shared information transfer chain. The constructed shared information table can be transmitted at different nodes according to the transmission sequence of the shared information transmission chain, and each node updates the node shared information in the shared information table according to the local differential privacy algorithm, so that the node shared information can be prevented from being decrypted when the node shared information provided by the same node is violently cracked, the safety of the node shared information generated by each node can be improved, and information leakage is avoided.
It should be noted that the information processing method provided according to the embodiment of the present disclosure conforms to the regulations of the relevant laws and regulations, and the information inquiring party is authorized by the relevant organization or sends the inquiry request under the conditions specified by the relevant laws and regulations.
Fig. 3 schematically shows a flowchart of updating the node shared information in the shared information table according to the local differential privacy algorithm by each other node according to the embodiment of the present disclosure.
As shown in fig. 3, updating the node shared information in the shared information table by each of the other nodes according to the local differential privacy algorithm includes operations S310 to S320.
In operation S310, each of the other nodes adds node noise information to the node plaintext information according to a local differential privacy algorithm, and generates new node shared information;
in operation S320, new node sharing information is added to a storage location in a sharing information table, resulting in an updated sharing information table, where the sharing information table includes a plurality of different storage locations.
According to an embodiment of the present disclosure, node plaintext information may include shared information corresponding to a query request. Each node sharing the information transmission chain, adding node noise information to node plaintext information according to a local differential privacy algorithm, can be represented by formula (3).
Ai＝Mi+Ri； (3)
In formula (3), MiRepresenting plain text information of the node, e.g. identification information, R, for characterising that the user has a negative list identityiRepresenting noise information.
It should be noted that, the local differential privacy algorithm is suitable for a large amount of information, for example, the amount of information is in the millions. Therefore, each node can generate a plurality of node shared information aiming at the plaintext information of the same node according to a preset rule, namely, the node shared information is repeatedly sampled aiming at the plaintext information of the same node, so that the number of the node shared information is expanded, and the calculation accuracy of a local differential privacy algorithm is met.
According to the embodiment of the disclosure, the node shared information corresponding to each node of the shared information transfer chain is respectively stored in a plurality of different storage positions of the shared information table, so that an information inquiry end which does not obtain information inquiry authority can be avoided, a large amount of node shared information can be repeatedly obtained for the same node, and the plaintext information of the node is prevented from being violently cracked.
According to an embodiment of the present disclosure, adding new node shared information to a storage location in a shared information table, and obtaining an updated shared information table may include the following operations.
And adding the new node sharing information to the storage position in the sharing information table according to a preset random rule or a preset sequence.
According to the embodiment of the present disclosure, the preset sequence may include, for example, an arrangement sequence of different storage locations in the shared information table, but is not limited thereto, and may also include a reverse order of the arrangement sequence of different storage locations in the shared information table, and a person skilled in the art may design the preset sequence according to actual situations.
According to the embodiment of the disclosure, the random rule may include node shared information corresponding to different nodes, and the node shared information is randomly added to the storage location of the shared information table, so that the situation that the node shared information corresponding to the same node is acquired by inquiring the same storage location of the shared information table for multiple times can be avoided, and the security of the shared information is further enhanced.
To clearly illustrate the information processing method provided according to the present disclosure, an embodiment of the present disclosure will be described below with reference to fig. 4a, 4b, and embodiments 1 and 2.
Fig. 4a schematically shows an application scenario of the information processing method according to an embodiment of the present disclosure.
As shown in fig. 4a, in embodiment 1, the information querying party 410 may send a query request 411 to the constructed shared information delivery chain 420, where the query request 411 may include a query request for identification information of the same user, for example, a query request for credit identification information of the same user.
It should be understood that the credit identification information may include identification information characterizing the user as having a positive list identification and identification information characterizing the user as having a negative list identification.
In delivery order, shared information delivery chain 420 may include nodes 421, 422, 423, 424. In the shared information transfer chain 420, the node 421 may be a start node and the node 424 may be an end node. Upon detecting the query request 411, the shared information table 430 may be built at the starting node, node 421. The shared information table 430 constructed at the node 421 may include node shared information a generated by the node 421 according to the local differential privacy algorithm1. The node shares information A1And storing the data in the corresponding storage position of the shared information table 430 according to a preset sequence.
The shared information table 430 may be sequentially transferred from the node 421 to the nodes 422, 423, 424 in the order of transfer of the shared information transfer chain 420 until being transferred to the end node, i.e., the node 424. At nodes 422, 423 and 424, each node can obtain node shared information A according to a local differential privacy algorithm2、A3、A4And according to a preset sequence, the nodes share the information A2、A3、A4Added to the storage location in the shared information table 430, the updated shared information table 430 is obtained at the end node, i.e., node 424. The updated shared information table 430 is then sent to the information inquirer 410 via the node 424.
According to an embodiment of the present disclosure, the node sharing information of each node may be obtained by formula (3).
Ai＝Mi+Ri； (3)
In formula (3), MiExpress node plain text information, i.e. identification information for characterizing that the user has a negative list identity, RiRepresenting noise information.
In the present embodiment, node plaintext information MiCharacterize the user as having a positive listIn the case of the identification information of the identification, a value of 0 may be taken. Node plaintext information MiThe value 1 may be taken in case that the identification information characterizing the user has a negative list identification.
After obtaining the updated shared information table 430, the information querying party 410 may obtain the node shared information a provided by each node of the shared information transfer chain 420 by analyzing the updated shared information table 4301、A2、A3、A4. The information inquirer 410 may aggregate the node sharing information by using formula (4) to obtain the user identification data P for representing the user credit identification information.
Figure BDA0003563092620000121
In the formula (4), when n → ∞ is reached,
Figure BDA0003563092620000122
so that the user identification data P can be obtained. In the case that the user identification data P is greater than or equal to the preset credit threshold, it may be determined that the user has identification information of a negative list identification. In the case that the user identification data P is smaller than the preset credit threshold, it may be determined that the user has identification information identified by the positive list.
It should be noted that, in this embodiment, the information querying party may be, for example, a financial management institution that obtains the related information querying authority, and each node in the shared information delivery chain may include a financial institution that stores the user credit identification information.
Fig. 4b schematically shows an application scenario of an information processing method according to another embodiment of the present disclosure.
As shown in fig. 4b, embodiment 2 differs from embodiment 1 in that the node 421 shares information a according to the node generated by the local differential privacy algorithm1And stores the data in a random storage location of the shared information table 430 according to a preset random rule.
And at nodes 422,423, 424 each node may be according toObtaining node sharing information A by local differential privacy algorithm2、A3、A4And according to a preset random rule, sharing the information A with the nodes2、A3、A4The node shared information is randomly added to different storage positions in the shared information table 430, so that the node shared information corresponding to the same node can be obtained by inquiring the same storage position of the shared information table for multiple times, and the security of the shared information is further enhanced.
According to an embodiment of the present disclosure, before sending the updated shared information table to the information querying party through the end node, the method further includes:
and encrypting the shared information of each node in the updated shared information table according to the key provided by the information inquirer to generate an encrypted shared information table.
According to the embodiment of the disclosure, for example, the shared information of each node in the updated shared information table may be encrypted through a symmetric encryption algorithm, so that the security of the encrypted shared information table may be further enhanced, and information leakage in the process of sending the shared information table to the information inquiring party is avoided.
According to the embodiment of the disclosure, each node shared information in the updated shared information table is encrypted, and the encryption level of the node shared information can be further upgraded, so that the node shared information can be prevented from being leaked in the process of sending the updated shared information table to the information inquiry party.
Fig. 5 schematically shows a flow chart of an information processing method according to another embodiment of the present disclosure.
As shown in fig. 5, the information processing method may further include operations S510 to S530.
In operation S510, an information lookup table is constructed at the start node, where the information lookup table is used to store the query request and operation information used by the start node to construct the shared information table.
In operation S520, the information lookup table is sequentially transferred from the start node to each of the nodes except the start node in the shared information transfer chain according to the transfer order of the shared information transfer chain until the end node of the shared information transfer chain is transferred.
In operation S530, the update operation information of each of the other nodes updating the shared information table is added to the information lookup table, so as to obtain an updated information lookup table.
According to the embodiment of the disclosure, the information query table constructed at the start node may record a query request from an information query party and operation information used by the start node to construct the shared information table. When the information query table is transmitted to the end node, since the update operation information for updating the shared information table by each of the other nodes is added to the information query table, each operation information for querying the shared information can be recorded in the updated information query table. The related information security end can trace the illegal operation information of each node in the information inquirer and the shared information transmission chain by acquiring and analyzing the information inquiry table so as to maintain the information security of the shared information.
According to an embodiment of the present disclosure, each of the other nodes may update the node shared information in the shared information table according to a local differential privacy algorithm, which may include the following operations.
Obtaining an information query table from a previous node of a shared information transfer chain; checking the information query table according to a preset checking rule to obtain an information checking result; and under the condition that the information verification result represents that verification passes, updating the node shared information in the shared information table according to a local differential privacy algorithm.
According to the embodiment of the present disclosure, the preset verification rule may include a rule for verifying the authority compliance of the execution subject of the operation information, and may further include a rule for verifying the compliance of the operation type of the operation information in the information lookup table.
For example, in the case where a preset verification rule is used to perform compliance verification with respect to the operation type of the operation information in the information lookup table. And the current node acquires the information query table from the last node of the shared information transmission chain, and verifies the operation type in the information query table by using a preset verification rule to obtain an information verification result. And when the information verification result is that the operation type of the operation information in the information query table meets the compliance, the verification can be represented to pass. And under the condition that the current node passes the verification, the node shared information in the shared information table can be updated according to the local differential privacy algorithm.
And when the information verification result is that the operation type of the operation information in the information query table does not meet the compliance, for example, when the modification operation exists, the verification can be represented to fail. The current node may not generate node sharing information, and may send an information security early warning notification according to actual requirements. Therefore, the transmission process of the information sharing table can be interrupted, the shared information is prevented from being tampered, and the information safety is guaranteed.
According to an embodiment of the present disclosure, the information processing method may further include the following operations.
And sending a query request, operation information used by the starting node for constructing the shared information table and update operation information used by each other node for updating the shared information table to the blockchain network so as to generate blocks based on the received information, wherein the blockchain network is constructed based on a plurality of nodes of the shared information transfer chain.
According to the embodiment of the disclosure, based on the characteristics of non-tampering, distributed accounting and traceability of the blockchain network, the blockchain network records the query request from the information query party, the operation information of the starting node for constructing the shared information table and the update operation information of each other node for updating the shared information table, so that each node in the shared information transfer chain can acquire the operation information for the shared information table through the blockchain network before updating the node shared information of the shared information table, and timely discover the operation information of the user who does not acquire the authority for the shared information table, thereby further ensuring the information security of the shared information.
According to the embodiment of the disclosure, the blockchain network can be constructed based on a plurality of nodes of the shared information transfer chain, so that each node of the shared information transfer chain can verify the query request recorded in the block, the operation information for constructing the shared information table and the update operation information, thereby discovering the illegal operation information in the query request, the operation information for constructing the shared information table and the update operation information in time, preventing the user who does not obtain the information query authority from querying the shared information, and further improving the information security.
Based on the information processing method, the disclosure also provides an information processing device. The apparatus will be described in detail below with reference to fig. 6.
Fig. 6 schematically shows a block diagram of the structure of an information processing apparatus according to an embodiment of the present disclosure.
As shown in fig. 6, the information processing apparatus 600 includes a construction module 601, a transfer module 602, and a transmission module 603.
The building module 601 is configured to build a shared information table at a starting node of a shared information transfer chain in response to detecting a query request from an information querying party, where the shared information transfer chain includes a plurality of nodes, the nodes are configured to generate node shared information, the starting node is located at a starting position of the shared information transfer chain, and the shared information table includes node shared information generated by the starting node according to a local differential privacy algorithm.
The transmitting module 602 is configured to sequentially transmit the shared information table from the start node to each of the other nodes in the shared information transmission chain except the start node according to the transmission sequence of the shared information transmission chain until the shared information table is transmitted to the end node of the shared information transmission chain, so that each of the other nodes updates the node shared information in the shared information table according to a local differential privacy algorithm.
The sending module 603 is configured to send the updated shared information table to the information querying party through the end node.
According to an embodiment of the present disclosure, the transfer module may include: the device comprises a generating unit and a first updating unit.
And the generating unit is used for adding node noise information to the node plain text information by each other node according to a local differential privacy algorithm to generate new node shared information.
The first updating unit is used for adding the new node sharing information to the storage position in the sharing information table to obtain an updated sharing information table, wherein the sharing information table comprises a plurality of different storage positions.
According to an embodiment of the present disclosure, the first update unit may include an update subunit.
And the updating subunit is used for adding the new node sharing information to the storage position in the sharing information table according to a preset random rule or a preset sequence.
According to an embodiment of the present disclosure, the information processing apparatus may further include an encryption module.
And the encryption module is used for encrypting the shared information of each node in the updated shared information table according to the key provided by the information inquiry party to generate an encrypted shared information table.
According to an embodiment of the present disclosure, the information processing apparatus may further include an information lookup table construction module, an information lookup table delivery module, and an information lookup table update module.
The information query table construction module is used for constructing an information query table at the starting node, wherein the information query table is used for storing query requests and operation information used by the starting node for constructing a shared information table.
And the information query table transmission module is used for transmitting the information query tables from the initial node to each node except the initial node in the shared information transmission chain in sequence according to the transmission sequence of the shared information transmission chain until the information query tables are transmitted to the end node of the shared information transmission chain.
And the information query table updating module is used for adding the updating operation information of each other node updating the shared information table to the information query table to obtain an updated information query table.
According to an embodiment of the present disclosure, the transfer module may include an acquisition unit, a verification unit, and a second update unit.
The obtaining unit is used for obtaining the information lookup table from the last node of the shared information transfer chain.
The checking unit is used for checking the information query table according to a preset checking rule to obtain an information checking result.
And the second updating unit is used for updating the node shared information in the shared information table according to the local differential privacy algorithm under the condition that the information verification result represents that the verification passes.
According to an embodiment of the present disclosure, the information processing apparatus may further include an operation information transmitting module.
The operation information sending module is used for sending a query request, operation information used by the starting node for constructing the shared information table and updating operation information used by each other node for updating the shared information table to the blockchain network, so that the blockchain network generates a blockbased on the received information, wherein the blockchain network is constructed based on a plurality of nodes of the shared information transfer chain.
According to the embodiment of the present disclosure, any multiple modules of the building module 601, the transferring module 602 and the sending module 603 may be combined and implemented in one module, or any one of the modules may be split into multiple modules. Alternatively, at least part of the functionality of one or more of these modules may be combined with at least part of the functionality of other modules and implemented in one module. According to an embodiment of the present disclosure, at least one of the building module 601, the transferring module 602, and the sending module 603 may be implemented at least partially as a hardware circuit, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system on a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or may be implemented in hardware or firmware by any other reasonable manner of integrating or packaging a circuit, or may be implemented in any one of or a suitable combination of software, hardware, and firmware. Alternatively, at least one of the building module 601, the delivering module 602 and the sending module 603 may be at least partly implemented as a computer program module, which when executed may perform a corresponding function.
Fig. 7 schematically shows a block diagram of an electronic device adapted to implement an information processing method according to an embodiment of the present disclosure.
As shown in fig. 7, 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 section 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 associated chipset, and/or a special purpose microprocessor (e.g., an Application Specific Integrated Circuit (ASIC)), among others. The processor 701 may also include on-board memory for caching purposes. The processor 701 may comprise a single processing unit or a plurality of processing units for performing the different actions of the method flows according to embodiments of the present disclosure.
In the RAM 703, various programs and data necessary for the operation of the electronic apparatus 700 are stored. The processor 701, the ROM 702, and the RAM 703 are connected to each other by a bus 704. The processor 701 performs various operations of the method flows according to the embodiments of the present disclosure by executing programs in the ROM 702 and/or the RAM 703. It is noted that the programs may also be stored in one or more memories other than the ROM 702 and RAM 703. The processor 701 may also perform various operations of method flows according to embodiments of the present disclosure by executing programs stored in the one or more memories.
Electronic device 700 may also include input/output (I/O) interface 705, which input/output (I/O) interface 705 is also connected to bus 704, according to an embodiment of the present disclosure. The electronic device 700 may also include one or more of the following components connected to the I/O interface 705: an input portion 706 including a keyboard, a mouse, and the like; an output section 707 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 708 including a hard disk and the like; and a communication section 709 including a network interface card such as a LAN card, a modem, or the like. 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 magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 710 as necessary, so that a computer program read out therefrom is mounted into the storage section 708 as necessary.
The present disclosure also provides a computer-readable storage medium, which may be contained in the apparatus/device/system described in the above embodiments; or may exist separately and not be assembled into the device/apparatus/system. The computer-readable storage medium carries one or more programs which, when executed, implement the method according to an embodiment of the disclosure.
According to embodiments of the present disclosure, the computer-readable storage medium may be a non-volatile computer-readable storage medium, which may include, for example but is not limited to: a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. For example, according to embodiments of the present disclosure, a computer-readable storage medium may include the ROM 702 and/or the RAM 703 and/or one or more memories other than the ROM 702 and the RAM 703 described above.
Embodiments of the present disclosure also include a computer program product comprising a computer program containing program code for performing the method illustrated by the flow chart. When the computer program product runs in a computer system, the program code is used for causing the computer system to realize the information processing method provided by the embodiment of the disclosure.
The computer program performs the above-described functions defined in the system/apparatus of the embodiments of the present disclosure when executed by the processor 701. The above described systems, devices, modules, units, etc. may be implemented by computer program modules according to embodiments of the present disclosure.
In one embodiment, the computer program may be hosted on a tangible storage medium such as an optical storage device, a magnetic storage device, or the like. In another embodiment, the computer program may also be transmitted in the form of a signal on a network medium, distributed, downloaded and installed via the communication section 709, and/or installed from the removable medium 711. The computer program containing program code may be transmitted using any suitable network medium, including but not limited to: wireless, wired, etc., or any suitable combination of the foregoing.
In such an embodiment, the computer program can be downloaded and installed from a network through the communication section 709, and/or installed from the removable medium 711. The computer program, when executed by the processor 701, performs the above-described functions defined in the system of the embodiment of the present disclosure. The systems, devices, apparatuses, modules, units, etc. described above may be implemented by computer program modules according to embodiments of the present disclosure.
In accordance with embodiments of the present disclosure, program code for executing computer programs provided by embodiments of the present disclosure may be written in any combination of one or more programming languages, and in particular, these computer programs may be implemented using high level procedural and/or object oriented programming languages, and/or assembly/machine languages. The programming language includes, but is not limited to, programming languages such as Java, C + +, python, the "C" language, or the like. The program code may execute entirely on the user computing device, partly on the user device, partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., through the internet using an internet service provider).
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
Those skilled in the art will appreciate that various combinations and/or combinations of features recited in the various embodiments and/or claims of the present disclosure can be made, even if such combinations or combinations are not expressly recited in the present disclosure. In particular, various combinations and/or combinations of the features recited in the various embodiments and/or claims of the present disclosure may be made without departing from the spirit or teaching of the present disclosure. All such combinations and/or associations are within the scope of the present disclosure.
The embodiments of the present disclosure have been described above. However, these examples are for illustrative purposes only and are not intended to limit the scope of the present disclosure. Although the embodiments are described separately above, this does not mean that the measures in the embodiments cannot be used in advantageous combination. The scope of the disclosure is defined by the appended claims and equivalents thereof. Various alternatives and modifications can be devised by those skilled in the art without departing from the scope of the present disclosure, and such alternatives and modifications are intended to be within the scope of the present disclosure.

Claims (11)

1. An information processing method comprising:
in response to detecting a query request from an information query party, constructing a shared information table at a starting node of a shared information transfer chain, wherein the shared information transfer chain comprises a plurality of nodes, the nodes are used for generating node shared information, the starting node is located at the starting position of the shared information transfer chain, and the shared information table comprises the node shared information generated by the starting node according to a local differential privacy algorithm;
according to the transmission sequence of the shared information transmission chain, transmitting the shared information table from the starting node to each node except the starting node in the shared information transmission chain in sequence until the shared information table is transmitted to the ending node of the shared information transmission chain, so that each node updates the node shared information in the shared information table according to a local differential privacy algorithm; and
and sending the updated shared information table to the information inquiry party through the end node.
2. The method of claim 1, wherein each of the other nodes updates the node shared information in the shared information table according to a local differential privacy algorithm comprising:
each other node adds node noise information to node plain text information according to the local differential privacy algorithm to generate new node shared information;
and adding the new node sharing information to a storage position in the sharing information table to obtain an updated sharing information table, wherein the sharing information table comprises a plurality of different storage positions.
3. The method of claim 2, wherein adding the new node sharing information to a storage location in the shared information table, and obtaining an updated shared information table comprises:
and adding the new node sharing information to the storage position in the sharing information table according to a preset random rule or a preset sequence.
4. The method of claim 1, wherein prior to sending the updated shared information table to the information inquirer through the end node, the method further comprises:
and encrypting the shared information of each node in the updated shared information table according to the key provided by the information inquirer to generate an encrypted shared information table.
5. The method of claim 1, further comprising:
constructing an information lookup table at the starting node, wherein the information lookup table is used for storing the query request and operation information used by the starting node for constructing the shared information table;
according to the transmission sequence of the shared information transmission chain, transmitting the information query table from the initial node to each node except the initial node in the shared information transmission chain in sequence until transmitting to the end node of the shared information transmission chain;
and adding the updating operation information of each other node for updating the shared information table to the information query table to obtain an updated information query table.
6. The method of claim 5, wherein each of the other nodes updates the node shared information in the shared information table according to a local differential privacy algorithm comprising:
obtaining the information query table from the last node of the shared information transfer chain;
checking the information query table according to a preset checking rule to obtain an information checking result;
and under the condition that the information verification result represents that verification passes, updating the node shared information in the shared information table according to the local differential privacy algorithm.
7. The method of claim 1, further comprising:
and sending the query request, the operation information used by the starting node for constructing the shared information table and the updating operation information for updating the shared information table by each other node to a block chain network so that the block chain network generates a block based on the received information, wherein the block chain network is constructed based on a plurality of nodes of the shared information transfer chain.
8. An information processing apparatus comprising:
the shared information transmission chain comprises a plurality of nodes, the nodes are used for generating node shared information, the starting node is located at the starting position of the shared information transmission chain, and the shared information table comprises node shared information generated by the starting node according to a local differential privacy algorithm;
a transmission module, configured to transmit the shared information table from the start node to each of the other nodes in the shared information transfer chain except the start node in sequence according to a transmission sequence of the shared information transfer chain until the shared information table is transmitted to an end node of the shared information transfer chain, so that each of the other nodes updates node shared information in the shared information table according to a local differential privacy algorithm; and
and the sending module is used for sending the updated shared information table to the information inquiry party through the end 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 of any of claims 1-7.
10. A computer readable storage medium having stored thereon executable instructions which, when executed by a processor, cause the processor to perform the method of any one of claims 1 to 7.
11. A computer program product comprising a computer program which, when executed by a processor, implements a method according to any one of claims 1 to 7.
CN202210308517.1A 2022-03-24 2022-03-24 Information processing method, device, equipment and medium Pending CN114676445A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210308517.1A CN114676445A (en) 2022-03-24 2022-03-24 Information processing method, device, equipment and medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210308517.1A CN114676445A (en) 2022-03-24 2022-03-24 Information processing method, device, equipment and medium

Publications (1)

Publication Number Publication Date
CN114676445A true CN114676445A (en) 2022-06-28

Family

ID=82076917

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210308517.1A Pending CN114676445A (en) 2022-03-24 2022-03-24 Information processing method, device, equipment and medium

Country Status (1)

Country Link
CN (1) CN114676445A (en)

Similar Documents

Publication Publication Date Title
US11520912B2 (en) Methods, media, apparatuses and computing devices of user data authorization based on blockchain
US11934540B2 (en) System and method for multiparty secure computing platform
CN108463827B (en) System and method for detecting sensitive information leakage while preserving privacy
US20210406386A1 (en) System and method for multiparty secure computing platform
US11303642B2 (en) Dynamic management of consent and permissioning between executed applications and programmatic interfaces
US8897451B1 (en) Storing secure information using hash techniques
CN114500093A (en) Safe interaction method and system for message information
US8867743B1 (en) Encryption of large amounts of data using secure encryption methods
CN114240347A (en) Business service secure docking method and device, computer equipment and storage medium
CN113553302A (en) Credit report acquisition method, system, equipment and storage medium
US10417448B2 (en) Management of sensitive information access and use
CN110399706B (en) Authorization authentication method, device and computer system
CN114615087B (en) Data sharing method, device, equipment and medium
CN115186033A (en) Data processing method based on block chain, authorization method and device and electronic equipment
CN114676445A (en) Information processing method, device, equipment and medium
CN114491489A (en) Request response method and device, electronic equipment and storage medium
CN111507707B (en) Digital asset isolation and sub-management system and method
CN113297163A (en) System, method, device, equipment and medium for transferring inquiry letter based on block chain
KR101986690B1 (en) Key chain management method and key chain management system for end-to-end encryption of message
CN114826616B (en) Data processing method, device, electronic equipment and medium
CN114553570B (en) Method, device, electronic equipment and storage medium for generating token
CN114666119B (en) Data processing method, device, electronic equipment and medium
CN114386073A (en) Method and device for creating security certificate, electronic equipment and storage medium
CN117009996A (en) Data processing method, device, electronic equipment and medium
Damsika et al. A novel mechanism for secure e-tendering in an open electronic network

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination