CN110198233A - Block chain consensus method and system based on trusted execution environment and directed acyclic graph - Google Patents
Block chain consensus method and system based on trusted execution environment and directed acyclic graph Download PDFInfo
- Publication number
- CN110198233A CN110198233A CN201910385696.7A CN201910385696A CN110198233A CN 110198233 A CN110198233 A CN 110198233A CN 201910385696 A CN201910385696 A CN 201910385696A CN 110198233 A CN110198233 A CN 110198233A
- Authority
- CN
- China
- Prior art keywords
- event
- node
- directed acyclic
- acyclic graph
- block chain
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/30—Decision processes by autonomous network management units using voting and bidding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
- H04L2209/46—Secure multiparty computation, e.g. millionaire problem
- H04L2209/463—Electronic voting
-
- 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
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Technology Law (AREA)
- Economics (AREA)
- Marketing (AREA)
- Strategic Management (AREA)
- Development Economics (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Storage Device Security (AREA)
- Computer And Data Communications (AREA)
Abstract
The invention discloses a block chain consensus method and a block chain consensus system based on a trusted execution environment and a directed acyclic graph, and the method comprises the steps of receiving an event set sent by a neighbor node, judging whether an event is legal or not based on trusted execution environment information carried by a new event, adding the legal event set into the directed acyclic graph of the node, judging that the event has achieved consensus if any event is agreed by nodes with more than a specified number in the block chain system, and ending the current round of consensus; all nodes pack the generated transaction to the generated new event, a neighbor node is randomly selected, and an event set which is known by the node and is unknown by the neighbor node is sent to the neighbor node through a gossip message. The invention can effectively reduce the network communication overhead, simplify the process of achieving consensus, improve the efficiency of achieving consensus, improve the expandability and the throughput rate of the nodes and reduce the resource consumption of event storage.
Description
Technical field
The present invention relates to the common recognition technologies of block chain, and in particular to a kind of based on credible performing environment and directed acyclic graph
Block chain common recognition method and system.
Background technique
Block chain common recognition is one of the core technology of block chain, for each common recognition main body of block chain to the friendship on block chain
Easy data are reached common understanding, and distributed consistent account book is ultimately formed.Existing block chain common recognition method is according to its block chain data
Structure can be divided into the common recognition based on block chain structure and be based on the two methods of common recognition of directed acyclic graph (DAG).One, it is chained based on block
The common recognition method of structure has proof of work (PoW), and equity proves (PoS), practical Byzantium (PBFT) etc..Wherein, PoW presence can
The problems such as scalability is low, throughput is low, resource consumption is big, PoS are the improved methods of PoW, although PoS improves certain effect
Rate reduces the consumption of resource, but there are the risks of centralization.The cost on network communication that PBFT common recognition method needs is larger,
It is unfavorable for the extension of its main body of knowing together.Two, block chain common recognition method such as byte snowball (byteball), Hash based on DAG
Scheme (Hashgraph) etc., although there is certain promotion in throughput and scalability, dynamic does not become its main body of knowing together
Change, and process of knowing together is sufficiently complex.
Summary of the invention
The technical problem to be solved in the present invention: it in view of the above problems in the prior art, provides a kind of based on credible execution ring
The block chain of border and directed acyclic graph common recognition method and system, the present invention can be effectively reduced cost on network communication, and simplification is reached
The process of common recognition improves the efficiency reached common understanding, and improves throughput, and reduce the resource consumption of event storage.
In order to solve the above-mentioned technical problem, the technical solution adopted by the present invention are as follows:
A kind of to be known together method based on the block chain of credible performing environment and directed acyclic graph, arbitrary node executes common recognition in block chain
Implementation steps include:
1) event sets that neighbor node is sent are received；
2) the credible performing environment information carried based on new events judges whether each of event sets new events are legal, such as
Each new events of fruit are legal and this node is honest node, then this node votes through the proposal in event, jumps and holds
Row step 3)；Otherwise, the event sets received are abandoned, terminates epicycle and knows together and exit；
3) event sets received are added in the directed acyclic graph of this node；
4) for all events in the directed acyclic graph of this node, if any one event is more than specified number in block catenary system
The confirmation of the node of amount then determines that the event has been reached common understanding；Otherwise it jumps and performs the next step；
5) judge whether this node has new proposal, if there is new proposal, then generate the new events comprising new proposal, if
Not new proposal then generates empty new events；
6) neighbor node is randomly choosed, is determined according to the directed acyclic graph of the directed acyclic graph of this node, the neighbor node
This node knows and the ignorant event sets of the neighbor node, and this node is known and the ignorant event of the neighbor node
Set is sent to the neighbor node by gossip message.
Preferably, the credible performing environment information carried in step 2 based on new events judges each of event sets
The whether legal detailed step of new events includes:
2.1) the transmission event counter value C carried in the new events being judged is readi；
2.2) source node for obtaining the new events that transmission is judged sends the transmission event counter value carried in an event
Ci-1, the transmission event counter value be source node based on the transmission event counter in credible performing environment to send event into
Row continuous counter and send when insertion event in obtain；
2.3) judgement sends event counter value Ci-1, send event counter value CiIt is whether continuous, if the two continuously if determine to be judged to
Disconnected new events are legal；Otherwise, it is determined that the new events being judged are illegal.
Preferably, when the event sets received being added in the directed acyclic graph of this node in step 3), the thing that will receive
Each of part set event is stored according to received sequencing, and this node parent pointer of each event is directed toward this section
A upper event for point, other node parent pointers are directed toward the event in source node, each event package in the event sets received
Containing two this node parent pointer, other node parent pointers cryptographic Hash the event of this node is formed with according to this node parent pointer
Directed acyclic graph is formed by other node parent pointers to acyclic figure, and between adjacent node.
The present invention also provides a kind of based on the block chain of credible performing environment and directed acyclic graph common recognition system, including calculates
Machine equipment, the computer equipment are programmed or configure aforementioned based on credible performing environment and directed acyclic graph to execute the present invention
Block chain know together method the step of.
The present invention also provides a kind of based on the block chain of credible performing environment and directed acyclic graph common recognition system, including calculates
Machine equipment is stored on the storage medium of the computer equipment and is programmed or configures that the present invention is aforementioned to be held based on credible to execute
The computer program of the block chain of row environment and directed acyclic graph common recognition method.
The present invention also provides a kind of computer readable storage medium, it is stored with and is compiled on the computer readable storage medium
Journey or configuration are to execute the aforementioned computer based on the block chain of credible performing environment and directed acyclic graph common recognition method of the present invention
Program.
Compared to the prior art, the present invention has an advantage that
1, whether the credible performing environment information carried the present invention is based on new events judges each of event sets new events
It is legal, to reduce transmission of the illegal data for node of doing evil in block chain, it can be effectively reduced cost on network communication,
Simplify the process reached common understanding, improves the efficiency reached common understanding.
2, the event sets that the present invention is received by directed acyclic graph storage, simplify the storage and extension of event, can
Scalability, the throughput of node are improved, and reduces the resource consumption of event storage.
Detailed description of the invention
Fig. 1 is the basic procedure schematic diagram of present invention method.
Fig. 2 is the directed acyclic illustrated example in the embodiment of the present invention.
Fig. 3 is the schematic illustration of ballot of knowing together in the embodiment of the present invention.
The structure chart of directed acyclic graph when Fig. 4 is system dispersion in the embodiment of the present invention
Fig. 5 is the structure chart of directed acyclic graph when system merges in the embodiment of the present invention.
Specific embodiment
As shown in Figure 1, the present embodiment is based on the block chain of credible performing environment and directed acyclic graph common recognition method, block chain
Middle arbitrary node executes the implementation steps known together
1) event sets that neighbor node is sent are received；
2) the credible performing environment information carried based on new events judges whether each of event sets new events are legal, such as
Each new events of fruit are legal and this node is honest node, then this node votes through the proposal in event, jumps and holds
Row step 3)；Otherwise, the event sets received are abandoned, terminates epicycle and knows together and exit；
3) event sets received are added in the directed acyclic graph of this node；
4) for all events in the directed acyclic graph of this node, if any one event is more than specified number in block catenary system
The confirmation of the node of amount (being half node in block catenary system in the present embodiment, furthermore can also be according to other threshold values of setting),
Then determine that the event has been reached common understanding；Otherwise it jumps and performs the next step；
5) judge whether this node has new proposal, if there is new proposal, then generate the new events comprising new proposal, if
Not new proposal then generates empty new events；
6) neighbor node is randomly choosed, is determined according to the directed acyclic graph of the directed acyclic graph of this node, the neighbor node
This node knows and the ignorant event sets of the neighbor node, and this node is known and the ignorant event of the neighbor node
Set is sent to the neighbor node by gossip message.
In the present embodiment, the credible performing environment information carried in step 2 based on new events judges every in event sets
One whether legal detailed step of new events includes:
2.1) the transmission event counter value C carried in the new events being judged is readi；
2.2) source node for obtaining the new events that transmission is judged sends the transmission event counter value carried in an event
Ci-1, the transmission event counter value be source node based on the transmission event counter in credible performing environment to send event into
Row continuous counter and send when insertion event in obtain；
2.3) judgement sends event counter value Ci-1, send event counter value CiIt is whether continuous, if the two continuously if determine to be judged to
Disconnected new events are legal；Otherwise, it is determined that the new events being judged are illegal.
One special hardware --- credible performing environment (TEE), utilization is credible for each node configuration in the present embodiment
Performing environment binds message.The counter that credible performing environment provides a simple monotonic increase (sends event
Counter), when sending event every time, all generates a new transmission event counter value and bound with event, ensured that in this way
The count value for the event binding that node issues every time is all different, prevents node that the proposal of opposite content is sent to different use
Family is done evil, and bifurcated is caused to attack, because if the two proposals must when different proposals is sent to different users
Different count value a and a+1 are bundled with, when user receives a+1 without receiving a, just have reason to suspect that the node is being made
It dislikes, to refuse the event of his transmission.
In the present embodiment, when being added the event sets received in the directed acyclic graph of this node in step 3), it will receive
Each of event sets event stored according to received sequencing, and this node parent pointer of each event
(self-parent) it is directed toward a upper event of this node, other node parent pointers (other-parent) are directed toward in source node
The event, each event includes that two this section point parent pointer, other node parent pointers cryptographic Hash make in the event sets received
The event for obtaining this node forms directed acyclic graph according to this node parent pointer, and passes through other node parent pointers between adjacent node
Form directed acyclic graph.The present embodiment is based on the block chain of credible performing environment and directed acyclic graph common recognition method for distribution
Each node reaches Byzantium's common recognition in network, and the present embodiment is based on credible performing environment (TEE) and directed acyclic graph (DAG),
Each node can initiate to propose, the whole network is waited to reach common understanding, and proposal is packaged into event by node, and the content of event is in addition to mentioning
Further include two cryptographic Hash except view, indicates the pointer for being directed toward other two events.Each node receives other equipment transmission
After event, it is saved in local, a directed acyclic graph DAG is eventually formed according to Hash pointer.
As shown in Fig. 2, the circle with number in figure indicates that event, four time shafts A, B, C and D are shown respectively one by one
4 nodes, all events that each node is sent arrange on the time shaft of oneself according to sequencing from the bottom up.?
On same root time shaft, per a newly-generated event, which needs comprising the cryptographic Hash with an event on time shaft, and claims
A upper event is this node father vertex (self-parent) of newly-generated event.Also forgive in the newly-generated event simultaneously
Another hash value, the hash are the hash value of some event on another time shaft, and claim on another time shaft
Event is other node father vertexes (other-parent) of newly-generated event, i.e., the thing for the arrow meaning that event issues in figure one
Part.For example, this node father vertex (self-parent) of event 5 is event 6, other node father vertexes (other-parent)
It is event 1.Over time, directed acyclic graph DAG increases upwards, and new event is in upper, old event under.It is all
Event propagated by gossip agreement, node randomly chooses a neighbor node every time, be sent to it is known to oneself and
The no all events of neighbours.When node sends event every time, a new event will be first generated, inside the event
The hash value and proposal of its self-parent and other-parent are filled in, if not proposing to initiate, the proposal of the event
Content can be sky, and self-parent is exactly the event of current the top on same root time shaft, and other-parent
The event of the top in the event exactly received.In such as figure one, when node C carries out gossip communication to node D, C
That oneself is known and the ignorant event of node D is sent to node D, node D only has event 8 at this time, and node C has event 1,
2,3,4,5,6.Therefore event sets { 1,2,3,4,5,6 } are sent to node D by node C, node D receive event sets it
Afterwards, legitimate verification first is carried out to these events, is added it in local directed acyclic graph DAG after being verified, and
New event 7 is generated, this node father vertex (self-parent) is exactly event 8, other node father vertexes (other-
It parent) is exactly event 5.Therefore, each node of all events can have local according to the event creation one received
To acyclic figure DAG, then reach common understanding to the event on directed acyclic graph DAG.For the node of all honesty, Ta Mendou
Identical directed acyclic graph DAG can be taken, therefore finally can also be reached an agreement to the common recognition of event.The process that event is reached common understanding
It is that the process for collecting ballot can first verify its legitimacy when node receives event, how legal, then honest node
It can agree to the proposal that the event is initiated, then the event is added in the directed acyclic graph DAG of oneself, and be passed by gossip
Other nodes are passed, therefore the event that all nodes that half in system is exceeded in directed acyclic graph DAG were agreed to all is
The event reached common understanding, if the Black Event in Fig. 3 is exactly the event reached common understanding.
As shown in figure 4, common recognition main body is changed when block catenary system interior joint disperses to form subsystem, at this point,
Subsystems carry out that (i.e. execution the present embodiment is based on credible performing environment and directed acyclic graph according to identical common recognition process
Block chain is known together method), gossip is mutually sent between the node in subsystem, and different subsystems no longer interacts.Subsystem
System is internal still can just to reach common understanding in new proposal, need to only collect the ballot of subsystem node number half at this time.Such as Fig. 5
Shown, when subsystem merges into an entirety, the node of two subsystems starts mutual transmission event (i.e. execution the present embodiment
Based on the block chain of credible performing environment and directed acyclic graph common recognition method), according to identical rule, neighbor node is not had
Event synchronization is gone over, and that knows together at this time reaches the half ballot for needing to collect the number of whole system node.Therefore, the present embodiment
It not only can be adapted for static block catenary system based on the block chain of credible performing environment and directed acyclic graph common recognition method, also
It can be adapted for that block catenary system interior joint disperses to form subsystem and subsystem merges the process to form block catenary system.
The present embodiment also provides a kind of based on the block chain of credible performing environment and directed acyclic graph common recognition system, including meter
Machine equipment is calculated, which is programmed or configures aforementioned based on credible performing environment and directed acyclic graph to execute the present invention
Block chain know together method the step of.The present embodiment also provides a kind of block chain based on credible performing environment and directed acyclic graph
Common recognition system, including computer equipment are stored on the storage medium of the computer equipment and are programmed or configure to execute this hair
The bright aforementioned computer program based on the block chain of credible performing environment and directed acyclic graph common recognition method.The present embodiment also provides
A kind of computer readable storage medium is stored on the computer readable storage medium before being programmed or configuring to execute the present invention
State the computer program based on the block chain of credible performing environment and directed acyclic graph common recognition method.
The above is only a preferred embodiment of the present invention, protection scope of the present invention is not limited merely to above-mentioned implementation
Example, all technical solutions belonged under thinking of the present invention all belong to the scope of protection of the present invention.It should be pointed out that for the art
Those of ordinary skill for, several improvements and modifications without departing from the principles of the present invention, these improvements and modifications
It should be regarded as protection scope of the present invention.
Claims (6)
1. a kind of based on the block chain of credible performing environment and directed acyclic graph common recognition method, which is characterized in that appoint in block chain
Meaning node executes the implementation steps known together
1) event sets that neighbor node is sent are received；
2) the credible performing environment information carried based on new events judges whether each of event sets new events are legal, such as
Each new events of fruit are legal and this node is honest node, then this node votes through the proposal in event, jumps and holds
Row step 3)；Otherwise, the event sets received are abandoned, terminates epicycle and knows together and exit；
3) event sets received are added in the directed acyclic graph of this node；
4) for all events in the directed acyclic graph of this node, if any one event is more than specified number in block catenary system
The confirmation of the node of amount then determines that the event has been reached common understanding；Otherwise it jumps and performs the next step；
5) judge whether this node has new proposal, if there is new proposal, then generate the new events comprising new proposal, if
Not new proposal then generates empty new events；
6) neighbor node is randomly choosed, is determined according to the directed acyclic graph of the directed acyclic graph of this node, the neighbor node
This node knows and the ignorant event sets of the neighbor node, and this node is known and the ignorant event of the neighbor node
Set is sent to the neighbor node by gossip message.
2. according to claim 1 based on the block chain of credible performing environment and directed acyclic graph common recognition method, feature
It is, whether the credible performing environment information carried in step 2 based on new events judges each of event sets new events
Legal detailed step includes:
2.1) the transmission event counter value C carried in the new events being judged is readi；
2.2) source node for obtaining the new events that transmission is judged sends the transmission event counter value carried in an event
Ci-1, the transmission event counter value be source node based on the transmission event counter in credible performing environment to send event into
Row continuous counter and send when insertion event in obtain；
2.3) judgement sends event counter value Ci-1, send event counter value CiIt is whether continuous, if the two continuously if determine to be judged to
Disconnected new events are legal；Otherwise, it is determined that the new events being judged are illegal.
3. it is according to claim 1 or 2 based on the block chain of credible performing environment and directed acyclic graph common recognition method, it is special
Sign is, will be in the event sets that received when being added the event sets received in the directed acyclic graph of this node in step 3)
Each event stored according to received sequencing, and this node parent pointer of each event is directed toward upper the one of this node
A event, other node parent pointers are directed toward the event in source node, each event includes this section point in the event sets received
Two parent pointer, other node parent pointers cryptographic Hash make the event of this node form directed acyclic according to this node parent pointer
Figure, and directed acyclic graph is formed by other node parent pointers between adjacent node.
4. a kind of based on the block chain of credible performing environment and directed acyclic graph common recognition system, including computer equipment, feature
It is, the computer equipment is programmed or configures aforementioned based on credible performing environment and directed acyclic graph to execute the present invention
The step of block chain common recognition method.
5. a kind of based on the block chain of credible performing environment and directed acyclic graph common recognition system, including computer equipment, feature
Be, be stored on the storage medium of the computer equipment be programmed or configure it is aforementioned based on credible execution to execute the present invention
The computer program of the block chain of environment and directed acyclic graph common recognition method.
6. a kind of computer readable storage medium, which is characterized in that be stored with and be programmed on the computer readable storage medium
Or configuration is to execute the aforementioned computer journey based on the block chain of credible performing environment and directed acyclic graph common recognition method of the present invention
Sequence.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910385696.7A CN110198233B (en) | 2019-05-09 | 2019-05-09 | Block chain consensus method and system based on trusted execution environment and directed acyclic graph |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910385696.7A CN110198233B (en) | 2019-05-09 | 2019-05-09 | Block chain consensus method and system based on trusted execution environment and directed acyclic graph |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110198233A true CN110198233A (en) | 2019-09-03 |
| CN110198233B CN110198233B (en) | 2021-11-19 |
Family
ID=67752481
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910385696.7A Active CN110198233B (en) | 2019-05-09 | 2019-05-09 | Block chain consensus method and system based on trusted execution environment and directed acyclic graph |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110198233B (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110458995A (en) * | 2019-09-12 | 2019-11-15 | 北京笔新互联网科技有限公司 | Vote anonymously system and voting method based on credible performing environment |
| CN111080288A (en) * | 2019-10-18 | 2020-04-28 | 湖南天河国云科技有限公司 | Block chain consensus achieving method and device based on directed acyclic graph |
| CN112202775A (en) * | 2020-09-29 | 2021-01-08 | 北京理工大学 | Consensus mechanism architecture and method for block chain of directed acyclic graph structure |
| CN112783983A (en) * | 2021-02-07 | 2021-05-11 | 中国人民解放军国防科技大学 | Self-adaptive consensus method based on major-minor block diagram chain structure block chain account book design |
| CN113034146A (en) * | 2021-05-25 | 2021-06-25 | 杭州云链趣链数字科技有限公司 | Block chain-based communication method, system, electronic device and storage medium |
| CN113077343A (en) * | 2021-04-09 | 2021-07-06 | 中山大学 | Block chain consensus system based on directed acyclic graph |
| CN113225175A (en) * | 2020-01-20 | 2021-08-06 | I25S商务管理咨询有限公司 | System and method for realizing directed acyclic graph consensus algorithm through gossip protocol |
| CN113297569A (en) * | 2021-05-06 | 2021-08-24 | 湖南兆物信链科技集团有限公司 | Attack processing method, equipment and storage medium based on Hash diagram |
| CN113923217A (en) * | 2021-09-30 | 2022-01-11 | 中国人民解放军国防科技大学 | Asynchronous Byzantine consensus method and system based on DAG |
| CN116723200A (en) * | 2023-08-11 | 2023-09-08 | 杭州趣链科技有限公司 | Cluster changing method and device, electronic equipment and computer readable storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108111604A (en) * | 2017-12-21 | 2018-06-01 | 广州广电运通金融电子股份有限公司 | Block chain common recognition methods, devices and systems, identification information treating method and apparatus |
| US20180331835A1 (en) * | 2017-05-11 | 2018-11-15 | Shapeshift Ag | Trusted agent blockchain oracle |
| CN109102296A (en) * | 2018-08-31 | 2018-12-28 | 北京八分量信息科技有限公司 | A kind of node common recognition method and system |
| CN109447795A (en) * | 2018-09-11 | 2019-03-08 | 中国人民解放军国防科技大学 | Byzantine consensus method supporting rapid achievement of final confirmation |
| US20190089716A1 (en) * | 2016-05-18 | 2019-03-21 | Innogy Innovation Gmbh | Peer-to-peer network and node of a peer-to-peer network |
-
2019
- 2019-05-09 CN CN201910385696.7A patent/CN110198233B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20190089716A1 (en) * | 2016-05-18 | 2019-03-21 | Innogy Innovation Gmbh | Peer-to-peer network and node of a peer-to-peer network |
| US20180331835A1 (en) * | 2017-05-11 | 2018-11-15 | Shapeshift Ag | Trusted agent blockchain oracle |
| CN108111604A (en) * | 2017-12-21 | 2018-06-01 | 广州广电运通金融电子股份有限公司 | Block chain common recognition methods, devices and systems, identification information treating method and apparatus |
| CN109102296A (en) * | 2018-08-31 | 2018-12-28 | 北京八分量信息科技有限公司 | A kind of node common recognition method and system |
| CN109447795A (en) * | 2018-09-11 | 2019-03-08 | 中国人民解放军国防科技大学 | Byzantine consensus method supporting rapid achievement of final confirmation |
Non-Patent Citations (1)
| Title |
|---|
| HUAIMIN WANG: "An Overview of Blockchain Technology: Architecture, Consensus, and Future Trends", 《IEEE》 * |
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110458995A (en) * | 2019-09-12 | 2019-11-15 | 北京笔新互联网科技有限公司 | Vote anonymously system and voting method based on credible performing environment |
| CN111080288A (en) * | 2019-10-18 | 2020-04-28 | 湖南天河国云科技有限公司 | Block chain consensus achieving method and device based on directed acyclic graph |
| CN111080288B (en) * | 2019-10-18 | 2023-08-18 | 湖南天河国云科技有限公司 | Block chain consensus achieving method and device based on directed acyclic graph |
| CN113225175A (en) * | 2020-01-20 | 2021-08-06 | I25S商务管理咨询有限公司 | System and method for realizing directed acyclic graph consensus algorithm through gossip protocol |
| CN113225175B (en) * | 2020-01-20 | 2024-08-23 | 德卡股份有限公司 | System and method for implementing directed acyclic graph consensus algorithm through a fluent protocol |
| CN112202775B (en) * | 2020-09-29 | 2021-06-22 | 北京理工大学 | Consensus mechanism architecture and method for block chain of directed acyclic graph structure |
| CN112202775A (en) * | 2020-09-29 | 2021-01-08 | 北京理工大学 | Consensus mechanism architecture and method for block chain of directed acyclic graph structure |
| CN112783983A (en) * | 2021-02-07 | 2021-05-11 | 中国人民解放军国防科技大学 | Self-adaptive consensus method based on major-minor block diagram chain structure block chain account book design |
| CN113077343A (en) * | 2021-04-09 | 2021-07-06 | 中山大学 | Block chain consensus system based on directed acyclic graph |
| CN113297569A (en) * | 2021-05-06 | 2021-08-24 | 湖南兆物信链科技集团有限公司 | Attack processing method, equipment and storage medium based on Hash diagram |
| CN113297569B (en) * | 2021-05-06 | 2022-08-12 | 湖南兆物信链科技集团有限公司 | Attack processing method, equipment and storage medium based on Hash diagram |
| CN113034146A (en) * | 2021-05-25 | 2021-06-25 | 杭州云链趣链数字科技有限公司 | Block chain-based communication method, system, electronic device and storage medium |
| CN113034146B (en) * | 2021-05-25 | 2021-08-17 | 杭州云链趣链数字科技有限公司 | Block chain-based communication method, system, electronic device and storage medium |
| CN113923217A (en) * | 2021-09-30 | 2022-01-11 | 中国人民解放军国防科技大学 | Asynchronous Byzantine consensus method and system based on DAG |
| CN113923217B (en) * | 2021-09-30 | 2024-04-16 | 中国人民解放军国防科技大学 | Asynchronous Bayesian-busy family consensus method and system based on DAG |
| CN116723200A (en) * | 2023-08-11 | 2023-09-08 | 杭州趣链科技有限公司 | Cluster changing method and device, electronic equipment and computer readable storage medium |
| CN116723200B (en) * | 2023-08-11 | 2023-11-10 | 武汉趣链数字科技有限公司 | Cluster changing method and device, electronic equipment and computer readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110198233B (en) | 2021-11-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110198233A (en) | Block chain consensus method and system based on trusted execution environment and directed acyclic graph | |
| Wang et al. | SoK: DAG-based blockchain systems | |
| CN110708171B (en) | Block chain consensus voting method, device, equipment and storage medium | |
| CN107276762B (en) | A kind of working method and device of multi-protocols block chain | |
| CN109743173A (en) | Go out block node in block chain and determines method, block verification method and block catenary system | |
| Canetti et al. | Black-box concurrent zero-knowledge requires\tilde {Ω}(log n) rounds | |
| Kol et al. | Interactive distributed proofs | |
| CN110599147A (en) | Ciphertext retrieval fair payment method and system based on block chain | |
| CN109981281B (en) | Method and device for determining candidate elements based on block chain proposal random consensus | |
| CN103067156B (en) | The URL encryption of mobile Internet user resources access, verification method and device | |
| TWI466525B (en) | Access control system and access control method thereof | |
| CN108667717A (en) | Block chain processing method, medium, device and computing device based on instant communication message record | |
| CN109600366A (en) | The method and device of protection user data privacy based on block chain | |
| Asfia et al. | Energy trading of electric vehicles using blockchain and smart contracts | |
| CN106899548A (en) | A kind of IP address modification method and device | |
| CN106611134A (en) | Cloud data integrity verification method | |
| Guo et al. | Blockchain-assisted privacy-preserving data computing architecture for Web3 | |
| CN110210252A (en) | A kind of active security method, device and the server of electronic data | |
| CN117614707A (en) | Block chain transaction method, system, electronic equipment and medium based on intelligent contract | |
| CN111371560A (en) | Certificateless fault-tolerant aggregation signature method and system applied to Internet of vehicles | |
| CN117411636A (en) | Block chain consensus method capable of randomly selecting master node | |
| Manulis et al. | Security model and framework for information aggregation in sensor networks | |
| Chen et al. | A Vehicular Trust Blockchain Framework with Scalable Byzantine Consensus | |
| CN109981295A (en) | Conditional anonymity method is realized under a kind of smart grid environment | |
| CN102421094B (en) | Distributed safety reprogramming method of wireless sensor network |
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 |