CN112073483B - Authority certification consensus method and system based on credit and committee endorsement mechanism - Google Patents
Authority certification consensus method and system based on credit and committee endorsement mechanism Download PDFInfo
- Publication number
- CN112073483B CN112073483B CN202010882749.9A CN202010882749A CN112073483B CN 112073483 B CN112073483 B CN 112073483B CN 202010882749 A CN202010882749 A CN 202010882749A CN 112073483 B CN112073483 B CN 112073483B
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- block
- committee
- accounting 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.)
- Active
Links
Images
Classifications
-
- 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/104—Peer-to-peer [P2P] networks
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/12—Accounting
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3247—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures
-
- 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/68—Special signature format, e.g. XML format
-
- 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 provides an authoritative certification consensus method and system based on a credit and committee endorsement mechanism, wherein a block chain network consists of common nodes, accounting nodes, authentication nodes and supervision nodes; the accounting node is selected from the authentication nodes according to the reputation ranking, collects and verifies transaction information sent by the common node, and adds the verified transaction into the generated new block; after the new block passes verification, randomly selecting a plurality of nodes from the supervision nodes to form a committee to sign on the submitted block for endorsement; the accounting node must collect enough endorsements from the supervising node to add the relevant information to the new block generated. By automatically selecting and exciting the accounting nodes through the credit degree ranking, the invention can reduce the calculation pressure and delay rate of the block chain network and improve the throughput of the block chain network; the regulatory problem was solved by introducing a committee endorsement mechanism. The invention provides a technical scheme with low cost and high performance for the alliance block chain and the private block chain.
Description
Technical Field
The invention belongs to the technical field of block chains, and provides an authority certification consensus method and system based on a credit and committee endorsement mechanism.
Background
The blockchain technology is a brand new distributed infrastructure and computing paradigm that utilizes blockchain data structures to verify and store data, utilizes distributed node consensus algorithms to generate and update data, cryptographically secures data transmission and access, and utilizes intelligent contracts composed of automated script code to program and manipulate data. In essence, the system is a shared database, and the data or information stored in the shared database has the characteristics of 'unforgeability', 'whole-course trace', 'traceability', 'public transparency', 'collective maintenance', and the like. Based on the characteristics, the block chain technology lays a solid 'trust' foundation, creates a reliable 'cooperation' mechanism and has wide application prospect. For example, the method can be widely applied to internet of things such as a vehicle networking self-organizing network and a smart grid edge computing architecture.
Generally, a blockchain system consists of a data layer, a network layer, a consensus layer, a stimulus layer, a contract layer, and an application layer. The consensus layer mainly encapsulates various consensus algorithms of the network nodes. As described in "review on block chain consensus mechanism" in exemplary Liu, currently common consensus algorithms include Proof of workload (Proof of Work, PoW), Proof of rights of stock (PoS), Proof of authorized rights of stock (DPoS), and the like. PoW relies on the computing power of the machine to obtain billing rights, and is resource intensive and slow. The PoS algorithm improves block generation speed but is costly. In the DPoS algorithm, each sharer obtains a certain voting right according to a proportion, and voting generates an accounting node, so that the calculation cost is reduced, but the reward distribution is uneven, the defense capability is weak, and the security is low.
The Authority certification (PoA) is a byzantine fault-tolerant consensus algorithm for federated and private block chains, relies on a limited number of block verification nodes, and is a reputation-based consensus algorithm. Blocks and transactions are verified by participants pre-approved by a regulatory body as a system administrator, and the authoritative consensus blockchain is protected by a trusted verification node. The verifier is responsible for collecting transactions from the client, creating blocks and adding them to the chain. The algorithm runs in turns, allowing the validation program to propose one block in each turn. Once the blocks are added, a global consensus is achieved.
The authoritative consensus does not require high performance hardware. In contrast to PoW consensus, PoA consensus does not require nodes to expend computational resources to solve complex mathematical tasks. Unlike the common recognition of PoW and PoS, the time interval for generating new blocks is predictable. The network node is authorized to generate blocks in sequence at specified time intervals. This increases the speed of the authentication transaction. While efficiency and security are guaranteed, authority-proof consensus also presents the problem of not being easy to supervise and authenticate a node as described in "PBFT vs proof-of-authority" of s.de Angelis.
Disclosure of Invention
Aiming at the defects of the prior art, the invention provides an authority certification consensus method based on a credit and committee endorsement mechanism.
In order to achieve the purpose, the invention provides an authority certification consensus method based on a credit and committee endorsement mechanism, wherein a block chain network consists of a common node, a bookkeeping node, an authentication node and a supervision node; the accounting node is selected from the authentication nodes according to the reputation ranking, collects and verifies transaction information sent by the common node, and adds the verified transaction into a new block generated by the accounting node; after the new block passes verification, randomly selecting a plurality of nodes from the supervision nodes to form a committee to sign on the submitted block for endorsement; the billing node must collect enough endorsements from the supervising node to add its relevant information to the new block to be generated.
Moreover, the consensus process comprises the following three phases,
1) a preparation stage: entities and a supervision organization register as verification nodes and supervision nodes in a block chain under real names, and credit ranking is generated according to the credit degree of the nodes;
2) the execution stage comprises the following steps of electing, namely randomly selecting an accounting node serving as a generation block from the authentication node with the front rank according to the current reputation ranking list;
the preparation step comprises the steps that the accounting node collects transaction information in the block chain and packs the transaction information into blocks;
the verification step comprises the steps that a plurality of nodes are randomly selected from the supervision nodes to form a committee, the accounting nodes request the committee members for verification, and after the accounting nodes collect a sufficient number of committee signatures, endorsement signatures are added into a new block;
receiving, namely broadcasting a new block to nodes of the whole network by the accounting node, acquiring credit reward and entering the next round of execution;
3) and a storage phase, wherein the new blocks broadcasted in the whole network are stored on the block chain.
Moreover, the reputation of the node is calculated in the following manner,
let the evaluation set have a set of influence factors, denoted as S ═ S1,S2,...,Si,...,SI) The ith influence factor is a different evaluation index element Si1,Si2,...,Sij...,SiJSet of (1), denoted as Si=(Si1,Si2,...,Sij...,SiJ) (ii) a Wherein I is the number of influence factors, J is the number of evaluation index elements of the ith influence factor, I is 1,2, …, I, J is 1,2, …, J;
for each SijAssigning different weights WijAnd then calculating a weighted average as the node reputation.
Moreover, the effective life cycle of each accounting node is set to be X, and each accounting node only receives X transactions; whenever the number of transactions exceeds X, a new accounting node records it.
Furthermore, the value range of X is preferably 1 to 3.
Moreover, the new block received by the block chain should satisfy the following conditions,
1) the new block is generated by the current accounting node;
2) no other blocks are generated in the current accounting node;
3) the block has passed endorsement;
4) the block has been generated and correctly signed.
The invention provides an authority certification consensus system based on a reputation and committee endorsement mechanism, which is used for executing the authority certification consensus method based on the reputation and committee endorsement mechanism.
According to the invention, the credit degree ranking is used for automatically selecting and exciting the accounting nodes, so that the calculation pressure and delay rate of the block chain network can be reduced, and the throughput of the block chain network is improved; the regulatory problem was solved by introducing a committee endorsement mechanism. The method provides a technical scheme with low cost and high performance for the alliance block chain and the private block chain.
Drawings
FIG. 1 is a diagram illustrating an authority consensus workflow according to an embodiment of the present invention.
FIG. 2 is a diagram of a consensus process at an execution stage according to an embodiment of the present invention.
FIG. 3 is a block diagram illustrating a basic data structure of a block according to an embodiment of the present invention.
Detailed Description
The technical solution of the present invention is specifically described below with reference to the accompanying drawings and examples.
Some concepts related to the embodiments of the present application are described below.
Block chain gas: to prevent negative behavior of the node, such as not participating in verification or maintaining the entire blockchain, associating node reputation with gas would consume gas if the authentication node provided service using the intelligent contract through the blockchain. After a plurality of rounds, all authentication nodes are allocated gas according to the credibility, and for the authentication nodes, the maintenance of the credibility is very important for the income, so that the authentication nodes serving as the accounting nodes are stimulated not to do harm and obey the rules.
Identity credibility: identity reputation is employed as an incentive mechanism that rewards nodes that participate in accounting in compliance with rules and penalizes nodes that do not comply with rules. The identity credibility of the authentication node can be checked at any time by the user. The work of assuming the verification node can be rewarded, and the identity credit degree of a company is improved;
authority certification: a reputation based consensus algorithm is protected by a trusted authentication node. The authentication node is responsible for collecting records from the client, creating the chunk and adding it to the chain. The algorithm runs in turns, allowing one block to be presented in each turn. Once the blocks are added, a global consensus is reached;
the embodiment of the invention provides an authoritative certification consensus method based on a credit and committee endorsement mechanism, wherein a block chain network consists of common nodes, authentication nodes and supervision nodes; and selecting the accounting node from the authentication nodes according to the reputation ranking, collecting and verifying transaction information sent by the common node by the accounting node, and adding the verified transaction into a new block generated by the accounting node. After the new block is verified, several node composition committees are randomly selected from the supervision nodes to sign on the submitted block to serve as endorsements. The billing node is required to collect enough endorsements by the supervising node before it can add its relevant information to the new block to be generated.
See figure 1 for an authority consensus workflow diagram. Specifically, the consensus working process of the method provided by the embodiment includes three stages:
1) a preparation stage: entities and supervision authorities register real names as verification nodes and supervision nodes in a block chain; let the evaluation set have a set of influence factors, denoted as S ═ S1,S2,...,Si,...,SI) And wherein the ith influence factor is a different evaluation index element Si1,Si2,...,Sij...,SiJSet of (1), denoted as Si=(Si1,Si2,...,Sij...,SiJ). Where I is the number of influence factors, J is the number of evaluation index elements of the ith influence factor, I is 1,2, …, I, J is 1,2, …, J.
For example, let I equal to 3 and J equal to J1,J2,J3。
Reputation factor S1And the options include company size, income, user size, whether the user is punished recently, the history of compliance and the like.
Hardware factor S2Including server CPU, memory, queue buffer size and performance, etc.
Network factor S3Including server bandwidth, network latency, server vulnerability tracking, data set backlog, etc.
An evaluation index element set of influence factors is constructed for each SijAssigning different weights WijThen calculating the weighted average value as the node credibility, and givingGenerating a reputation ranking according to the node reputation degree;
in specific implementation, other influence factors and evaluation index elements can be set as required. Can also be used in advance as
2) Referring to the consensus process diagram of the execution phase shown in fig. 2, the execution phase comprises the following steps:
2.1) election step: according to the current reputation ranking list, a consensus algorithm randomly selects one accounting node as a generation block from the authentication nodes of the top 10% of the ranking, and in order to avoid corruption of the accounting node or intentional attack by an adversary, the effective life cycle of each accounting node is limited to X (namely, only X transactions are received by each accounting node, and when the number of the transactions exceeds X, a new accounting node records the number of the transactions). If the selected authentication node does not respond, the consensus algorithm will reselect the accounting node and resend the request in case of a timeout. In specific implementation, X can be preset by a user according to needs, and the preferable suggested value range is 1-3.
In this embodiment, according to the reputation ranking list of the current kth round, the consensus algorithm randomly ranks the task O and the timestamp T to one of the authentication nodes P10% before the task O and the timestamp T0Sending Request (k, O, T), i.e. accounting Request, if P0Returning the result Reply (k, T, O, P)0) It will act as a billing node for the current round of generating blocks. If the selected authentication node does not respond, the consensus algorithm reselects the accounting node and retransmits the request under the condition of time-out;
2.2) preparation steps: and when the selected accounting node is the accounting node, the accounting node collects the transaction information in the block chain and packs the transaction information into blocks.
In this embodiment, after being selected as the accounting node, P0Starting to collect transaction information TX ═ { TX in block chain1,...,TXLAre packed into blocks BkWherein TXlIs transaction information. And then encapsulates it as a prepare requestIs the digital signature of the accounting node to the Request (k, O, T) as the proof of electing the accounting node;
2.3) a verification step: the consensus algorithm randomly selects a plurality of nodes from the supervision nodes to form a committee, the accounting node requests the committee members for verification, and the endorsement signatures are added into a new block after the accounting node collects a sufficient number of committee signatures.
In this embodiment, the consensus algorithm selects node D from the supervisory nodes u1,2,3, the U constitutes a committee, and the accounting node sends a preparation request Prepare to the committee member for verification, and after the verification is passed, DuWill send an authentication requestWhereinIs made of P0Public key encrypted DiAnd signing the endorsement of the Prepare, wherein U is the total number of the selected nodes, and U is the node label. At P0After v committee signatures are collected (e.g., 3 ≦ v ≦ U), the endorsement signature is packed into block Bk。
2.4) an accepting step: and the accounting node broadcasts the new block to the nodes of the whole network, obtains credit reward and enters the next round.
In this embodiment, P0 broadcasts B to nodes of the entire networkkAnd obtains a credit award rzAnd entering the next round of execution. Reward reputation score for billing nodesWhere E is the number of records generated after the previous block. T (e) is the gas consumed by the executive record e, and the reward factor s (e) is used to reward or penalize different behaviors.
3) A storage stage: new blocks broadcast over the network are stored on the block chain.
Condition that the blockchain receives a new block:
1) the new block is generated by the current accounting node.
2) No other blocks are generated by the current accounting node.
3) The block has passed the endorsement.
4) The block has been generated and correctly signed.
The above 4 conditions need to be satisfied simultaneously.
The real-time block data of the embodiment comprises blocks which are connected back and forth and contain recording sequences;
referring to fig. 3, fig. 3 is a schematic diagram of a basic data structure of a block according to an embodiment of the present invention, and the definitions of the fields are described as follows:
the Block header contains the following fields:
hash value of the camera block: each block (except the first block (also referred to as a "created block") retains the hash of the previous block header in this field.
Merkle root: the integrity of the blockchain is guaranteed and if an attacker modifies the transaction in an earlier block, the Merkle Root value will be modified, which will affect the attacked chunk-head hash.
Hash value of camera block: the hash value of the current chunk.
Time stamp: time stamp of block generation.
The Endorsement design: unlike conventional block structures, the blocks presented herein also include endorsement signatures for verification in generating the blocks.
The Block Body contains all the records of a certain round. For example, Transaction Record 1, Transaction Record 2 …
After the above technical solution is actually applied, if the accounting node wants to destroy the block chain system in the current round of consensus, a certain number of supervision nodes must be combined together to cause damage, and the conditions are as follows:
1) the selected accounting node in the authentication node must conspire with the supervision node;
2) in these colluding nodes, there must be enough nodes randomly chosen for endorsement.
These two conditions make it practically difficult for the billing node to generate different blocks with his rights, and the probability of the system stability being disturbed is greatly reduced.
In specific implementation, a person skilled in the art can implement the automatic operation process by using a computer software technology, and a system device for implementing the method, such as a computer-readable storage medium storing a corresponding computer program according to the technical solution of the present invention and a computer device including a corresponding computer program for operating the computer program, should also be within the scope of the present invention.
The embodiment of the invention also provides an authority certification consensus system based on the credit and committee endorsement mechanism, which is used for executing the authority certification consensus method based on the credit and committee endorsement mechanism. Based on the method of the invention, the system of the method of the invention is easy to implement.
It should be understood that parts of the specification not set forth in detail are well within the prior art.
It should be understood that the above description of the preferred embodiments is given for clarity and not for any purpose of limitation, and that various changes, substitutions and alterations can be made herein without departing from the spirit and scope of the invention as defined by the appended claims.
Claims (5)
1. An authority certification consensus method based on a reputation and committee endorsement mechanism is characterized in that: the block chain network consists of a common node, a billing node, an authentication node and a supervision node; the accounting node is selected from the authentication nodes according to the reputation ranking, collects and verifies transaction information sent by the common node, and adds the verified transaction into a new block generated by the accounting node; after the new block passes verification, randomly selecting a plurality of nodes from the supervision nodes to form a committee to sign on the submitted block for endorsement; the accounting node must collect enough endorsements of the supervision nodes to add the relevant information into a new block to be generated;
the consensus working process comprises the following three phases,
1) a preparation stage: entities and a supervision organization register as verification nodes and supervision nodes in a block chain under real names, and credit ranking is generated according to the credit degree of the nodes;
2) the execution stage comprises the following steps that during election, according to the current reputation ranking list, a consensus algorithm randomly selects one accounting node as a generation block from the authentication nodes ranked in the front, in order to avoid corruption of the accounting node or intentional attack of an adversary, the effective life cycle of each accounting node is limited to X, and each accounting node only receives X transactions; recording by a new accounting node each time the transaction amount exceeds X; if the selected authentication node does not respond, the consensus algorithm reselects the accounting node and retransmits the request under the condition of time-out; the realization mode is that according to the ranking list of the credibility of the current k-th round, the consensus algorithm randomly ranks the task O and the timestamp T to one P of the authentication nodes with the top rank0Sending an accounting Request (k, O, T), if P0Returning the result Reply (k, T, O, P)0) Then it will be used as the accounting node of the block generated in the current round; if the selected authentication node does not respond, the consensus algorithm reselects the accounting node and retransmits the request under the condition of time-out;
in preparation, after the selected accounting node is the accounting node, the accounting node collects the transaction information in the block chain and packs the transaction information into blocks, which is realized as follows,
after being selected as the accounting node, P0Starting to collect transaction information TX ═ { TX in block chain1,...,TXLAre packed into blocks BkWherein TXlTo transaction information, which is then packaged as a prepare request Is the digital signature of the accounting node to the Request (k, O, T) as the proof of electing the accounting node;
during verification, a consensus algorithm randomly selects a plurality of nodes from the supervision nodes to form a committee, the accounting node requests the committee members for verification, and after the accounting node collects a sufficient number of committee signatures, endorsement signatures are added into a new block, the realization method is as follows,
consensus algorithm selects node D from supervision nodesu1,2,3, the U constitutes a committee, and the accounting node sends a preparation request Prepare to the committee member for verification, and after the verification is passed, DuWill send an authentication requestWhereinIs made of P0Public key encrypted DiEndorsement signature for Prepare, U is the total number of selected nodes, U is the node label, at P0After collecting the v committee signatures, the endorsement signatures are packed into block Bk;
When receiving, the accounting node broadcasts a new block to the nodes of the whole network, obtains credit reward and enters the next round to realize the following,
p0 broadcasts B to nodes of the whole networkkAnd obtains a credit award rzEntering the next round of execution, the reward credit score of the accounting nodeWhere E is the number of records generated after the previous block, T (E) is the gas consumed by executing record E, and the reward factor S (E) is used to reward or penalize different behaviors;
3) and a storage phase, wherein the new blocks broadcasted in the whole network are stored on the block chain.
2. The reputation-and-committee endorsement mechanism-based authoritative certification consensus method of claim 1, wherein: the reputation of a node is calculated as follows,
let the evaluation set have a set of influence factors, denoted as S ═ S1,S2,...,Si,...,SI) The ith influence factor is a different evaluation index element Si1,Si2,...,Sij...,SiJSet of (1), denoted as Si=(Si1,Si2,...,Sij...,SiJ) (ii) a Wherein I is the number of influence factors, J is the number of evaluation index elements of the ith influence factor, I is 1,2, …, I, J is 1,2, …, J;
for each SijAssigning different weights WijAnd then calculating a weighted average as the node reputation.
3. The reputation-and-committee endorsement mechanism-based authoritative certification consensus method of claim 1, wherein: the value range of X is 1-3.
4. The reputation-based committee endorsement mechanism authority-based consensus method according to claim 1,2 or 3, wherein: the block chain receiving a new block needs to satisfy the following conditions at the same time,
1) the new block is generated by the current accounting node;
2) no other blocks are generated in the current accounting node;
3) the block has passed endorsement;
4) the block has been generated and correctly signed.
5. An authority certification consensus system based on a reputation and committee endorsement mechanism, comprising: for performing an authoritative certification consensus method based on a reputation and committee endorsement mechanism as in any one of claims 1-4.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202010882749.9A CN112073483B (en) | 2020-08-28 | 2020-08-28 | Authority certification consensus method and system based on credit and committee endorsement mechanism |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202010882749.9A CN112073483B (en) | 2020-08-28 | 2020-08-28 | Authority certification consensus method and system based on credit and committee endorsement mechanism |
Publications (2)
Publication Number | Publication Date |
---|---|
CN112073483A CN112073483A (en) | 2020-12-11 |
CN112073483B true CN112073483B (en) | 2022-01-04 |
Family
ID=73660229
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202010882749.9A Active CN112073483B (en) | 2020-08-28 | 2020-08-28 | Authority certification consensus method and system based on credit and committee endorsement mechanism |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN112073483B (en) |
Families Citing this family (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113014635A (en) * | 2021-02-19 | 2021-06-22 | 卓尔智联(武汉)研究院有限公司 | Node type division method and device of block chain system and block chain system |
CN113364592B (en) * | 2021-05-06 | 2024-03-29 | 陈冠华 | Project system file management system and method based on reputation value alliance chain |
CN113343311A (en) * | 2021-06-04 | 2021-09-03 | 北京邮电大学 | Block chain consensus method and system based on reputation model and digital signature mechanism |
CN113326240B (en) * | 2021-06-22 | 2023-05-30 | 哈尔滨工程大学 | Data sharing method of energy consumption sensitive terminal node in edge network |
CN113691632B (en) * | 2021-08-27 | 2023-06-13 | 广东卓启云链科技有限公司 | Dynamic scheduling method and system for block chain computing resources |
CN113965326B (en) * | 2021-09-26 | 2022-05-17 | 北京岸思信息科技有限公司 | Lightweight block chain system for resisting parallel attack |
CN116248725B (en) * | 2023-05-10 | 2023-07-25 | 南京信息工程大学 | Block chain node slicing method oriented to node collaborative storage in Internet of vehicles environment |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108667614A (en) * | 2018-04-19 | 2018-10-16 | 上海分布信息科技有限公司 | A kind of Byzantine failure tolerance method and its realize system |
CN109508982A (en) * | 2018-11-21 | 2019-03-22 | 北京蓝石环球区块链科技有限公司 | REPB common recognition based on the more subchains of block chain main chain adduction row |
CN109636599A (en) * | 2018-11-07 | 2019-04-16 | 广西师范大学 | License block chain secret protection and monitoring and managing method based on group ranking |
CN109767199A (en) * | 2018-12-10 | 2019-05-17 | 西安电子科技大学 | PBFT common recognition system and method, block chain data processing system based on prestige |
CN111200589A (en) * | 2019-12-05 | 2020-05-26 | 北京数字认证股份有限公司 | Data protection method and system for alliance chain |
CN111583039A (en) * | 2020-05-09 | 2020-08-25 | 江苏大学 | Safe interaction method, incentive method and transaction system for manager-free blockchain transaction |
Family Cites Families (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP3857850A4 (en) * | 2018-09-28 | 2022-06-29 | Thunder Token Inc. | High throughput blockchain consensus systems and methods with low finalization time |
CN110213737B (en) * | 2019-05-23 | 2022-02-15 | 广西大学 | Method for establishing body area network information security mechanism based on alliance chain |
CN111445334B (en) * | 2020-03-30 | 2023-09-05 | 北京数字认证股份有限公司 | Aggregation signature method, device and storage medium of blockchain system |
CN111209346B (en) * | 2020-04-24 | 2020-07-28 | 腾讯科技(深圳)有限公司 | Block chain data archiving method and device and computer readable storage medium |
-
2020
- 2020-08-28 CN CN202010882749.9A patent/CN112073483B/en active Active
Patent Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108667614A (en) * | 2018-04-19 | 2018-10-16 | 上海分布信息科技有限公司 | A kind of Byzantine failure tolerance method and its realize system |
CN109636599A (en) * | 2018-11-07 | 2019-04-16 | 广西师范大学 | License block chain secret protection and monitoring and managing method based on group ranking |
CN109508982A (en) * | 2018-11-21 | 2019-03-22 | 北京蓝石环球区块链科技有限公司 | REPB common recognition based on the more subchains of block chain main chain adduction row |
CN109767199A (en) * | 2018-12-10 | 2019-05-17 | 西安电子科技大学 | PBFT common recognition system and method, block chain data processing system based on prestige |
CN111200589A (en) * | 2019-12-05 | 2020-05-26 | 北京数字认证股份有限公司 | Data protection method and system for alliance chain |
CN111583039A (en) * | 2020-05-09 | 2020-08-25 | 江苏大学 | Safe interaction method, incentive method and transaction system for manager-free blockchain transaction |
Non-Patent Citations (2)
Title |
---|
"基于信誉的动态授权PBFT共识机制";李俊清等;《软件》;20190531;第40卷(第五期);全文 * |
"基于区块链的电动汽车充电交易模型";金志刚等;《电网技术》;20191231;第43卷(第12期);全文 * |
Also Published As
Publication number | Publication date |
---|---|
CN112073483A (en) | 2020-12-11 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN112073483B (en) | Authority certification consensus method and system based on credit and committee endorsement mechanism | |
Zhuang et al. | Proof of reputation: A reputation-based consensus protocol for blockchain based systems | |
Xiao et al. | A survey of distributed consensus protocols for blockchain networks | |
Zhu et al. | zkCrowd: a hybrid blockchain-based crowdsourcing platform | |
CN109767199B (en) | PBFT consensus system and method based on reputation and blockchain data processing system | |
US20200059369A1 (en) | Determining consensus by parallel proof of voting in consortium blockchain | |
CN110611701B (en) | Parameter configuration and transaction processing method based on block chain | |
Cai et al. | Towards private, robust, and verifiable crowdsensing systems via public blockchains | |
US11157899B1 (en) | System and method for bootstrapping a separate proof of work chain | |
CN110825810B (en) | Block chain-based crowd sensing dual privacy protection method | |
CN112163856A (en) | Consensus method and system for block chain and Internet of things fusion scene | |
CN112053043A (en) | Block chain-based crowd sensing method and system | |
CN111131209A (en) | Improved efficient consensus method, system, computer device and storage medium | |
CN112651830B (en) | Block chain consensus method applied to power resource sharing network | |
CN109412838A (en) | Server cluster host node selection method based on hash calculating and Performance Evaluation | |
Wang et al. | A fast and secured vehicle-to-vehicle energy trading based on blockchain consensus in the internet of electric vehicles | |
CN110990790B (en) | Data processing method and equipment | |
US11354629B1 (en) | Controlling initiation of a blockchain election using a burn quota | |
Aluko et al. | Proof-of-reputation: an alternative consensus mechanism for blockchain systems | |
Qi et al. | LightPoW: A trust based time-constrained PoW for blockchain in internet of things | |
EP3520370B1 (en) | A decentralised database | |
US11290280B1 (en) | Cryptocurrency mining using a single-leader election algorithm | |
Goswami et al. | Towards a middleware design for efficient blockchain oracles selection | |
CN114422146A (en) | Anonymous sorting method for block chain main nodes | |
Dorri et al. | Blockchain for Cyberphysical Systems |
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 |