CN109493221A - Transaction record time slot scrambling, equipment, network and storage medium in block chain - Google Patents
Transaction record time slot scrambling, equipment, network and storage medium in block chain Download PDFInfo
- Publication number
- CN109493221A CN109493221A CN201811256704.XA CN201811256704A CN109493221A CN 109493221 A CN109493221 A CN 109493221A CN 201811256704 A CN201811256704 A CN 201811256704A CN 109493221 A CN109493221 A CN 109493221A
- Authority
- CN
- China
- Prior art keywords
- block
- node
- block chain
- alternative
- cryptographic hash
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
- G06Q20/3829—Payment protocols; Details thereof insuring higher security of transaction involving key management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/389—Keeping log of transactions for guaranteeing non-repudiation of a transaction
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3247—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures
Abstract
The embodiment of the present invention provides transaction record time slot scrambling, equipment, network and storage medium in a kind of block chain, wherein, this method comprises: the first node in the first block chain calculates the cryptographic Hash of each transaction record in preset time period on the first block chain；The first node generates Merkel tree Merkle Tree based on the cryptographic Hash of each transaction record；The first node is based on the Merkle Tree and generates alternative block, and the alternative block is broadcast in the second block chain, so that the second node in the second block chain is based on the alternative block and obtains book keeping operation permission, and it is based on the book keeping operation permission and the alternative block, generate new block.Technical solution provided in an embodiment of the present invention can prevent the transaction record in block chain from revealing, and improve the confidentiality and safety of transaction record in block chain.
Description
Technical field
The present embodiments relate to transaction record time slot scrambling in block chain technical field more particularly to a kind of block chain,
Equipment, network and storage medium.
Background technique
When the node in block chain A provides billed services for block chain B, and block chain B is alliance's chain or privately owned chain
When, if the block chain B alternative block comprising transaction record details generated is sent directly to carry out in block chain A
Book keeping operation, then the transaction record in alternative block is visible for the node in block chain in A, the friendship of such block chain B
Easy information is just easy to reveal.
Summary of the invention
The embodiment of the present invention provides transaction record time slot scrambling, equipment, network and storage medium in a kind of block chain, to
It prevents the transaction record in block chain from revealing, improves the confidentiality and safety of transaction record in block chain.
First aspect of the embodiment of the present invention provides transaction record time slot scrambling in a kind of block chain, this method comprises:
First node in first block chain calculates each transaction record in preset time period on the first block chain
Cryptographic Hash；
The first node is using the cryptographic Hash of each transaction record as Merkel tree Merkle Tree to be generated
In leaf node cryptographic Hash, and according to the cryptographic Hash of leaf node in the Merkel tree Merkle Tree to be generated
The cryptographic Hash for calculating non-leaf nodes in Merkel tree Merkle Tree to be generated, to generate the Merkle Tree；
The first node is based on the Merkle Tree and generates alternative block, and the alternative block is broadcast to the
In two block chains, so that the second node in the second block chain is based on the alternative block and obtains book keeping operation permission, and it is based on
The book keeping operation permission and the alternative block generate new block.
In a kind of possible design, when the second node calculates the whole Hash that the random number obtained makes new block
When value is less than the difficulty value on the block head point being obtained ahead of time, the second node obtains book keeping operation permission.
In alternatively possible design, the first node is based on the Merkle Tree and generates alternative block, and will
The alternative block is broadcast in the second block chain, so that the second node in the second block chain is based on the alternative block
Book keeping operation permission is obtained, and is based on the book keeping operation permission and the alternative block, after generating new block, the method is also wrapped
It includes:
The first node receives the new block that the second node is broadcast out；
The first node signs to the new block using its private key in the first block chain, and will label
The new block after name is broadcast in the first block chain, so that other nodes in the first block chain are based on described
Merkle Tree in new block verifies the new block；
When the quantity for the node being verified is more than preset threshold, the first node determines that the new block verifying is logical
It crosses.
The first node described in another possible design is using its private key in the first block chain to described
New block is signed, and the new block after signature is broadcast in the first block chain, so that first block
Other nodes in chain verify the new block based on the Merkle Tree in the new block, comprising:
The first node signs to the new block using its private key in the first block chain, and will label
The new block after name is broadcast in the first block chain, so that other nodes in the first block chain are by the Merkle
Each leaf node and non-leaf nodes and the cryptographic Hash of root node respectively calculate described pre- with other described nodes in Tree
If the cryptographic Hash of each transaction record is compared in the period,
Alternatively, make other nodes in the first block chain by the cryptographic Hash of root node in the Merkle Tree and
The cryptographic Hash of the non-leaf nodes of predetermined number respectively calculates the described of acquisition with other described nodes in the Merkle Tree
The cryptographic Hash of the node of corresponding position is compared in Merkle Tree.
It is described when the quantity for the node being verified is more than preset threshold in another possible design, described the
After one node determines that the new block is verified, the method also includes:
It is broadcast in the second block chain the reward voucher of the second node by the first node.
In another possible design, the first node is based on the Merkle Tree and generates alternative block, and will
The alternative block is broadcast in the second block chain, so that the second node in the second block chain is based on the alternative block
Book keeping operation permission is obtained, and is based on the book keeping operation permission and the alternative block, generates new block, comprising:
The alternative block is broadcast in the first block chain by the first node, so that in the first block chain
Other nodes the alternative block is verified based on the Merkle Tree in the alternative block；
Wherein, if the node for having more than preset quantity in the first block chain is verified the alternative block,
The alternative block is broadcast in the second block chain, so that the second node in the second block chain is based on described standby
Constituency block obtains book keeping operation permission, and is based on the book keeping operation permission and the alternative block, generates new block.
The second aspect of the embodiment of the present invention provides a kind of node of block chain, which includes:
Processor, and the memory for storing computer instruction, when processor executes the computer instruction, institute
Processor is stated, is used for:
Calculate the cryptographic Hash of each transaction record in preset time period；
Using the cryptographic Hash of each transaction record as the leaf node in Merkel tree Merkle Tree to be generated
Cryptographic Hash, and calculated according to the cryptographic Hash of leaf node in the Merkel tree Merkle Tree to be generated to be generated
The cryptographic Hash of non-leaf nodes in Merkel tree Merkle Tree, to generate the Merkle Tree；
Alternative block is generated based on the Merkle Tree, and the alternative block is broadcast in the second block chain, with
So that second node in the second block chain is based on the alternative block and obtain book keeping operation permission, and based on the book keeping operation permission with
And the alternative block, generate new block.
In a kind of possible design, when the second node calculates the whole Hash that the random number obtained makes new block
When value is less than the difficulty value on the block head point being obtained ahead of time, the second node obtains book keeping operation permission.
In another possible design, the processor is also used to:
Receive the new block that the second node is broadcast out；
It is signed using its private key in the first block chain to the new block, and will be described new after signature
Block is broadcast in the first block chain, so that other nodes in the first block chain are based in the new block
Merkle Tree verifies the new block；
When the quantity for the node being verified is more than preset threshold, determine that the new block is verified.
In another possible design, the processor is specifically used for:
It is signed using private key of the first node in the first block chain to the new block, and will signature
The new block afterwards is broadcast in the first block chain, so that other nodes in the first block chain are by the Merkle
Each leaf node and non-leaf nodes and the cryptographic Hash of root node respectively calculate described pre- with other described nodes in Tree
If the cryptographic Hash of each transaction record is compared in the period,
Alternatively, make other nodes in the first block chain by the cryptographic Hash of root node in the Merkle Tree and
The cryptographic Hash of the non-leaf nodes of predetermined number respectively calculates the described of acquisition with other described nodes in the Merkle Tree
The cryptographic Hash of the node of corresponding position is compared in Merkle Tree.
In another possible design, the processor is also used to:
Reward message of the first node to the second node is broadcast in the second block chain.
In another possible design, the processor is specifically used for:
The alternative block is broadcast in the first block chain, so that other node bases in the first block chain
Merkle Tree in the alternative block verifies the alternative block；
Wherein, if the node for having more than preset quantity in the first block chain is verified the alternative block,
The alternative block is broadcast in the second block chain, so that the second node in the second block chain is based on described standby
Constituency block obtains book keeping operation permission, and is based on the book keeping operation permission and the alternative block, generates new block.
The third aspect of the embodiment of the present invention provides a kind of block chain network, which includes described in above-mentioned second aspect
Node.
Fourth aspect of the embodiment of the present invention provides a kind of computer readable storage medium, including instruction, when it is in computer
When upper operation, so that computer executes method described in above-mentioned first aspect.
In embodiments of the present invention, the first node in the first block chain is by calculating the first block within a preset period of time
The cryptographic Hash of each transaction record on chain, and using the cryptographic Hash of each transaction record as Merkel tree Merkle to be generated
The cryptographic Hash of leaf node in Tree, according to the cryptographic Hash meter of leaf node in Merkel tree Merkle Tree to be generated
The cryptographic Hash of non-leaf nodes is based in Merkel tree Merkle Tree to be generated to generate Merkle Tree
Merkle Tree generates alternative block, is kept accounts so that the second node in the second block chain is based on the alternative block
Permission, and generate new block.Since the embodiment of the present invention is to indicate the first block chain by the cryptographic Hash on Merkle Tree
In transaction record, rather than the details of transaction record are carried directly in alternative block, thus by alternative block
When being broadcast to the second block chain, the detailed transaction information of the first block chain would not be leaked into the second block chain, be improved
The confidentiality and safety of transaction record in first block chain.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
Some embodiments of invention without any creative labor, may be used also for those of ordinary skill in the art
To obtain other drawings based on these drawings.
Fig. 1 is the structural schematic diagram of Merkle Hash Tree provided in an embodiment of the present invention a kind of；
Fig. 2 is the flow chart of transaction record time slot scrambling in a kind of block chain provided in an embodiment of the present invention；
Fig. 3 is the flow chart of transaction record time slot scrambling in a kind of block chain provided in an embodiment of the present invention；
Fig. 4 is a kind of structural schematic diagram of the node of block chain provided in an embodiment of the present invention.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.It is based on
Embodiment in the present invention, it is obtained by those of ordinary skill in the art without making creative efforts every other
Embodiment shall fall within the protection scope of the present invention.
The term " includes " of description and claims of this specification and " having " and their any deformation, it is intended that
Be to cover it is non-exclusive include, for example, the device of the process or structure that contain series of steps is not necessarily limited to clearly arrange
Those of out structure or step but may include other steps being not clearly listed or intrinsic for these processes or device
Rapid or structure.
Merkel tree (Merkle Tree) is tree described in a kind of data structure, and this field is normally referred to as Merkel
Hash tree (Merkle Hash Tree), this is because all nodes for the Merkle Tree that it is constructed all are hash values.
Merkle Tree has the following characteristics that it is a kind of tree, can be binary tree, can also be with multiway tree, either a few fork trees, it
All have the characteristics that all of tree construction；Value on the leaf node of Merkle Tree can be arbitrarily arranged, such as Merkle Hash
Tree can be using the hash value of data as the value of leaf node；The value of non-leaf nodes can be by leaf node all below it
Value be combined, then to combined result carry out Hash be calculated.Specifically, Fig. 1 is provided in an embodiment of the present invention one
The structural schematic diagram of kind of Merkle Hash Tree, by taking the node 7 in Fig. 1 as an example, the hash value of node 7 be by node 15,
Hash value on 16 is calculated, and the value of other non-leaf nodes on similar Merkle Hash Tree can also pass through class
As method be calculated, repeat no more herein.
Based on the method for above-mentioned Merkle Tree, the embodiment of the invention provides transaction records in a kind of block chain to maintain secrecy
Method, this method are used by the structure of block in transformation block chain so that block only includes the hash value of each transaction record
Merkle Tree carrys out the transaction record of description block chain within a preset period of time, and does not include the detailed letter of each transaction record
Breath, in this way by include Merkle Tree alternative block be sent to kept accounts in other block chains when, would not be by local area
Transaction record in block chain is leaked in other block chains, to improve the confidentiality and safety of transaction record in block chain
Property.
Technical solution of the present invention is described below with reference to specific embodiment.
Fig. 2 is the flow chart of transaction record time slot scrambling in a kind of block chain provided in an embodiment of the present invention, such as Fig. 2 institute
Show, this method comprises the following steps:
First node in step 101, the first block chain calculates each item in preset time period on the first block chain
The cryptographic Hash of transaction record.
Wherein, the first block chain refers to the block chain with billing requirements, for " the first block chain " in the present embodiment
Name is only for that will there is the block chain of billing requirements to distinguish with other block chains, without other meanings.In order to
Facilitate understanding, the first block chain can be interpreted as alliance's chain or privately owned chain in the present embodiment, first node is interpreted as joining
Some on alliance's chain or privately owned chain puts node on someone's head.
In the present embodiment, first node obtains all friendships of the first block chain within a preset period of time by broadcast message
Easily record, and the transaction record progress cryptographic Hash calculating to getting one by one, obtain the corresponding cryptographic Hash of each transaction record.
Step 102, first node are using the cryptographic Hash of each transaction record as Merkel tree Merkle to be generated
The cryptographic Hash of leaf node in Tree, and according to the Kazakhstan of leaf node in the Merkel tree Merkle Tree to be generated
Uncommon value calculates the cryptographic Hash of non-leaf nodes in Merkel tree Merkle Tree to be generated, to generate the Merkle
Tree。
Obtain each transaction record cryptographic Hash after, first node using the corresponding cryptographic Hash of each transaction record as
The leaf node of Merkle Tree, the cryptographic Hash of each non-leaf nodes is according under each non-leaf nodes in Merkle Tree
The values of all leaf nodes calculated and obtain using preset algorithm, the calculation method of the cryptographic Hash of root node in Merkle Tree
It is similar with the calculation method of root node in existing Merkle Tree, it repeats no more herein.
Step 103, first node are based on the Merkle Tree and generate alternative block, and the alternative block is broadcasted
Into the second block chain, so that the second node in the second block chain is based on the alternative block and obtains book keeping operation permission, and
Based on the book keeping operation permission and the alternative block, new block is generated.
In the present embodiment, for first node after generating Merkle Tree, being generated based on the Merkle Tree includes being somebody's turn to do
Merkle Tree, and the random number on block head point is empty alternative block, or even can also in alternative block in other designs
To carry the incentive message that first node makes a promise calculate node (i.e. second node).
First node signs alternative block using its private key in the second block chain after generating alternative block
Name, and the alternative block after signature is broadcast in the second block chain, the second node in the second block chain, it is alternative receiving
After block, the operation for calculating random number is executed, when the random number that second node calculates is less than the whole cryptographic Hash of block in advance
When the difficulty value on the block head first obtained point, then second node obtains book keeping operation permission, and second node will calculate the random of acquisition
Number inserts the head of alternative block, generates new block.
Further, after obtaining new block, second node using its private key in the second block chain to new block into
Row signature, and the block after signature is broadcast in the second block chain, so that first node obtains new district from the second block chain
Block, and new block is broadcast in the first block chain, other nodes in the first block chain verify new block, if
It being verified, first node is signed it to the reward voucher of second node using its private key in the second block chain,
And the reward voucher after signature is broadcast in the second block chain.
In the present embodiment, the first node in the first block chain is by calculating on the first block chain within a preset period of time
Each transaction record cryptographic Hash, and using the cryptographic Hash of each transaction record as Merkel tree Merkle to be generated
The cryptographic Hash of leaf node in Tree, according to the cryptographic Hash meter of leaf node in Merkel tree Merkle Tree to be generated
The cryptographic Hash of non-leaf nodes is based in Merkel tree Merkle Tree to be generated to generate Merkle Tree
Merkle Tree generates alternative block, is kept accounts so that the second node in the second block chain is based on the alternative block
Permission, and generate new block.Since the present embodiment is indicated in the first block chain by the cryptographic Hash on Merkle Tree
Transaction record, rather than the details of transaction record are carried directly in alternative block, to be broadcasted by alternative block
When to the second block chain, the detailed transaction information of the first block chain would not be leaked into the second block chain, improve first
The confidentiality and safety of transaction record in block chain.
Above-described embodiment is further optimized and extended below.
Fig. 3 is the flow chart of transaction record time slot scrambling in a kind of block chain provided in an embodiment of the present invention, such as Fig. 3 institute
Show, on the basis of Fig. 2 embodiment, after step 103, can also include the following steps:
Step 201, first node receive the new block that the second node is broadcast out.
Step 202, first node sign to the new block using its private key in the first block chain, and
The new block after signature is broadcast in the first block chain, so that other nodes in the first block chain are based on
Merkle Tree in the new block verifies the new block.
Step 203, when the quantity for the node being verified be more than preset threshold when, the first node determines the new district
Block is verified.
In the present embodiment, the node in the first block chain when being verified to new block, can with the following method in
Any one:
In a kind of feasible verification method, first node carries out new block using its private key in the first block chain
Signature, and the new block after signature is broadcast in the first block chain, the node in the first block chain, after receiving new block
By each leaf node of Merkle Tree, the cryptographic Hash of non-leaf nodes and root node in new block and itself it is calculated
The first block chain in above-mentioned preset time period the cryptographic Hash of each transaction record compare, if compare it is consistent if verify it is logical
It crosses, further, if the quantity for the node being verified is more than preset threshold, it is determined that new block is verified.
In another feasible method, first node signs new block using its private key in the first block chain
Name, and the new block after signature is broadcast in the first block chain, the node in the first block chain, after receiving new block,
By the non-leaf nodes of predetermined number in the cryptographic Hash of the root node of Merkle Tree in new block and Merkle Tree
Cryptographic Hash is compared with the cryptographic Hash that its own calculates the node of corresponding position in the Merkle Tree obtained, wherein
If comparing unanimously, it is verified, further, if the quantity for the node being verified in the first block chain is more than default threshold
Value, it is determined that new block is verified.
The two methods of certain above-mentioned offer be merely for convenience of understanding two kinds of cited feasible verification modes without
It is to unique restriction of the invention.Such as in other possible designs, alternative block can also be broadcast to the second block
Before in chain, first alternative block is broadcast in the first block chain, so that other sections in the first block chain in addition to first node
Point verifies alternative block based on the Merkle Tree in alternative block, and has more than in the first block chain default
When the node verification of quantity passes through, alternative block is broadcast in the second block chain, so that the second node in the second block chain
Book keeping operation permission is obtained based on alternative block, and based on book keeping operation permission and alternative block, generates new block.
In the present embodiment, the first node in the first block chain is by calculating on the first block chain within a preset period of time
Each transaction record cryptographic Hash, and using the cryptographic Hash of each transaction record as Merkel tree Merkle to be generated
The cryptographic Hash of leaf node in Tree, according to the cryptographic Hash meter of leaf node in Merkel tree Merkle Tree to be generated
The cryptographic Hash of non-leaf nodes is based in Merkel tree Merkle Tree to be generated to generate Merkle Tree
Merkle Tree generates alternative block, is kept accounts so that the second node in the second block chain is based on the alternative block
Permission, and generate new block.Since the present embodiment is indicated in the first block chain by the cryptographic Hash on Merkle Tree
Transaction record, rather than the details of transaction record are carried directly in alternative block, to be broadcasted by alternative block
When to the second block chain, the detailed transaction information of the first block chain would not be leaked into the second block chain, improve first
The confidentiality and safety of transaction record in block chain.
The technical solution of embodiment in order to better understand the present invention, below illustratively with the first block chain be it is privately owned
Chain, first node are to put node on someone's head, and the second block chain is publicly-owned chain, and second node is to implement the present invention for calculate node
Example is illustrated:
Some in S1, privately owned chain puts the generation that node carries out alternative block on someone's head, but what is generated is not in the prior art
Traditional block, but generate one include Merkle Tree alternative block.By the transaction of privately owned chain within a preset period of time
Record is separated by Merkle Tree with alternative block and unique association.It is specific as follows: to put node on someone's head and pass through oneself extensively
The All Activity record of privately owned chain that message was collected within a preset period of time is broadcast, carries out the calculating of cryptographic Hash, Mei Gejiao one by one
Leaf node of the cryptographic Hash easily recorded as a Merkle Tree, the value of the non-leaf nodes of Merkle Tree are bases
The value of all leaf nodes is calculated according to the algorithm made an appointment below it, finally according to the side of Merkle Tree
Formula generates a Merkle Tree, to replace the transaction record in alternative block with Merkle Tree.It both ensure that in this way
It maintains secrecy to the particular content of each transaction record in privately owned chain, and can be by the structure of Merkle Tree and every
Whether the cryptographic Hash of a leaf node is comprehensive to verify the sequence of transaction record and content in alternative block, it is contemplated that safety
While, and convenient for verifying the correctness of alternative block.
Node is put on someone's head after generating alternative block in S2, privately owned chain, and the part of the block body of the alternative block is
The form of Merkle Tree, the random number of the part of block head are blank, and it is preset for putting the incentive message of node on someone's head
Value, then by the alternative block with this put on someone's head node after the private key signature in publicly-owned chain with broadcast the message mode be broadcast to public affairs
Have in chain.
After calculate node in S3, publicly-owned chain receives the broadcast message, candidate area build is calculated according to the broadcast message
Random number in portion, that is to say, that find suitable random number the whole cryptographic Hash of the alternative block is less than and be obtained ahead of time
The difficulty value on block head point after finding the random number, the head that random number is added to alternative block is formed complete alternative
Block (distinguish for convenience it is following will completely alternative block be known as new block), new block is used to the private key label of calculate node
It is broadcasted in publicly-owned chain after name.
In S4, privately owned chain put on someone's head node had received in publicly-owned chain calculate node broadcast new block after, put node on someone's head
The new block is broadcasted in privately owned chain after the private key signature in privately owned chain using oneself.
After other nodes in S5, privately owned chain have received new block, which is verified, specific method is
Verify each leaf node and non-leaf nodes and root node cryptographic Hash whether with oneself pre-stored privately owned chain above-mentioned
Whether the cryptographic Hash of each transaction record in preset time period consistent, that is, be compared based on Merkle Tree and
Verification processing.Merkle Tree can greatly reduce the transmission quantity of data and the complexity of calculating.In order to promote the effect of verifying
Rate leaf node and non-leaf nodes can not also be verified in turn, but only verify the cryptographic Hash of root node, and random
The cryptographic Hash and cryptographic Hash of the calculated Merkle Tree of node oneself on corresponding position for the N number of non-leaf nodes chosen
It is whether consistent, if unanimously, new block is verified.Still by taking Fig. 1 as an example, if node 15,16.......30 is leaf section
The cryptographic Hash of these nodes is transferred to node B from node A by point, after data are transferred to node B, thinks to be transferred to node B under verifying
On data validity (whether verify data changes in transmission process), it is only necessary to verify institute on node A and node B
Whether the cryptographic Hash of the leaf node of the MerkleTree of construction is consistent, if unanimously, indicating that data are effective, transmission
No change has taken place in the process.If the cryptographic Hash of node 15 is tampered in transmission process, held very much by Merkle Tree
Easily (because at this point, node 0,1,3,7,15 corresponding hash value are all changed), the time complexity of positioning are found in positioning
It is lower.And be once verified, then start to verify the random number that the calculate node in the publicly-owned chain is found, if this is random
Number is also verified, then the message being verified is used the private key label in the privately owned chain of oneself by other nodes in privately owned chain
It is broadcasted in privately owned chain after name.
If the node existed in S6, privately owned chain more than preset threshold is verified new block.Node is put on someone's head in publicly-owned chain
In, it is signed using oneself private key in publicly-owned chain to its reward proof to calculate node, then by the prize after signature
Proof is encouraged to be broadcast in publicly-owned chain.
What needs to be explained here is that can also shift to an earlier date the verification step of S5 in other implementations, that is, put node on someone's head
After generating alternative block, alternative block is broadcast in privately owned chain, so that other nodes in privately owned chain carry out alternative block
Verifying, if the node verification for having more than preset quantity passes through, alternative block is broadcast in publicly-owned chain, so that calculate node meter
Calculate random number.
Fig. 4 is a kind of structural schematic diagram of the node of block chain provided in an embodiment of the present invention, as shown in figure 4, node 40,
Including processor 41, and the memory 42 for storing computer instruction, when processor executes the computer instruction, institute
Processor 41 is stated, is used for:
Calculate the cryptographic Hash of each transaction record in preset time period；
Using the cryptographic Hash of each transaction record as the Kazakhstan of the leaf node in Merkel tree Merkle Tree to be generated
Uncommon value, calculates Merkel tree to be generated according to the cryptographic Hash of leaf node in Merkel tree Merkle Tree to be generated
The cryptographic Hash of non-leaf nodes is in Merkle Tree to generate Merkle Tree；
Alternative block is generated based on the Merkle Tree, and the alternative block is broadcast in the second block chain, with
So that second node in the second block chain is based on the alternative block and obtain book keeping operation permission, and based on the book keeping operation permission with
And the alternative block, generate new block.
In a kind of possible design, when the second node calculates the whole Hash that the random number obtained makes new block
When value is less than the difficulty value on the block head point being obtained ahead of time, the second node obtains book keeping operation permission.
In a kind of possible design, the processor 41 is also used to:
Receive the new block that the second node is broadcast out；
It is signed using its private key in the first block chain to the new block, and will be described new after signature
Block is broadcast in the first block chain, so that other nodes in the first block chain are based in the new block
Merkle Tree verifies the new block；
When the quantity for the node being verified is more than preset threshold, determine that the new block is verified.
In a kind of possible design, the processor 41 is specifically used for:
It is signed using private key of the first node in the first block chain to the new block, and will signature
The new block afterwards is broadcast in the first block chain, so that other nodes in the first block chain are by the Merkle
Each leaf node and non-leaf nodes and the cryptographic Hash of root node respectively calculate described pre- with other described nodes in Tree
If the cryptographic Hash of each transaction record is compared in the period,
Alternatively, make other nodes in the first block chain by the cryptographic Hash of root node in the Merkle Tree and
The cryptographic Hash of the non-leaf nodes of predetermined number respectively calculates the described of acquisition with other described nodes in the Merkle Tree
The cryptographic Hash of the node of corresponding position is compared in Merkle Tree.
In a kind of possible design, the processor 41 is also used to:
Reward message of the first node to the second node is broadcast in the second block chain.
In a kind of possible design, the processor 41 is specifically used for:
The alternative block is broadcast in the first block chain, so that other node bases in the first block chain
Merkle Tree in the alternative block verifies the alternative block；
Wherein, if the node for having more than preset quantity in the first block chain is verified the alternative block,
The alternative block is broadcast in the second block chain, so that the second node in the second block chain is based on described standby
Constituency block obtains book keeping operation permission, and is based on the book keeping operation permission and the alternative block, generates new block.
The method that node provided in this embodiment is able to carry out above-described embodiment, executive mode is similar with beneficial effect,
It repeats no more herein.
The embodiment of the present invention also provides a kind of block chain network, which includes the node that Fig. 4 embodiment provides.
The embodiment of the present invention also provides a kind of computer readable storage medium, including instruction, when it runs on computers
When, so that computer executes method described in above-described embodiment.
Finally, it should be noted that those of ordinary skill in the art will appreciate that whole in above-described embodiment method or
Part process is that relevant hardware can be instructed to complete by computer program, and the program can be stored in a computer
In readable storage medium storing program for executing, the program is when being executed, it may include such as the process of the embodiment of above-mentioned each method.Wherein, described to deposit
Storage media can be disk, CD, read-only memory (ROM) or random access memory (RAM) etc..
Each functional unit in the embodiment of the present invention can integrate in a processing module, be also possible to each unit
It is individually physically present, can also be integrated in two or more units in a module.Above-mentioned integrated module both can be with
Using formal implementation of hardware, can also be realized in the form of software function module.If the integrated module is with software
The form of functional module realizes, and when sold or used as an independent product, also can store and computer-readable deposits at one
In storage media.Storage medium mentioned above can be read-only memory, disk or CD etc..
The above embodiments are only used to illustrate the technical solution of the present invention., rather than its limitations；Although referring to aforementioned each reality
Applying example, invention is explained in detail, those skilled in the art should understand that: it still can be to aforementioned each
Technical solution documented by embodiment is modified, or equivalent substitution of some or all of the technical features；And
These are modified or replaceed, the range for technical solution of various embodiments of the present invention that it does not separate the essence of the corresponding technical solution.
Claims (14)
1. transaction record time slot scrambling in a kind of block chain characterized by comprising
First node in first block chain calculates the Kazakhstan of each transaction record in preset time period on the first block chain
Uncommon value；
The first node is using the cryptographic Hash of each transaction record as in Merkel tree Merkle Tree to be generated
The cryptographic Hash of leaf node, and calculated according to the cryptographic Hash of leaf node in the Merkel tree Merkle Tree to be generated
The cryptographic Hash of non-leaf nodes in Merkel tree Merkle Tree to be generated, to generate the Merkle Tree；
The first node is based on the Merkle Tree and generates alternative block, and the alternative block is broadcast to the secondth area
In block chain, so that the second node in the second block chain is based on the alternative block and obtains book keeping operation permission, and based on described
Permission of keeping accounts and the alternative block generate new block.
2. the method according to claim 1, wherein making newly when the second node calculates the random number obtained
When the whole cryptographic Hash of block is less than the difficulty value on the block head point being obtained ahead of time, the second node obtains book keeping operation permission.
3. the method according to claim 1, wherein the first node is generated based on the Merkle Tree
Alternative block, and the alternative block is broadcast in the second block chain, so that the second node base in the second block chain
Book keeping operation permission is obtained in the alternative block, and is based on the book keeping operation permission and the alternative block, after generating new block,
The method also includes:
The first node obtains the new block that the second node is broadcast out；
The first node signs to the new block using its private key in the first block chain, and will be after signature
The new block be broadcast in the first block chain so that other nodes in the first block chain be based on the new district
Merkle Tree in block verifies the new block；
When the quantity for the node being verified is more than preset threshold, the first node determines that the new block is verified.
4. according to the method described in claim 3, it is characterized in that, the first node is using it in the first block chain
Private key sign to the new block, and the new block after signature is broadcast in the first block chain so that
Other nodes in the first block chain verify the new block based on the Merkle Tree in the new block,
Include:
The first node signs to the new block using its private key in the first block chain, and will be after signature
The new block be broadcast in the first block chain so that other nodes in the first block chain are by the Merkle
The institute that each leaf node and non-leaf nodes and the cryptographic Hash of root node and other described nodes are respectively calculated in Tree
The cryptographic Hash for stating each transaction record in preset time period is compared,
Alternatively, making other nodes in the first block chain by the cryptographic Hash of the root node in the Merkle Tree and institute
It states in Merkle Tree the cryptographic Hash of the non-leaf nodes of predetermined number and respectively calculates the described of acquisition with other described nodes
The cryptographic Hash of the node of corresponding position is compared in Merkle Tree.
5. according to the method described in claim 3, it is characterized in that, described when the quantity for the node being verified is more than default threshold
When value, after the first node determines that the new block is verified, the method also includes:
It is broadcast in the second block chain the reward voucher of the second node by the first node.
6. the method according to claim 1, wherein the first node is generated based on the Merkle Tree
Alternative block, and the alternative block is broadcast in the second block chain, so that the second node base in the second block chain
Book keeping operation permission is obtained in the alternative block, and is based on the book keeping operation permission and the alternative block, generates new block, packet
It includes:
The alternative block is broadcast in the first block chain by the first node, so that its in the first block chain
He verifies the alternative block based on the Merkle Tree in the alternative block node；
Wherein, if the node for having more than preset quantity in the first block chain is verified the alternative block, by institute
It states alternative block to be broadcast in the second block chain, so that the second node in the second block chain is based on the candidate area
Block obtains book keeping operation permission, and is based on the book keeping operation permission and the alternative block, generates new block.
7. a kind of node of block chain characterized by comprising
Including processor, and the memory for storing computer instruction, when processor executes the computer instruction, institute
Processor is stated, is used for:
Calculate the cryptographic Hash of each transaction record in preset time period on the first block chain；
Using the cryptographic Hash of each transaction record as the Kazakhstan of the leaf node in Merkel tree Merkle Tree to be generated
Uncommon value, and Merck to be generated is calculated according to the cryptographic Hash of leaf node in the Merkel tree Merkle Tree to be generated
The cryptographic Hash of non-leaf nodes in your tree Merkle Tree, to generate the Merkle Tree；
Alternative block is generated based on the Merkle Tree, and the alternative block is broadcast in the second block chain, so that institute
It states the second node in the second block chain and is based on the alternative block acquisition book keeping operation permission, and be based on the book keeping operation permission and institute
Alternative block is stated, new block is generated.
8. node according to claim 7, which is characterized in that make newly when the second node calculates the random number obtained
When the whole cryptographic Hash of block is less than the difficulty value on the block head point being obtained ahead of time, the second node obtains book keeping operation permission.
9. node according to claim 7, which is characterized in that the processor is also used to:
Obtain the new block that the second node is broadcast out；
It is signed using its private key in the first block chain to the new block, and by the new block after signature
It is broadcast in the first block chain, so that other nodes in the first block chain are based on the Merkle in the new block
Tree verifies the new block；
When the quantity for the node being verified is more than preset threshold, determine that the new block is verified.
10. node according to claim 9, which is characterized in that the processor is specifically used for:
It is signed using private key of the first node in the first block chain to the new block, and will be described in after signature
New block is broadcast in the first block chain, so that other nodes in the first block chain will be each in the Merkle Tree
Leaf node and non-leaf nodes and the cryptographic Hash of root node and other described nodes be respectively calculated it is described default when
Between in section the cryptographic Hash of each transaction record be compared,
Alternatively, making other nodes in the first block chain by the cryptographic Hash of the root node in the Merkle Tree and institute
It states in Merkle Tree the cryptographic Hash of the non-leaf nodes of predetermined number and respectively calculates the described of acquisition with other described nodes
The cryptographic Hash of the node of corresponding position is compared in Merkle Tree.
11. node according to claim 9, which is characterized in that the processor is also used to:
Reward message of the first node to the second node is broadcast in the second block chain.
12. node according to claim 7, which is characterized in that the processor is specifically used for:
The alternative block is broadcast in the first block chain, so that other nodes in the first block chain are based on institute
The Merkle Tree stated in alternative block verifies the alternative block；
Wherein, if the node for having more than preset quantity in the first block chain is verified the alternative block, by institute
It states alternative block to be broadcast in the second block chain, so that the second node in the second block chain is based on the candidate area
Block obtains book keeping operation permission, and is based on the book keeping operation permission and the alternative block, generates new block.
13. a kind of block chain network, which is characterized in that including node described in any one of claim 7-12.
14. a kind of computer readable storage medium, including instruction, when run on a computer, so that computer executes such as
Method of any of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811256704.XA CN109493221B (en) | 2018-10-26 | 2018-10-26 | Method, device, network and storage medium for keeping transaction records secret in block chain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811256704.XA CN109493221B (en) | 2018-10-26 | 2018-10-26 | Method, device, network and storage medium for keeping transaction records secret in block chain |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109493221A true CN109493221A (en) | 2019-03-19 |
| CN109493221B CN109493221B (en) | 2021-01-12 |
Family
ID=65692074
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811256704.XA Active CN109493221B (en) | 2018-10-26 | 2018-10-26 | Method, device, network and storage medium for keeping transaction records secret in block chain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109493221B (en) |
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110020544A (en) * | 2018-12-26 | 2019-07-16 | 阿里巴巴集团控股有限公司 | The Hash information processing method and system of record are stored in the block of block chain |
| CN110232569A (en) * | 2019-05-07 | 2019-09-13 | 北京奇艺世纪科技有限公司 | A kind of read method of transaction record, device and storage medium |
| CN110753080A (en) * | 2019-08-30 | 2020-02-04 | 深圳壹账通智能科技有限公司 | Block transmission method, device, equipment and readable storage medium |
| CN110853214A (en) * | 2019-11-06 | 2020-02-28 | 杭州复杂美科技有限公司 | Block generation method, device and storage medium |
| CN111130801A (en) * | 2019-12-26 | 2020-05-08 | 腾讯科技（深圳）有限公司 | Data processing method and device, node equipment and computer storage medium |
| CN111147227A (en) * | 2019-12-27 | 2020-05-12 | 杭州中科先进技术研究院有限公司 | Communication method and communication platform based on block chain |
| CN111314086A (en) * | 2020-02-11 | 2020-06-19 | 上海宓猿信息技术有限公司 | Method for implementing block chain privacy protocol |
| CN111371558A (en) * | 2020-02-26 | 2020-07-03 | 百度在线网络技术（北京）有限公司 | Block chain data processing method and device, electronic equipment and medium |
| CN111428277A (en) * | 2020-03-20 | 2020-07-17 | 中国建设银行股份有限公司 | Block chain data verification method, device and system |
| CN111431696A (en) * | 2020-03-26 | 2020-07-17 | 深圳市欧欣泰科技有限公司 | Identity-based block chain sealing mechanism |
| CN111445236A (en) * | 2019-11-14 | 2020-07-24 | 杭州复杂美科技有限公司 | Block chain transaction verification method, equipment and storage medium |
| CN111464539A (en) * | 2020-03-31 | 2020-07-28 | 中国联合网络通信集团有限公司 | Block chain accounting method and accounting node |
| CN111614721A (en) * | 2020-04-14 | 2020-09-01 | 梁伟 | Multi-dimensional block chain network and method and device for generating multi-dimensional block chain network |
| CN111865894A (en) * | 2020-05-27 | 2020-10-30 | 布比（北京）网络技术有限公司 | Block validity verification method and device |
| CN113841359A (en) * | 2019-04-12 | 2021-12-24 | 区块链控股有限公司 | Method and apparatus for propagating tiles in a blockchain network |
| CN114844654A (en) * | 2022-07-06 | 2022-08-02 | 湖南密码工程研究中心有限公司 | Vehicle networking credible state data proving method |
| CN117132279A (en) * | 2023-10-26 | 2023-11-28 | 山东大学 | Block chain double-chain accounting method, system, equipment and medium |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106548091A (en) * | 2016-10-14 | 2017-03-29 | 北京爱接力科技发展有限公司 | A kind of data deposit card, the method and device of checking |
| CN107015882A (en) * | 2016-12-26 | 2017-08-04 | 阿里巴巴集团控股有限公司 | A kind of block data method of calibration and device |
| WO2018013259A1 (en) * | 2016-07-15 | 2018-01-18 | Mastercard International Incorporated | Method and system for partitioned blockchains and enhanced privacy for permissioned blockchains |
| CN107947922A (en) * | 2017-11-29 | 2018-04-20 | 中国科学院合肥物质科学研究院 | A kind of digital archives management method and system based on block chain technology |
| CN108389130A (en) * | 2018-03-02 | 2018-08-10 | 合肥学院 | A kind of more trade mode alliances chain |
| CN108399572A (en) * | 2018-03-22 | 2018-08-14 | 深圳市网心科技有限公司 | block chain transaction processing method, device and storage medium |
| CN108667632A (en) * | 2018-04-19 | 2018-10-16 | 阿里巴巴集团控股有限公司 | Based on the credit record sharing method and device of block chain, electronic equipment |
-
2018
- 2018-10-26 CN CN201811256704.XA patent/CN109493221B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018013259A1 (en) * | 2016-07-15 | 2018-01-18 | Mastercard International Incorporated | Method and system for partitioned blockchains and enhanced privacy for permissioned blockchains |
| CN106548091A (en) * | 2016-10-14 | 2017-03-29 | 北京爱接力科技发展有限公司 | A kind of data deposit card, the method and device of checking |
| CN107015882A (en) * | 2016-12-26 | 2017-08-04 | 阿里巴巴集团控股有限公司 | A kind of block data method of calibration and device |
| CN107947922A (en) * | 2017-11-29 | 2018-04-20 | 中国科学院合肥物质科学研究院 | A kind of digital archives management method and system based on block chain technology |
| CN108389130A (en) * | 2018-03-02 | 2018-08-10 | 合肥学院 | A kind of more trade mode alliances chain |
| CN108399572A (en) * | 2018-03-22 | 2018-08-14 | 深圳市网心科技有限公司 | block chain transaction processing method, device and storage medium |
| CN108667632A (en) * | 2018-04-19 | 2018-10-16 | 阿里巴巴集团控股有限公司 | Based on the credit record sharing method and device of block chain, electronic equipment |
Non-Patent Citations (1)
| Title |
|---|
| 袁勇: ""区块链技术发展现状与展望"", 《自动化学报》 * |
Cited By (27)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110020544A (en) * | 2018-12-26 | 2019-07-16 | 阿里巴巴集团控股有限公司 | The Hash information processing method and system of record are stored in the block of block chain |
| CN110020544B (en) * | 2018-12-26 | 2021-08-24 | 创新先进技术有限公司 | Hash information processing method and system for storage record in block of block chain |
| CN113841359A (en) * | 2019-04-12 | 2021-12-24 | 区块链控股有限公司 | Method and apparatus for propagating tiles in a blockchain network |
| CN110232569A (en) * | 2019-05-07 | 2019-09-13 | 北京奇艺世纪科技有限公司 | A kind of read method of transaction record, device and storage medium |
| CN110232569B (en) * | 2019-05-07 | 2021-04-16 | 北京奇艺世纪科技有限公司 | Method and device for reading transaction record and storage medium |
| CN110753080A (en) * | 2019-08-30 | 2020-02-04 | 深圳壹账通智能科技有限公司 | Block transmission method, device, equipment and readable storage medium |
| CN110853214A (en) * | 2019-11-06 | 2020-02-28 | 杭州复杂美科技有限公司 | Block generation method, device and storage medium |
| CN110853214B (en) * | 2019-11-06 | 2021-05-11 | 杭州复杂美科技有限公司 | Block generation method, device and storage medium |
| CN111445236A (en) * | 2019-11-14 | 2020-07-24 | 杭州复杂美科技有限公司 | Block chain transaction verification method, equipment and storage medium |
| CN111445236B (en) * | 2019-11-14 | 2023-05-30 | 杭州复杂美科技有限公司 | Block chain transaction verification method, device and storage medium |
| CN111130801A (en) * | 2019-12-26 | 2020-05-08 | 腾讯科技（深圳）有限公司 | Data processing method and device, node equipment and computer storage medium |
| CN111147227A (en) * | 2019-12-27 | 2020-05-12 | 杭州中科先进技术研究院有限公司 | Communication method and communication platform based on block chain |
| CN111314086A (en) * | 2020-02-11 | 2020-06-19 | 上海宓猿信息技术有限公司 | Method for implementing block chain privacy protocol |
| CN111371558B (en) * | 2020-02-26 | 2024-01-16 | 百度在线网络技术（北京）有限公司 | Block chain data processing method and device, electronic equipment and medium |
| CN111371558A (en) * | 2020-02-26 | 2020-07-03 | 百度在线网络技术（北京）有限公司 | Block chain data processing method and device, electronic equipment and medium |
| CN111428277A (en) * | 2020-03-20 | 2020-07-17 | 中国建设银行股份有限公司 | Block chain data verification method, device and system |
| CN111428277B (en) * | 2020-03-20 | 2023-08-18 | 中国建设银行股份有限公司 | Block chain data verification method, device and system |
| CN111431696A (en) * | 2020-03-26 | 2020-07-17 | 深圳市欧欣泰科技有限公司 | Identity-based block chain sealing mechanism |
| CN111431696B (en) * | 2020-03-26 | 2023-10-17 | 深圳市欧欣泰科技有限公司 | Block chain seal mechanism based on identity |
| CN111464539A (en) * | 2020-03-31 | 2020-07-28 | 中国联合网络通信集团有限公司 | Block chain accounting method and accounting node |
| CN111614721A (en) * | 2020-04-14 | 2020-09-01 | 梁伟 | Multi-dimensional block chain network and method and device for generating multi-dimensional block chain network |
| CN111865894B (en) * | 2020-05-27 | 2022-07-01 | 布比（北京）网络技术有限公司 | Block validity verification method and device |
| CN111865894A (en) * | 2020-05-27 | 2020-10-30 | 布比（北京）网络技术有限公司 | Block validity verification method and device |
| CN114844654B (en) * | 2022-07-06 | 2022-09-06 | 湖南密码工程研究中心有限公司 | Vehicle networking credible state data proving method |
| CN114844654A (en) * | 2022-07-06 | 2022-08-02 | 湖南密码工程研究中心有限公司 | Vehicle networking credible state data proving method |
| CN117132279A (en) * | 2023-10-26 | 2023-11-28 | 山东大学 | Block chain double-chain accounting method, system, equipment and medium |
| CN117132279B (en) * | 2023-10-26 | 2024-01-23 | 山东大学 | Block chain double-chain accounting method, system, equipment and medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109493221B (en) | 2021-01-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109493221A (en) | Transaction record time slot scrambling, equipment, network and storage medium in block chain | |
| Halpin et al. | Introduction to Security and Privacy on the Blockchain | |
| CN107729471A (en) | A kind of block chain and its generation method and equipment | |
| CN101004805B (en) | Digital document management system, digital document management method | |
| CN108039943B (en) | Verifiable encryption searching method | |
| CN108830602B (en) | Permission chain construction and management and control method based on chameleon hash function | |
| CN110008720B (en) | Dynamic data tracing method and device for Internet of things based on alliance chain | |
| JP5753273B2 (en) | Data authenticity guarantee method, management computer and storage medium | |
| CN108009445A (en) | A kind of trust data management system of half centralization | |
| CN107360156A (en) | P2P network method for cloud storage based on block chain under a kind of big data environment | |
| JP2020522927A (en) | Blockchain for general calculation | |
| CN107423632A (en) | Customizable sensitive data desensitization method and system | |
| Zhang et al. | Secure top-k query processing via untrusted location-based service providers | |
| CN110096903B (en) | Asset verification method based on block chain and block chain network system | |
| Brunner et al. | SPROOF: A Platform for Issuing and Verifying Documents in a Public Blockchain. | |
| Warmke | What is bitcoin | |
| Lin et al. | The challenges of existence, status, and value for improving blockchain | |
| CN112116349B (en) | High-throughput-rate-oriented random consensus method and device for drawing account book | |
| CN111464310B (en) | Method for realizing mixed chain of alliance chain and Polkadat chain | |
| CN115270145A (en) | User electricity stealing behavior detection method and system based on alliance chain and federal learning | |
| CN109447803A (en) | Bookkeeping methods, equipment, alliance's chain and the storage medium of alliance's chain | |
| Etemad et al. | Database outsourcing with hierarchical authenticated data structures | |
| EP3906636A1 (en) | Verifiable object state data tracking | |
| CN114328518A (en) | UTXO model-based low storage consumption method and system | |
| Sung | Prospects and challenges posed by blockchain technology on the copyright legal system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: 100191 1107c, 11 / F, Xueyuan international building, 1 Zhichun Road, Haidian District, Beijing Applicant after: IALLCHAIN Co.,Ltd. Address before: 100043 5158, 5 floor, 11 Shixing street, Shijingshan District, Beijing. Applicant before: IALLCHAIN Co.,Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |