CN110445795A - A kind of block chain certification uniqueness confirmation method - Google Patents

A kind of block chain certification uniqueness confirmation method Download PDF

Info

Publication number
CN110445795A
CN110445795A CN201910746615.1A CN201910746615A CN110445795A CN 110445795 A CN110445795 A CN 110445795A CN 201910746615 A CN201910746615 A CN 201910746615A CN 110445795 A CN110445795 A CN 110445795A
Authority
CN
China
Prior art keywords
node
alliance
uniqueness
block
collection
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
Application number
CN201910746615.1A
Other languages
Chinese (zh)
Other versions
CN110445795B (en
Inventor
不公告发明人
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Easy to sign chain (Shenzhen) Technology Co.,Ltd.
Original Assignee
Guangzhou Zhi Hong Science And Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Guangzhou Zhi Hong Science And Technology Co Ltd filed Critical Guangzhou Zhi Hong Science And Technology Co Ltd
Priority to CN201910746615.1A priority Critical patent/CN110445795B/en
Publication of CN110445795A publication Critical patent/CN110445795A/en
Application granted granted Critical
Publication of CN110445795B publication Critical patent/CN110445795B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00Network architectures or network communication protocols for network security
    • H04L63/08Network architectures or network communication protocols for network security for authentication of entities
    • H04L63/0807Network architectures or network communication protocols for network security for authentication of entities using tickets, e.g. Kerberos
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32Cryptographic 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/321Cryptographic 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 a third party or a trusted authority
    • H04L9/3213Cryptographic 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 a third party or a trusted authority using tickets or tokens, e.g. Kerberos
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/50Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Hardware Design (AREA)
  • Computing Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The present invention provides a kind of block chains to authenticate uniqueness confirmation method, this method comprises: constructing dynamic authorization node collection for each alliance, subregion verifies virtual token uniqueness;Build file data is broadcast to internal all confirmation nodes by the agency of alliance;Node is confirmed according to the sequence of head information, and the same virtual token of synchronization can only authenticate once, i.e., same VC_ID does not allow to appear in the build file data of other alliances.Block chain proposed by the present invention authenticates uniqueness confirmation method, the agency of all alliances is broadcast to by the node collection that keeps accounts by global alliance's block, message or block are broadcast to the certification node of affiliated alliance again by acting on behalf of, it can help to eliminate the network blockage by being broadcast directly to the initiation of the whole network node, alleviate message time-out or block update delay is too long.

Description

A kind of block chain certification uniqueness confirmation method
Technical field
The present invention relates to block chain, in particular to a kind of block chain authenticates uniqueness confirmation method.
Background technique
Block chain is the distributed basis framework verified using linked data structure with storing data.Due to block link network Network is mutually verified between capable of realizing node by algorithm, and safety can be realized without relying on central server in distributed book keeping operation mode Authentication.Each newly generated block is promoted in strict accordance with timeline sequence, it is intended to which invasion is distorted data in block chain and believed The behavior of breath is easy to be traced.Therefore, block chain technology has obtained increasingly extensive application in field of identity authentication.However, existing There is the block chain in technology as the data scale of construction is increasing, if authentication each time will be by all certification nodes It verifies, hence it is evident that will lead to delay and handling capacity is lower;And all identification authentication datas are taken together into the data volume so that account book Geometry grade increases, if by individually authenticating node maintenance, it is clear that the carrying cost for also resulting in entire block catenary system is higher.
Summary of the invention
To solve the problems of above-mentioned prior art, the invention proposes a kind of block chain structureizations to store controlling party Method, comprising:
Multiple alliances are formed into alliance's block chain, the storage of block chain composed by multiple certification nodes in alliance is virtual to be enabled The authentication content of board;Authorization node collection is dynamically determined for each alliance, carries out core for the uniqueness to virtual token It is real.
Preferably, the alliance has unique identity, and request certification both sides can initiate to authenticate by different alliances Request, and virtual token can be transmitted in any alliance, the virtual token is globally unique.
Preferably, the certification request is described are as follows:
TR=(src, des, VC_ID, key, TR_ID);
Wherein VC_ID is the whole network unique identification of the virtual token VC, and src indicates virtual token sender;Des is indicated Virtual token recipient;Key indicates request certification both sides' private key;TR_ID indicates that the whole network unique authentication of certification request requests ID;
There are three types of states for the certification request TR tool:
S (TR)={ not determining, Pending The Entry Into Force comes into force };
Meet uniqueness by verifying authentication content, the state of identity is switched to come into force by not determination;Pass through verification Authentication content is unsatisfactory for uniqueness, and the state of identity switchs to Pending The Entry Into Force by not determination.
Preferably, authorization node collection dynamic change at any time, the authorization node collection of each alliance is from other connection of the whole network It votes and generates in the certification node of alliance.
Preferably, it votes in the certification node from other alliances of the whole network and generates the behaviour of the authorization node collection of each alliance Make by the agency of current alliance initiated, the agency votes in from the inside block chain of current alliance, and it is responsible and its The agent communication of his alliance.
Preferably, the authorization node collection of all alliances randomly chooses a group node as the node that keeps accounts from the whole network node Collection;The hash index for meeting the authentication of uniqueness is sent to the node that keeps accounts by the confirmation node that authorization node collection is included Collection;The node collection that keeps accounts updates global alliance block.
Preferably, be set for the authorization node collection and the node collection that keeps accounts validity period.
The present invention compared with prior art, has the advantage that
The invention proposes a kind of block chain structure storage controlling methods, are realized by constructing multi-level block chain structure Block capacity is expansible, and alleviates and postpone increase problem caused by authentication procedures, ensure that each authentication exists Uniqueness in entire block catenary system.
Detailed description of the invention
Fig. 1 is the flow chart of block chain structure storage controlling method according to an embodiment of the present invention.
Specific embodiment
Retouching in detail to one or more embodiment of the invention is hereafter provided together with the attached drawing of the diagram principle of the invention It states.The present invention is described in conjunction with such embodiment, but the present invention is not limited to any embodiments.The scope of the present invention is only by right Claim limits, and the present invention covers many substitutions, modification and equivalent.Illustrate in the following description many details with Just it provides a thorough understanding of the present invention.These details are provided for exemplary purposes, and without in these details Some or all details can also realize the present invention according to claims.
An aspect of of the present present invention provides a kind of block chain structure storage controlling method.Fig. 1 is to implement according to the present invention The block chain structure storage controlling method flow chart of example.
The present invention constructs multi-level alliance's block chain, and participant is multiple alliances, and alliance has unique identity, Each alliance is made of multiple certification nodes, the internal identity authentication content of the block chain storage virtual token of each alliance;It is empty Quasi- token is globally unique, can be transmitted in any alliance;Request certification both sides can initiate certification request by different alliances, and can Virtual token is transmitted in any alliance.Block chain inside each alliance's maintenance, all collectives, alliance safeguard global alliance chain; The authorization node collection of each alliance verifies the uniqueness of virtual token, guarantees that virtual token is all satisfied uniquely in different alliances Property.By constructing dynamic authorization node collection for each alliance, subregion verifies virtual token uniqueness, improves throughput of system; Authorization node collection dynamic change at any time prevents alliance from acting in collusion altered data.
Global alliance's chain is stored with reliable token hashes index, the block chain storage internal authentication node of each alliance Authentication data.The inside block chain of alliance votes in a certification node, the referred to as agency of the alliance, and agency is responsible for and other The agent communication of alliance;Ballot generates the authorization node collection of current alliance from the certification node of other alliances of the whole network.
The authorization node collection of all alliances randomly chooses a group node as the node collection that keeps accounts from the whole network node;Alliance Initial authorization node collection is voted from the whole network node generation by the agency of alliance, keep accounts node collection by all alliances start node Collection is voted from the whole network node and is generated.Build file data is broadcast to the authorization node collection of alliance by the agency of alliance;Alliance Authorization node collection verifies whether authentication meets uniqueness;
The hash index for meeting the authentication of uniqueness is sent to the node collection that keeps accounts by the confirmation node of alliance;Keep accounts section Point set updates global alliance block.
The virtual token VC passes through VC_ID the whole network unique identification.The certification request be described as TR=(src, des, VC_ID, key, TR_ID), src indicates virtual token sender;Des indicates virtual token recipient;Key indicates request certification Both sides' private key;TR_ID indicates that certification request ID, certification request ID the whole network are unique.There are three types of authentication result tools state S (TR)= { not determining, Pending The Entry Into Force comes into force }.Meet uniqueness by verifying authentication content, the state of identity is switched to give birth to by not determination Effect;It is unsatisfactory for uniqueness by verifying authentication content, the state of identity switchs to Pending The Entry Into Force by not determination.The certification TR to come into force Meet the authentication of uniqueness.The alliance Ai∈{P1..., PN, N indicates the quantity of alliance in block chain network.
Alliance AiIt indicates that participant different in block chain network is identified using public key address, and saves other alliances Identity.Each alliance includes multiple certification node ANij, j≤ni, ANijIndicate alliance AiJ-th of certification node, ni Indicate alliance AiCertification number of nodes.It is communicated between certification node by asynchronous message mechanism.According to different needs Wallet is arranged different roles, comprising: the node UN that keeps accounts, confirmation node VN, Generic Authentication node ON.The node that keeps accounts is responsible for dimension Protect global alliance chain;Confirmation node is responsible for verifying whether authentication meets uniqueness;The node that keeps accounts is safeguarded with confirmation node Whether internal block chain and verification authentication meets the uniformity in tissue.Generic Authentication node, which only initiates certification, asks Whether block chain and verification authentication inside asking, safeguarding meet the uniformity in tissue.Authenticate node by public key Location is identified.
Alliance AiAll certification node ANijStorage alliance AiPrivate key, utilize alliance AiPrivate key and authenticate node private Key signs to block.Alliance AiAuthorization node collection VNGiIt is made of confirmation node, verifies alliance AiCertification whether meet Uniqueness;Alliance AiAuthorization node collection dynamic change, current grant node collection randomly choose one from the whole network node at any time Group node is as alliance AiNext validity period confirm node collection.Keep accounts node collection UNGiBy keeping accounts, node is formed, and currently keep accounts section Point set randomly chooses a group node by the host node of the authorization node collection of each unit validity period all alliances from the whole network and forms, And dynamic change at any time.
For example, it is assumed that the whole network is by alliance A1, A2, A3Three alliance's compositions, each alliance separately include 7 certification sections Point.By voting in certification node A11, A21, A31It is acted on behalf of accordingly as each alliance.Then A11It is responsible for from other alliances A2, A3Certification node in ballot generate alliance A1Authorization node collection VNG1, it is assumed that initial VNG1Node integrates as A22, A35。A21It is responsible for From alliance A1, A3Certification node in ballot generate alliance A2Authorization node collection VNG2, it is assumed that initial VNG2Node integrates as A12, A34。A31It is responsible for from alliance A1, A2Certification node in ballot generate alliance A3Authorization node collection VNG3, it is assumed that initial VNG3Section Point set is A15, A24.All above-mentioned authorization node collection A22, A35, A12, A34, A15, A24One group of section is randomly choosed from the whole network node Point is as the node collection that keeps accounts, it is assumed that is A23, A37, A15.That is node A22, A35It is applied not only to determine the node collection that keeps accounts, also monitoring connection Alliance A1Certification whether meet uniqueness, and be to come into force by the status modifier for verifying the certification request ID passed through, be then forwarded to Keep accounts node collection A23, A37, A15.Similarly, node A12, A34Monitor alliance A2Certification whether meet uniqueness, node A15, A24Prison Control alliance A3Certification whether meet uniqueness, will verify the status modifier of certification request ID passed through is to come into force, and is then sent To the node collection A that keeps accounts23, A37, A15.The node collection that keeps accounts is for constructing global alliance's block.
Based on block chain structure of the invention, it is assumed that a certain alliance A3Attempt to tamper with itself authentication data and correlation zone Block, for the block to come into force, the block in global alliance's block chain after need to distorting is sent to all certification nodes (i.e. A31,..., A37) verified;And the alliance need to change together all global alliances chain blocks after change block;It needs simultaneously Change every other alliance (A1And A2Totally 14 nodes) certification block chain, such high cost data for making malicious modification It is almost difficult to come into force.
Block chain is formed by alliance's sub-district block chaining inside alliance, authentication data and build inside the storage of alliance's block File;Build file stores the TR_ID of all certifications in this block, authenticating party list, VC_ID;Global alliance's block then will not It is chained up with alliance's block chain, constitutes global alliance chain.Global alliance's block only stores the certification that comes into force for meeting uniqueness, lattice Formula is as follows: GB=<exp_ID, PB_ID, NB_ID, and TRset>, wherein PB_ID indicates the mark of block chain inside alliance, NB_ID Indicate the hash index value of alliance's block on PB_ID, TRset indicates the TR_ID set of authentic authentication, including corresponding virtual Token VC_ID, exp_ID indicate current affiliated time limit serial number, when new alliance is added, are worked as according to exp_ID quick obtaining Preceding and new authorization node collection, keep accounts node collection.
Authorization node collection is directed to each alliance AiBuilding, authorization node collection, which verifies authentication using build file data, is No to meet uniqueness, certification node belonging to alliance passes through the block chain inside common recognition algorithm maintenance, alliance AiAuthorization node There will be no the TR_ID of the certification of the Uniqueness to be sent to the node collection that keeps accounts for collection;The TR_ID only authenticated is kept accounts node collection It is written in global alliance's chain, which is just identified as authentic authentication.
Preferably, there are a validity periods for authorization node collection.In authorization node collection generating process, current grant node collection It is alliance A before validity period reachesiConstruct the authorization node collection of next validity period.It specifically, is guarantee alliance AiInitially award It weighs node and concentrates the safe node that at least there is more than half, alliance AiAgency select M confirmation node at random from the whole network As alliance AiInitial authorization node collection, M > 3N/4.Select a confirmation node as alliance A in each allianceiAuthorization section The both candidate nodes of point set;Selection result is sent to other M-1 confirmation node and alliance AiAgency;Frequency of occurrence is most M confirmation node as alliance AiAuthorization node collection VNGi;Statistical result is broadcast to recognizing for inside by the agency of each alliance Demonstrate,prove node, VNGiIn each confirmation node be in communication with each other, thereby confirm that and establish connection between node.
By Byzantine theorem it is found that at least there is the trusted node of 3N/4 or more in the whole network, it can thus be appreciated that N number of node Chain at most there are N/4 incredible main bodys, therefore block chain more new node be concentrated to it is few comprising (N+1)/2 safety certification Node, so block chain more new node collection is believable.
Preferably, before the end of the validity period, current grant node collection VNGiM alliance is randomly choosed, in each alliance Select a node for meeting the following conditions as alliance AiNext validity period authorization node collection VNGi, i.e., any node is not Can be continuously as the confirmation node of any alliance, and M > 3N/4;The voting results of this node are sent to other M-1 confirmation section Point and alliance AiAgency;M most node of statistics frequency of occurrence is as new VNG againi, and by final result, that is, next The candidate authorization node collection of validity period is sent to the node collection that keeps accounts.Next validity period candidate node set is gone out occurrence by the node collection that keeps accounts The most confirmation node of number is as alliance AiNext validity period authorization node collection VNGi.When the node collection that keeps accounts calculate it is all When the new authorization node collection of alliance, by the node listing of new authorization node collection be sent to the current confirmation node of each alliance with And new confirmation node.Node UN keep accounts for the VNG of each allianceiNode listing is broadcast to the agency of 1/4 alliance, Mei Gelian The node collection message of next validity period is sent to internal certification node by the agency of alliance.Based on the above mechanism, guarantee is next to be had Effect phase confirmation node receives the node listing information of correct authorization node collection.
Within each validity period, alliance AiAuthorization node collection verify alliance AiCertification whether meet uniqueness.It is preferred that Ground, alliance AiAgency internal build file data is broadcast to alliance AiAuthorization node collection VNGi;VNGiIt will meet unique The TR_ID of the authentication of property is broadcasted to the node collection that keeps accounts.The authorization node collection of all alliances selects one group from the whole network node Keep accounts node collection UNG of the node as next validity period.
Based on previous example, authorization node collection A is being determined22, A35, A12, A34, A15, A24Later, if it exceeds one It presets validity period, such as 10 minutes, then authorization node collection A22, A35, A12, A34, A15, A24Authorization node role will fail.Therefore Within ten minutes, for alliance A1, A2, A3, A is acted on behalf of accordingly11, A21, A31Organize present node collection A22, A35, A12, A34, A15, A24It votes, reselects next round authorization node collection, it is assumed that the new authorization node collection selected according to votes For A25, A32, A16, A37, A11, A23, voting results are broadcasted in each alliance, then by new authorization node collection from the whole network node In select the node collection that keeps accounts of next validity period, may be, for example, A13, A36, A14.The node collection that keeps accounts is for constructing global area, alliance Block.
In the authorization node collection by after being sent to and keep accounts node collection of the authentication for meeting uniqueness, keep accounts node collection Construct global alliance block;And alliance AiAfter build file data is sent to authorization node collection, without waiting for authorization node collection Verification, continue construct alliance AiGlobal alliance's block.
If each authentication is broadcast to all nodes of the whole network by alliance, TOCOM total communication cost is N2;If alliance will have The authentication content of body is sent to the internal authentication node of other alliances, Yi Yinfa leakage of private information problem.If alliance will Block content is broadcasted to the whole network, and authenticating the uniqueness verification time can be elongated, increases the storage of block chain and maintenance cost.To reduce net Network communication cost simultaneously improves throughput of system, and the preferential embodiment of the present invention carries out core using uniqueness of the following procedure to certification Real confirmation:
Alliance AiAgency build file data is broadcast to internal all confirmation nodes;Confirm node according to head information Sequentially, verified according to the uniqueness that following rule carries out alliance's block: the same virtual token of synchronization can only authenticate once, I.e. same VC_ID does not allow to appear in the build file data of other alliances.Build file includes following information: internal block The TR_ID list of all certifications, relevant authenticating party list, alliance's private key, creation time, the cryptographic Hash of previous block, VC_ID List, the ID of current overall situation alliance block.Alliance AiAuthorization node collection will present node collection verify after have recognizing for uniqueness Card TR_ID is sent to the node collection that keeps accounts in form of a message, and message format MSG is as follows: Msg=< PB_ID, NB_ID, TR_ID, VC_ID, BlockID, Key >, BlockID is the private key of current global alliance block number, Key expression node;Keep accounts node collection root Can only occur primary rule in same block according to same VC_ID and guarantee that authentication content meets uniqueness.In the currently active phase At the end of, it is current to confirm that node VN terminates all build file data verification process, and delete untreated build file data. Alliance AiBuild file data is broadcast to authorization node collection VNGi, within certain time interval, if alliance AiDo not receive Verification result then sends the build file data again.Using the above mechanism, for being aborted the build file data of verification, Delay is maximum to be no more than the time interval.
As it can be seen that global alliance's block is broadcast to the agency of all alliances by the node collection that keeps accounts, by act on behalf of again by message or Block is broadcast to the certification node of affiliated alliance;Since general networking is in order between internal certification node;Therefore based on this The mechanism of invention can help to eliminate the network blockage by being broadcast directly to the initiation of the whole network node, alleviate message time-out or area It is too long that block updates delay.
When selection it is new keep accounts node collection when, vote information is sent to the section that currently keeps accounts by the authorization node collection of all alliances Point set is counted votes highest M nodes by the node collection that currently keeps accounts, and as the section that keeps accounts of next validity period Point set, while the node collection information that keeps accounts of next validity period is sent to all alliances by each confirmation node by the way of multicast Agency and next validity period keep accounts node collection, i.e., each keep accounts node by message be broadcast to the agency of 1/4 alliance of the whole network with Next validity period keeps accounts node.
Face similarly keep accounts task when, due to hardware processing capability difference between different nodes, it is possible that high calculate Power node is idle, and low calculation power node is then constantly in busy state, influences whole efficiency.Therefore of the invention further In embodiment, the calculation power of certification node is comprehensively considered when ballot selection keeps accounts node.The node calculates power Memory capacity, nucleus number, dominant frequency, bus I/O rate and network bandwidth, and the mode of weighted sum calculates the calculation power of certification node.
Node force parameter is calculated first to calculate using normalization:
Wherein, UijRepresent alliance AiJ-th certification node normalized calculation force parameter, UjIndicate alliance AiJ-th Initial parameter before authenticating node normalization, Umin iRepresent alliance AiIn each node same parameters minimum value,Represent alliance AiIn respectively calculate the average value of force parameter.niIndicate alliance AiCertification number of nodes.
According to parameter normalization as a result, can calculate power to node hardware carries out accurate description, and calculate the weighting of each component Average value U 'ij
U’ij=k1×Uij(1)+k2×Uij(2)+…+kx×Uij(x)
Wherein, Uij(1)、Uij(2)…Uij(x) node to be obtained according to parameter normalization calculates x component of force parameter, Such as memory capacity, core frequency, bandwidth etc., k1, k2... kxRepresent corresponding weight, i.e. shadow of the performance quantities to node calculation power The degree of sound.
Preferably, node is kept accounts after the interactive process every time with authorization node, table of the authorization node to the node that keeps accounts It now scores, with SCijRepresentative keeps accounts after node j provides interaction for authorization node i, and authorization node i is to keeping accounts what node j gave Score.
Therefore, whenever new authorization node collection selected from the whole network node it is new keep accounts node collection when, by U 'ij×SCijMake For the reference weight of the whole network ballot.
In global alliance's block building process, if all nodes both participate in competition and generate global alliance block, it can make It is high at delay, calculate power waste.Therefore global alliance's block generting machanism is improved in the preferred embodiment of the invention to improve system Handling capacity.Specifically, when constructing block, block body is constructed by the way of individual branches, independently updated each branch avoids Limitation to throughput of system.Each unit validity period ballot selects multiple host nodes to construct global alliance's block simultaneously, according to Time sequencing verifies global alliance's block of each primary node constructs, and the node collection that keeps accounts will verify the global area, alliance passed through at first Block is broadcasted to the agency of all alliances, while deleting global alliance's block of other primary node constructs.It is effective by each unit The multiple host nodes of phase ballot construct block simultaneously, postpone the problem of increasing to reduce malicious node as host node bring.
The node that each keeps accounts is known together the global alliance's block passed through at first based on timestamp judgement, and by this area, global alliance Block is broadcast to the agency of Z alliance, N/4 < Z < 3N/4;Since each node receives repeatedly global alliance block, therefore can guarantee Node receives correctly global alliance block.
In conclusion the invention proposes a kind of block chain structure storage controlling method, by constructing multi-level block It is expansible that chain structure realizes block capacity, and alleviates and postpone increase problem caused by authentication procedures, ensure that every time Uniqueness of the authentication in entire block catenary system.
Obviously, it should be appreciated by those skilled in the art, each module of the above invention or each steps can be with general Computing system realize that they can be concentrated in single computing system, or be distributed in multiple computing systems and formed Network on, optionally, they can be realized with the program code that computing system can be performed, it is thus possible to they are stored It is executed within the storage system by computing system.In this way, the present invention is not limited to any specific hardware and softwares to combine.
It should be understood that above-mentioned specific embodiment of the invention is used only for exemplary illustration or explains of the invention Principle, but not to limit the present invention.Therefore, that is done without departing from the spirit and scope of the present invention is any Modification, equivalent replacement, improvement etc., should all be included in the protection scope of the present invention.In addition, appended claims purport of the present invention Covering the whole variations fallen into attached claim scope and boundary or this range and the equivalent form on boundary and is repairing Change example.

Claims (10)

1. a kind of block chain authenticates uniqueness confirmation method, wherein the block chain is multi-level alliance's block chain, participant For multiple alliances, each alliance is made of multiple certification nodes, the internal identity of the block chain storage virtual token of each alliance Authentication content;The authorization node collection of each alliance verifies the uniqueness of virtual token, guarantees virtual token in different alliances It is all satisfied uniqueness, which comprises the following steps: construct dynamic authorization node collection for each alliance, subregion is verified Virtual token uniqueness;Build file data is broadcast to internal all confirmation nodes by the agency of alliance;Confirm node according to head The sequence of information, verified according to the uniqueness that following rule carries out alliance's block: the same virtual token of synchronization can only be recognized Card is primary, i.e., same VC_ID does not allow to appear in the build file data of other alliances.
2. block chain according to claim 1 authenticates uniqueness confirmation method, which is characterized in that the agency of the alliance is The certification node that the inside block chain of alliance votes in is responsible for the agent communication with other alliances;The current alliance Authorization node collection be from other alliances of the whole network certification node in ballot generate;The method also includes all alliances Authorization node collection randomly chooses a group node as the node collection that keeps accounts from the whole network node;The initial authorization node collection of alliance is by joining The agency of alliance votes generation from the whole network node;The node collection that keeps accounts is voted from the whole network node by the start node collection of all alliances It generates;The authorization node collection of all alliances randomly chooses a group node as the node collection that keeps accounts from the whole network node.
3. -2 described in any item block chains authenticate uniqueness confirmation method according to claim 1, which is characterized in that the method Further include: the hash index for meeting the authentication of uniqueness is sent to the node collection that keeps accounts by the confirmation node of alliance, and keep accounts section Point set updates global alliance block.
4. -2 described in any item block chains authenticate uniqueness confirmation method according to claim 1, which is characterized in that described virtual Token passes through VC_ID the whole network unique identification;The certification request is described as TR=(src, des, VC_ID, key, TR_ID), src Indicate virtual token sender;Des indicates virtual token recipient;Key indicates request certification both sides' private key;TR_ID expression is recognized Card request ID, certification request ID the whole network are unique.
5. -2 described in any item block chains authenticate uniqueness confirmation method according to claim 1, which is characterized in that build file Include following information: the TR_ID list of internal all certifications of block, relevant authenticating party list, alliance's private key, creation time, The cryptographic Hash of previous block, VC_ID list, the ID of current overall situation alliance block.
6. -2 described in any item block chains authenticate uniqueness confirmation method according to claim 1, which is characterized in that alliance awards The certification TR_ID that power node collection has uniqueness after verifying present node collection is sent to the node collection that keeps accounts in form of a message, Message format MSG is as follows: Msg=<PB_ID, NB_ID, TR_ID, VC_ID, BlockID, Key>, BlockID is current global Alliance's block number, Key indicate the private key of node;The node collection that keeps accounts can only occur in same block once according to same VC_ID Rule guarantee that authentication content meets uniqueness.
7. -2 described in any item block chains authenticate uniqueness confirmation method according to claim 1, which is characterized in that have currently It is current to confirm that node VN terminates all build file data verification process at the end of the effect phase, and delete untreated build file Data.
8. -2 described in any item block chains authenticate uniqueness confirmation method according to claim 1, which is characterized in that alliance Ai will Build file data is broadcast to authorization node collection VNGi, within certain time interval, if alliance Ai does not receive verification knot Fruit then sends the build file data again.
9. -2 described in any item block chains authenticate uniqueness confirmation method according to claim 1, which is characterized in that in vote Select the calculation power that certification node is considered when keeping accounts node;The node calculate power include but is not limited to memory capacity, it is nucleus number, dominant frequency, total Line I/O rate and network bandwidth, and the mode of weighted sum calculates the calculation power of certification node.
10. block chain according to claim 9 authenticates uniqueness confirmation method, which is characterized in that the node calculates power meter Calculation process is as follows:
A. node force parameter is calculated to calculate using normalization:
Wherein, Uij represents the normalized calculation force parameter of j-th of certification node of alliance Ai, and Uj indicates that j-th of alliance Ai is recognized Initial parameter before demonstrate,proving node normalization, Umini represent the minimum value of each node same parameters in alliance Ai, represent in alliance Ai Each average value for calculating force parameter.The certification number of nodes of ni expression alliance Ai;
B. according to parameter normalization as a result, can calculate power to node hardware carries out accurate description, and the weighting for calculating each component is flat Mean value
U ' ij=k1×Uij(1)+k2×Uij(2)+…+kx×Uij(x) (2)
Wherein, Uij (1), Uij (2) ... Uij (x) are that the node obtained according to parameter normalization calculates x component of force parameter, example Such as memory capacity, core frequency, bandwidth etc., k1, k2 ... kx represents corresponding weight, i.e. the performance quantities shadow of calculating node power The degree of sound.
C. node is kept accounts after the interactive process every time with authorization node, and authorization node counts the performance for the node that keeps accounts Point, it is score that authorization node i gives the node j that keeps accounts after authorization node i is provided and interacted using the SCij representative node j that keeps accounts;
Whenever new authorization node collection selected from the whole network node it is new keep accounts node collection when, thrown U ' ij × SCij as the whole network The reference weight of ticket.
CN201910746615.1A 2018-11-30 2018-11-30 Block chain authentication uniqueness confirmation method Active CN110445795B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910746615.1A CN110445795B (en) 2018-11-30 2018-11-30 Block chain authentication uniqueness confirmation method

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201811450068.4A CN109347877B (en) 2018-11-30 2018-11-30 Block chain structure storage controlling method
CN201910746615.1A CN110445795B (en) 2018-11-30 2018-11-30 Block chain authentication uniqueness confirmation method

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
CN201811450068.4A Division CN109347877B (en) 2018-11-30 2018-11-30 Block chain structure storage controlling method

Publications (2)

Publication Number Publication Date
CN110445795A true CN110445795A (en) 2019-11-12
CN110445795B CN110445795B (en) 2021-12-14

Family

ID=65319419

Family Applications (2)

Application Number Title Priority Date Filing Date
CN201910746615.1A Active CN110445795B (en) 2018-11-30 2018-11-30 Block chain authentication uniqueness confirmation method
CN201811450068.4A Active CN109347877B (en) 2018-11-30 2018-11-30 Block chain structure storage controlling method

Family Applications After (1)

Application Number Title Priority Date Filing Date
CN201811450068.4A Active CN109347877B (en) 2018-11-30 2018-11-30 Block chain structure storage controlling method

Country Status (1)

Country Link
CN (2) CN110445795B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111915303A (en) * 2020-10-14 2020-11-10 广东博嘉拓建筑科技有限公司 Workload settlement method, device, server and medium

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110324421B (en) * 2019-07-03 2021-08-27 广东投盟科技有限公司 Information processing method and block chain node equipment
CN111818152B (en) * 2020-07-02 2021-04-30 电子科技大学 Leader election consensus method based on distributed network
CN112738215B (en) * 2020-12-28 2023-03-24 杭州趣链科技有限公司 Block chain node authorization method, block chain node authorization device, terminal equipment and medium

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107426157B (en) * 2017-04-21 2020-04-17 杭州趣链科技有限公司 Alliance chain authority control method based on digital certificate and CA authentication system
CN107147735B (en) * 2017-05-12 2020-08-11 北京博晨技术有限公司 Distributed account book system based on hierarchical structure
CN107528886B (en) * 2017-07-25 2020-07-31 中国科学院计算技术研究所 Block chain full-network splitting method and system
CN108737418B (en) * 2018-05-22 2020-09-15 飞天诚信科技股份有限公司 Identity authentication method and system based on block chain
CN108833081B (en) * 2018-06-22 2021-01-05 中国人民解放军国防科技大学 Block chain-based equipment networking authentication method

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111915303A (en) * 2020-10-14 2020-11-10 广东博嘉拓建筑科技有限公司 Workload settlement method, device, server and medium

Also Published As

Publication number Publication date
CN109347877B (en) 2019-10-01
CN109347877A (en) 2019-02-15
CN110445795B (en) 2021-12-14

Similar Documents

Publication Publication Date Title
CN109347877B (en) Block chain structure storage controlling method
Yu et al. Repucoin: Your reputation is your power
Cai et al. Enabling reliable keyword search in encrypted decentralized storage with fairness
CN109842606B (en) Block chain consensus algorithm and system based on consistent Hash algorithm
CN109542888B (en) Data modification and synchronization method, device, equipment and storage medium of block chain
CN110505239B (en) Information processing method and device based on block chain network and electronic equipment
CN109587238B (en) Data processing and synchronizing method, device, equipment and storage medium of block chain
CN109508982A (en) REPB common recognition based on the more subchains of block chain main chain adduction row
CN110611701B (en) Parameter configuration and transaction processing method based on block chain
CN111988137B (en) DPoS (dual port service) consensus method and system based on threshold signature and fair reward
WO2021135934A1 (en) Blockchain accounting method and apparatus, node and storage medium
US20200286049A1 (en) Systems and methods of self-administered protocols on a blockchain platform
CN110855432B (en) Asynchronous BFT &amp; DPOS consensus mechanism for assigning verifier rewards based on verifiable random functions
CN110602217B (en) Block chain-based alliance management method, device, equipment and storage medium
CN113853578A (en) Method for generating random numbers in a blockchain intelligent contract
CN111182510B (en) Industrial Internet of things node consensus method based on block chain
CN112651830B (en) Block chain consensus method applied to power resource sharing network
CN113940032A (en) Method and apparatus for recording work history and certifying reputation in blockchain networks
CN113783700B (en) Authority and interest proving method and system capable of monitoring safety under fragmented block chain
CN109685505A (en) Byzantine failure tolerance common recognition optimization method based on association ring signatures
CN113132401A (en) Data processing method and device based on block chain
KR20220007152A (en) Method and device for registering and authenticating miner identity in blockchain network
CN114422146A (en) Anonymous sorting method for block chain main nodes
CN111865595A (en) Block chain consensus method and device
CN115643047A (en) Block chain identity authentication method based on honest rewards

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
TA01 Transfer of patent application right
TA01 Transfer of patent application right

Effective date of registration: 20211124

Address after: 518000 No. A15, floor 4, block r2-b, Gaoxin industrial village, No. 020, Gaoxin South seventh Road, Gaoxin community, Yuehai street, Nanshan District, Shenzhen, Guangdong

Applicant after: Easy to sign chain (Shenzhen) Technology Co.,Ltd.

Address before: 510000 Building A30, 68 Nanxiang Road, Huangpu District, Guangzhou City, Guangdong Province

Applicant before: GUANGZHOU ZHIHONG TECHNOLOGY CO.,LTD.

GR01 Patent grant
GR01 Patent grant