CN112149173A

CN112149173A - Information filtering method, computing node and related equipment

Info

Publication number: CN112149173A
Application number: CN201910569482.5A
Authority: CN
Inventors: 罗玉龙; 聂光耀; 魏艳兰
Original assignee: Huawei Technologies Co Ltd
Current assignee: Huawei Technologies Co Ltd
Priority date: 2019-06-27
Filing date: 2019-06-27
Publication date: 2020-12-29

Abstract

Methods of information filtering are provided. The method comprises the following steps: the first node acquires transaction data, wherein the transaction data is data read from a first state database by the first node according to a transaction request sent by a client, or data ready to be written into the first state database; the first node acquires an illegal keyword from the second state database, wherein the illegal keyword is added by the second node and is synchronized to the second state database of the first node; the first node matches the illegal keyword with the transaction data; and the first node returns information of refusing to execute the transaction request to a client under the condition that the illegal keyword is successfully matched with the transaction data.

Description

Information filtering method, computing node and related equipment

Technical Field

The present application relates to the field of computer technologies, and in particular, to an information filtering method, a computing node, and a related device

Background

A block chain (Blockchain) is a distributed database with a chain data structure, which combines data blocks in a time sequence in a sequential connection manner, and a block chain system usually includes a plurality of block chain nodes, where the block chain nodes can communicate with each other in a wired or wireless manner, and query information issued by each node or generate transactions with each node. As an emerging technology, the blockchain has the characteristics of traceability of history, non-falsification of recorded data, anonymity and the like, so that the blockchain is widely applied to the industries of finance, insurance, law, art, real estate and logistics and the like.

However, the blockchain technology brings opportunities for national development and convenience for social life, and also brings certain safety risks. If someone propagates illegal contents by means of the block chain, once information contents forbidden by laws and administrative laws are recorded in the block chain, due to the non-falsification characteristic of the block chain, the illegal contents are permanently propagated, and adverse effects are caused on the network environment.

Disclosure of Invention

The application provides an information filtering method, a computing node and related equipment, which can not only refuse to issue illegal information which is not linked, but also refuse to inquire illegal information which is linked, thereby improving the safety of block chain information service management.

In a first aspect, a method for filtering information is provided, where the method is applied to a blockchain network, where the blockchain network includes a normal chain and a management chain, where the normal chain includes a first node, the management chain includes a first node and a second node, and the first node includes a first state database corresponding to the normal chain and a second state database corresponding to the management chain, and the method includes:

the first node acquires transaction data, wherein the transaction data is data read from a first state database by the first node according to a transaction request sent by a client, or data ready to be written into the first state database;

the first node acquires an illegal keyword from the second state database, wherein the illegal keyword is added by the second node and is synchronized to the second state database of the first node;

the first node matches the illegal keyword with the transaction data;

and the first node returns information of refusing to execute the transaction request to a client under the condition that the illegal keyword is successfully matched with the transaction data.

In a specific implementation, when the first node fails to match the illegal keyword with the transaction data, the first node determines to continue to execute the transaction according to the transaction data.

The method described in the first aspect is implemented, so that when the first node performs a read transaction or a write transaction process, whether the read transaction or the write transaction process contains illegal information is determined by using the illegal keyword in the second state database, and therefore illegal information which is not linked up cannot be issued on a blockchain by a user, illegal information which is linked up cannot be read from the blockchain by the user, and further the security of blockchain information service management is improved.

In some embodiments, before the first node acquires the transaction data, the method further comprises: the first node acquires a first blacklist from the second state database, wherein the first blacklist is added by the second node and is synchronized to the second state database of the first node; the first node acquires a first identity identifier from the transaction request, wherein the first identity identifier is an identifier of the client or an identifier of a user using the client; the first node matches the first identity identifier with the first blacklist; the first node obtains transaction data, including: and when the first identity identification and the first blacklist are unsuccessfully matched, the first node acquires transaction data.

In some embodiments, after the first node determines to continue executing transactions according to the transaction data, further comprising: the first node acquires a second blacklist from the second state database, wherein the second blacklist is added by the second node and is synchronized to the second state database of the first node; the first node acquires a second identity mark, wherein the second identity mark is the identity mark of other nodes, and the other nodes are nodes for sending information to the first node, or the first node prepares to send information; the first node matches the second identity with the second blacklist; and when the first identity identification is successfully matched with the first blacklist, the first node refuses to receive the information sent by other nodes, or the first node refuses to send the information to other nodes.

In the above embodiment, the second node adds the first blacklist and the second blacklist in the second status database, so that the user, the client and the node in the first blacklist and the second blacklist can be rejected to query and issue the block chain information without performing keyword matching, thereby increasing the information filtering speed.

In some embodiments, the illegal key is added by a system chain code in the second node and is synchronized to the second state database of the first node, and the system chain code in the second node is used for adding and deleting the illegal key in the second node.

In some embodiments, when the transaction request is a write transaction request, the transaction data is an endorsement result, where the endorsement result is a result obtained by the first node performing a simulated transaction according to the transaction request; and when the transaction request is a read transaction request, the transaction data is a query result, wherein the query result is a result obtained by the first node querying the first state database according to the transaction request.

In some embodiments, the first node adds a first channel and a second channel, where the first channel is a channel corresponding to the normal chain, and the second channel is a channel corresponding to the management chain; the second node joins the second channel.

In some embodiments, the first node is provided with a first ledger and a second ledger, where the first ledger is a ledger corresponding to the normal chain, and the second ledger is a ledger corresponding to the management chain; the second node is provided with the second account book.

In the above embodiment, because the transaction information of the blockchain network is stored in the account book and the first status database corresponding to the common chain, and the illegal keyword, the first blacklist and the second blacklist information required for information filtering are stored in the account book and the second status database corresponding to the management chain, the transaction information of the blockchain network can be managed by a blockchain administrator, and the filtering information can be managed by a government regulatory department, thereby achieving the purpose of simply and efficiently improving the safety of blockchain information service.

In a second aspect, a method for filtering information is provided, where the method is applied in a blockchain network, the blockchain network includes a normal chain and a management chain, the normal chain includes a first node, the management chain includes a first node and a second node, the first node includes a first status database corresponding to the normal chain and a second status database corresponding to the management chain, and the second node includes the second status database corresponding to the management chain, and the method includes:

the second node receives a first transaction request sent by a client, wherein the first transaction request comprises an illegal keyword;

the second node calls a system chain code to carry out transaction according to the second transaction request so as to add the illegal keyword into a second state database of the second node;

the second node synchronizes the illegal key to a second state database of the first node.

In some embodiments, the second node receives a second transaction request sent by the client, where the second transaction request includes one or more of a first blacklist and a second blacklist, the first blacklist includes identity information of a malicious client and a malicious user who forbid transactions on the blockchain network, and the second blacklist includes identity information of a malicious node that cooperates with the malicious client or the malicious user to perform transactions with the blockchain; the second node calls a system chain code to conduct transaction according to the second transaction request so as to add the first blacklist and the second blacklist to a second state database of the second node; and the second node synchronizes the first blacklist and the second blacklist to a second state database of the first node.

In a third aspect, a block link point is provided, where the block link node is a first node of a block link network, the block link network includes a normal chain and a management chain, the normal chain includes a first node, the management chain includes a first node and a second node, the first node includes a first status database corresponding to the normal chain and a second status database corresponding to the management chain, and the block link point includes:

the first node comprises a first acquisition unit, a second acquisition unit and a first state database, wherein the acquisition unit is used for acquiring transaction data, and the transaction data is data read from the first state database by the first node according to a transaction request sent by a client or data ready to be written into the first state database;

a second obtaining unit, configured to obtain an illegal keyword from the second status database, where the illegal keyword is added by the second node and is synchronized into the second status database of the first node;

the matching unit is used for matching the illegal keyword with the transaction data;

and the returning unit is used for returning information for refusing to execute the transaction request to the client under the condition that the illegal keyword is successfully matched with the transaction data.

In some embodiments, the second obtaining unit is further configured to obtain a first blacklist from the second status database before obtaining the transaction data, where the first blacklist is added by the second node and synchronized to the second status database of the first node; the first obtaining unit is further configured to obtain a first identity identifier from the transaction request, where the first identity identifier is an identifier of the client or an identifier of a user using the client; the matching unit is further configured to match the first identity identifier with the first blacklist.

In some embodiments, the node further comprises a determination unit for determining to continue to execute a transaction according to the transaction data in case of a failure of matching the illegal keyword with the transaction data.

In some embodiments, the second obtaining unit is further configured to obtain a second blacklist from the second status database after determining to continue to perform the transaction according to the transaction data, where the second blacklist is added by the second node and synchronized to the second status database of the first node; the first obtaining unit is further configured to obtain a second identity, where the second identity is an identity of another node, and the another node is a node that sends information to the first node, or the first node prepares to send information; the matching unit is further configured to match the second identity with the second blacklist; the matching unit is further configured to, when the first identity identifier and the first blacklist are successfully matched, reject to receive information sent by the other node by the first node, or reject to send information to the other node by the first node.

In a fourth aspect, a blockchain link point is provided, where the blockchain node is a second node of a blockchain network, the blockchain includes a normal chain and a management chain, the normal chain includes a first node, the management chain includes a first node and a second node, the first node includes a first status database corresponding to the normal chain and a second status database corresponding to the management chain, the second node includes the second status database corresponding to the management chain, and the node includes:

the system comprises a receiving unit, a processing unit and a processing unit, wherein the receiving unit is used for receiving a first transaction request sent by a client, and the first transaction request comprises an illegal keyword;

the calling unit is used for calling a system chain code to carry out transaction according to the second transaction request so as to add the illegal keyword into a second state database of the second node;

a synchronization unit to synchronize the illegal key to a second state database of the first node.

In some embodiments, the receiving unit is further configured to receive a second transaction request sent by the client, where the second transaction request includes one or more of a first blacklist and a second blacklist, the first blacklist includes identity information of a malicious client and a malicious user who prohibit a transaction on the blockchain network, and the second blacklist includes identity information of a malicious node that cooperates with the malicious client or the malicious user to perform a transaction with the blockchain; the calling unit is further configured to call a system chain code to perform a transaction according to the second transaction request, so as to add the first blacklist and the second blacklist to a second state database of the second node; the synchronization unit is further configured to synchronize the first blacklist and the second blacklist to a second status database of the first node.

In a fifth aspect, there is provided a computer program product for implementing the method as described in the first aspect above when the computer program product is read and executed by a computing device.

A sixth aspect provides a computer program product for implementing the method as described in the second aspect above, when the computer program product is read and executed by a computing device.

In a seventh aspect, there is provided a computer non-transitory storage medium comprising instructions that, when executed on a computing device, implement the method as described in the first aspect above.

In an eighth aspect, there is provided a computer non-transitory storage medium comprising instructions which, when executed on a computing device, implement the method as described in the second aspect above.

In a ninth aspect, there is provided a computing node comprising a processor and a memory, the processor executing code in the memory to perform the method as described in the first aspect.

In a tenth aspect, there is provided a computing node comprising a processor and a memory, the processor executing code in the memory to perform the method as described in the second aspect.

Drawings

In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below.

FIGS. 1A-1B are schematic block-chain networks;

FIGS. 2A-2B are flow diagrams illustrating steps for a write transaction in a blockchain network;

FIG. 3 is a flow chart illustrating steps in a read transaction in a blockchain network;

4A-4C are flow charts of human-computer interaction using a method of information filtering provided herein in an application scenario;

FIG. 5 is a block chain network according to the present application;

FIG. 6 is a schematic flow chart diagram illustrating a method for filtering information provided herein;

FIGS. 7A-7B are schematic flow charts of an information filtering method provided in the present application in a write transaction scenario;

FIG. 8 is a schematic flow chart of an information filtering method in a read transaction scenario according to the present application;

fig. 9 is a schematic structural diagram of a blockchain network system provided in the present application.

Detailed Description

The terminology used in the description of the embodiments section of the present application is for the purpose of describing particular embodiments of the present application only and is not intended to be limiting of the present application.

To facilitate understanding of the technical solution of the present invention, first, a block chain system architecture is briefly described by taking a schematic structural diagram of a block chain network shown in fig. 1A-1B as an example.

The Block Chain network may include one or more Block chains (Block Chain). The block chain comprises a plurality of block chain nodes. The block link points include Ledger instances (leggers) and chain codes (chaincodes). The ledger instance is used to record transactions in a blockchain network. The chain code, which may be called a Smart contract (Smart contract), is used for the block chain node to inquire about the transaction in this instance and to newly increment the transaction in this instance, and the number of the chain codes may be one or more. One block chain may correspond to one Channel. Wherein the channel has the following characteristics: the block link points added into the same channel can be transacted or share accounts; one or more channels can be added to the same blockchain node, when the blockchain node is added into one channel, the node holds an account book, and when the blockchain node is added into a plurality of channels, the node correspondingly holds a plurality of account books.

For example, the blockchain network N in fig. 1A includes blockchain nodes P1, P2, and P3, and the blockchain network includes two blockchains, a blockchain 1 and a blockchain 2, where the blockchain 1 includes blockchain nodes P1 and P2, the corresponding channel is C1, and the ledger L1 is shared between the blockchain nodes P1 and P2. Blockchain 2 includes blockchain nodes P1 and P3, the corresponding channel is C2, and account book L2 is shared between blockchain nodes P1 and P3. The block chain node P1 is provided with a chain code S1 and a chain code S2, the block chain node P2 is provided with a chain code S1, and the block chain node P3 is provided with a chain code S2. The block chain node P1 accesses the ledger L1 on the node through the chain code S1, accesses the ledger L2 on the node through the chain code S2, the block chain node P2 accesses the ledger L1 on the node through the chain code S1, and the block chain node P3 accesses the ledger L2 on the node through the chain code S2.

The blockchain network may be managed by one or more organizations (Organization), each Organization may include one or more Organization nodes, and the Organization nodes are managed by an Organization administrator, and the Organization nodes in the same Organization may be blockchain nodes on the same blockchain or blockchain nodes on different blockchains. For example, block link point P1 and block chain node P2 in fig. 1A may belong to organization O1, and block chain node P3 may belong to organization O2. Alternatively, blockchain node P1 may belong to organization O1, blockchain node P2 and blockchain node P3 may belong to organization O2. Each organization may develop a different client or Application (Application) on its own, where the client represents an entity operated by the end user and needs to connect to a blockchain node to communicate with the blockchain network, so that the user can query information on the blockchain or perform a transaction through the client. In a specific implementation, the client may be various software programs in a user terminal or a computer, or a Browser end (Browser) in a product of a B/S architecture. An administrator of the organization can distribute the digital certificates for the nodes in the organization, so that when each node accesses the block chain network, the identity of each node can be verified through the digital certificates. The organization administrator may also create, start, stop, reconfigure, and delete nodes through the client of its own organization, for example, as shown in fig. 1B, the administrator of organization O1 creates a blockchain node P4, joins it to channel C1, assigns a digital certificate of O1 to blockchain node P4, and installs a chain code S1 on blockchain node P4, so that node P4 can access ledger L1 through chain code S1 to become a node on blockchain 1. It should be noted that, because there may be a difference in the points of interest of each organization for the same account book, the clients used by different organizations sharing the same account book are also different. Plus an example.

It should be understood that the blockchain networks shown in fig. 1A-1B are only for illustration, and the blockchain networks may further include more nodes, chain codes, and the like, and the present application is not limited in particular.

Based on the block chain system architecture shown in fig. 1A, the following two main application scenarios for the block chain are described: the information distribution process and the information inquiry process will be described in detail.

Information issuing process (write transaction process)

Blockchain nodes on a blockchain can be logically broken down into different roles, each role assuming different functions in a transaction flow. The blockchain nodes can be mainly divided into an endorsement node (Endorser), a sequencing node (Orderer) and a commit node (commit). The detailed flow of the write transaction and the function of the various blockchain nodes are briefly described below.

Fig. 2A is a schematic diagram of a write transaction flow provided herein. As shown in fig. 2A, the write transaction process may be specifically divided into the following steps:

s201: a client or application generates a Proposal for a transaction (promusal) and sends the Proposal for a transaction to a endorsement node.

In a specific implementation, the transaction proposal includes an endorsement link function name, an endorsement node list, identity information (client signature), and user specific transaction content. The endorsement node list is determined according to an endorsement policy preset in an endorsement chain code, for example, the endorsement policy set by the endorsement chain code requires signature endorsement through A, B endorsement nodes, so that the address information of A, B two endorsement nodes is added to the endorsement node list. The transaction proposal will be sent A, B to two endorsement nodes to endorse.

S202: and the endorsement node simulates the transaction according to the transaction proposal, generates an endorsement result, sends the endorsement result to a client, and receives the endorsement result.

In the specific implementation, the endorsement node firstly verifies the client signature in the transaction Proposal to determine whether the client is authorized to perform the transaction operation, and after the verification is passed, the endorsement node performs the simulated transaction according to the transaction Proposal, namely, the endorsement chain code which needs to be executed at this time is obtained according to the endorsement chain code function name in the transaction Proposal, and the endorsement result or Proposal Response (professal Response) for expressing the result of the simulated transaction is generated according to the business logic in the execution endorsement chain code 'simulated' of the transaction content, namely, the endorsement result. And returning the endorsement chain code to the client, wherein the endorsement chain code is used for being executed by the endorsement node and generating an endorsement result. Note that the ledger data is not updated in the endorsement process, and only the simulated transaction is performed to obtain the result of the simulated transaction.

S203: the client generates transaction information according to the endorsement result sent by the endorsement node, and sends the transaction information to the sequencing node, and the sequencing node receives the transaction information.

In the specific implementation, the client firstly confirms whether the number of endorsement results received from the endorsement node reaches a preset threshold value, and if the number of received transaction proposals does not reach the preset threshold value, the transaction is stopped; and if the number of the received transaction proposals reaches a preset threshold value, comparing whether endorsement results returned by the nodes are consistent, determining whether the transaction proposals returned by the nodes are endorsement results obtained by executing a correct endorsement strategy, and packing all endorsement results and adding signatures which are successfully verified under the condition that the endorsement results returned by the nodes are consistent and the endorsement results obtained by executing the correct endorsement strategy are confirmed, so that transaction information is generated and sent to the sequencing node.

S204: and the sequencing node generates a new block according to the transaction information, sends the block to a submitting node, and the submitting node receives the block. Specifically, the sorting node sorts the transaction information and other transaction information on the channel according to transaction time, generates a new block, and sends the packed block to the submitting node.

S205: the commit node appends the block to the local blockchain so that blockchain link points on all channels can update the blockchain.

The write transaction flow described in S201-S205 above is explained in detail below with reference to fig. 2B.

In one embodiment, as shown in fig. 2B, each node in the block chain stores data including ledger data and State data (State Database), wherein the ledger data is stored in a block (block) and the State data is stored in a State Database (State DB). It should be understood that, since the book data of the block chain needs to traverse the blocks from the creation block, as the block chain grows, the workload of reading the book by the block traversing method is very large, and therefore, each node in the block chain may additionally maintain a state database besides maintaining the book data, and separately store some important data or data that needs to be frequently accessed, so that part of the business can quickly acquire the required data. Thus, in FIG. 2B, nodes P1, P2, and P3 within the same channel maintain a state database D1 in addition to a ledger L1. Note that the ledger data in the block is data that cannot be tampered, but the status data in the status database records the result of each transaction, so that the status data can be modified by increasing transactions, and the status data is data that can be modified.

In a specific implementation, the state data stored in the state database may be related to the latest transaction of the current ledger. In order to facilitate quick query of data required by the current service, the state data is generally stored in a Key Value pair (K, V), where K represents a Key (Key), V represents a Value (Value) corresponding to the Key, for example, K is small and V is 14 years old. The above examples are merely illustrative and are not intended to be limiting.

Therefore, as shown in fig. 2B, after the client generates the transaction proposal, the client sends the transaction proposal to the endorsement node (step S201 in fig. 2A, step 1 in fig. 2B), and the specific flow of the endorsement node generating the endorsement result (step S202 in fig. 2A, steps 1 to 4 in fig. 2B) in combination with the state database D1 is as follows: firstly, according to the transaction content, by reading the state data 210 in the state database D1, the latest key value pair of the current account book transaction is obtained, that is, the value corresponding to the key K1 is V1, the value corresponding to the key K2 is V2, and version 1 represents that the key value pair is the key value pair of the first version; then, the endorsement node P1 may perform a simulated transaction according to the transaction proposal and the key value pair, execute the chain code to generate a new key value pair, and form a Read-Write Set 220(Read-Write Set), wherein the simulated transaction result is that the value corresponding to the key K1 is modified to be V12, and the value corresponding to the key K2 is modified to be V22 (step 3 in fig. 2B); finally, the endorsement node P1 performs a signature operation on the read-write set to generate an endorsement result, and sends the endorsement result to the client (step 4 in fig. 2B). It should be appreciated that since the transaction execution in the endorsement process is only a simulated transaction, the result of the transaction execution (the read/write set 230) is not written into the current state database D1, and even the ledger update is not performed.

The specific process of the sorting node in combination with the status database generation block (steps S203-S204 in fig. 2A, and steps 5 to 7 in fig. 2B) is as follows: after receiving the read-write sets 230 sent by the endorsement nodes P1, the client compares whether the read-write sets are consistent, and if so, the transaction is approved by the endorsement nodes, which is a problem-free transaction, so that the read-write sets 230 can be packaged into real transaction information and sent to the sorting node P2 for sorting (step 5), and the sorting node calls a sorting chain code to sort the transactions according to the transaction information and further generates a new block (steps 6 to 7). In short, after the read-write set 230 passes through steps 4 to 8, and when it is determined that the transaction is a transaction that can be executed, the submitting node P3 records information of a new transaction in the ledger data according to the read-write set in step 8, and correspondingly updates the state data 230 in the state database, modifies the value corresponding to the key K1 to V12, modifies the value corresponding to the key K2 to V22, and modifies the version to the second version; otherwise, the transaction will be aborted. After the submitting node adds a new block into the block chain and updates the state database D1, other block chain nodes on all channels will also update the account book L1 and the state database D1 maintained by the node, thereby ending the transaction.

It should be noted that fig. 2B is only used for illustration, in a specific implementation, the endorsement node may be a plurality of nodes, a chain code installed on each node, a maintained account book, and a maintained state database may also be a plurality of nodes, the state database and the state database in the read-write set may also be a plurality of nodes, key value pairs in the state database and the read-write set are only used for illustration, and the key K, the version, and the value V may correspond to different meanings and formats according to a service scenario, which is not specifically limited in this application.

(II) information inquiry process (read transaction process)

The flow of information inquiry (read transaction) will be explained below by taking fig. 3 as an example. As can be seen from fig. 3, the process of information query can be specifically divided into the following steps:

s301: the client generates a query proposal for querying the target account book, sends the query proposal to the block link point P1, and receives the query proposal by the block link point P1. The block link point P1 is a node installed with a query chain code S1, where the query chain code is used for the block chain node P1 to execute and query the account book L1, and obtain a query result.

S302: and the block chain node P1 calls and executes a corresponding query chain code S1 according to the query proposal.

S303: block chain node P1 queries state database D1, generating query results. In a specific implementation, the block link point P1 may call a getstate function in the query chain code to obtain the state data of the ledger. It should be noted that fig. 3 only shows a state database (StateDB) for storing relevant data of the latest transaction of the current account book, in a specific implementation, each node may also maintain other databases according to service requirements, such as an ID database (IDstore), for storing a chain code ID, so as to facilitate a user to quickly query which accounts exist in the node, and further such as a history database (HistoryDB), for storing version changes of key value pairs in the state database, so as to facilitate a user to quickly query historical transaction information, and the like, which is not described herein again.

S304: block chain node P1 returns the query results to the client, which receives the query results.

It can be understood that, because each node in the block chain stores the book data and the state data, in the information query process, the query result can be obtained only by performing state query on the locally stored state database at the node without accessing other nodes. For the content that is not shown or not described in fig. 3, reference may be made to the related explanation of the write transaction flow described in fig. 2A-2B, and details are not repeated here.

As can be seen from the above, the information publishing process and the information querying process of the blockchain do not have any relevant steps related to processing the illegal information, so that malicious users in the blockchain system can directly publish, record, store, and propagate the illegal information, and once the illegal information is published, the illegal information cannot be tampered permanently, and other users in the blockchain system can also directly access the illegal information, so that the illegal information is permanently propagated, and the security of the blockchain information management is greatly reduced.

In order to solve the problem of low safety of block chain information management, the application provides an information filtering method, which can not only refuse to issue illegal information which is not uplink but also refuse to inquire illegal information which is uplink, thereby improving the safety of block chain information service management.

An application scenario in which a user performs a block chain information query (read transaction) by using the information filtering method provided by the present application is illustrated below by taking fig. 4A to 4C as an example. As shown in fig. 4A, assuming that the user currently needs to query all transaction information of a blockchain wallet with an address of "0 xBB9bc244D798123fDe783fCc1C72D3Bb8C 189413" through the blockchain client 410, after the user inputs the wallet address in the search box 411 shown in fig. 4A, the blockchain client 410 displays an interface shown in fig. 4B, shows the account name, available balance and transaction record 412 of the wallet address to the user, and the user can view the detailed information of the transaction by clicking any transaction record 412, and if the detailed information of the transaction does not contain illegal information, the blockchain client 410 displays the detailed information of the transaction; if the transaction details contain illegal information, the blockchain client 410 returns to the interface shown in fig. 4C to alert the user that the transaction contains a large amount of malicious content and is inaccessible.

It should be noted that the illegal information may be information content prohibited by laws and administrative laws such as harming national security, disturbing social order, infringing legal rights and interests of others, for example, information including illegal words such as "drugs", "pornography" and "guns"; but also information content with sensitive political inclination (or inverse political party inclination), violence inclination, unhealthy chromatic words or non-civilized language, such as information containing malicious words of abuse, 35881, abuse of others, ethnic discrimination and the like, which is not specifically limited in this application.

It can be understood that the application scenario in which the user performs the blockchain transaction by using the information filtering method provided by the present application is similar to the application scenario described above, and when the blockchain client 410 detects that the transaction information uploaded by the user includes illegal information, the blockchain client 410 returns to the interface shown in fig. 4C, which is not described again here.

In order to implement the application scenario, that is, in order to implement the process of identifying and denying access to illegal information when performing an information query (read transaction) or an information distribution (write transaction) process in a blockchain network, the present application provides an information filtering method. The method relates to the following main principles: by adding a management chain in a blockchain network and storing illegal keywords in the management chain, when each node carries out a read transaction and a write transaction process, the illegal keywords stored in the management chain can be read firstly, and when the obtained read transaction content contains the illegal keywords, the read transaction process is stopped, so that the illegal information which is linked cannot be read from the blockchain by a user; when the obtained write transaction content contains an illegal keyword, the write transaction process is stopped, so that illegal information which is not linked up cannot be issued on the block chain by a user, and further the safety of block chain information service management is improved.

The information filtering method provided by the present application is described in detail below with reference to the accompanying drawings.

Fig. 5 is a blockchain network that can implement the information filtering method provided by the present application, where the blockchain network includes a management chain and a general chain, where the first ledger stores transaction information of the blockchain network, and the second ledger stores illegal keywords and blacklist information. In a specific implementation, the common chain includes a first node, the management chain includes a first node and a second node, and the first node adds a first channel and a second channel, where the first channel is a channel corresponding to the common chain and the second channel is a channel corresponding to the management chain; the second node joins the second channel. The first node is provided with a first account book and a second account book, wherein the first account book is the account book corresponding to the common chain, and the second account book is the account book corresponding to the management chain; the second node is provided with the second account book. That is, as shown in fig. 5, the channel of the normal chain is C1, the maintained account book is L1, the channel of the management chain is C2, and the maintained account book is L2. The ledger L1 is an ledger corresponding to the common chain, and the ledger L2 is an ledger corresponding to the management chain, and records illegal keywords and blacklist information that are not allowed to appear in the transaction of the blockchain network, where the first node may include an endorsement node, a sorting node, and a submission node in the foregoing content, and specifically may be P1 and P3 in fig. 5. The second node P2 has a system chain code S installed thereon, which is used to add or delete illegal keywords, and add or delete blacklist information. It should be noted that although the first nodes P1 and P3 in the normal chain are connected to the management chain channel C2, and do not have the functions of adding or deleting sensitive keywords and adding or deleting blacklist information because the system chain code S1 is not installed, the first nodes P1 and P3 both maintain the ledger L1 and ledger L2, and therefore the first nodes P1 and P3 can query the information of the ledger L1 and ledger L2. And the management node P2 cannot access the information of the ledger L1 on the normal chain because it is not connected to the normal chain channel C1. As can be seen from the foregoing, each block link point maintains a state database, and therefore the first node further includes a first state database corresponding to the normal chain and a second state database corresponding to the management chain, and the second node further includes the second state database corresponding to the management chain. That is, as shown in FIG. 5, the first nodes P1 and P3 further include state databases D1 and D2, and the second node P2 includes a state database D2.

It is to be understood that the first node may be managed by a normal chain administrator, and the second node may be managed by an administrative chain administrator, where the normal chain administrator managing the first node may be an organization administrator in the foregoing, that is, a provider of a certain service information service in the blockchain network, and the administrative chain administrator managing the second node may be a government department or a regulatory department corresponding to the service. For example, a company provides a block chain network of cross-border logistics information, a common chain ledger can be a staff who records all logistics warehousing information from the production of commodities to the delivery to cross-border consumers, a common chain manager can be a staff who maintains the block chain network, and a management chain manager can be a staff of a customs administration department, and blacklists users, clients and nodes who provide false information, counterfeit commodities, data or sell counterfeit products. It should be understood that the above examples are illustrative only and are not to be construed as being particularly limiting.

Fig. 6 is a schematic flow chart of an information filtering method provided in the present application, which may be implemented in the blockchain network shown in fig. 5, and the following describes the information filtering method provided in the present application with reference to fig. 5 and fig. 6:

s601: the client sends a target transaction request to a first node P1, and the first node P1 receives the transaction request sent by the client, wherein the target transaction request comprises a read transaction request or a write transaction request.

S602: and the first node calls the corresponding target chain code to carry out target transaction according to the target transaction request to obtain transaction data. The transaction data is data read from a first state database by the first node according to a transaction request sent by a client, or data ready to be written into the first state database. And under the condition that the target transaction request is a write transaction request, the target chain code is an endorsement chain code, and under the condition that the target transaction request is a read transaction request, the target chain code is an inquiry chain code. In a specific implementation, when the target transaction request is a write transaction request, the transaction data is an endorsement result (endorsement result) of the first node, and when the target transaction request is a read transaction request, the transaction data is a query result.

S603: and the first node acquires illegal keywords from the second state database and matches the illegal keywords with transaction data, wherein the illegal keywords are added by the second node and are synchronized into the second state database of the first node. If the matching of the illegal keyword and the transaction data is successful, step S604 is performed, and if the matching of the illegal keyword and the transaction data is failed, step S605 is performed.

S604: the first node aborts the target transaction and returns information denying execution of the target transaction request to the client. In a specific implementation, the client generates an interface as shown in fig. 4C or other similar information according to the information of the target transaction suspension, and the application is not limited in particular.

S605: the first node determines to continue executing transactions according to the transaction data. In a specific implementation, the first node returns the generated endorsement result to the client when the target transaction request is a write transaction request, and the first node returns the query result to the client when the target transaction request is a read transaction request.

In a specific embodiment, the management chain is further configured to store blacklist information, the target transaction request further includes identity information of the client, and before the first node acquires transaction data (after step S601, before step S602), the method further includes: the first node acquires blacklist information stored in a management chain and matches the identity information with the blacklist information; under the condition that the identity information is successfully matched with the blacklist information, the first node returns the information that the target transaction is stopped to the client (namely, step S603 is executed); and under the condition that the identity information and the blacklist information are unsuccessfully matched, the first node calls a corresponding target chain code to perform target transaction according to the target transaction request, and transaction data are obtained (namely, step S602 is executed). It can be understood that if some clients or first nodes query or issue illegal information for many times, they may be added to the blacklist, so that the information of target transaction suspension may also be returned without performing steps S602-S603, thereby speeding up the information filtering.

The illegal information may be illegal information in the foregoing content, and the blacklist information includes a first blacklist and a second blacklist, where the first blacklist includes identity information of a malicious client and a malicious user who forbid a transaction on the blockchain network, and the second blacklist includes identity information of a malicious node that cooperates with the malicious client or the malicious user to perform a transaction with the blockchain. For example, the first blacklist may be a user name, a client address, and the like of a transaction using the client, and the second blacklist may be a node name, a node address, and the like of a node, or other identity information unique to the client, the user, and the node, which is not limited herein. For example, a user name of a malicious user who has issued or inquired about illegal information is added to the blacklist, so that the malicious user cannot inquire or issue any information to the block chain, and for example, a malicious node actively matched with the malicious user to inquire about illegal information and issue the illegal information is added to the blacklist, so that the malicious user cannot provide services for other malicious users who are not in the blacklist, and the speed of information filtering is improved fundamentally. Blacklist information and illegal information can be added according to the service requirement of the blockchain network, for example, an IP address of a business competition partner is added to a blacklist, and the like, which is not specifically limited in the present application.

Further, the blacklist information and the illegal keyword may be set by an administrator of the management chain according to experience, or may be obtained through algorithms such as machine learning and logical reasoning. For example, a neural network is trained by using historical transaction information of a large number of blacklist nodes, and transaction characteristics of the blacklist nodes are learned, so that new blacklist information is predicted according to transaction information of other nodes. It should be understood that the foregoing examples are illustrative only, and the present application is not limited thereto.

It should be noted that the blockchain network shown in fig. 5 is only used for illustration, and the blockchain network may further include more management nodes, first nodes, normal chain channels, chain codes, and the like, and may also include only one channel, that is, the blockchain network has only one blockchain, which is both a management chain and a normal chain, and the present application is not limited specifically.

In summary, by implementing the technical scheme of the embodiment of the present application, an illegal keyword and blacklist information may be added to a management chain, so that when a first node performs a read transaction or a write transaction process, whether the read transaction or the write transaction process includes illegal information is determined by the illegal keyword and blacklist information, and thus illegal information that is not linked cannot be issued on a blockchain by a user, illegal information that is linked cannot be read from the blockchain by the user, and thus security of blockchain information service management is improved.

The following describes the information filtering method provided by the present application, taking an application scenario of a write transaction process (information publishing process) as an example. Referring to fig. 7A, the method can be described by the following steps:

s701: a client or application generates a Proposal for a transaction (promusal) and sends the Proposal for a transaction to one or more endorsement nodes. The endorsement node can be any first node provided with an endorsement chain code. The contents of the transaction proposal and the definition of the endorsement node can refer to the contents in the foregoing embodiments of fig. 2A-2B, and are not described herein again.

S702: and each endorsement node in the one or more endorsement nodes simulates the transaction according to the transaction proposal and generates an endorsement result, and sends the endorsement result to a client, and the client receives the endorsement result. In a specific implementation, the content in the foregoing embodiments of fig. 2A to 2B may be referred to for generating an endorsement result, and details are not repeated here.

S703: and the endorsement node acquires the illegal keywords stored in the management chain and matches the illegal keywords with the endorsement result. If the matching of the illegal keyword and the endorsement result is successful, executing the steps S704-S705, and if the matching of the illegal keyword and the endorsement result is failed, executing the step S706

S704: and the endorsement node stops endorsement and returns the information of endorsement failure to the client, and the client receives the information of endorsement failure.

S705: the client displays the information of the transaction failure to the user. In a specific implementation, the client may generate an interface as shown in fig. 4C, or other similar information, to notify the user that the current transaction information includes information that is not compliant, which is not limited in this application.

S706: the endorsement node sends the endorsement result to the client, and after the client receives the endorsement node, the client executes the steps S203-S205 in the embodiment of fig. 2A, thereby completing one complete transaction. Reference may be made to the foregoing embodiments, and details are not repeated herein.

In a specific embodiment, the target transaction request further includes identity information of the client, and after the first node receives the target transaction request sent by the client (after step S701, before step S702), the method further includes: the method comprises the steps that a first node obtains blacklist information in a management chain account book and matches the identity information with the blacklist information; under the condition that the identity information is successfully matched with the blacklist information, the first node returns the information that the target transaction is suspended to the client (namely, step S704 is executed); and under the condition that the identity information and the blacklist information are unsuccessfully matched, the first node calls a corresponding target chain code to perform target transaction according to the target transaction request, and obtains transaction data needing to be returned to the client (namely, step S702 is executed). It can be understood that if some clients or first nodes query or issue illegal information for many times, they may be added to the blacklist, so that step S704 is directly executed without executing steps S702 to S703, thereby speeding up the information filtering.

In a specific implementation manner, the management chain administrator may further add a malicious node actively cooperating with the malicious user to perform the query and issue of the illegal information into the blacklist, so that the malicious node cannot provide services for other malicious users not in the blacklist, thereby further improving the accuracy of information filtering. Therefore, after step S706, any first node in the block chain may also shield any information from the blacklisted node according to the blacklisted information, and not send any information to the blacklisted node. It can be understood that, when each node sends or receives information, the identity information of the destination node and the identity information of the sending node, to which the information is attached, are matched with the blacklist node, and in case of successful matching, the first node suspends the transaction and returns the information of transaction suspension to the client, and in case of failed matching, the first node continues the current transaction.

For example, assuming that in the current write transaction process, the identity information of the client and the user name is not in the blacklist information, and the read-write set generated by the endorsement node does not include an illegal keyword, at this time, the endorsement node may send the endorsement result to the client, and after receiving the endorsement node, the client will execute steps S203-205 in the embodiment of fig. 2A, in brief, the client will generate transaction information according to the endorsement result and send the transaction information to the sorting node; the sequencing node generates a new block according to the transaction information and sends the block to the submitting node; when the submitting node receives the block sent by the sorting node, matching the identity information of the sorting node with the blacklist, and if the matching fails, executing the step S205 by the submitting node so as to complete one transaction; under the condition of successful matching, the sequencing node actively cooperates with a malicious user to inquire and issue illegal information, so that the termination block is submitted, and the transaction termination information is returned to the client, so that the illegal information is prevented from being issued to the maximum extent.

The write transaction flow described in the above-mentioned S701-S706 is explained in detail below with reference to fig. 7B.

In a specific embodiment, the blacklist information and the illegal keyword are stored in an account book and a status database of a node accessing to a channel of the management chain. The management node may modify the blacklist information and the illegal keyword in the state database by performing a management transaction on the management chain, where the management transaction is specifically adding an illegal keyword, deleting an illegal keyword, adding a blacklist user name, deleting a blacklist user name, and the like. As can be seen from the foregoing, the ledger data record in the block is an operation record of a transaction, and is data that cannot be tampered, but the state data record in the state database is a result of each transaction, so that the state data can be modified by increasing the number of transactions, for example, a transaction performed by a management node for the first time on a management chain is to add an account a into a blacklist, and then the state database will have blacklist information of an account a after the transaction is performed. Therefore, when filtering, the information is filtered according to the blacklist information and the illegal keyword in the state database.

In a specific implementation, as shown in fig. 7B, each node of the normal chain maintains one management chain state database D1 and one normal chain state database D2 in addition to the management chain ledger L1 and the management chain ledger L2. Therefore, a specific method for filtering information by combining the state database and the first blacklist may be as follows: the first node acquires a first blacklist from the second state database, wherein the first blacklist is added by the second node and is synchronized to the second state database of the first node; the first node acquires a first identity identifier from the transaction request, wherein the first identity identifier is an identifier of the client or an identifier of a user using the client; the first node matches the first identity identifier with the first blacklist; the first node obtains transaction data, including: and when the first identity identification and the first blacklist are unsuccessfully matched, the first node acquires transaction data. As can be seen from the foregoing, after the endorsement node (i.e., the first node) receives the transaction proposal sent by the client, the endorsement node may obtain the blacklist information and the illegal keyword stored in the management chain state database D1, and match the identity information in the transaction proposal with the blacklist information. The identity information in the traded proposal is matched with the blacklist information (step 2 in fig. 7B). And under the condition that the identity information is successfully matched with the blacklist information, the endorsement node returns the endorsement failure information to the client (step 3 in fig. 7B). Under the condition that the matching between the identity information and the blacklist information fails, the endorsement node executes the endorsement chain code according to the transaction proposal to generate a read-write set 720 (step 4 in fig. 7B), wherein the process of generating the read-write set 720 may refer to the embodiment in fig. 2B, and is not described herein again. For example, in the management chain status data 730 in fig. 7B, the blacklist information is { Key ═ ID, Value ═ ID1, and version ═ 1}, and if the identity information in the transaction proposal is "ID ═ ID 1", it represents that the user ID in the transaction proposal has been pulled into the blacklist, so step 3 will be executed, and information of endorsement failure is returned; if the identity information in the transaction proposal is "ID 2", it represents that the user ID in the transaction proposal is not pulled into the blacklist, so step 4 will be executed to continue the transaction endorsement. It can be understood that the specific method for filtering information by combining the state database and the blacklist information is to filter user identity information and client identity information in the blacklist information.

Similarly, the method for filtering the information with respect to the second blacklist information may be as follows: after the first node determines to continue executing the transaction according to the transaction data, the method further includes: the first node acquires a second blacklist from the second state database, wherein the second blacklist is added by the second node and is synchronized to the second state database of the first node; the first node acquires a second identity mark, wherein the second identity mark is the identity mark of other nodes, and the other nodes are nodes for sending information to the first node, or the first node prepares to send information; the first node matches the second identity with the second blacklist; and when the first identity identification is successfully matched with the first blacklist, the first node refuses to receive the information sent by other nodes, or the first node refuses to send the information to other nodes. In a specific implementation, the above contents may also be referred to, and the second identity identifier of the other node that receives or sends the information is matched with the second blacklist in the state data 730 of the management chain, which is not described herein again. It should be understood that the above examples of the identity information and the key value pair in fig. 7B are only for illustration and are not to be construed as specific limitations.

Similarly, the method for filtering the illegal information by combining the state database and the illegal keyword comprises the following steps: as shown in fig. 7B, the endorsement node queries the general chain state database 720 according to the transaction proposal, generates a read-write set (step 4 in fig. 7B), matches the read-write set with the illegal keyword in the management chain state data 730, and returns the information of endorsement failure to the client when the read-write set 720 is successfully matched with the illegal keyword (step 5 in fig. 7B). Under the condition that the read-write set 720 fails to match the illegal keyword, the endorsement node generates an endorsement result according to the read-write set 720 and returns the endorsement result to the client (step 6 in fig. 7B), so that the client executes steps S203-S205 in the embodiment of fig. 2A, thereby completing a complete transaction. Reference may be made to the foregoing embodiments, and details are not repeated herein. For example, in the management chain status data 730 in fig. 7B, the illegal keys are K1, Value V12, and version 1, and the read/write set 720 in fig. 7B includes K1 and V12, which represents that part of the information in the transaction includes the illegal Key, so step 5 is executed to return the information of the endorsement failure. It can be understood that if the read/write concentration part contains an illegal keyword, step 6 is executed to continue the transaction.

It should be noted that fig. 7B is only used for illustration, in a specific implementation, the endorsement node may be a plurality of nodes, a chain code installed on each node, a maintained account book, and a maintained state database may also be a plurality of nodes, a plurality of state databases and a plurality of state databases in the read-write set may also be provided, key value pairs in the state databases and the read-write set are only used for illustration, and the key K, the version, and the value V may correspond to different meanings and formats according to a service scenario, which is not specifically limited in this application.

It can be understood that, by implementing the information filtering method provided by the present application, an illegal keyword and blacklist information may be added to a management chain, so that when a first node writes a transaction (information issue), whether current transaction content includes illegal information is determined through the illegal keyword and blacklist information, and thus, content that does not comply with the rules, such as illegal transaction, malicious information, and the like, cannot be issued on a blockchain by a user, thereby improving security of blockchain information service management.

The following describes the information filtering method provided by the present application, taking an application scenario of a read transaction process (information query process) as an example. Referring to fig. 8, the method can be described by the following steps:

s801: the client generates a query proposal, the query proposal is sent to a first node P1, the first node P1 receives the query proposal, and the query proposal comprises the identity information of the client.

S802: and querying the management chain state database 820 to obtain blacklist information and illegal keywords.

S803: and returning the information of the query failure under the condition that the blacklist contains the identity information. For example, in the management chain status data 810 in fig. 8, the blacklist information is { Key ═ ID, Value ═ ID1, and version ═ 1}, and if the identity information in the transaction proposal is "ID ═ ID 1", which represents that the user ID in the transaction proposal has been pulled into the blacklist, step S803 is executed to return the information that the query failed.

S804, under the condition that the blacklist does not contain the identity information, according to the query proposal, the query chain code is called to query the common chain state database 810, and a reading set is constructed.

And S805, returning the information of the query failure under the condition that the read set contains the illegal keywords. For example, in fig. 8, the illegal keyword is { Key ═ K1, Value ═ V12, and version ═ 1}, and the read set 820 includes { Key ═ K1, Value ═ V12, and version ═ 1}, which represents that the transaction content of the query includes the illegal keyword, and therefore, information of query failure is returned.

And S806, under the condition that the reading set does not contain illegal keywords, generating a query result according to the reading set, and returning the query result to the client. For specific implementation, reference may be made to the embodiment in fig. 3 in the foregoing, and details are not described here.

It can be understood that, because each node in the block chain stores the book data and the state data, in the information query process, the query result can be obtained only by performing state query on the locally stored state database at the node without accessing other nodes. For the content that is not shown or not described in fig. 8, reference may be made to the related explanation of the write transaction flow described in fig. 7A-7B, which is not described herein again.

In a specific embodiment, the illegal keyword, the first blacklist and the second sum list may be added by a system chain code in the second node, and are synchronized to the second status database of the first node, and the system chain code in the second node is used for adding and deleting the illegal keyword in the second node. The specific method for adding the illegal keyword can be as follows: the second node receives a first transaction request sent by a client, wherein the first transaction request comprises an illegal keyword; the second node calls a system chain code to carry out transaction according to the second transaction request so as to add the illegal keyword into a second state database of the second node; the second node synchronizes the illegal key to a second state database of the first node. Similarly, the transaction may be performed by calling the system link code, so that the first blacklist information and the second blacklist information are added to the second state database of the second node, which is not described herein again.

In the specific implementation, for a blockchain network without an information filtering function, the above flow of identifying and rejecting access to illegal information when performing an information query (read transaction) or an information distribution (write transaction) flow on a blockchain network can be implemented by only adding one or more second nodes, installing a system chain code for adding blacklist information and illegal keywords on the second nodes, and then notifying a common chain administrator to perform unified upgrade on all nodes on the common chain, so that each first node executes the information filtering method provided by the present application when performing a read transaction and a write transaction flow. The whole upgrading process is fast, the operation is simple, and the user experience is good.

It can be understood that, by implementing the information filtering method provided by the present application, an illegal keyword and blacklist information may be added to a management chain, so that when a first node reads a transaction (information query), whether the currently queried transaction content includes illegal information is determined through the illegal keyword and blacklist information, and thus, the content that is stored on a blockchain and is not compliant, such as illegal transactions, malicious information, and the like, cannot be queried by a user, thereby improving the security of blockchain information service management.

In conjunction with the related embodiments shown in fig. 1A to 8, related devices, apparatuses, and systems related to the embodiments of the present application are described below.

Referring to fig. 9, fig. 9 is a schematic structural diagram of a blockchain network system provided in the present application, wherein the blockchain network system 900 includes one or more second nodes 910 and one or more first nodes 920. The first node 910 may be the first node in the foregoing, and the second node 920 may be the second node in the foregoing.

The second node 910 may be the second node in the preceding, the second node 910 comprising one or more processors 911, a communication interface 912, and a memory 913. The processor 911, the communication interface 912, and the memory 913 may be connected to each other via a bus 914. The bus 914 may be a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. The bus 914 may be divided into an address bus, a data bus, a control bus, and the like. For ease of illustration, only one thick line is shown in FIG. 9, but this does not indicate only one bus or one type of bus.

Processor 911 comprises one or more general-purpose processors, which can be any type of device capable of Processing electronic instructions, including a Central Processing Unit (CPU), microprocessor, microcontroller, host processor, controller, and an ASIC (Application Specific Integrated Circuit), among others. The processor 911 executes various types of digitally stored instructions, such as software or firmware programs stored in the memory 913, which enable the computing device to provide a wide variety of services. For example, the processor 911 may perform processing functions by calling program code in the memory 913, including adding or deleting illegal keys, adding or deleting blacklist information, maintaining a status database, and so on.

Communication interface 912 may be a wired interface (e.g., an ethernet interface) for communicating with other devices or modules. For example, the communication interface 912 may be configured to support communication between the second node 910 and the first node 920 such that the second node 910 updates the state database of the management chain, which the first node 920 may subsequently update, and/or perform other steps of the techniques described herein.

The Memory 913 may include a Volatile Memory (Volatile Memory), such as a Random Access Memory (RAM); the Memory may also include a Non-Volatile Memory (Non-Volatile Memory), such as a Read-Only Memory (ROM), a Flash Memory (Flash Memory), a Hard Disk Drive (HDD), or a Solid-State Drive (SSD) Memory, which may also include a combination of the above types of memories. Memory 913 may store program codes and program data. Such as storing a system chain code for adding or deleting illegal keywords, adding or deleting blacklist information, storing a status database for storing illegal keywords and blacklist information, etc.

The first node 920 may be the first node in the foregoing. The first node 920 includes one or more processors 921, a communication interface 922, and memory 923. The processor 921, the communication interface 922, and the memory 923 may be connected to each other via a bus 924. The bus 924 may be a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. The bus 924 may be divided into an address bus, a data bus, a control bus, and the like. For ease of illustration, only one thick line is shown in FIG. 9, but this does not indicate only one bus or one type of bus.

The processor 921 includes one or more general-purpose processors, which may be any type of device capable of Processing electronic instructions, including a Central Processing Unit (CPU), a microprocessor, a microcontroller, a main processor, a controller, and an ASIC (Application Specific Integrated Circuit), among others. Processor 921 executes various types of digital storage instructions to implement the functions of a transaction execution module that may implement any of the steps that may be dominated by endorsement nodes, sort nodes, and commit nodes in the write transaction flow and read transaction flow of the embodiments of fig. 2A, 2B, and 3, and a filter module that may implement any of the steps that may be dominated by first nodes or endorsement nodes in fig. 6, 7A, 7B, and 8, and/or other steps for performing the techniques described herein.

Communication interface 922 may be a wired interface (e.g., an ethernet interface) for communicating with other devices or modules. For example, communication interface 921 is used to support first node 920 to perform step S601 in fig. 6, steps S701, S704, and S706 in fig. 7A, and/or to perform other steps of the techniques described herein.

The Memory 923 may include Volatile Memory (Volatile Memory), such as Random Access Memory (RAM); the Memory may also include a Non-Volatile Memory (Non-Volatile Memory), such as a Read-Only Memory (ROM), a Flash Memory (Flash Memory), a Hard Disk Drive (HDD), or a Solid-State Drive (SSD) Memory, which may also include a combination of the above types of memories. Memory 913 may store program codes and program data. For example, the processor 921 may call the program code in the memory 923 to implement the functions of the transaction execution module and the filtering module, and specifically, may implement some or all of the implementation steps with the first node 920 as an execution subject as described in any of the method embodiments in fig. 2A, fig. 2B, fig. 3, fig. 6, fig. 7A, fig. 7B, or fig. 8.

It should be noted that fig. 9 is only one possible implementation manner of the embodiment of the present application, and in practical applications, the blockchain network system may further include more or less components, and the blockchain nodes may further include more or less components, which is not limited herein. For the content that is not shown or described in the embodiment of the present application, reference may be made to the related explanation in the embodiment described in fig. 1A to fig. 8, and details are not described here.

Embodiments of the present invention also provide a computer non-transitory storage medium having instructions stored therein, where when the computer non-transitory storage medium is run on a processor, any one of the method flows described in fig. 6, 7A, 7B, or 8 is implemented.

Embodiments of the present invention also provide a computer program product, where when the computer program product runs on a processor, any one of the method flows described in fig. 6, 7A, 7B or 8 is implemented.

The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied in hardware or in software executed by a processor. The software instructions may be comprised of corresponding software modules that may be stored in Random Access Memory (RAM), flash Memory, Read Only Memory (ROM), Erasable Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), registers, a hard disk, a removable disk, a compact disc Read Only Memory (CD-ROM), or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor such the processor can read information from, and write information to, the storage medium. Of course, the storage medium may also be integral to the processor. The processor and the storage medium may reside in an ASIC. Additionally, the ASIC may reside in a computing device. Of course, the processor and the storage medium may reside as discrete components in a computing device.

It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by a computer program, which can be stored in a computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. And the aforementioned storage medium includes: various media that can store program codes, such as ROM, RAM, magnetic or optical disks.

Claims

1. A method for filtering information, applied to a blockchain network, the blockchain network including a normal chain and a management chain, the normal chain including a first node, the management chain including a first node and a second node, the first node including a first status database corresponding to the normal chain and a second status database corresponding to the management chain, the method comprising:

the first node matches the illegal keyword with the transaction data;

2. The method of claim 1, prior to the first node obtaining transaction data, further comprising:

the first node acquires a first blacklist from the second state database, wherein the first blacklist is added by the second node and is synchronized to the second state database of the first node;

the first node acquires a first identity identifier from the transaction request, wherein the first identity identifier is an identifier of the client or an identifier of a user using the client;

the first node matches the first identity identifier with the first blacklist;

the first node obtains transaction data, including:

and when the first identity identification and the first blacklist are unsuccessfully matched, the first node acquires transaction data.

3. The method according to claim 1 or 2, characterized in that the first node determines to continue to execute a transaction according to the transaction data in case of failure of matching the illegal keyword with the transaction data.

4. The method of claim 3, wherein after the first node determines to continue executing transactions according to the transaction data, further comprising:

the first node acquires a second blacklist from the second state database, wherein the second blacklist is added by the second node and is synchronized to the second state database of the first node;

the first node acquires a second identity mark, wherein the second identity mark is the identity mark of other nodes, and the other nodes are nodes for sending information to the first node, or the first node prepares to send information;

the first node matches the second identity with the second blacklist;

and when the first identity identification is successfully matched with the first blacklist, the first node refuses to receive the information sent by other nodes, or the first node refuses to send the information to other nodes.

5. The method according to any of claims 1 to 4, wherein the illegal key is added by a system chain code in the second node and is synchronized to the second state database of the first node, and the system chain code in the second node is used for adding and deleting the illegal key in the second node.

6. The method according to any one of claims 1 to 5,

when the transaction request is a write transaction request, the transaction data is an endorsement result, wherein the endorsement result is a result obtained by the first node performing simulated transaction according to the transaction request;

and when the transaction request is a read transaction request, the transaction data is a query result, wherein the query result is a result obtained by the first node querying the first state database according to the transaction request.

7. The method according to any one of claims 1 to 6,

a first channel and a second channel are added to the first node, wherein the first channel is a channel corresponding to the common chain, and the second channel is a channel corresponding to the management chain;

the second node joins the second channel.

8. The method according to any one of claims 1 to 7,

the first node is provided with a first account book and a second account book, wherein the first account book is the account book corresponding to the common chain, and the second account book is the account book corresponding to the management chain;

the second node is provided with the second account book.

9. A method of information filtering, applied to a blockchain network, the blockchain network including a normal chain and a management chain, the normal chain including a first node, the management chain including a first node and a second node, the first node including a first status database corresponding to the normal chain and a second status database corresponding to the management chain, the second node including the second status database corresponding to the management chain, the method comprising:

10. The method of claim 9, further comprising:

the second node receives a second transaction request sent by the client, wherein the second transaction request comprises one or more of a first blacklist and a second blacklist, the first blacklist comprises identity information of a malicious client and a malicious user which forbid transactions on the blockchain network, and the second blacklist comprises identity information of a malicious node which cooperates with the malicious client or the malicious user to perform transactions with the blockchain;

the second node calls a system chain code to conduct transaction according to the second transaction request so as to add the first blacklist and the second blacklist to a second state database of the second node;

and the second node synchronizes the first blacklist and the second blacklist to a second state database of the first node.

11. The method according to any one of claims 9 or 10,

the second node joins the second channel.

12. The method according to any one of claims 9 to 11,

the second node is provided with the second account book.

13. A block link point, wherein the block link node is a first node of a block link network, wherein the block link network comprises a normal chain and a management chain, wherein the normal chain comprises the first node, wherein the management chain comprises the first node and a second node, wherein the first node comprises a first status database corresponding to the normal chain and a second status database corresponding to the management chain, and wherein the block link point comprises:

14. The node of claim 13,

the second obtaining unit is further configured to obtain a first blacklist from the second status database before obtaining the transaction data, where the first blacklist is added by the second node and is synchronized to the second status database of the first node;

the first obtaining unit is further configured to obtain a first identity identifier from the transaction request, where the first identity identifier is an identifier of the client or an identifier of a user using the client;

the matching unit is further configured to match the first identity identifier with the first blacklist.

15. The node according to claim 13 or 14, characterized in that the node further comprises a determination unit for determining to continue executing a transaction according to the transaction data in case the illegal keyword fails to match the transaction data.

16. The node of claim 15,

the second obtaining unit is further configured to obtain a second blacklist from the second status database after determining to continue to perform a transaction according to the transaction data, where the second blacklist is added by the second node and is synchronized to the second status database of the first node;

the first obtaining unit is further configured to obtain a second identity, where the second identity is an identity of another node, and the another node is a node that sends information to the first node, or the first node prepares to send information;

the matching unit is further configured to match the second identity with the second blacklist;

the matching unit is further configured to, when the first identity identifier and the first blacklist are successfully matched, reject to receive information sent by the other node by the first node, or reject to send information to the other node by the first node.

17. The node according to any of claims 13 to 16, wherein said illegal key is added by a system chain code in said second node and is synchronized to said second state database of said first node, said system chain code in said second node being used for adding and deleting said illegal key in said second node.

18. The node according to any of claims 13 to 17,

19. The node according to any of claims 13 to 18,

the second node joins the second channel.

20. The node according to any of claims 13 to 19,

the second node is provided with the second account book.

21. A blockchain link node that is a second node of a blockchain network, the blockchain including a normal chain and a management chain, the normal chain including a first node, the management chain including a first node and a second node, the first node including a first status database corresponding to the normal chain and a second status database corresponding to the management chain, the second node including the second status database corresponding to the management chain, the node comprising:

22. The node of claim 21,

the receiving unit is further configured to receive a second transaction request sent by the client, where the second transaction request includes one or more of a first blacklist and a second blacklist, the first blacklist includes identity information of a malicious client and a malicious user who forbid a transaction on the blockchain network, and the second blacklist includes identity information of a malicious node that cooperates with the malicious client or the malicious user to perform a transaction with the blockchain;

the calling unit is further configured to call a system chain code to perform a transaction according to the second transaction request, so as to add the first blacklist and the second blacklist to a second state database of the second node;

the synchronization unit is further configured to synchronize the first blacklist and the second blacklist to a second status database of the first node.

23. The node according to any of claims 21 or 22,

the second node joins the second channel.

24. The node according to any of claims 21 to 23,

the second node is provided with the second account book.

25. A computer program product, characterized in that when the computer program product is read and executed by a computing device, the method according to any of claims 1 to 8 is to be performed.

26. A computer program product, characterized in that when the computer program product is read and executed by a computing device, the method according to any of claims 9 to 12 is to be performed.

27. A computer non-transitory storage medium comprising instructions that, when executed on a computing device, cause the computing device to perform the method of any of claims 1 to 8.

28. A computer non-transitory storage medium comprising instructions that, when executed on a computing device, cause the computing device to perform the method of any of claims 9 to 12.

29. A computing node comprising a processor and a memory, the processor executing code in the memory to perform the method of any of claims 1 to 8.

30. A computing node comprising a processor and a memory, the processor executing code in the memory to perform the method of any of claims 9 to 12.