CN110351297A - A kind of verification method and device applied to block chain - Google Patents
A kind of verification method and device applied to block chain Download PDFInfo
- Publication number
- CN110351297A CN110351297A CN201910668695.3A CN201910668695A CN110351297A CN 110351297 A CN110351297 A CN 110351297A CN 201910668695 A CN201910668695 A CN 201910668695A CN 110351297 A CN110351297 A CN 110351297A
- Authority
- CN
- China
- Prior art keywords
- verified
- tree
- equipment
- salt
- node
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
- H04L63/0442—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload wherein the sending and receiving network entities apply asymmetric encryption, i.e. different keys for encryption and decryption
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/08—Network architectures or network communication protocols for network security for authentication of entities
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/20—Network architectures or network communication protocols for network security for managing network security; network security policies in general
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- 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/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
Abstract
The invention discloses a kind of verification method and device applied to block chain, wherein method are as follows: determine the root node of the first bit arithmetic tree of user to be verified；The root node of first bit arithmetic tree is determined according to the first salt figure of at least one equipment to be verified of the nodal information and user to be verified of the first bit arithmetic tree；If the root node of the first bit arithmetic tree is identical as the root node of second operation tree, it is determined that user to be verified holds at least one equipment to be verified；Wherein, second salt figure of any two registered device is different, since the first bit arithmetic tree considers the first salt figure of at least one equipment to be verified, so as to disposably verify multiple equipment to be verified of user to be verified, and bit arithmetic is the basic operations of computer, it is shorter to obtain the first bit arithmetic tree spent time, therefore has been obviously improved verification efficiency.The above method can be applied to financial technology (Fintech) and the field block chain (Blockchain).
Description
Technical field
The present invention relates to the field financial technology (Fintech), the block chain field (Blockchain) and data security arts,
More particularly to a kind of verification method and device applied to block chain.
Background technique
With the development of computer technology, more and more technologies (big data, distribution, block chain (Blockchain),
Artificial intelligence etc.) it applies in financial field, traditional financial industry gradually changes to financial technology (Fintech).Currently, financial
In sciemtifec and technical sphere, the requirement to transaction security is high, user be frequently present of the equipment identities that need to hold oneself into
Row verifies the demand of its ownership.
Verification mode in the prior art is the public key encryption one piece of data of authentication to be used by system, and issue verifying
The private key signature one that simultaneously comparison data or authentication actively use oneself is decrypted using the private key of oneself by authentication by side
Segment data, system use the public key sign test and comparison data of authentication, and this mode needs to be implemented more the asymmetric of time-consuming and adds
Close algorithm needs one by one to verify each equipment, it is clear that the prior art is tested especially when user holds multiple equipment
Card mode time-consuming is more long, and efficiency is lower.
Summary of the invention
The embodiment of the present application provides a kind of verification method and device applied to block chain, solves and verifies in the prior art
Mode time-consuming is more long, the lower problem of efficiency.
In a first aspect, the embodiment of the present application provides a kind of verification method applied to block chain: determining user's to be verified
The root node of first bit arithmetic tree；The root node of the first bit arithmetic tree is the nodal information according to the first bit arithmetic tree
It is determined with the first salt figure of at least one equipment to be verified of the user to be verified；The leaf section of the first bit arithmetic tree
There are the first mapping relations with the first salt figure of at least one equipment to be verified for point；If the root section of the first bit arithmetic tree
Point is identical as the root node of second operation tree, it is determined that the user to be verified holds at least one described equipment to be verified；
The root node of the second operation tree is registered according at least one of the corresponding registered users of the user to be verified
Second salt figure pre-generatmg of equipment；The of the leaf node of the second operation tree and at least one registered device
There are the second mapping relations for two salt figures；Wherein, each registered device corresponds to an equipment to be verified, and any two are registered
Second salt figure of equipment is different.
In the above method, the root node of the first bit arithmetic tree of user to be verified is first determined, due to the first bit arithmetic tree
Root node is determining according to the nodal information of the first bit arithmetic tree and the first salt figure of at least one equipment to be verified, and
There are first for first salt figure of at least one equipment to be verified of the leaf node of the first bit arithmetic tree and the user to be verified
Mapping relations, so that the root node of the first bit arithmetic tree is to consider the first salt figure of at least one equipment to be verified just to obtain
, if the root node and second operation tree of the first bit arithmetic tree determined according to the nodal information of the first bit arithmetic tree
Root node is identical, can with the first salt figure of at least one each equipment to be verified of equipment to be verified close to 1 determine the probability and
Second salt figure is all the same, therefore avoids complicated rivest, shamir, adelman, can only pass through simple bit arithmetic, that is, can determine institute
State user's checking to be verified success, bit arithmetic is the basic operations of computer, obtain the time spent by the first bit arithmetic tree compared with
It is short, and the first bit arithmetic tree considers the first salt figure of at least one equipment to be verified, so that this method can be verified disposably
Multiple equipment to be verified of user to be verified, to be obviously improved verification efficiency.
In a kind of optional embodiment, the root node of the first bit arithmetic tree of the determination user to be verified, comprising: obtain
First salt figure of the nodal information of the first bit arithmetic tree, at least one equipment to be verified；It is transported according to described first
The nodal information of tree and the first salt figure of at least one equipment to be verified are calculated, determines the root section of the first bit arithmetic tree
Point；Before determining that the user to be verified holds at least one described equipment to be verified, further includes: according to it is described at least one wait for
The public key for verifying the first salt figure of each equipment to be verified and the equipment to be verified in equipment, generates the first of the equipment to be verified
Cryptographic Hash；Determine the first cryptographic Hash of each equipment to be verified at least one described equipment to be verified, if with it is described at least
The second cryptographic Hash of corresponding registered device is consistent in one registered device, and the second cryptographic Hash of the registered device is
It is generated according to the second salt figure of the registered device and the public key of the registered device.
Under aforesaid way, the root node of the first operation tree is according to the nodal information of the first bit arithmetic tree got and extremely
What the first salt figure of few equipment to be verified obtained, it to be verified is set according to each at least one equipment to be verified got
The public key of standby the first salt figure and the equipment to be verified, generates the first cryptographic Hash of the equipment to be verified, then verify at least one
Whether the first cryptographic Hash of each equipment to be verified is consistent with corresponding second cryptographic Hash in equipment to be verified, thus further
Increase the reliability of verifying.
In a kind of optional embodiment, the nodal information according to first operation tree and described at least one is to be tested
The first salt figure for demonstrate,proving equipment, determines the root node of the first bit arithmetic tree, comprising: according to the node of the first bit arithmetic tree
First salt figure of information and at least one equipment to be verified determines at least one node of the first bit arithmetic tree；It presses
According to preset bit exclusive-OR operation, according to the brotgher of node of each node and the node at least one described node, determining should
The father node of node, until determining the root node of the first bit arithmetic tree.
Under aforesaid way, since the first salt figure of at least one equipment to be verified and the leaf node of the first bit arithmetic tree are deposited
At least one section of the first bit arithmetic tree neatly can be therefrom determined in conjunction with the nodal information of the first operation tree in mapping relations
Point, according still further to preset bit exclusive-OR operation, according to the brotgher of node of each node and the node at least one described node,
The father node of the node is determined, until the root node of the first bit arithmetic tree is determined, to provide a kind of flexible determining institute
The mode of the root node of the first bit arithmetic tree is stated, and bit exclusive-OR operation is a kind of higher bit arithmetic of efficiency in bit arithmetic, therefore,
Which can further promote verification efficiency and flexibility.
In a kind of optional embodiment, before the root node of the first bit arithmetic tree of the determination user to be verified, also wrap
Include: receiving the first cochain request that the registered users are sent, the first cochain request for will it is described at least one
The public key of the public key, registered users of registering equipment is stored to block chain；Receive the second cochain that the registered users are sent
Request, the second cochain request include the second cryptographic Hash using the private key encryption of at least one registered device；From
The block chain obtains the public key of at least one registered device and second cryptographic Hash of encryption is decrypted；?
When successful decryption, second cryptographic Hash is stored into the block chain；It receives in the third that the registered users are sent
Chain request, the third cochain request include the root using the second operation tree of the private key encryption of the registered users
Node；From the block chain obtain the registered users public key and to the root node of the second operation tree of encryption into
Row decryption；In successful decryption, the root node of the second operation tree is stored into the block chain.
First cochain request for by the public key of the public key of at least one registered device, registered users store to
Block chain, so as to the subsequent processing to the request of the second cochain and the request of third cochain, since the storage of block chain can not distort
Property, enhance the safety of the second cryptographic Hash and the storage of second operation tree.
In a kind of optional embodiment, the update request that the registered users are sent is received；The update request is used for
Instruction regenerates second cryptographic Hash of at least one registered device and/or the root node of the second operation tree,
And it is stored again to the block chain.
Second cryptographic Hash of at least one registered device and the root node of second operation tree may need to change
Become, aforesaid way provides a kind of the second cryptographic Hash for regenerating registered device in block chain and/or second fortune
Calculate the mode of the root node of tree.
In a kind of optional embodiment, the second salt figure of at least one registered device is N system positive integer；N
For the integer greater than 1；According to the second salt figure of at least one registered device, at least one binary integer is obtained；Its
In, the second salt figure of each registered device is corresponding to obtain a binary integer；According at least one described binary integer,
According to second mapping relations, the leaf node of the second operation tree is determined；The leaf section of the second operation tree
Point includes the combination of the first leaf node and the combination of the second leaf node；The first leaf node group is combined into second bit arithmetic
There are the combinations of the leaf node of second mapping relations with the second salt figure of at least one registered device in tree；Institute
It states the second leaf node group and is combined into the second operation tree and do not deposited with the second salt figure of at least one registered device
In the combination of the leaf node of second mapping relations；The value of leaf node is 0 in the combination of second leaf node；According to institute
The leaf node for stating second operation tree generates the root node of the second operation tree.
Under aforesaid way, no matter the leaf node of the second operation tree whether the second salt figure at least one registered device
There are the second mapping relations, the leaf node of the second operation tree can assignment, a kind of necessarily can be generated second to provide
The mode of the root node of bit arithmetic tree.
Second aspect, the application provide a kind of verifying device, comprising: determining module, for determining the of user to be verified
The root node of one bit arithmetic tree；The root node of the first bit arithmetic tree be according to the nodal information of the first bit arithmetic tree and
What the first salt figure of at least one equipment to be verified of the user to be verified determined；The leaf node of the first bit arithmetic tree
There are the first mapping relations with the first salt figure of at least one equipment to be verified；Processing module, if being used for described first
The root node of operation tree is identical as the root node of second operation tree, it is determined that the user to be verified hold it is described at least one
Equipment to be verified；The root node of the second operation tree be according to the corresponding registered users of the user to be verified at least
Second salt figure pre-generatmg of one registered device；The leaf node of the second operation tree with it is described at least one infused
There are the second mapping relations for second salt figure of volume equipment；Wherein, each registered device corresponds to an equipment to be verified, arbitrarily
Second salt figure of two registered devices is different.
In a kind of optional embodiment, the determining module is also used to: obtain the first bit arithmetic tree nodal information,
First salt figure of at least one equipment to be verified；According to the nodal information of the first bit arithmetic tree and it is described at least one
First salt figure of equipment to be verified determines the root node of the first bit arithmetic tree；According at least one described equipment to be verified
In each equipment to be verified the first salt figure and the equipment to be verified public key, generate the first cryptographic Hash of the equipment to be verified；
Determine the first cryptographic Hash of each equipment to be verified at least one described equipment to be verified, if with it is described at least one infused
Volume equipment in corresponding registered device the second cryptographic Hash it is consistent, the second cryptographic Hash of the registered device be according to this
What the public key of the second salt figure and the registered device of registering equipment generated.
In a kind of optional embodiment, the determining module is specifically used for: being believed according to the node of the first bit arithmetic tree
First salt figure of breath and at least one equipment to be verified, determines at least one node of the first bit arithmetic tree；According to
Preset bit exclusive-OR operation determines the section according to the brotgher of node of each node and the node at least one described node
The father node of point, until determining the root node of the first bit arithmetic tree.
In a kind of optional embodiment, the determining module is specifically used for: receiving the registered users are sent first
Cochain request, first cochain request is for by the public key of the public key of at least one registered device, registered users
It stores to block chain；The second cochain request that the registered users are sent is received, the second cochain request includes using institute
State second cryptographic Hash of the private key encryption of registered device；The public key of the registered device is obtained simultaneously from the block chain
Second cryptographic Hash of encryption is decrypted；In successful decryption, second cryptographic Hash is stored to the block chain
In；The third cochain request that the registered users are sent is received, the third cochain request includes using the registered use
The root node of the second operation tree of the private key encryption at family；The public key of the registered users is obtained simultaneously from the block chain
The second operation tree of encryption is decrypted；In successful decryption, the root node of the second operation tree is stored
To in the block chain.
In a kind of optional embodiment, the processing module is also used to: being received the update that the registered users are sent and is asked
It asks；It is described to update request and be used to indicate the second cryptographic Hash for regenerating at least one registered device and/or described the
The root node of two bit arithmetic trees, and stored again to the block chain.
In a kind of optional embodiment, the second salt figure of at least one registered device is N system positive integer；N
For the integer greater than 1；The processing module is also used to: being determined as follows the root node of the second operation tree: root
According to the second salt figure of at least one registered device, at least one binary integer is obtained；Wherein, each registered device
The second salt figure corresponding obtain a binary integer；According at least one described binary integer, according to second mapping
Relationship determines the leaf node of the second operation tree；The leaf node of the second operation tree includes the first leaf section
Point combination and the combination of the second leaf node；The first leaf node group is combined into the second operation tree and described at least one
There are the combinations of the leaf node of second mapping relations for second salt figure of a registered device；The second leaf node group
It is combined into the second operation tree to map with the second salt figure of at least one registered device there is no described second and close
The combination of the leaf node of system；The value of leaf node is 0 in the combination of second leaf node；According to the second operation tree
Leaf node generates the root node of the second operation tree.
The beneficial effect of above-mentioned second aspect and each embodiment of second aspect can refer to above-mentioned first aspect and first
The beneficial effect of each embodiment of aspect, which is not described herein again.
The third aspect, the embodiment of the present application provide a kind of computer equipment, including program or instruction, when described program or refer to
Order is performed, the method to execute above-mentioned first aspect and each embodiment of first aspect.
Fourth aspect, the embodiment of the present application provides a kind of storage medium, including program or instruction, when described program or instruction
It is performed, the method to execute above-mentioned first aspect and each embodiment of first aspect.
Detailed description of the invention
Fig. 1 is a kind of step flow diagram of the verification method applied to block chain provided by the embodiments of the present application；
Fig. 2 is the schematic diagram of user provided by the embodiments of the present application initialization；
Fig. 3 is the schematic diagram of second operation tree provided by the embodiments of the present application；
Fig. 4 is the schematic diagram of the root node generating process of the first bit arithmetic tree provided by the embodiments of the present application；
Fig. 5 is a kind of structural schematic diagram for verifying device provided by the embodiments of the present application.
Specific embodiment
In order to better understand the above technical scheme, below in conjunction with Figure of description and specific embodiment to above-mentioned
Technical solution is described in detail, it should be understood that the specific features in the embodiment of the present application and embodiment are to the application skill
The detailed description of art scheme, rather than the restriction to technical scheme, in the absence of conflict, the embodiment of the present application
And the technical characteristic in embodiment can be combined with each other.
In financial institution's (banking institution, insurance institution or security organization), in the business of progress, (loan transaction of such as bank is deposited
Money business etc.) in operation process, in financial technology field, the requirement to transaction security is high, and user is frequently present of needs
The equipment identities held to oneself verify the demand of its ownership.
In the prior art, the public key encryption one piece of data of authentication is used by system, and issues authentication, is made by authentication
With the private key decryption of oneself and comparison data or authentication actively use the private key signature one piece of data of oneself, and system makes
With the public key sign test and comparison data of authentication, this mode needs to be implemented more time-consuming rivest, shamir, adelman, especially
When user holds multiple equipment, need one by one to verify each equipment, it is clear that such case does not meet the finance such as bank
The demand of mechanism not can guarantee the high-efficiency operation of financial institution's items business.
For this purpose, the application provides a kind of verification method applied to block chain, as shown in Figure 1, mentioning for the embodiment of the present application
A kind of step flow diagram of the verification method applied to block chain supplied.
Step 101: determining the root node of the first bit arithmetic tree of user to be verified.
Wherein, the root node of the first bit arithmetic tree is according to the nodal information of the first bit arithmetic tree and described to be verified
What the first salt figure of at least one of user equipment to be verified determined；The leaf node of the first bit arithmetic tree and it is described at least
There are the first mapping relations for first salt figure of one equipment to be verified.
Step 102: if the root node of the first bit arithmetic tree is identical as the root node of second operation tree, it is determined that institute
It states user to be verified and holds at least one described equipment to be verified.
The root node of the second operation tree is at least one according to the corresponding registered users of the user to be verified
Second salt figure pre-generatmg of a registered device；The leaf node of the second operation tree with described at least one is registered
There are the second mapping relations for second salt figure of equipment；Wherein, the corresponding equipment to be verified of each registered device, any two
Second salt figure of a registered device is different.
Step 101~step 102 will be described in detail by an entire flow below.Whole process includes initializing
Journey, facility registration process, user registration course and device authentication process.Wherein, step 101~step 102 occurs to infuse in equipment
During volume.
It entirely completes in process, system participant includes three kinds: authentication side, user and equipment Three role.Body
Part authentication: authentication side specifically can be a verifier, this role can carry out body to the equipment that user is held
Part verifying.User: this role holds multiple equipment, while needing to verify equipment ownership.User can be according to being presently in
Step process classify, be known as registered users in the user that authentication side registered equipment tenure, and due to
The subsequent possible needs of user carry out verifying equipment tenure again, and user can be described as use to be verified before through authentication
Family.Equipment: i.e. various (Internet of Things) equipment held of user.Equipment can also classify according to the step process being presently in,
Such as registered device and equipment to be verified.
Initialization procedure is specific as follows:
Public key (Public Key) and private key (Private Key) are introduced first.Public key and private key are by a kind of algorithm
An obtained key pair (i.e. a public key and a private key), public key is part disclosed in cipher key pair, and private key is then non-public affairs
The part opened.Public key is commonly used in encrypted session key, verifying digital signature, or the number that encryption can be decrypted with corresponding private key
According to.Can guarantee it is worldwide only one by the key pair that this algorithm obtains.When using this key pair, such as
Fruit encrypts one piece of data with one of key, it is necessary to be decrypted with another key.For example it must just be used with public key encryption data
Private key decryption, if must also use public key decryptions with private key encryption, otherwise decryption will not succeed.
As shown in Fig. 2, for the schematic diagram of user provided by the embodiments of the present application initialization.
User generates user's such as elliptic curve digital signature algorithm (ECDSA) using the rivest, shamir, adelman of agreement
The held equipment public key and private key of public key and private key and the held equipment of user.For example, equipment A generate private key A with
And after equipment B generates private key B, private key A and private key B can be stored in the local data base of user, then private key A is corresponding
In the corresponding public key B deposit block chain of public key A and private key B.
Facility registration process is specific as follows:
It (1) is each equipment, the random random integers for generating a not designated length, referred to as the second salt of this equipment
Value, cannot be identical to the second salt figure of each equipment equipment generated.In addition, the equipment to be verified that user to be verified shows
Salt figure, referred to as the first salt figure of this equipment.Second salt figure is used as the input parameter of hash algorithm, is reflected with generating Hash
Penetrate value.This provides Hash anti-reflective to the ability broken through.Wherein, the second salt figure of equipment does not limit the integer of several systems, citing
For, it is decimal integer.Specifically, the second salt figure of equipment is 657.
(2) using the public key of equipment as original text, by the second salt figure of the equipment, using the Hash hash algorithm appointed,
(the first cryptographic Hash is the first salt figure of equipment to be verified for the cryptographic Hash of generating device salt figure, referred to as the second cryptographic Hash of the equipment
The cryptographic Hash temporarily generated with the public key of the equipment).Wherein, hash algorithm is the calculation to certain text string generation Hash mapping value
Method, such as sha3.Example: Hash (public key, 657)=8e00acc4cdea7eb98c1d81864abd7ebc793decc47b54f
f2a843513ee7a62666e。
(3) private key for using equipment, the cryptographic Hash of each equipment is stored into block chain.
User registration course is specific as follows:
When user's registration, according to the second salt figure of each equipment, second operation tree as shown in Figure 3 is generated.It needs
It is bright, when the first bit arithmetic tree is user's checking to be verified, the operation tree that temporarily generates.
Wherein, bit arithmetic tree (either the first bit arithmetic tree or second operation tree) is a kind of complete binary tree.
The node (node for having child node) of each non-leaf nodes in bit arithmetic tree, all according to the two of the node child nodes according to
Preset bit arithmetic generates.For example, preset bit arithmetic is exclusive or (XOR) bit arithmetic, and the bit arithmetic tree of generation is exclusive or
Bit arithmetic.Bit exclusive-OR operation are as follows: a kind of algorithm of digitwise operation, 0XOR0=0,0XOR1=1,1XOR1=0.Exclusive or, which meets, to be handed over
Change rule, associative law, reflexivity.Verification mode based on bit arithmetic can replace user frequently to use the need of individual device private key
It asks, XOR operation, ultrahigh in efficiency is used only in salt figure.
(1) the second salt figure (rectangular box i.e. shown in Fig. 3) for the registered device for being held user, according to second
Second mapping relations of operation tree carry out assignment.
For example, can according to the registered device that sequence from big to small is held user the second salt figure one by one
Arrangement, can be ranked up according to the lexicographic order of each registered device public key.By the second of sorted each equipment
Leaf node after the positive integer of salt figure switchs to binary system from the decimal system, according to the second mapping relations, as bit arithmetic tree.
A kind of situation are as follows: if the sum of leaf node is not 2 n times power (such as 4,8,16,32), that is to say, that second
There is the leaf node of the second salt figure without corresponding registered device in bit arithmetic tree, then by remaining the n times power for being not up to 2
Leaf node is filled up with preset value, that is, the leaf node that the second salt figure without corresponding registered device will be present is assigned with preset value
Value.Wherein, preset value can be 0.
(2) since the leaf node of the second operation tree, bit arithmetic is executed by layer, bit arithmetic value is generated, until root node.
Wherein, each non-leaf nodes (root node and node 1~6 as shown in Figure 3) of second operation tree is by the son of the node
Node generates.
(3) using the private key of user to be registered, the root node of the second operation tree is stored in block chain.
Therefore, one of user registration course optional embodiment is as follows:
Second salt figure of at least one registered device is N system positive integer；N is the integer greater than 1；The second
The root node of operation tree is determined as follows, comprising: according to the second salt figure of at least one registered device, is obtained
At least one binary integer；Wherein, the second salt figure of each registered device is corresponding obtains a binary integer；According to institute
At least one binary integer is stated, according to second mapping relations, determines the leaf node of the second operation tree；It is described
The leaf node of second operation tree includes the combination of the first leaf node and the combination of the second leaf node；First leaf node
Group is combined into the second operation tree to map with the second salt figure of at least one registered device there are described second and close
The combination of the leaf node of system；The second leaf node group be combined into the second operation tree with it is described at least one infused
There is no the combinations of the leaf node of second mapping relations for second salt figure of volume equipment；Leaf in the combination of second leaf node
The value of node is 0；According to the leaf node of the second operation tree, the root node of the second operation tree is generated.
It should be noted that in the above method, the value of the specific N of N system need all participants (user, authentication side,
Equipment) it makes an appointment.According to the second salt figure of at least one registered device, at least one binary integer mode is obtained
There are many.For example, if the second salt figure of registered device D is binary integer, directly by the second of registered device D
Salt figure is as the value for corresponding to leaf node in second operation tree；If the second salt figure of registered device D is not binary system
Second salt figure of integer, registered device D is decimal integer, then converts binary system for the second salt figure of registered device D
After integer, using the binary integer after conversion as the value for corresponding to leaf node in second operation tree.
Under aforesaid way, no matter the leaf node of the second operation tree whether the second salt figure at least one registered device
There are the second mapping relations, the leaf node of the second operation tree can assignment, a kind of necessarily can be generated second to provide
The mode of the root node of bit arithmetic tree.
Bonding apparatus registration process and user registration course, step 101 can execute following optional embodiment before:
The first cochain request that the registered users are sent is received, the first cochain request is used for described at least one
The public key of a registered device, the public key of registered users are stored to block chain.
Receive the second cochain request that the registered users are sent, the second cochain request include using it is described at least
Second cryptographic Hash of the private key encryption of one registered device；At least one registered device is obtained from the block chain
Public key is simultaneously decrypted second cryptographic Hash of encryption；In successful decryption, second cryptographic Hash is stored to described
In block chain.
The third cochain request that the registered users are sent is received, the third cochain request includes having infused using described
The root node of the second operation tree of the private key encryption of volume user；The public affairs of the registered users are obtained from the block chain
Key is simultaneously decrypted the root node of the second operation tree of encryption；In successful decryption, by the second operation tree
Root node store into the block chain.
First cochain request for by the public key of the public key of at least one registered device, registered users store to
Block chain, so as to the subsequent processing to the request of the second cochain and the request of third cochain, since the storage of block chain can not distort
Property, enhance the safety of the second cryptographic Hash and the storage of second operation tree.
In a kind of optional embodiment of the application, authentication side, user and equipment all have the direct reading of block chain
Write capability.If not having direct block chain access authority (needing proxy interface), there is man-in-the-middle attack can
Energy.User needs to access block chain by believable data channel.
Device authentication process is specific as follows:
The process illustrates for referring to Fig. 4.
(1) nodal information for the first bit arithmetic tree that user shows, the first salt figure of at least one equipment to be verified are obtained.
Wherein the nodal information of the first bit arithmetic tree be it is all can derive exclusive or root vertex, all necessary exclusive or trees believe
Breath.Such as the node for having underscore in Fig. 4, this includes: several exclusive or values (underscore in figure) and its pair in exclusive or tree
Position is answered, while it is high to further comprise tree.
(2) authentication side accesses block chain, the first salt figure and the equipment to be verified of equipment to be verified each first
The first cryptographic Hash that public key is obtained by hash algorithm, if it is identical as second cryptographic Hash of this equipment on block chain, if
It is identical, then carry out step (3).
(3) authentication root (is schemed according to the nodal information of the first bit arithmetic tree in conjunction with the first salt figure of equipment to be verified
First salt figure of the first salt figure of the equipment A to be verified in 4, equipment B to be verified), construct the first bit arithmetic tree, and from bottom to
On, the root node of the first operation tree is calculated.
(4) authentication side accesses block chain, will be second in the root node and block chain of the first operation tree that be calculated
The root node of operation tree compares, if identical, user's checking success.
Bonding apparatus verification process, step 101 can be with are as follows: obtain the first bit arithmetic tree nodal information, it is described extremely
First salt figure of few equipment to be verified；According to the nodal information of the first bit arithmetic tree and described at least one is to be verified
First salt figure of equipment determines the root node of the first bit arithmetic tree.
Specifically, according to the first salt of the nodal information of the first bit arithmetic tree and at least one equipment to be verified
Value determines that the root node process of the first bit arithmetic tree can be with are as follows:
According to the first salt figure of the nodal information of the first bit arithmetic tree and at least one equipment to be verified, determine
At least one node of the first bit arithmetic tree；According to preset bit exclusive-OR operation, according at least one described node
The brotgher of node of each node and the node determines the father node of the node, until determining the root section of the first bit arithmetic tree
Point.
Under aforesaid way, since the first salt figure of at least one equipment to be verified and the leaf node of the first bit arithmetic tree are deposited
At least one section of the first bit arithmetic tree neatly can be therefrom determined in conjunction with the nodal information of the first operation tree in mapping relations
Point, according still further to preset bit exclusive-OR operation, according to the brotgher of node of each node and the node at least one described node,
The father node of the node is determined, until the root node of the first bit arithmetic tree is determined, to provide a kind of flexible determining institute
The mode of the root node of the first bit arithmetic tree is stated, and bit exclusive-OR operation is a kind of higher bit arithmetic of efficiency in bit arithmetic, therefore,
Which can further promote verification efficiency and flexibility.
Following steps can be executed before step 102:
According to the first salt figure of each equipment to be verified at least one described equipment to be verified and the equipment to be verified
Public key generates the first cryptographic Hash of the equipment to be verified；Determine each equipment to be verified at least one described equipment to be verified
The first cryptographic Hash, if it is uniform with the second cryptographic Hash of corresponding registered device at least one described registered device
It causes, the second cryptographic Hash of the registered device is raw according to the second salt figure of the registered device and the public key of the registered device
At.
Under aforesaid way, the root node of the first operation tree is according to the nodal information of the first bit arithmetic tree got and extremely
What the first salt figure of few equipment to be verified obtained, it to be verified is set according to each at least one equipment to be verified got
The public key of standby the first salt figure and the equipment to be verified, generates the first cryptographic Hash of the equipment to be verified, then verify at least one
Whether the first cryptographic Hash of each equipment to be verified is consistent with corresponding second cryptographic Hash in equipment to be verified, thus further
Increase the reliability of verifying.
In some scenes, the equipment that user needs to increase, is newly-increased, deleting and transfer is held.At this moment it needs to give birth to again
At the second salt figure of the equipment that there is change, and regenerate the second operation tree.Specific as follows: equipment is newly-increased: description user is new
Increase a this scene of equipment.The second salt figure of newly added equipment is needed, newly executes a facility registration and user's registration process, i.e.,
The leaf node of newly-increased second operation tree, regenerates the second operation tree, and the root section of the second operation tree on more new block chain
Point.Equipment updates: description user updates this scene of salt figure of an equipment.User needs equipment salt of the more new equipment on chain
Value, re-executes a facility registration and user's registration process, that is, updates the leaf node of the second operation tree, regenerate second
Operation tree, and the root node of the second operation tree on more new block chain.Equipment is deleted: an equipment is removed oneself by description user
Hold list.User needs to delete leaf node, re-executes a facility registration and user's registration process, that is, updates second
The leaf node of operation tree generates the second operation tree, and the root node of the second operation tree on more new block chain, and more new block
The root node of the second operation tree on chain.
As can be seen that either increasing, being newly-increased, deleting the leaf node for requiring to update the second operation tree, lay equal stress on new life
At the second operation tree.As soon as user carries out primary after the number that the equipment in user hand is verified is more than certain threshold value
Equipment updates, for the second salt figure of equipment this moral hazard for preventing authentication side leakage user from showing.Equipment transfer:
As first sweep equipment, then newly added equipment.
Therefore, a kind of optional embodiment is as follows:
Receive the update request that the registered users are sent；Update request be used to indicate regenerate it is described at least
Second cryptographic Hash of one registered device and/or the root node of the second operation tree, and stored again to the block
Chain.
Second cryptographic Hash of at least one registered device and the root node of second operation tree may need to change
Become, aforesaid way provides a kind of the second cryptographic Hash for regenerating registered device in block chain and/or second fortune
Calculate the mode of the root node of tree.
In step 101~step 102 method, the root node of the first bit arithmetic tree of user to be verified is first determined, due to
The root node of first bit arithmetic tree is the according to the nodal information of the first bit arithmetic tree and at least one equipment to be verified
What one salt figure determined, and the of at least one equipment to be verified of the leaf node of the first bit arithmetic tree and the user to be verified
There are the first mapping relations for one salt figure, so that the root node of the first bit arithmetic tree is consider at least one equipment to be verified
What one salt figure just obtained, if the root node and for the first bit arithmetic tree determined according to the nodal information of the first bit arithmetic tree
The root node of two bit arithmetic trees is identical, can be at least one each equipment to be verified of equipment to be verified close to 1 determine the probability
The first salt figure and the second salt figure it is all the same, therefore avoid complicated rivest, shamir, adelman, can only be transported by simple position
It calculates, that is, can determine the user's checking success to be verified, bit arithmetic is the basic operations of computer, obtains the first bit arithmetic tree institute
The time of consuming is shorter, and the first bit arithmetic tree considers the first salt figure of at least one equipment to be verified, thus this method
Multiple equipment to be verified that user to be verified can disposably be verified, to be obviously improved verification efficiency.
Verification method provided by the embodiments of the present application applied to block chain has the advantage that
(1) performance advantage: compared to the mode for playing tradition dependence key or public private key pair, since bit arithmetic efficiency is centre
Device (CPU) is managed from just built-in function decades ago, therefore when number of devices is more, whether verification efficiency or exclusive or tree
The efficiency of reconstruction is all much higher than all other schemes, including the solution mutation based on Merkle tree.
(2) prevent cracking: since the value range of the second salt figure of equipment is entire positive integer domain, cryptographic Hash is by the of equipment
Two salt figures and public key generate, therefore inverse attack cracks equipment salt figure and is nearly impossible, thus, some user thinks counter to push away it
Second salt figure of some equipment of his user is also unpractical.Further, user can also by update salt figure come into
The promotion of one step cracks difficulty.
(3) bit arithmetic value (such as exclusive or value) is collided: the value of bit arithmetic value the result is that a binary value, although there is
Collision to a certain extent is possible (root that different leaf nodes obtains is the same).But when number of devices is less, due to salt figure
Selection randomness it is very high, therefore collision probability is lower, the appropriate digit for increasing by the second salt figure.And when number of devices increases, if
The quantity of the second standby salt figure increases the entropy of system.Even so, occur even if the bit arithmetic value of root node is collided, due to nothing
Method cracks the corresponding salt figure of each leaf node, can also be verified according to cryptographic Hash, is still unable to reach and steals other people and set
The standby purpose having for oneself.
Fig. 5 is a kind of structural schematic diagram for verifying device provided by the embodiments of the present application.
The application provides a kind of verifying device, comprising: determining module 501, for determining first fortune of user to be verified
Calculate the root node of tree；The root node of the first bit arithmetic tree be according to the nodal information of the first bit arithmetic tree and it is described to
What the first salt figure of at least one equipment to be verified of verifying user determined；The leaf node of the first bit arithmetic tree with it is described
There are the first mapping relations for first salt figure of at least one equipment to be verified；Processing module 502, if being used for first bit arithmetic
The root node of tree is identical as the root node of second operation tree, it is determined that the user to be verified holds that described at least one is to be tested
Demonstrate,prove equipment；The root node of the second operation tree be according to the corresponding registered users of the user to be verified at least one
Second salt figure pre-generatmg of registered device；The leaf node of the second operation tree with it is described at least one registered set
There are the second mapping relations for the second standby salt figure；Wherein, each registered device corresponds to an equipment to be verified, any two
Second salt figure of registered device is different.
In a kind of optional embodiment, the determining module 501 is also used to: the node for obtaining the first bit arithmetic tree is believed
First salt figure of breath, at least one equipment to be verified；According to the nodal information of the first bit arithmetic tree and it is described at least
First salt figure of one equipment to be verified determines the root node of the first bit arithmetic tree；At least one is to be verified according to described
The public key of first salt figure of each equipment to be verified and the equipment to be verified in equipment, generates the first Hash of the equipment to be verified
Value；Determine the first cryptographic Hash of each equipment to be verified at least one described equipment to be verified, if with it is described at least one
The second cryptographic Hash of corresponding registered device is consistent in registered device, and the second cryptographic Hash of the registered device is basis
What the second salt figure of the registered device and the public key of the registered device generated.
In a kind of optional embodiment, the determining module 501 is specifically used for: according to the node of the first bit arithmetic tree
First salt figure of information and at least one equipment to be verified determines at least one node of the first bit arithmetic tree；It presses
According to preset bit exclusive-OR operation, according to the brotgher of node of each node and the node at least one described node, determining should
The father node of node, until determining the root node of the first bit arithmetic tree.
In a kind of optional embodiment, the determining module 501 is specifically used for: receive that the registered users send the
The request of one cochain, first cochain request is for by the public affairs of the public key of at least one registered device, registered users
Key is stored to block chain；The second cochain request that the registered users are sent is received, the second cochain request includes using
Second cryptographic Hash of the private key encryption of the registered device；The public key of the registered device is obtained from the block chain
And second cryptographic Hash of encryption is decrypted；In successful decryption, second cryptographic Hash is stored to the block
In chain；The third cochain request that the registered users are sent is received, the third cochain request includes using described registered
The root node of the second operation tree of the private key encryption of user；The public key of the registered users is obtained from the block chain
And the second operation tree of encryption is decrypted；In successful decryption, the root node of the second operation tree is deposited
Storage is into the block chain.
In a kind of optional embodiment, the processing module 502 is also used to: receiving the update that the registered users are sent
Request；It is described to update request and be used to indicate the second cryptographic Hash for regenerating at least one registered device and/or described
The root node of second operation tree, and stored again to the block chain.
In a kind of optional embodiment, the second salt figure of at least one registered device is N system positive integer；N
For the integer greater than 1；The processing module 502 is also used to: it is determined as follows the root node of the second operation tree:
According to the second salt figure of at least one registered device, at least one binary integer is obtained；Wherein, each registered to set
The second standby salt figure is corresponding to obtain a binary integer；According at least one described binary integer, reflected according to described second
Relationship is penetrated, determines the leaf node of the second operation tree；The leaf node of the second operation tree includes the first leaf
Combination of nodes and the combination of the second leaf node；The first leaf node group be combined into the second operation tree with it is described at least
There are the combinations of the leaf node of second mapping relations for second salt figure of one registered device；Second leaf node
Group, which is combined into the second operation tree, is not present second mapping with the second salt figure of at least one registered device
The combination of the leaf node of relationship；The value of leaf node is 0 in the combination of second leaf node；According to the second operation tree
Leaf node, generate the root node of the second operation tree.
The embodiment of the present application provides a kind of computer equipment, including program or instruction, when described program or instruction are performed
When, to execute a kind of verification method applied to block chain provided by the embodiments of the present application and any optional method.
The embodiment of the present application provides a kind of storage medium, including program or instruction, when described program or instruction be performed,
To execute a kind of verification method applied to block chain provided by the embodiments of the present application and any optional method.
Finally, it should be noted that it should be understood by those skilled in the art that, embodiments herein can provide as method, be
System or computer program product.Therefore, the application can be used complete hardware embodiment, complete software embodiment or combine software
With the form of the embodiment of hardware aspect.Moreover, it wherein includes that computer can use journey that the application, which can be used in one or more,
The computer implemented in the computer-usable storage medium (including but not limited to magnetic disk storage, optical memory etc.) of sequence code
The form of program product.
The application be referring to according to the present processes, equipment (system) and computer program product flow chart and/or
Block diagram describes.It should be understood that each process that can be realized by computer program instructions in flowchart and/or the block diagram and/or
The combination of process and/or box in box and flowchart and/or the block diagram.It can provide these computer program instructions to arrive
General purpose computer, special purpose computer, Embedded Processor or other programmable data processing devices processor to generate one
Machine, so that being generated by the instruction that computer or the processor of other programmable data processing devices execute for realizing flowing
The device for the function of being specified in journey figure one process or multiple processes and/or block diagrams one box or multiple boxes.
These computer program instructions, which may also be stored in, is able to guide computer or other programmable data processing devices with spy
Determine in the computer-readable memory that mode works, so that it includes referring to that instruction stored in the computer readable memory, which generates,
Enable the manufacture of device, the command device realize in one box of one or more flows of the flowchart and/or block diagram or
The function of being specified in multiple boxes.
Obviously, those skilled in the art can carry out various modification and variations without departing from the model of the application to the application
It encloses.In this way, if these modifications and variations of the application belong within the scope of the claim of this application and its equivalent technologies, then
The application is also intended to include these modifications and variations.
Claims (12)
1. a kind of verification method applied to block chain characterized by comprising
Determine the root node of the first bit arithmetic tree of user to be verified；The root node of the first bit arithmetic tree is according to described
What the first salt figure of at least one equipment to be verified of the nodal information of one bit arithmetic tree and the user to be verified determined；It is described
There are the first mapping relations for the leaf node of first bit arithmetic tree and the first salt figure of at least one equipment to be verified；
If the root node of the first bit arithmetic tree is identical as the root node of second operation tree, it is determined that the user to be verified
Hold at least one described equipment to be verified；The root node of the second operation tree is corresponding according to the user to be verified
Second salt figure pre-generatmg of at least one registered device of registered users；The leaf node of the second operation tree with
There are the second mapping relations for second salt figure of at least one registered device；Wherein, each registered device corresponding one
Second salt figure of a equipment to be verified, any two registered device is different.
2. the method as described in claim 1, which is characterized in that the root section of the first bit arithmetic tree of the determination user to be verified
Point, comprising:
Obtain the nodal information of the first bit arithmetic tree, the first salt figure of at least one equipment to be verified；
According to the first salt figure of the nodal information of the first bit arithmetic tree and at least one equipment to be verified, determine described in
The root node of first bit arithmetic tree；
Before determining that the user to be verified holds at least one described equipment to be verified, further includes:
According to the public key of the first salt figure of each equipment to be verified and the equipment to be verified at least one described equipment to be verified,
Generate the first cryptographic Hash of the equipment to be verified；
Determine the first cryptographic Hash of each equipment to be verified at least one described equipment to be verified, if with it is described at least one
The second cryptographic Hash of corresponding registered device is consistent in registered device, and the second cryptographic Hash of the registered device is basis
What the second salt figure of the registered device and the public key of the registered device generated.
3. method according to claim 2, which is characterized in that the nodal information according to first operation tree and described
First salt figure of at least one equipment to be verified determines the root node of the first bit arithmetic tree, comprising:
According to the first salt figure of the nodal information of the first bit arithmetic tree and at least one equipment to be verified, determine described in
At least one node of first bit arithmetic tree；
According to preset bit exclusive-OR operation, according to the brotgher of node of each node and the node at least one described node,
The father node of the node is determined, until determining the root node of the first bit arithmetic tree.
4. method according to claim 2, which is characterized in that the root section of the first bit arithmetic tree of the determination user to be verified
Before point, further includes:
Receive the first cochain request that the registered users are sent, the first cochain request for will it is described at least one
The public key of the public key, registered users of registering equipment is stored to block chain；
Receive the second cochain request that the registered users are sent, the second cochain request include using it is described at least one
Second cryptographic Hash of the private key encryption of registered device；
The public key of at least one registered device is obtained from the block chain and second cryptographic Hash of encryption is carried out
Decryption；
In successful decryption, second cryptographic Hash is stored into the block chain；
The third cochain request that the registered users are sent is received, the third cochain request includes using the registered use
The root node of the second operation tree of the private key encryption at family；
From the block chain obtain the registered users public key and to the root node of the second operation tree of encryption into
Row decryption；
In successful decryption, the root node of the second operation tree is stored into the block chain.
5. method as claimed in claim 4, which is characterized in that the method also includes:
Receive the update request that the registered users are sent；Update request be used to indicate regenerate it is described at least one
The root node of second cryptographic Hash of registered device and/or the second operation tree, and stored again to the block chain.
6. method a method as claimed in any one of claims 1 to 5, which is characterized in that the second salt figure of at least one registered device
It is N system positive integer；N is the integer greater than 1；The root node of the second operation tree is determined as follows, comprising:
According to the second salt figure of at least one registered device, at least one binary integer is obtained；Wherein, it has each infused
Second salt figure of volume equipment is corresponding to obtain a binary integer；
The leaf of the second operation tree is determined according to second mapping relations according at least one described binary integer
Child node；The leaf node of the second operation tree includes the combination of the first leaf node and the combination of the second leaf node；It is described
First leaf node group is combined into the second operation tree that there are institutes with the second salt figure of at least one registered device
State the combination of the leaf node of the second mapping relations；The second leaf node group be combined into the second operation tree with it is described
There is no the combinations of the leaf node of second mapping relations for second salt figure of at least one registered device；Second leaf section
The value of leaf node is 0 in point combination；
According to the leaf node of the second operation tree, the root node of the second operation tree is generated.
7. a kind of verifying device characterized by comprising
Determining module, the root node of the first bit arithmetic tree for determining user to be verified；The root section of the first bit arithmetic tree
Point is first according at least one equipment to be verified of the nodal information and user to be verified of the first bit arithmetic tree
What salt figure determined；There are for first salt figure of the leaf node of the first bit arithmetic tree and at least one equipment to be verified
One mapping relations；
Processing module, if the root node for the first bit arithmetic tree is identical as the root node of second operation tree, it is determined that
The user to be verified holds at least one described equipment to be verified；The root node of the second operation tree be according to it is described to
Verify the second salt figure pre-generatmg of at least one registered device of the corresponding registered users of user；Second bit arithmetic
There are the second mapping relations for the leaf node of tree and the second salt figure of at least one registered device；Wherein, it has each infused
Volume equipment corresponds to an equipment to be verified, and the second salt figure of any two registered device is different.
8. device as claimed in claim 7, which is characterized in that the determining module is also used to:
Obtain the nodal information of the first bit arithmetic tree, the first salt figure of at least one equipment to be verified；
According to the first salt figure of the nodal information of the first bit arithmetic tree and at least one equipment to be verified, determine described in
The root node of first bit arithmetic tree；
According to the public key of the first salt figure of each equipment to be verified and the equipment to be verified at least one described equipment to be verified,
Generate the first cryptographic Hash of the equipment to be verified；
Determine the first cryptographic Hash of each equipment to be verified at least one described equipment to be verified, if with it is described at least one
The second cryptographic Hash of corresponding registered device is consistent in registered device, and the second cryptographic Hash of the registered device is basis
What the second salt figure of the registered device and the public key of the registered device generated.
9. device as claimed in claim 8, which is characterized in that the determining module is specifically used for:
According to the first salt figure of the nodal information of the first bit arithmetic tree and at least one equipment to be verified, determine described in
At least one node of first bit arithmetic tree；
According to preset bit exclusive-OR operation, according to the brotgher of node of each node and the node at least one described node,
The father node of the node is determined, until determining the root node of the first bit arithmetic tree.
10. device as claimed in claim 8, which is characterized in that the processing module is also used to:
Receive the first cochain request that the registered users are sent, the first cochain request for will it is described at least one
The public key of the public key, registered users of registering equipment is stored to block chain；
Receive the second cochain request that the registered users are sent, the second cochain request include using it is described at least one
Second cryptographic Hash of the private key encryption of registered device；
The public key of at least one registered device is obtained from the block chain and second cryptographic Hash of encryption is carried out
Decryption；
In successful decryption, second cryptographic Hash is stored into the block chain；
The third cochain request that the registered users are sent is received, the third cochain request includes using the registered use
The root node of the second operation tree of the private key encryption at family；
From the block chain obtain the registered users public key and to the root node of the second operation tree of encryption into
Row decryption；
In successful decryption, the root node of the second operation tree is stored into the block chain.
11. device as claimed in claim 10, which is characterized in that the processing module is also used to:
Receive the update request that the registered users are sent；Update request be used to indicate regenerate it is described at least one
The root node of second cryptographic Hash of registered device and/or the second operation tree, and stored again to the block chain.
12. the device as described in claim 8-11 is any, which is characterized in that the second salt of at least one registered device
Value is N system positive integer；N is the integer greater than 1；The determining module is also used to:
It is determined as follows the root node of the second operation tree:
According to the second salt figure of at least one registered device, at least one binary integer is obtained；Wherein, it has each infused
Second salt figure of volume equipment is corresponding to obtain a binary integer；According at least one described binary integer, according to described
Two mapping relations determine the leaf node of the second operation tree；The leaf node of the second operation tree includes first
Leaf node combination and the combination of the second leaf node；The first leaf node group be combined into the second operation tree with it is described
There are the combinations of the leaf node of second mapping relations for second salt figure of at least one registered device；Second leaf
Combination of nodes is to be not present described second with the second salt figure of at least one registered device in the second operation tree
The combination of the leaf node of mapping relations；The value of leaf node is 0 in the combination of second leaf node；
According to the leaf node of the second operation tree, the root node of the second operation tree is generated.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910668695.3A CN110351297B (en) | 2019-07-23 | 2019-07-23 | Verification method and device applied to block chain |
| PCT/CN2020/096425 WO2021012841A1 (en) | 2019-07-23 | 2020-06-16 | Verification method and device applied to blockchain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910668695.3A CN110351297B (en) | 2019-07-23 | 2019-07-23 | Verification method and device applied to block chain |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110351297A true CN110351297A (en) | 2019-10-18 |
| CN110351297B CN110351297B (en) | 2022-04-01 |
Family
ID=68179966
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910668695.3A Active CN110351297B (en) | 2019-07-23 | 2019-07-23 | Verification method and device applied to block chain |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN110351297B (en) |
| WO (1) | WO2021012841A1 (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2021012841A1 (en) * | 2019-07-23 | 2021-01-28 | 深圳前海微众银行股份有限公司 | Verification method and device applied to blockchain |
| CN113420084A (en) * | 2021-06-07 | 2021-09-21 | 广东辰宜信息科技有限公司 | Block chain system |
| CN113570194A (en) * | 2021-06-28 | 2021-10-29 | 北京电链科技有限公司 | Block chain-based power construction business data processing method and system |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114139206B (en) * | 2021-12-06 | 2024-04-05 | 常州大学 | Multi-user heterogeneous data merging and concurrent evidence method based on blockchain privacy protection |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107682308A (en) * | 2017-08-16 | 2018-02-09 | 北京航空航天大学 | The electronic evidence preservation system for Channel Technology of being dived based on block chain |
| CN109040082A (en) * | 2018-08-10 | 2018-12-18 | 阿里巴巴集团控股有限公司 | Certification, verification method and the device of the identity content information of user |
| CN109064174A (en) * | 2018-08-09 | 2018-12-21 | 肇庆市高新区甜慕新能源技术有限公司 | A method of the registration service of particular certificate is provided on block chain |
| CN109101572A (en) * | 2018-07-17 | 2018-12-28 | 何晓行 | Card method, apparatus and server, storage medium are deposited based on block chain |
| EP3429122A1 (en) * | 2017-07-11 | 2019-01-16 | Panasonic Intellectual Property Corporation of America | Methods and apparatuses for controlling electronic voting |
| CN109903049A (en) * | 2019-03-01 | 2019-06-18 | 长沙理工大学 | A kind of block chain transaction data storage method, device, equipment and storage medium |
Family Cites Families (5)
| 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 |
| US11316696B2 (en) * | 2017-09-29 | 2022-04-26 | R3 Ltd. | Hash subtrees for grouping components by component type |
| CN108304737A (en) * | 2018-01-26 | 2018-07-20 | 鑫银科技集团股份有限公司 | A kind of data verification method, electronic equipment and data verification system |
| CN108737109A (en) * | 2018-05-11 | 2018-11-02 | 北京奇虎科技有限公司 | Data proof of possession method, apparatus and system |
| CN110351297B (en) * | 2019-07-23 | 2022-04-01 | 深圳前海微众银行股份有限公司 | Verification method and device applied to block chain |
-
2019
- 2019-07-23 CN CN201910668695.3A patent/CN110351297B/en active Active
-
2020
- 2020-06-16 WO PCT/CN2020/096425 patent/WO2021012841A1/en active Application Filing
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP3429122A1 (en) * | 2017-07-11 | 2019-01-16 | Panasonic Intellectual Property Corporation of America | Methods and apparatuses for controlling electronic voting |
| CN107682308A (en) * | 2017-08-16 | 2018-02-09 | 北京航空航天大学 | The electronic evidence preservation system for Channel Technology of being dived based on block chain |
| CN109101572A (en) * | 2018-07-17 | 2018-12-28 | 何晓行 | Card method, apparatus and server, storage medium are deposited based on block chain |
| CN109064174A (en) * | 2018-08-09 | 2018-12-21 | 肇庆市高新区甜慕新能源技术有限公司 | A method of the registration service of particular certificate is provided on block chain |
| CN109040082A (en) * | 2018-08-10 | 2018-12-18 | 阿里巴巴集团控股有限公司 | Certification, verification method and the device of the identity content information of user |
| CN109903049A (en) * | 2019-03-01 | 2019-06-18 | 长沙理工大学 | A kind of block chain transaction data storage method, device, equipment and storage medium |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2021012841A1 (en) * | 2019-07-23 | 2021-01-28 | 深圳前海微众银行股份有限公司 | Verification method and device applied to blockchain |
| CN113420084A (en) * | 2021-06-07 | 2021-09-21 | 广东辰宜信息科技有限公司 | Block chain system |
| CN113420084B (en) * | 2021-06-07 | 2023-09-26 | 广东辰宜信息科技有限公司 | Block chain system |
| CN113570194A (en) * | 2021-06-28 | 2021-10-29 | 北京电链科技有限公司 | Block chain-based power construction business data processing method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110351297B (en) | 2022-04-01 |
| WO2021012841A1 (en) | 2021-01-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106254374B (en) | A kind of cloud data public audit method having duplicate removal function | |
| US11580321B2 (en) | Systems, devices, and methods for machine learning using a distributed framework | |
| Yu et al. | Attribute-based cloud data integrity auditing for secure outsourced storage | |
| CN108965258B (en) | Cloud environment data integrity verification method based on fully homomorphic encryption | |
| CN110351297A (en) | A kind of verification method and device applied to block chain | |
| Jin et al. | Dynamic and public auditing with fair arbitration for cloud data | |
| US10277395B2 (en) | Cryptographic key-generation with application to data deduplication | |
| TW202020710A (en) | System and method for information protection | |
| JP5790319B2 (en) | Signature verification apparatus, signature verification method, program, and recording medium | |
| TW202020711A (en) | System and method for information protection | |
| WO2019034984A1 (en) | Random number generation in a blockchain | |
| JP6069852B2 (en) | Information processing apparatus, information processing method, and program | |
| CN113162768A (en) | Intelligent Internet of things equipment authentication method and system based on block chain | |
| CN108123934A (en) | A kind of data integrity verifying method towards mobile terminal | |
| CN106487786A (en) | A kind of cloud data integrity verification method based on biological characteristic and system | |
| Etemad et al. | Generic dynamic data outsourcing framework for integrity verification | |
| US11416821B1 (en) | Apparatuses and methods for determining and processing dormant user data in a job resume immutable sequential listing | |
| CN109274504A (en) | A kind of multi-user's big data storage sharing method and system based on cloud platform | |
| US20230254299A1 (en) | Apparatus and methods for credentialing users across user devices | |
| CN109818944A (en) | It is a kind of to support pretreated cloud data outsourcing and integrity verification method and device | |
| CN109784094B (en) | Batch outsourcing data integrity auditing method and system supporting preprocessing | |
| Junxiang et al. | Dynamic provable data possession with batch-update verifiability | |
| CN116547944A (en) | Signature generation device, authentication device, and program | |
| Li et al. | Large Branching Tree Based Dynamic Provable Data Possession Scheme. | |
| US11856095B2 (en) | Apparatus and methods for validating user data by using cryptography |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |