CN110033264A - Merkel tree corresponding to building block and simple payment verification method and device - Google Patents

Abstract

Disclosed are a method and device for constructing a Merkle tree corresponding to a block and simple payment verification. If a transaction written into the blockchain contains sensitive content that should not be made public, the transaction in the blockchain can be replaced with its transaction hash, and the relevant Merkle tree construction and simple payment verification can be performed based on the replaced transaction hash.

Description

Merkle tree corresponding to construction block, simple payment verification method and device

technical field

The embodiments of this specification relate to the field of information technology, and in particular, to a Merkle tree corresponding to a building block, a simple payment verification method, and an apparatus.

Background technique

A blockchain network is a decentralized, distributed data storage system participated by multiple nodes. Once data is written to the blockchain on each node, on the one hand, it means that the data is open to the entire network, and on the other hand, the data written into the blockchain is difficult to delete and tamper with. Based on this, in the field of data storage, blockchain technology has great application prospects.

In addition, in practice, centralized equipment can also use blockchain-like storage (which can be regarded as centralized blockchain storage) to store data. Blocks are generated on the same principle. Obviously, if you want to delete the data written in the quasi-blockchain, unless the centralized device deletes the entire quasi-blockchain stored. Therefore, centralized blockchain-like storage is also more suitable for data storage business. In this paper, the blockchain storage method and other centralized blockchain-like storage methods are collectively referred to as blockchain storage.

However, in practical applications, once some content (called sensitive content in this paper) is written into the blockchain, it will cause harmful consequences that are difficult to eliminate.

Assuming that the above sensitive content is deleted from the blockchain, the accuracy of the Simple Payment Verification (SPV) for other data (data located in the same block as the sensitive content) is easily affected, so that Affect the normal operation of the data storage business.

Based on the above, it is a technical problem to be solved how to keep the sensitive content written in the blockchain from being disclosed and not to affect the normal operation of the certificate deposit business for the other data.

SUMMARY OF THE INVENTION

In order to prevent the sensitive content written into the block chain from being disclosed, and not to affect the normal operation of the certificate deposit business for the other data, the embodiments of this specification provide a block-corresponding Merkle tree construction and simple payment method. The verification method and device, the technical scheme is as follows:

According to the first aspect of the embodiments of the present specification, a method for constructing a Merkle tree corresponding to a block is provided, including:

For the target block in the blockchain, obtain the label of the target block;

If the tag of the target block is a designated tag, for each transaction storage location in the target block, data is read from the transaction storage location; wherein, the designated tag represents the storage in the target block. has passed at least one sensitive transaction, and for each sensitive transaction, the sensitive transaction has been replaced with cryptic data containing the transaction hash of the sensitive transaction;

If it is determined that the data read from the transaction storage location includes a transaction, perform a hash calculation on the transaction included in the read data to obtain a transaction hash corresponding to the transaction storage location;

If it is determined that the data read from the transaction storage location includes concealed data, the transaction hash is extracted from the concealed data included in the read data as the transaction hash corresponding to the transaction storage location;

A Merkle tree corresponding to the target block is constructed based on the transaction hashes corresponding to the respective transaction storage locations in the target block.

According to a second aspect of the embodiments of the present specification, an apparatus for constructing a Merkle tree corresponding to a block is provided, including:

an obtaining module, for obtaining the label of the target block for the target block in the blockchain;

The reading module, if the label of the target block is a designated label, for each transaction storage location in the target block, read data from the transaction storage location; wherein, the designated label represents the target At least one sensitive transaction has been stored in the block, and for each sensitive transaction, the sensitive transaction has been replaced with an encrypted data containing the transaction hash of the sensitive transaction;

The first processing module, if it is determined that the data read from the transaction storage location includes a transaction, perform a hash calculation on the transaction included in the read data to obtain a transaction hash corresponding to the transaction storage location;

The second processing module, if it is determined that the data read from the transaction storage location includes concealed data, then extracts the transaction hash from the concealed data included in the read data as the transaction hash corresponding to the transaction storage location;

A construction module, which constructs a Merkle tree corresponding to the target block based on the transaction hashes corresponding to the respective transaction storage locations in the target block.

According to a third aspect of the embodiments of this specification, a simple payment verification method is provided, including:

Receive a verification request; the verification request includes a target transaction identifier;

According to the verification request, determine the block in which the transaction corresponding to the target transaction identifier is located in its own blockchain, and build a Merkle tree corresponding to the block based on the method of the first aspect;

Based on the constructed Merkle tree, simple payment verification is performed for the transaction corresponding to the target transaction identifier.

According to a fourth aspect of the embodiments of this specification, a simple payment verification device is provided, including:

a receiving module, receiving a verification request; the verification request includes a target transaction identifier;

The building module, according to the verification request, determines the block in which the transaction corresponding to the target transaction identifier is located in its own blockchain, and constructs the Merkle tree corresponding to the block based on the method of the first aspect;

The verification module, based on the constructed Merkle tree, performs simple payment verification for the transaction corresponding to the target transaction identifier.

In the technical solution provided by the embodiments of this specification, if a transaction written into the blockchain is a sensitive transaction (containing sensitive content that should not be disclosed), then the transaction in the blockchain can be replaced with a transaction including the transaction. Hidden data. On the one hand, the transaction hash of the transaction is calculated by using a one-way hash algorithm (ie, a hash algorithm) for the transaction, and the transaction cannot be deduced from the transaction hash of the transaction. Therefore, the transaction is replaced by a hidden one. Converting data is equivalent to irretrievably hiding the plaintext content of the transaction published in the blockchain. On the other hand, replacing the transaction with hidden data will not affect the stability of the Merkle tree corresponding to the transaction in the block, nor will it affect other transactions (located in the same block as the transaction). The accuracy of the simple payment verification (Simplified Payment Verification, SPV) of the transaction), thus ensuring the normal operation of the data deposit business.

It is to be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not limiting of the embodiments of the present specification.

In addition, any one of the embodiments of the present specification does not need to achieve all the above effects.

Description of drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present specification or the prior art, the following briefly introduces the accompanying drawings required in the description of the embodiments or the prior art. Obviously, the accompanying drawings in the following description are only These are some of the embodiments described in the embodiments of the present specification. For those of ordinary skill in the art, other drawings can also be obtained according to these drawings.

Fig. 1 is the structural representation of Merkle tree provided by this description;

FIG. 2 is a schematic flowchart of a method for concealing transactions written into a block chain provided by an embodiment of this specification;

3 is a schematic diagram of a process for constructing concealed data provided by an embodiment of this specification;

4 is a schematic diagram of another process for constructing masked data provided by an embodiment of the present specification;

FIG. 5 is a schematic flowchart of a method for concealing transactions written into a block chain provided by an embodiment of this specification;

6 is a schematic diagram of a content field and an identification field provided by an embodiment of this specification;

7 is a schematic flowchart of a method for concealing transactions written into a blockchain provided by an embodiment of this specification;

FIG. 8 is a schematic diagram of anonymized data including non-sensitive content provided by an embodiment of the present specification;

FIG. 9 is a schematic flowchart of a method for concealing a transaction written in a block chain provided by an embodiment of this specification;

FIG. 10 is a schematic flowchart of a method for concealing a transaction written into a block chain provided by an embodiment of this specification;

11 is a schematic flowchart of a method for constructing a Merkle tree corresponding to a block provided by an embodiment of this specification;

FIG. 12 is a schematic flowchart of a method for concealing transactions written into a block chain provided by an embodiment of this specification;

13 is a schematic flowchart of another method for constructing a Merkle tree corresponding to a block provided by an embodiment of this specification;

14 is a schematic flowchart of a simple payment verification method provided by an embodiment of this specification;

FIG. 15 is a schematic structural diagram of an apparatus for concealing transactions written in a block chain provided by an embodiment of this specification;

FIG. 16 is a schematic structural diagram of a device for hiding transactions written into a block chain provided by an embodiment of this specification;

FIG. 17 is a schematic structural diagram of a device for concealing transactions written into a block chain provided by an embodiment of this specification;

FIG. 18 is a schematic structural diagram of an apparatus for concealing transactions written into a block chain provided by an embodiment of this specification;

FIG. 19 is a schematic structural diagram of a device for hiding transactions written into a block chain provided by an embodiment of this specification;

20 is a schematic structural diagram of an apparatus for building a Merkle tree corresponding to a block provided by an embodiment of this specification;

21 is a schematic structural diagram of a simple payment verification device provided by an embodiment of this specification;

FIG. 22 is a schematic structural diagram of a computer device for configuring the apparatus according to the embodiment of the present specification.

Detailed ways

As mentioned above, in practical applications, once sensitive content is written into the blockchain, it will cause harmful consequences that are difficult to eliminate.

For example, Zhang San slandered Li Si and uploaded the text file of the defamatory speech to the blockchain network for evidence, causing the text file to be written into the blockchain, causing irreparable damage to Li Si's reputation. Another example is that Company A steals the business secrets of Company B, and submits the stolen business secrets to a centralized device that uses a blockchain-like storage method for storage. To eliminate the harm, the entire block chain of storage can only be deleted by a centralized device, and the price to pay is too great.

It should be noted that the transaction described in this specification refers to a piece of data written into the blockchain. A transaction is a data structure agreed in a blockchain protocol or a blockchain-like protocol. To store a piece of data in the blockchain, it needs to be encapsulated into a transaction.

In the blockchain-based data storage scenario, once a transaction is written into the blockchain, it is difficult to delete and tamper with it. However, in practical applications, if the transactions written to the blockchain are subsequently determined to contain sensitive content that should not be disclosed, how can the sensitive content written to the blockchain be no longer disclosed under the premise of ensuring the normal operation of the blockchain storage business? It becomes a difficult technical problem to solve.

It should be noted that if the sensitive transactions (transactions containing sensitive content) written into the blockchain are directly deleted, it is easy to cause the data storage business based on the blockchain to fail to operate normally. The reasons are as follows:

Common blockchain technologies (blockchain or centralized blockchain-like) tend to support simple payment SPV verification. SPV refers to a transaction to verify whether the transaction has been written to the blockchain. The principle of SPV is that the verification requester requests the data storage party (blockchain node or centralized device) to verify whether a transaction (called a target transaction) has been written to the blockchain, and the data storage party will first locate the target exchange In the block (called the target block), then build a Merkle tree based on each transaction in the target block, then determine the Merkle path corresponding to the target transaction, and assign the Merkle path corresponding to the target transaction. The hash value associated with the path is returned to the verification requester. Verify that the requester will receive the hash value returned by the data storage party, and verify whether the Merkle path corresponding to the target transaction is correct, that is, according to the transaction hash of the target transaction and the hash value returned by the data storage party, according to the corresponding target transaction. Merkle path, calculate the root hash of the Merkle tree, and judge whether the calculated root hash is consistent with the root hash in the block header of the target block. has been written into the blockchain.

FIG. 1 is a schematic diagram of the structure of a Merkle tree provided in this specification. As shown in Figure 1, in the Merkle tree, each leaf node corresponds to each transaction stored in the target block. The hash value on each leaf node is the transaction hash obtained by hashing the corresponding transaction. For each parent node, the hash value on the parent node is obtained by hashing the hash values on the two child nodes of the parent node.

Suppose the target transaction transaction 1. The verification requester needs to verify that transaction 1 was written to the blockchain. Therefore, the verification requester sends a request to any data storage party, and the data storage party will first determine the target block and construct a Merkle tree as shown in Figure 1. Then, the data storage party will determine the hash values associated with the Merkle path corresponding to transaction 1 as Hash2, Hash10, and Hash14, and return Hash2, Hash10, and Hash14 to the verification requester. The verification requester can calculate the root hash of the Merkle tree according to Hash1 (transaction hash of transaction 1), Hash2, Hash10, and Hash14, and according to the Merkle path corresponding to transaction 1. Then, if the verification requester finds If the calculated root hash is consistent with the root hash stored in the block header of the target block, it is determined that transaction 1 has indeed been written to the block chain.

Obviously, before triggering simple payment verification for the target transaction, the data store usually needs to build a Merkle tree based on each transaction in the target block. In this way, the hash value associated with the Merkle path corresponding to the target transaction can be returned to the verification requester, so that SPV can be performed for the target transaction. This also means that if any one of transactions 1 to 8 is tampered with or deleted, the root hash of the Merkle tree (ie Hash1-8) will change, resulting in the failure of simple payment verification.

For example, as shown in Figure 1, transaction 2 contains sensitive content. If transaction 2 is directly deleted from the blockchain, when simple payment verification is required for any of transactions 1 and 3 to 8, due to the lack of For transaction 2, a Merkle tree can only be constructed based on transactions 1 and 3 to 8. In this way, the root hash of the constructed Merkle tree is inconsistent with the root hash stored in the block header of the target block, which will lead to The simple payment verification fails, and the wrong conclusion is drawn that neither transaction 1 nor transaction 3 to 8 are on the chain.

For this reason, the present invention can realize the concealment of a transaction in the block chain on the premise of not interfering with the simple payment verification in the block chain system. The core technical means of the present invention is to replace the transaction (sensitive transaction) that needs to be concealed in the block chain with the concealed data including the transaction hash of the transaction. In this way, the plaintext content of the transaction can be stopped without disturbing the smooth operation of the simple payment verification system based on the blockchain.

In order for those skilled in the art to better understand the technical solutions in the embodiments of the present specification, the technical solutions in the embodiments of the present specification will be described in detail below with reference to the accompanying drawings in the embodiments of the present specification. Obviously, the described implementation Examples are only some of the embodiments of the present specification, but not all of the embodiments. All other embodiments obtained by those of ordinary skill in the art based on the embodiments in this specification should fall within the scope of protection.

The technical solutions provided by the embodiments of the present specification will be described in detail below with reference to the accompanying drawings.

Example 1

FIG. 2 is a schematic flowchart of a method for concealing transactions written into a block chain provided by an embodiment of this specification, including the following steps:

S200: Receive a concealed instruction.

The application scenario of the present invention is a blockchain-based data storage scenario. In this scenario, a blockchain network including multiple nodes performs blockchain-type distributed storage for data, or a centralized device performs blockchain-type centralized storage for data.

In a blockchain scenario, the execution subject of this method may be each blockchain node; in a quasi-blockchain scenario, the execution subject of this method may be a centralized device.

In this specification, a concealed instruction includes a target transaction identifier, and the target transaction identifier is generally a transaction identifier of a sensitive transaction containing sensitive content. Of course, the method shown in FIG. 1 can also conceal the non-sensitive transactions written in the block chain. Therefore, the target transaction identifier can theoretically be the transaction identifier of any transaction.

It should be noted that the transaction identifier of the transaction is used to uniquely identify the transaction. Specifically, the transaction identifier of the transaction may be a transaction hash obtained by performing a hash operation on the transaction, or may be a unique number assigned to the transaction.

In step S200, the concealment instruction may be issued by a certain user. The user may be a user who uploads sensitive content, or a subject (such as a court, a victim, etc.) who has the right to request the concealment of sensitive content.

In the blockchain scenario, each blockchain node receives a hidden instruction, which may specifically be: each blockchain node receives a hidden transaction encapsulated with a hidden instruction. Each blockchain node executes the concealed instruction in the manner of executing the concealed transaction. After the concealed transaction is executed, each blockchain node will also write the concealed transaction into the blockchain for evidence.

S202: Determine the concealed data according to the concealment instruction.

In this specification, the concealment data includes at least the transaction hash of the transaction corresponding to the target transaction identifier.

S204: Replace the transaction corresponding to the target transaction identifier in the block chain with the concealed data.

In this specification, the transaction corresponding to the target transaction identifier in the block chain is replaced with the concealed data, which may be specifically:

First determine the block (called the target block) in which the transaction corresponding to the target transaction identifier in the block chain is located, and then replace the transaction stored in the transaction storage location corresponding to the target transaction identifier in the target block with the Anonymize data.

A block chain is actually a storage structure composed of multiple blocks connected in chronological order. For each block, there are multiple transaction storage locations within that block. The so-called transaction storage location refers to the storage space or storage address in the block for storing transactions. Assuming that 100 transactions are written in the blockchain, there are also 100 transaction storage locations in the blockchain, which are used to store these 100 transactions respectively.

In this specification, the block chain can be traversed according to the target transaction identifier to search for the transaction corresponding to the target transaction identifier, that is, to locate the transaction storage location where the transaction corresponding to the target transaction identifier is located. Subsequently, the transaction corresponding to the target transaction identifier is deleted from the located transaction storage location, and the hidden data is stored in the located transaction storage location.

Further, since it is inefficient to locate transactions in the blockchain by traversing according to the target transaction identifier, in this specification, any transaction written into the blockchain can be recorded in advance outside the blockchain. The correspondence between the transaction identifier of the transaction and the transaction storage location in the blockchain.

Among them, for any transaction written into the blockchain, the transaction storage location of the transaction in the blockchain is generally the height of the block in which the transaction is located (that is, the sequence number of the block in the blockchain) and the The offset of the transaction in the block. For example, after the block containing transaction A is written to the fourth block in the blockchain, the height of the block containing transaction A is 5, and the offset of transaction A in the block is 120, the transaction storage location corresponding to transaction A may be (5, 120).

In this specification, in a blockchain-like scenario, the centralized device can also encapsulate the hidden instruction into a hidden transaction and write it into the blockchain.

In addition, in a blockchain or blockchain-like scenario, a hidden transaction written to the blockchain is encapsulated not only with a hidden instruction, but also with a data hash of the hidden data.

Through the method described in Figure 2, the concealment of sensitive content written in the blockchain can be achieved. In addition, since the method of concealing the sensitive content is to replace the sensitive transaction containing the sensitive content with the concealed data containing the transaction hash of the sensitive transaction, the normal SPV will not be affected.

In addition, the masked data may include more information in addition to the transaction hash of the transaction corresponding to the target transaction identifier.

Specifically, FIG. 3 is a schematic diagram of a process of constructing masked data provided by an embodiment of the present specification. When constructing the concealed data, each node can obtain the transaction hash of the transaction corresponding to the target transaction identifier; splicing a preset pre-mark character to the header of the transaction hash; The data obtained by splicing the transaction hashes is used to determine the concealed data.

The function of the above-mentioned pre-marked characters is that when data is read for a certain transaction storage location, if the transaction in the transaction storage location has been replaced with concealed data, then the data in the concealed data is read. When the preceding mark character is used, it is equivalent to clear: "What is stored in this transaction storage location is not the plaintext content of the transaction, but the transaction hash".

Since the transaction hash is generally a string of fixed length, remark information can be further added after the transaction hash in the hidden data. In this way, after reading the transaction hash in the concealed data, the remaining part of the concealed data is the remark information.

It should be noted that, the remark information may specifically be information added to achieve specific business needs. For example, the remark information may be "hidden", indicating that the transaction corresponding to the target transaction identifier has been hidden. When the user queries the transaction corresponding to the target transaction identifier, the remark information may prompt the user that the transaction is invisible.

Further, FIG. 4 is a schematic diagram of another process of constructing masked data provided by an embodiment of the present specification. When constructing the concealed data, the transaction hash of the transaction corresponding to the target transaction identifier can be obtained; the preset pre-mark characters are spliced into the header of the transaction hash, and the preset post-mark characters are spliced into the The tail of the transaction hash, and the remark information is spliced to the tail of the post-mark character; then, the data formed by splicing the pre-mark character, the transaction hash, the post-mark character and the remark information Determined to be the anonymized data.

The function of the above-mentioned post-mark character is that when the hidden data includes remark information (or the non-sensitive content mentioned later), it is not necessary to read the data according to the fixed-length value of the transaction hash, but the post-mark is used. Characters separate transaction hashes in masked data from remarks (non-sensitive content) for easy differentiation.

It should be noted that, the above-mentioned pre-marked characters and post-marked characters can be specified according to actual needs. For example, the preceding marker character may be "OE" and the last marker character may be "0F".

Embodiment 2

In this specification, the concealed data may not include the pre-marked characters and the post-marked characters described in the first embodiment, and other means are used to determine whether the transaction or concealed data is stored in a transaction storage location. mark.

Specifically, for each transaction storage location in the blockchain, a content field and an identification field are created in the transaction storage location in advance. The content field is used to store the transaction or the hidden data generated based on the transaction, and the identification field is used to store the first An identifier or a second identifier that identifies whether the content field is transaction or masked data.

Wherein, when the content field includes a transaction, the identification field includes a first identifier, and when the content field includes masking data generated based on the transaction, the identification field includes a second identifier.

FIG. 5 is a schematic flowchart of another method for concealing transactions written into a block chain provided by an embodiment of this specification, including the following steps:

S500: Receive a concealment instruction including a target transaction identifier, and determine a transaction storage location for storing the transaction corresponding to the target transaction identifier as a target transaction storage location.

In this specification, for each transaction storage location in the blockchain, the transaction storage location stores a content field and an identification field, and if the content field includes a transaction, the identification field includes a first identifier.

S502: Determine the concealed data according to the concealment instruction.

S504: Replace the transaction in the content field of the target transaction storage location with the anonymized data.

S506: Replace the first identifier in the identification field of the target transaction storage location with the second identifier.

For example, the first identifier may be "FF" occupying two bytes, and the second identifier may be "00" occupying two bytes.

The beneficial effects of the second embodiment are analyzed here. In the first embodiment, a method of splicing pre-marked characters before the transaction hash in the concealed data is used to mark and distinguish whether a transaction or concealed data is stored in a transaction storage location.

However, in practice, in order to avoid "hash collision" between the transaction hash and the pre-marked character in the hidden data (that is, when the node or centralized device executes the transaction hiding logic, it is impossible to distinguish the character read from the transaction storage location is The pre-mark character is still the character in the transaction hash), usually the pre-mark character is set to a special character that theoretically will not be repeated with the transaction hash. Nodes or centralized devices that read the data on the storage location bring a lot of burden.

For this reason, if the method in the second embodiment is adopted, the pre-mark character and the transaction hash are no longer used for splicing, but two independent fields are divided in the transaction storage location, namely the content field and the identification field. The content field uses The identification field stores an identifier used to identify whether the transaction or the concealed data in the content field is used to store the transaction or the concealed data replaced after the transaction is concealed. In this way, it is only necessary to write a short identifier in the identification field to realize the mark distinction of whether the transaction or the hidden data is stored in a certain transaction storage location.

FIG. 6 is a schematic diagram of a content field and an identification field provided by an embodiment of this specification. As shown in FIG. 6 , assuming that the content field of transaction storage location 1 in the target block stores transactions, and the content field of transaction storage location 2 stores concealed data, the identification field can be used for identification.

Embodiment 3

Based on the first embodiment and the second embodiment, the composition of the concealed data can also be optimized.

7 is a schematic flowchart of another method for concealing transactions written into a blockchain provided by an embodiment of this specification, including the following steps:

S700: Receive a concealed instruction.

In this specification, the concealment instruction may specifically include a target transaction identifier and concealment conditions. Wherein, the concealment condition is used to determine the sensitive content in the transaction corresponding to the target transaction identifier.

Further, the concealment condition may be sensitive location information, which is used to represent the location of the sensitive content in the transaction corresponding to the target transaction identifier. For example, the sensitive location information may be byte range information (1, 6), indicating that the content of the first byte to the sixth byte in the transaction corresponding to the target transaction identifier is sensitive content.

S702: Obtain the transaction hash of the transaction corresponding to the target transaction identifier, and extract non-sensitive content from the transaction corresponding to the target transaction identifier according to the concealment condition included in the concealment instruction.

The non-sensitive content is content other than the sensitive content in the transaction corresponding to the target transaction identifier.

S704: Determine the concealed data according to the transaction hash and the non-sensitive content.

In step S704, the masked data may only include the transaction hash and the non-sensitive content. Since transaction hashes are generally of fixed length, confusion of transaction hashes with the non-sensitive content generally does not occur.

In addition, in conjunction with Embodiment 1, the following situations exist:

1. The masked data may also include pre-mark characters.

2. The concealed data may also include pre-marked characters and post-marked characters.

Wherein, the post-mark character can be used to distinguish the transaction hash from the non-sensitive content.

3. The concealed data may further include pre-marked characters, first post-marked characters, second post-marked characters, and remark information.

Wherein, the first post-mark character can be used to distinguish the transaction hash from the non-sensitive content, and the second post-mark character can be used to distinguish the non-sensitive content from the remark information.

S706: Replace the transaction corresponding to the target transaction identifier in the block chain with the concealed data.

In this way, on the premise of concealing the sensitive content in the transaction corresponding to the target transaction identifier, the non-sensitive content in the transaction corresponding to the target transaction identifier can be retained, as shown in FIG. 8 .

Embodiment 4

Based on the third embodiment, the method for generating the concealed data can be further optimized.

FIG. 9 is a schematic flowchart of a method for concealing transactions written into a block chain provided by an embodiment of this specification, including the following steps:

S900: Receive a hidden command.

S902: Obtain the transaction hash of the transaction corresponding to the target transaction identifier, and extract non-sensitive content from the transaction corresponding to the target transaction identifier according to the concealment condition included in the concealment instruction.

S904: Adjust the model based on the preset expression mode, adjust the expression mode of the non-sensitive content, and determine the concealed data according to the transaction hash and the adjusted non-sensitive content.

S906: Replace the transaction corresponding to the target transaction identifier in the block chain with the concealed data.

The expression mode adjustment model may specifically be a preset expression mode adjustment rule. For example, the expression mode adjustment rule may be: if there is a Chinese character in the non-sensitive content, replace the Chinese character with pinyin. For another example, the expression mode adjustment rule may be: if there is an uppercase English letter in the non-sensitive content, at least one uppercase English letter is replaced with a lowercase English letter.

Specifically, the expression adjustment model may also be an intelligent model trained in advance according to a machine learning algorithm.

In a word, the function of the expression mode adjustment model is to adjust the expression mode of the non-sensitive content so that the information conveyed by the adjusted non-sensitive content is within the coverage range of the information conveyed by the non-sensitive content before the adjustment.

Preferably, the information conveyed by the adjusted non-sensitive content may be consistent with the information conveyed by the pre-adjusted non-sensitive content, that is, after the expression of the non-sensitive content is adjusted, the conveyed information is not lost.

In order to prevent this from happening, adjusting the expression of the non-sensitive content written in the concealed data can make it impossible to decipher the concealed sensitive content based on the adjusted non-sensitive content no matter how much you try.

Embodiment 5

Based on the above-mentioned first to fourth embodiments, an authority verification mechanism may be introduced.

FIG. 10 is a schematic flowchart of a method for concealing transactions written into a block chain provided by an embodiment of this specification, including the following steps:

S1000: Receive hidden commands;

S1002: Acquire the signature of the concealed instruction, and determine whether the acquired signature satisfies the specified condition, if yes, execute step S804, if not, execute step S806.

S1004: Determine, according to the concealment instruction, concealed data including the transaction hash of the transaction corresponding to the target transaction identifier, and replace the transaction corresponding to the target transaction identifier in the block chain with the concealed data.

S1006: Reject the concealed instruction.

In practical applications, it may be required that the concealed instruction must have a signature that satisfies a specified condition. Each blockchain node or centralized device will only execute the hidden instruction when it is determined that the signature of the hidden instruction meets the specified conditions.

Specifically, the specified conditions may include but are not limited to the following three situations:

1. If the transaction corresponding to the target transaction identifier is a transaction written into the blockchain, the signature of the hidden instruction is the signature of the blockchain node. At this time, the specified condition is that the number of acquired signatures is greater than the specified number.

For example, if there are 10 nodes in the blockchain network, the specified number can be set to 5, then the hidden instruction must be approved by more than 5 nodes to be valid.

2. If the transaction corresponding to the target transaction identifier is a transaction written in a block chain, the specified condition is that the acquired signature includes the signatures of at least two authorized parties.

Specifically, in practice, the authorized party may include the court, the controller of the centralized device, the business party targeted by the data storage service of the centralized device, etc.

3. Pre-allocate weights to the signatures of each authorized party. If the transaction corresponding to the target transaction identifier is a transaction written into a block chain, the specified condition is that the sum of the corresponding weights of the acquired signatures is greater than the specified weight.

For example, a court can be assigned a weight of 100, the controller of a centralized device can be assigned a weight of 50, and a business party can be assigned a weight of 40. Also, set the specified weight to 60.

Embodiment 6

Based on the methods in Embodiments 1 to 5, a method for constructing a Merkle tree corresponding to a block provided by the embodiments of this specification, as shown in FIG. 11 , includes:

S1100: For each transaction storage location in the target block, read data from the transaction storage location.

S1102: If it is determined that the data read from the transaction storage location includes a transaction, perform a hash calculation on the transaction included in the read data to obtain a transaction hash corresponding to the transaction storage location.

S1104: If it is determined that the data read from the transaction storage location includes concealed data, extract a transaction hash from the concealed data included in the read data as a transaction hash corresponding to the transaction storage location.

S1106: Construct a Merkle tree corresponding to the target block based on the transaction hashes corresponding to each transaction storage location in the target block.

Embodiment 7

Based on the sixth embodiment, after the transaction corresponding to the target transaction identifier is concealed, the label of the block where the transaction corresponding to the target transaction identifier is located may be further determined as a designated label.

In this specification, at least a part of the block in the blockchain may have a label for indicating that there is at least one hidden transaction in the block.

Specifically, a designated label can be agreed to represent that there is at least one hidden transaction in the block. After replacing the transaction corresponding to the target transaction identifier with the concealed data, it can be determined whether the label of the block (target block) where the transaction corresponding to the target transaction identifier is located has a label, and if there is no label, Assign the specified label to the target block. If there is a label, it is further judged whether it is the specified label. If it is a designated label, it means that in addition to the transaction corresponding to the target transaction identifier, there are other hidden sensitive transactions in the target block, and the label of the target block does not need to be changed; if it is not a designated label , indicating that the target block does not contain hidden data, then the tag of the target block needs to be modified to the specified tag.

As such, blocks in the blockchain have labels that are either 1 or 0. If the specified label is 1, the label is 1 when the block contains masked data, and the label is 0 when the block does not contain masked data. If the specified label is 0, the label is 0 when the block contains masked data, and the label is 1 when the block does not contain masked data.

The function of determining the label of the block where the transaction corresponding to the target transaction identifier is located as the designated label is to reduce the computational burden of the blockchain node or the centralized device. Specifically, if the block containing the hidden data is not marked, then, as shown in Figure 11, when the Merkle tree needs to be constructed for the target block, the blockchain node or centralized device is not clear Whether the target block contains hidden data, therefore, it is necessary to determine whether the transaction storage position stores the transaction or the hidden data for each transaction storage location in the target block in turn, so as to adopt different strategies Get the transaction hash corresponding to the transaction storage location. When there are many blocks that need to build a Merkle tree and few sensitive transactions are hidden, if the method shown in Figure 11 is executed for each block, it will waste a lot of computing resources.

In the seventh embodiment, before starting to construct the Merkle tree corresponding to any block, it is possible to first judge whether the block contains hidden data according to the label of the block. In this way, it can be assumed that the target block does not exist For hidden sensitive transactions, the default method is used to construct the Merkle tree corresponding to the target block (instead of the method shown in Figure 11), which saves computing resources.

FIG. 12 is a schematic flowchart of a method for concealing transactions written into a block chain provided by an embodiment of this specification, including the following steps:

S1200: Receive a concealed instruction.

S1202: Determine the concealed data according to the concealment instruction.

S1204: Replace the transaction corresponding to the target transaction identifier in the block chain with the anonymized data.

S1206: Determine the label of the block where the transaction corresponding to the target transaction identifier is located as the designated label.

13 is a schematic flowchart of another method for constructing a Merkle tree corresponding to a block provided by an embodiment of this specification, including the following steps:

S1300: For a target block in the blockchain, obtain a label of the target block.

S1302: If the tag of the target block is a designated tag, for each transaction storage location in the target block, read data from the transaction storage location.

S1304: If it is determined that the data read from the transaction storage location includes a transaction, perform a hash calculation on the transaction included in the read data to obtain a transaction hash corresponding to the transaction storage location.

S1306: If it is determined that the data read from the transaction storage location includes concealed data, extract a transaction hash from the concealed data included in the read data as a transaction hash corresponding to the transaction storage location.

S1308: Construct a Merkle tree corresponding to the target block based on the transaction hashes corresponding to each transaction storage location in the target block.

Further, for each transaction storage location in the target block, if the data read from the transaction storage location does not include the preceding mark character, then determine that the data read from the transaction storage location includes a transaction; The data read from the transaction storage location includes the preceding mark character, and it is determined that the data read from the transaction storage location includes the obscured data.

Alternatively, if the identification field in the data read from the transaction storage location includes the first identifier, it is determined that the data read from the transaction storage location includes a transaction; if the identification field in the data read from the transaction storage location Including the second identifier, it is determined that the data read from the transaction storage location includes masked data.

In Embodiment 7, the method of extracting the transaction hash from the concealed data included in the read data may specifically be: determining the data located after the preceding mark character in the concealed data included in the read data. Hash and extract the transaction; or, determine the data of a specified length after the pre-mark character in the concealed data included in the read data as the transaction hash and extract.

The specified length is a fixed length of the transaction hash.

In Embodiment 7, the data located between the pre-marked character and the post-marked character in the concealed data included in the read data may also be determined as a transaction hash and extracted.

In the seventh embodiment, if the label of the target block is not a specified label, a Merkle tree corresponding to the target block is constructed by default.

In the seventh embodiment, further, a binary number string may be created in advance. Assuming that the block chain includes N blocks, the binary number string has at least N binary digits, and the value of the ith binary digit of the binary number string is is the label of the i-th block in the blockchain, i∈[1, N].

In this way, the method of obtaining the label of the target block may be: determining the serial number M of the target block; reading the value of the Mth binary digit from the binary number string as the label of the target block.

14 is a schematic flowchart of a simple payment verification method provided by an embodiment of this specification, including the following steps:

S1400: Receive a verification request; the verification request includes a target transaction identifier;

S1402: According to the verification request, determine the block in which the transaction corresponding to the target transaction identifier is located in its own blockchain, and construct the Merk corresponding to the block based on the method shown in FIG. 11 or FIG. 13 Er tree;

S1404: Based on the constructed Merkle tree, perform simple payment verification for the transaction corresponding to the target transaction identifier.

FIG. 15 is a schematic structural diagram of a device for hiding transactions written into a blockchain provided by an embodiment of this specification. For each transaction storage location in the blockchain, the transaction storage location stores a content field and an identification field. If the content field contains a transaction, the identification field contains a first identifier, and the apparatus includes:

The receiving module 1501 receives a hidden instruction including a target transaction identifier, and determines a transaction storage location for storing the transaction corresponding to the target transaction identifier, as the target transaction storage location;

The determining module 1502 determines concealed data according to the concealment instruction; the concealment data includes the transaction hash of the transaction corresponding to the target transaction identifier;

The processing module 1503 replaces the transaction in the content field of the target transaction storage location with the anonymized data, and replaces the first identifier in the identification field of the target transaction storage location with the second identifier.

The concealment instruction further includes concealment conditions for determining the sensitive content in the transaction corresponding to the target transaction identifier;

The determining module 1502 obtains the transaction hash of the transaction corresponding to the target transaction identifier, and extracts non-sensitive content from the transaction corresponding to the target transaction identifier according to the concealment condition included in the concealment instruction; according to the transaction Hash with the non-sensitive content to determine the anonymized data.

The concealment condition is sensitive location information, which is used to represent the location of the sensitive content in the transaction corresponding to the target transaction identifier.

The determining module 1502 splices a preset post-mark character to the tail of the transaction hash; splices the non-sensitive content to the tail of the post-mark character; splices the transaction hash, the post-mark The data formed by splicing characters and the non-sensitive content is determined to be concealed data.

The determining module 1502 adjusts the model based on the preset expression mode, and adjusts the expression mode of the non-sensitive content; and determines the concealed data according to the transaction hash and the adjusted non-sensitive content.

The determining module 1502 acquires the signature of the concealment instruction, and judges whether the acquired signature satisfies the specified condition; if so, determines concealed data according to the concealment instruction; if not, rejects the concealment instruction.

If the transaction corresponding to the target transaction identifier is a transaction written into the blockchain, the signature of the hidden instruction is the signature of the blockchain node, and the specified condition is that the number of acquired signatures is greater than the specified number.

If the transaction corresponding to the target transaction identifier is a transaction written in a block chain, the specified condition is that the acquired signature includes the signatures of at least two authorized parties.

The signature of each authorized party is assigned weight;

If the transaction corresponding to the target transaction identifier is a transaction written into a block chain, the specified condition is that the sum of the corresponding weights of the acquired signatures is greater than the specified weight.

The device also includes:

The transaction writing module 1504 writes the hidden transaction encapsulated with the hidden instruction into the block chain.

The transaction writing module 1504 writes the concealed transaction encapsulated with the data hash of the concealed instruction and the concealed data into the block chain.

The device also includes:

The label determination module 1505 determines the label of the block where the transaction corresponding to the target transaction identifier is located as the designated label.

For any block in the blockchain, if the block does not contain concealed data, the label of the block is not the specified label.

Assuming that the block chain includes N blocks, the value of the ith binary bit of the pre-created binary string is the label of the ith block in the block chain, i∈[1,N].

FIG. 16 is a schematic structural diagram of an apparatus for concealing transactions written into a block chain provided by an embodiment of this specification, including:

The receiving module 1601 receives a concealed instruction; the concealed instruction includes a target transaction identifier and a concealment condition, and the concealment condition is used to determine the sensitive content in the transaction corresponding to the target transaction identifier;

The acquisition and extraction module 1602 acquires the transaction hash of the transaction corresponding to the target transaction identifier, and extracts non-sensitive content from the transaction corresponding to the target transaction identifier according to the concealment condition included in the concealment instruction;

Determining module 1603, determining concealed data according to the transaction hash and the non-sensitive content;

The processing module 1604 replaces the transaction corresponding to the target transaction identifier in the block chain with the anonymized data.

For each transaction storage location in the blockchain, the transaction storage location stores a content field and an identification field, and the content field includes a transaction or anonymized data generated based on the transaction;

Wherein, when the content field includes a transaction, the identification field includes a first identifier, and when the content field includes masking data generated based on the transaction, the identification field includes a second identifier.

The concealment condition is sensitive location information, which is used to represent the location of the sensitive content in the transaction corresponding to the target transaction identifier.

The determining module 1603 splices a preset post-mark character to the tail of the transaction hash; splices the non-sensitive content to the tail of the post-mark character; splices the transaction hash, the post-mark The data formed by splicing characters and the non-sensitive content is determined to be concealed data.

The determining module 1603 adjusts the model based on the preset expression method, and adjusts the expression method of the non-sensitive content; and determines the concealed data according to the transaction hash and the adjusted non-sensitive content.

The determining module 1603 acquires the signature of the concealment instruction, and judges whether the acquired signature satisfies the specified condition; if so, determines concealment data according to the concealment instruction; if not, rejects the concealment instruction.

If the transaction corresponding to the target transaction identifier is a transaction written into the blockchain, the signature of the hidden instruction is the signature of the blockchain node, and the specified condition is that the number of acquired signatures is greater than the specified number.

If the transaction corresponding to the target transaction identifier is a transaction written in a block chain, the specified condition is that the acquired signature includes the signatures of at least two authorized parties.

The signature of each authorized party is assigned weight;

If the transaction corresponding to the target transaction identifier is a transaction written into a block chain, the specified condition is that the sum of the corresponding weights of the acquired signatures is greater than the specified weight.

The device also includes:

The label determination module 1605 determines the label of the block where the transaction corresponding to the target transaction identifier is located as the designated label.

For any block in the blockchain, if the block does not contain concealed data, the label of the block is not the specified label.

Assuming that the block chain includes N blocks, the value of the ith binary bit of the pre-created binary string is the label of the ith block in the block chain, i∈[1,N].

The device also includes:

The transaction writing module 1606 writes the hidden transaction encapsulated with the hidden instruction into the block chain.

The transaction writing module 1606 writes the concealed transaction encapsulated with the data hash of the concealed instruction and the concealed data into the block chain.

FIG. 17 is a schematic structural diagram of an apparatus for concealing transactions written into a block chain provided by an embodiment of this specification, including:

The receiving module 1701 receives a concealed instruction; the concealed instruction includes a target transaction identifier and a concealment condition, and the concealment condition is used to determine the sensitive content in the transaction corresponding to the target transaction identifier;

Obtaining and extracting module 1702, obtaining the transaction hash of the transaction corresponding to the target transaction identifier, and extracting non-sensitive content from the transaction corresponding to the target transaction identifier according to the concealment condition included in the concealment instruction;

The adjustment determination module 1703 adjusts the model based on the preset expression mode, adjusts the expression mode of the non-sensitive content, and determines the concealed data according to the transaction hash and the adjusted non-sensitive content;

The processing module 1704 replaces the transaction corresponding to the target transaction identifier in the block chain with the anonymized data.

For each transaction storage location in the blockchain, the transaction storage location stores a content field and an identification field, and the content field includes a transaction or anonymized data generated based on the transaction;

Wherein, when the content field includes a transaction, the identification field includes a first identifier, and when the content field includes masking data generated based on the transaction, the identification field includes a second identifier.

The concealment condition is sensitive location information, which is used to represent the location of the sensitive content in the transaction corresponding to the target transaction identifier.

The adjustment determination module 1703 splices the preset post-mark character to the tail of the transaction hash; splices the adjusted insensitive content to the tail of the post-mark character; splices the transaction hash, The data obtained by splicing the post-marked characters and the adjusted insensitive content is determined to be concealed data.

The adjustment determination module 1703 obtains the signature of the concealed instruction, and judges whether the acquired signature satisfies the specified condition; if so, determines concealed data according to the concealed instruction; if not, rejects the concealed instruction.

If the transaction corresponding to the target transaction identifier is a transaction written into the blockchain, the signature of the hidden instruction is the signature of the blockchain node, and the specified condition is that the number of acquired signatures is greater than the specified number.

If the transaction corresponding to the target transaction identifier is a transaction written in a block chain, the specified condition is that the acquired signature includes the signatures of at least two authorized parties.

The signature of each authorized party is assigned weight;

If the transaction corresponding to the target transaction identifier is a transaction written into a block chain, the specified condition is that the sum of the corresponding weights of the acquired signatures is greater than the specified weight.

The device also includes:

The label determination module 1705 determines the label of the block in which the transaction corresponding to the target transaction identifier is located as the designated label.

For any block in the blockchain, if the block does not contain concealed data, the label of the block is not the specified label.

Assuming that the block chain includes N blocks, the value of the ith binary bit of the pre-created binary string is the label of the ith block in the block chain, i∈[1,N].

The device also includes:

The transaction writing module 1706 writes the hidden transaction encapsulated with the hidden instruction into the block chain.

The transaction writing module 1706 writes the concealed transaction encapsulated with the data hash of the concealed instruction and the concealed data into the block chain.

FIG. 18 is a schematic structural diagram of an apparatus for concealing transactions written into a block chain provided by an embodiment of this specification, including:

The receiving module 1801 receives a concealed instruction; the concealed instruction includes a target transaction identifier;

Obtaining judgment module 1802, obtaining the signature of the concealed instruction, and judging whether the obtained signature satisfies the specified condition;

The first processing module 1803, if so, according to the concealment instruction, determine the concealment data including the transaction hash of the transaction corresponding to the target transaction identifier, and replace the transaction corresponding to the target transaction identifier in the blockchain into said anonymized data;

The second processing module 1804, if not, rejects the concealed instruction.

If the transaction corresponding to the target transaction identifier is a transaction written into the blockchain, the signature of the hidden instruction is the signature of the blockchain node, and the specified condition is that the number of acquired signatures is greater than the specified number.

If the transaction corresponding to the target transaction identifier is a transaction written in a block chain, the specified condition is that the acquired signature includes the signatures of at least two authorized parties.

The signature of each authorized party is assigned weight;

If the transaction corresponding to the target transaction identifier is a transaction written into a block chain, the specified condition is that the sum of the corresponding weights of the acquired signatures is greater than the specified weight.

The first processing module 1803 obtains the transaction hash of the transaction corresponding to the target transaction identifier; splices a preset pre-mark character to the header of the transaction hash; It is hoped that the spliced data will determine the hidden data.

The first processing module 1803 splices the preset post-mark character to the tail of the transaction hash, and splices the remark information to the tail of the post-mark character; splices the pre-mark character, the transaction The data obtained by splicing the hash, the post-mark character and the remark information is determined to be concealed data.

For each transaction storage location in the blockchain, the transaction storage location stores a content field and an identification field, and the content field includes a transaction or anonymized data generated based on the transaction;

Wherein, when the content field includes a transaction, the identification field includes a first identifier, and when the content field includes masking data generated based on the transaction, the identification field includes a second identifier.

The concealment instruction further includes concealment conditions for determining the sensitive content in the transaction corresponding to the target transaction identifier;

The first processing module 1803 obtains the transaction hash of the transaction corresponding to the target transaction identifier, and extracts non-sensitive content from the transaction corresponding to the target transaction identifier according to the concealment condition included in the concealment instruction; The transaction hash and the non-sensitive content are used to determine the concealed data.

The concealment condition is sensitive location information, which is used to represent the location of the sensitive content in the transaction corresponding to the target transaction identifier.

The first processing module 1803 splices the preset post-mark character to the tail of the transaction hash; splices the non-sensitive content to the tail of the post-mark character; splices the transaction hash, the The data formed by splicing the back-marked characters and the non-sensitive content is determined to be concealed data.

The first processing module 1803 adjusts the model based on the preset expression method, and adjusts the expression method of the non-sensitive content; and determines the concealed data according to the transaction hash and the adjusted non-sensitive content.

The device also includes:

The label determination module 1805 determines the label of the block where the transaction corresponding to the target transaction identifier is located as the designated label.

For any block in the blockchain, if the block does not contain concealed data, the label of the block is not the specified label.

Assuming that the block chain includes N blocks, the value of the ith binary bit of the pre-created binary string is the label of the ith block in the block chain, i∈[1,N].

The device also includes:

The transaction writing module 1806 writes the hidden transaction encapsulated with the hidden instruction into the block chain.

The transaction writing module 1806 writes the concealed transaction encapsulated with the data hash of the concealed instruction and the concealed data into the block chain.

FIG. 19 is a schematic structural diagram of an apparatus for concealing transactions written into a block chain provided by an embodiment of this specification, including:

The receiving module 1901 receives a concealed instruction; the concealed instruction includes a target transaction identifier;

The determining module 1902 determines concealed data according to the concealment instruction; the concealment data includes the transaction hash of the transaction corresponding to the target transaction identifier;

The processing module 1903 replaces the transaction corresponding to the target transaction identifier in the block chain with the concealed data, and determines the tag of the block in which the transaction corresponding to the target transaction identifier is located as the designated tag.

The determining module 1902 obtains the transaction hash of the transaction corresponding to the target transaction identifier; splices a preset pre-mark character to the header of the transaction hash; splices the pre-mark character and the transaction hash according to the pre-mark character The generated data is determined to be anonymized data.

The determining module 1902 splices the preset post-mark character to the tail of the transaction hash, and splices the remark information to the tail of the post-mark character; splices the pre-mark character, the transaction hash , the data spliced into the post-marked character and the remark information is determined to be concealed data.

For each transaction storage location in the blockchain, the transaction storage location stores a content field and an identification field, and the content field includes a transaction or anonymized data generated based on the transaction;

Wherein, when the content field includes a transaction, the identification field includes a first identifier, and when the content field includes masking data generated based on the transaction, the identification field includes a second identifier.

The concealment instruction further includes concealment conditions for determining the sensitive content in the transaction corresponding to the target transaction identifier;

The determining module 1902 obtains the transaction hash of the transaction corresponding to the target transaction identifier, and extracts non-sensitive content from the transaction corresponding to the target transaction identifier according to the concealment condition included in the concealment instruction; according to the transaction Hash with the non-sensitive content to determine the anonymized data.

The concealment condition is sensitive location information, which is used to represent the location of the sensitive content in the transaction corresponding to the target transaction identifier.

The determining module 1902 splices a preset post-mark character to the tail of the transaction hash; splices the non-sensitive content to the tail of the post-mark character; splices the transaction hash, the post-mark The data formed by splicing characters and the non-sensitive content is determined to be concealed data.

The determining module 1902 adjusts the model based on the preset expression mode, and adjusts the expression mode of the non-sensitive content; and determines the concealed data according to the transaction hash and the adjusted non-sensitive content.

The determining module 1902 acquires the signature of the concealment instruction, and judges whether the acquired signature satisfies the specified condition; if so, determines concealment data according to the concealment instruction; if not, rejects the concealment instruction.

If the transaction corresponding to the target transaction identifier is a transaction written into the block chain, the signature of the hidden instruction is the signature of the block chain node, and the specified condition is that the number of acquired signatures is greater than the specified number.

If the transaction corresponding to the target transaction identifier is a transaction written in a block chain, the specified condition is that the acquired signature includes the signatures of at least two authorized parties.

The signature of each authorized party is assigned weight;

If the transaction corresponding to the target transaction identifier is a transaction written into a block chain, the specified condition is that the sum of the corresponding weights of the acquired signatures is greater than the specified weight.

For any block in the blockchain, if the block does not contain concealed data, the label of the block is not the specified label.

Assuming that the block chain includes N blocks, the value of the ith binary bit of the pre-created binary string is the label of the ith block in the block chain, i∈[1,N].

The device also includes:

The transaction writing module 1904 writes the hidden transaction encapsulated with the hidden instruction into the block chain.

The transaction writing module 1904 writes the concealed transaction encapsulated with the data hash of the concealed instruction and the concealed data into the block chain.

20 is a schematic structural diagram of an apparatus for building a Merkle tree corresponding to a block provided by an embodiment of this specification, including:

Obtaining module 2001, for the target block in the blockchain, obtains the label of the target block;

The reading module 2002, if the label of the target block is a designated label, then for each transaction storage location in the target block, read data from the transaction storage location; wherein, the designated label represents the At least one sensitive transaction has been stored in the target block, and for each sensitive transaction, the sensitive transaction has been replaced with the hidden data containing the transaction hash of the sensitive transaction;

The first processing module 2003, if it is determined that the data read from the transaction storage location includes a transaction, perform a hash calculation on the transaction included in the read data to obtain a transaction hash corresponding to the transaction storage location;

The second processing module 2004, if it is determined that the data read from the transaction storage location includes concealed data, extracts a transaction hash from the concealed data included in the read data, as the transaction hash corresponding to the transaction storage location ;

The construction module 2005 constructs a Merkle tree corresponding to the target block based on the transaction hashes corresponding to each transaction storage location in the target block.

The operation of replacing the sensitive transaction stored in the target block with the hidden data is as follows:

determining the transaction hash of said sensitive transaction;

splicing a preset pre-mark character to the header of the transaction hash;

Determine the concealed data according to the data spliced into the pre-marked character and the transaction hash;

The sensitive transactions are replaced with certain anonymized data.

According to the data spliced into the pre-marked character and the transaction hash, determine the concealed data, which specifically includes:

splicing the preset post-mark character to the tail of the transaction hash, and splicing the remark information to the tail of the post-mark character;

The data obtained by splicing the pre-marked characters, the transaction hash, the post-marked characters, and the remark information is determined as concealed data.

The first processing module 2003 determines that the data read from the transaction storage location includes a transaction if the data read from the transaction storage location does not include the preceding mark character;

The second processing module 2004, if the data read from the transaction storage location includes the preceding mark character, determines that the data read from the transaction storage location includes the concealed data.

The second processing module 2004 determines and extracts the data located after the pre-marked character in the concealed data included in the read data as transaction hash; or, extracts the concealed data included in the read data The data of the specified length located after the pre-mark character is determined as the transaction hash and extracted.

The second processing module 2004 determines and extracts the data located between the pre-marked character and the post-marked character in the concealed data included in the read data as a transaction hash.

For each transaction storage location in the blockchain, the transaction storage location stores a content field and an identification field, and the content field includes a transaction or anonymized data generated based on the transaction;

Wherein, when the content field includes a transaction, the identification field includes a first identifier, and when the content field includes masked data generated based on the transaction, the identification field includes a second identifier;

The first processing module 2003 determines that the data read from the transaction storage location includes a transaction if the identification field in the data read from the transaction storage location includes the first identifier;

The second processing module 2004, if the identification field in the data read from the transaction storage location includes the second identifier, determines that the data read from the transaction storage location includes the concealed data.

The construction module 2005, if the tag of the target block is not a specified tag, constructs the Merkle tree corresponding to the target block in a default manner.

Suppose the block chain includes N blocks, and the value of the ith binary bit of the pre-created binary string is the label of the ith block in the block chain, i∈[1,N];

The obtaining module 2001 determines the serial number M of the target block; reads the value of the Mth binary digit from the binary number string as a label of the target block.

21 is a schematic structural diagram of a simple payment verification device provided by an embodiment of this specification, including:

The receiving module 2101 receives a verification request; the verification request includes a target transaction identifier;

The construction module 2102, according to the verification request, determines the block in which the transaction corresponding to the target transaction identifier is located in its own blockchain, and constructs the block corresponding to the block based on the method shown in FIG. 11 or FIG. 13 . Merkle tree;

The verification module 2103, based on the constructed Merkle tree, performs simple payment verification for the transaction corresponding to the target transaction identifier.

A blockchain-like centralized storage solution is as follows:

S1, receive the data records to be stored, and determine the hash value of each data record.

The data records to be stored here can be various consumption records of individual client users, or can be business results, intermediate states, and operation records generated by the application server when executing business logic based on user instructions. Specific business scenarios can include consumption records, audit logs, supply chains, government regulatory records, medical records, and more.

S2, when the preset block forming condition is reached, determine each data record to be written in the block, and generate the Nth block including the hash value of the block and the data record.

The preset block-forming conditions include: the number of data records to be stored reaches the number threshold, for example, every time a thousand data records are received, a new block is generated, and one thousand data records are written into the block; or, When the time interval from the last block formation time reaches the time threshold, for example, every 5 minutes, a new block is generated, and the data records received within these 5 minutes are written into the block.

Here, N refers to the serial number of the block. In other words, in the embodiment of this specification, the blocks are in the form of a block chain and are arranged in sequence based on the time of block formation, and have strong timing characteristics. Among them, the block height of the block increases monotonically based on the sequence of block formation time. The block height can be a serial number, and at this time, the block height of the Nth block is N; the block height can also be generated in other ways.

When N=1, that is, the block at this time is the initial block. The hash value and block height of the initial block are given based on a preset method. For example, the initial block does not contain data records, the hash value is any given hash value, and the block height blknum=0; for another example, the generation trigger condition of the initial block is consistent with the trigger conditions of other blocks, But the hash of the initial block is determined by hashing everything in the initial block.

When N>1, since the content and hash value of the previous block have been determined, at this time, the current block (th N blocks) hash value, for example, a feasible way is to determine the hash value of each data record to be written in the Nth block, and generate a Merk according to the arrangement order in the block. Merkle tree, the root hash value of the Merkle tree and the hash value of the previous block are spliced together, and the hash algorithm is used again to generate the hash value of the current block. For another example, the hash value of the overall data record can be obtained by splicing and hashing according to the order of the data records in the block, the hash value of the previous block and the hash value of the overall data record can be spliced, and the splicing obtained The string is hashed to generate the hash value of the block.

Through the aforementioned block generation method, each block is determined by a hash value, and the hash value of a block is determined by the content and sequence of the data records in the block and the hash value of the previous block. Users can initiate verification based on the hash value of the block at any time. Any modification of the content in the block (including the modification of the data record content or sequence in the block) will cause the hash value of the block calculated during verification and The hash value of the block is inconsistent, which leads to the failure of verification, thus realizing the immutability under centralization.

By generating a block including a certain number of data records, and recording the hash value when the block is generated, the centralized storage of data records in the form of blockchain is realized. In this data storage method, the hash value of each block depends on the hash value of the previous block and the content of the data records contained in it. Users can query their own data records at any time based on the above storage form, and can perform hash value verification on the specified block or specified data record according to the hash value, which ensures the integrity of user data and improves user experience.

The embodiments of the present specification also provide a computer device, which at least includes a memory, a processor, and a computer program stored in the memory and running on the processor, wherein, when the processor executes the program, FIGS. 2 , 5 and 7 are implemented. , the functions of the methods shown in 9 to 14.

FIG. 22 is a schematic diagram of a more specific hardware structure of a computing device provided by an embodiment of this specification. The device may include: a processor 2210 , a memory 2220 , an input/output interface 2230 , a communication interface 2240 and a bus 2250 . The processor 2210 , the memory 2220 , the input/output interface 2230 and the communication interface 2240 realize the communication connection among each other within the device through the bus 2250 .

The processor 2210 may be implemented by a general-purpose CPU (Central Processing Unit, central processing unit), a microprocessor, an application specific integrated circuit (Application Specific Integrated Circuit, ASIC), or one or more integrated circuits, and is used to execute related program to implement the technical solutions provided by the embodiments of this specification.

The memory 2220 may be implemented in the form of a ROM (Read Only Memory, read only memory), a RAM (Random Access Memory, random access memory), a static storage device, a dynamic storage device, and the like. The memory 2220 may store an operating system and other application programs. When implementing the technical solutions provided by the embodiments of this specification through software or firmware, relevant program codes are stored in the memory 2220 and invoked by the processor 2210 for execution.

The input/output interface 2230 is used for connecting input/output modules to realize information input and output. The input/output/module can be configured in the device as a component (not shown in the figure), or can be externally connected to the device to provide corresponding functions. The input device may include a keyboard, a mouse, a touch screen, a microphone, various sensors, etc., and the output device may include a display, a speaker, a vibrator, an indicator light, and the like.

The communication interface 2240 is used to connect a communication module (not shown in the figure), so as to realize the communication interaction between the device and other devices. The communication module may implement communication through wired means (eg, USB, network cable, etc.), or may implement communication through wireless means (eg, mobile network, WIFI, Bluetooth, etc.).

The bus 2250 includes a path to transfer information between the various components of the device (eg, the processor 2210, the memory 2220, the input/output interface 2230, and the communication interface 2240).

It should be noted that, although the above-mentioned device only shows the processor 2210, the memory 2220, the input/output interface 2230, the communication interface 2240 and the bus 2250, in the specific implementation process, the device may also include necessary components for normal operation. other components. In addition, those skilled in the art can understand that, the above-mentioned device may only include components necessary to implement the solutions of the embodiments of the present specification, rather than all the components shown in the figures.

Embodiments of the present specification further provide a computer-readable storage medium on which a computer program is stored, and when the program is executed by a processor, implements the functions of the methods shown in FIGS. 2 , 5 , 7 , and 9 to 14 .

Computer-readable media includes both persistent and non-permanent, removable and non-removable media, and storage of information may be implemented by any method or technology. Information may be computer readable instructions, data structures, modules of programs, or other data. Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read only memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), Flash Memory or other memory technology, Compact Disc Read Only Memory (CD-ROM), Digital Versatile Disc (DVD) or other optical storage, Magnetic tape cassettes, magnetic tape magnetic disk storage or other magnetic storage devices or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, computer-readable media does not include transitory computer-readable media, such as modulated data signals and carrier waves.

From the description of the above embodiments, those skilled in the art can clearly understand that the embodiments of the present specification can be implemented by means of software plus a necessary general hardware platform. Based on such understanding, the technical solutions of the embodiments of this specification or the parts that make contributions to the prior art may be embodied in the form of software products, and the computer software products may be stored in storage media, such as ROM/RAM, A magnetic disk, an optical disk, etc., includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods described in various embodiments or some parts of the embodiments in this specification.

The systems, methods, modules or units described in the above embodiments may be specifically implemented by computer chips or entities, or by products with certain functions. A typical implementing device is a computer, which may be in the form of a personal computer, laptop computer, cellular phone, camera phone, smart phone, personal digital assistant, media player, navigation device, email sending and receiving device, game control desktop, tablet, wearable device, or a combination of any of these devices.

Each embodiment in this specification is described in a progressive manner, and the same and similar parts between the various embodiments may be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the method and device embodiments, since they are basically similar to the method embodiments, the description is relatively simple, and reference may be made to some descriptions of the method embodiments for related parts. The method embodiments described above are only illustrative, and the modules described as separate components may or may not be physically separated. When implementing the solutions of the embodiments of this specification, the functions of each module may be integrated into the same module. or multiple software and/or hardware implementations. Some or all of the modules may also be selected according to actual needs to achieve the purpose of the solution in this embodiment. Those of ordinary skill in the art can understand and implement it without creative effort.

The above are only specific implementations of the embodiments of the present specification. It should be pointed out that for those skilled in the art, without departing from the principles of the embodiments of the present specification, several improvements and modifications can be made. These Improvements and modifications should also be regarded as the protection scope of the embodiments of the present specification.

Claims (21)

1. A method for constructing a Merkle tree corresponding to a block, comprising: For the target block in the blockchain, obtain the label of the target block; If the tag of the target block is a designated tag, for each transaction storage location in the target block, data is read from the transaction storage location; wherein, the designated tag represents the storage in the target block. has passed at least one sensitive transaction, and for each sensitive transaction, the sensitive transaction has been replaced with cryptic data containing the transaction hash of the sensitive transaction; If it is determined that the data read from the transaction storage location includes a transaction, perform a hash calculation on the transaction included in the read data to obtain a transaction hash corresponding to the transaction storage location; If it is determined that the data read from the transaction storage location includes concealed data, the transaction hash is extracted from the concealed data included in the read data as the transaction hash corresponding to the transaction storage location; A Merkle tree corresponding to the target block is constructed based on the transaction hashes corresponding to the respective transaction storage locations in the target block. 2. method as claimed in claim 1, the sensitive transaction that is stored in described target block is replaced with the operation of concealing data as follows: determining the transaction hash of said sensitive transaction; splicing a preset pre-mark character to the header of the transaction hash; Determine the concealed data according to the data spliced into the pre-marked character and the transaction hash; The sensitive transactions are replaced with certain anonymized data. 3. method as claimed in claim 2, according to the data that described front mark character and described transaction hash are spliced into, determine concealment data, specifically comprise: splicing the preset post-mark character to the tail of the transaction hash, and splicing the remark information to the tail of the post-mark character; The data obtained by splicing the pre-marked characters, the transaction hash, the post-marked characters, and the remark information is determined as concealed data. 4. The method according to claim 2 or 3, determining that the data read from the transaction storage location comprises a transaction, specifically comprising: If the data read from the transaction storage location does not include the preceding mark character, it is determined that the data read from the transaction storage location includes a transaction; It is determined that the data read from the transaction storage location includes masked data, including: If the data read from the transaction storage location includes the preceding mark character, it is determined that the data read from the transaction storage location includes masked data. 5. The method according to claim 2, extracting a transaction hash from the concealed data included in the read data, specifically comprising: Determining and extracting the data located after the preceding mark character in the concealed data included in the read data as a transaction hash; Or, the data of the specified length located after the preceding mark character in the concealed data included in the read data is determined as the transaction hash and extracted. 6. The method according to claim 3, extracting a transaction hash from the concealed data included in the read data, specifically comprising: Determining and extracting the data between the pre-marked character and the post-marked character in the concealed data included in the read data as a transaction hash. 7. The method of claim 1 , for each transaction storage location in the blockchain, the transaction storage location stores a content field and an identification field, the content field comprising a transaction or masked data generated based on the transaction ; Wherein, when the content field includes a transaction, the identification field includes a first identifier, and when the content field includes masked data generated based on the transaction, the identification field includes a second identifier; Determine that the data read from the transaction storage location includes transactions, including: If the identification field in the data read from the transaction storage location includes the first identifier, it is determined that the data read from the transaction storage location includes a transaction; It is determined that the data read from the transaction storage location includes masked data, including: If the identification field in the data read from the transaction storage location includes the second identifier, it is determined that the data read from the transaction storage location includes masked data. 8. The method of claim 1, further comprising: If the label of the target block is not a specified label, the Merkle tree corresponding to the target block is constructed by default. 9. The method according to claim 8, suppose that the block chain includes N blocks, the value of the ith binary bit of the pre-created binary string is the label of the ith block in the block chain, i ∈ [ 1, N]; Obtain the label of the target block, specifically including: Determine the sequence number M of the target block; The value of the M-th binary digit is read from the binary number string as the label of the target block. 10. A simple payment verification method, comprising: Receive a verification request; the verification request includes a target transaction identifier; According to the verification request, determine the block in which the transaction corresponding to the target transaction identifier is located in its own blockchain, and construct the block corresponding to the block based on the method according to any one of claims 1 to 9. Kerr tree; Based on the constructed Merkle tree, simple payment verification is performed for the transaction corresponding to the target transaction identifier. 11. An apparatus for constructing a Merkle tree corresponding to a block, comprising: an obtaining module, for obtaining the label of the target block for the target block in the blockchain; The reading module, if the label of the target block is a designated label, for each transaction storage location in the target block, read data from the transaction storage location; wherein, the designated label represents the target At least one sensitive transaction has been stored in the block, and for each sensitive transaction, the sensitive transaction has been replaced with an encrypted data containing the transaction hash of the sensitive transaction; The first processing module, if it is determined that the data read from the transaction storage location includes a transaction, perform a hash calculation on the transaction included in the read data to obtain a transaction hash corresponding to the transaction storage location; The second processing module, if it is determined that the data read from the transaction storage location includes concealed data, then extracts the transaction hash from the concealed data included in the read data as the transaction hash corresponding to the transaction storage location; A construction module, which constructs a Merkle tree corresponding to the target block based on the transaction hashes corresponding to the respective transaction storage locations in the target block. 12. The device of claim 11 , the operation of replacing the sensitive transaction stored in the target block with the concealed data is as follows: determining the transaction hash of said sensitive transaction; splicing a preset pre-mark character to the header of the transaction hash; Determine the concealed data according to the data spliced into the pre-marked character and the transaction hash; The sensitive transactions are replaced with certain anonymized data. 13. The device according to claim 12, according to the data formed by splicing the pre-marked characters and the transaction hash, to determine the concealed data, specifically comprising: splicing the preset post-mark character to the tail of the transaction hash, and splicing the remark information to the tail of the post-mark character; The data obtained by splicing the pre-marked characters, the transaction hash, the post-marked characters, and the remark information is determined as concealed data. 14. The apparatus of claim 12 or 13, wherein the first processing module, if the data read from the transaction storage location does not include the preceding mark character, determines that the data read from the transaction storage location includes trade; The second processing module, if the data read from the transaction storage location includes the preceding mark character, determines that the data read from the transaction storage location includes concealed data. 15. The apparatus according to claim 12, wherein the second processing module determines and extracts the data located after the pre-marked character in the concealed data included in the read data as a transaction hash; or, takes The data of a specified length after the pre-mark character in the concealed data included in the read data is determined as a transaction hash and extracted. 16. The apparatus according to claim 13, wherein the second processing module determines the data between the pre-marked character and the back-marked character in the concealed data included in the read data as a transaction. hope and extract. 17. The apparatus of claim 11 , for each transaction storage location in the blockchain, the transaction storage location stores a content field and an identification field, the content field comprising a transaction or masked data generated based on the transaction ; Wherein, when the content field includes a transaction, the identification field includes a first identifier, and when the content field includes masked data generated based on the transaction, the identification field includes a second identifier; The first processing module, if the identification field in the data read from the transaction storage location includes the first identifier, determine that the data read from the transaction storage location includes a transaction; The second processing module, if the identification field in the data read from the transaction storage location includes the second identifier, determines that the data read from the transaction storage location includes the concealed data. 18 . The apparatus of claim 11 , wherein, if the label of the target block is not a specified label, the construction module adopts a default method to build the Merkle tree corresponding to the target block. 19 . 19. The apparatus of claim 18, wherein the block chain includes N blocks, the value of the ith binary bit of the pre-created binary string is the label of the ith block in the block chain, i∈[ 1, N]; The obtaining module determines the serial number M of the target block; reads the value of the Mth binary digit from the binary number string as a label of the target block. 20. A simple payment verification device, comprising: a receiving module, receiving a verification request; the verification request includes a target transaction identifier; The building module, according to the verification request, determines the block in which the transaction corresponding to the target transaction identifier is located in its own blockchain, and constructs the block based on the method according to any one of claims 1 to 9 the corresponding Merkle tree; The verification module, based on the constructed Merkle tree, performs simple payment verification for the transaction corresponding to the target transaction identifier. 21. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the program as claimed in any one of claims 1 to 10 when the processor executes the program method described.