CN115633035B - Improved PBFT (physical layer transmission) based block chain consensus algorithm for Internet of things - Google Patents
Improved PBFT (physical layer transmission) based block chain consensus algorithm for Internet of things Download PDFInfo
- Publication number
- CN115633035B CN115633035B CN202211560127.XA CN202211560127A CN115633035B CN 115633035 B CN115633035 B CN 115633035B CN 202211560127 A CN202211560127 A CN 202211560127A CN 115633035 B CN115633035 B CN 115633035B
- Authority
- CN
- China
- Prior art keywords
- consensus
- node
- pbft
- nodes
- 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.)
- 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/389—Keeping log of transactions for guaranteeing non-repudiation of a transaction
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
- H04L12/16—Arrangements for providing special services to substations
- H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
-
- 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/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Accounting & Taxation (AREA)
- Computing Systems (AREA)
- Medical Informatics (AREA)
- General Health & Medical Sciences (AREA)
- Health & Medical Sciences (AREA)
- Finance (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
A block chain consensus algorithm based on an improved PBFT Internet of things belongs to the technical field of block chain consensus algorithms, the block chain platform adopts a Fabric platform which is well developed at present, the improved PBFT consensus algorithm is designed for the Fabric platform, and a verifiable random function and a proxy node design are added on the basis of the PBFT consensus algorithm, so that the defect that the Bayer fault tolerance is not supported in the Fabric consensus network is overcome, and meanwhile, the problem of traffic surge during the expansion of the PBFT consensus network is solved.
Description
Technical Field
The invention belongs to the technical field of block chain consensus algorithm, and particularly relates to an improved practical Byzantine fault-tolerant algorithm PBFT consensus algorithm in a block chain of an Internet of things.
Background
The blockchain is a distributed ledger maintained by multiple parties, and the ledger can be understood as a traditional database. Different from the traditional database, each node of the block chain holds a complete account book, the account book is composed of blocks which continuously grow, each block stores hash values of the last block, and for example, by taking a bit currency as an example, if an attacker wants to tamper the account book content, the attacker needs to have over 51% of calculation power in the whole block chain network, so that the attacker wants to attack the account book of the block chain is extremely difficult, and the block chain provides the capability of being not tampered and traceable.
The internet of things is a huge network which is formed by combining various information sensing devices and networks through internet connection and realizes interconnection and intercommunication between people and things. In recent years, the technology of the internet of things is rapidly developed, informatization is changing the clothes and eating habits of people, but due to the objectively limited capacity of the equipment of the internet of things, a complex network access mode and different structures of data, the cooperation cost of the internet of things system and the system before is higher. The internet of things and the block link are combined, so that the data of the internet of things can be safer, more applications such as source tracing, evidence storage and the like can be developed by utilizing the characteristics, trust is built among entities in social production and life, and social cooperation efficiency is improved.
The blockchain architecture is a distributed architecture. In the blockchain system, the consensus algorithm needs to solve the problem that each node keeps data consistent through a rule, and the blockchain is essentially a distributed database, so the consensus algorithm is the core of the blockchain. Common consensus algorithms in public chain systems are POW workload certification, POS entitlement certification, DPOS delegation entitlement certification; common consensus algorithms in the federation chain system are PBFT, raft. Different consensus algorithms have different energy consumption, security, efficiency, etc.
At present, more block chain services of the internet of things use a HyperhedgerFaric hyper-book as a block chain technical platform, and Fabricv1.4 has built-in consensus algorithms Solo, kafka and Raft, which do not support Byzantine fault tolerance, i.e. if a malicious node (Byzantine node) exists in a consensus network of a block chain, the built-in consensus algorithm cannot achieve consensus.
The verifiable random function is an encryption function that generates pseudo-random numbers based on data input, and a proof of proof that a verifier can easily verify the validity of the random numbers. The input data has a private key and public information, and the verifier can verify the validity of the random number through the public key, the public information and proof of the prover.
The existing internet of things block chain has the following defects when a default consensus algorithm in a Fabric platform is used:
the Solo, kafka and Raft consensus algorithm built in the Fabric does not support the Byzantine fault-tolerant algorithm, if Byzantine nodes exist in the consensus network, the consensus cannot be achieved, and therefore related services are forced to stop and cannot continue to be served.
The direct application of the PBFT consensus algorithm to the Fabric platform has the following disadvantages:
because the communication complexity of the PBFT algorithm depends on the number of nodes participating in the protocol, each node needs to communicate with other nodes, and when the number of nodes of the block chain consensus network increases, the speed of consensus decreases, which affects the throughput of the block chain network.
Therefore, there is a need in the art for a new solution to solve the above problems.
Disclosure of Invention
The technical problem to be solved by the invention is as follows: the block chain consensus algorithm based on the improved PBFT Internet of things is provided, and the idea of selecting the proxy node by the DPOS is combined to select the proxy node in the PBFT consensus network to participate in the PBFT consensus, so that the block chain network keeps better performance when the number of the consensus nodes is large, and the increasing traffic demand is met.
A block chain consensus algorithm based on improved PBFT Internet of things is characterized in that: comprises the following steps which are sequentially carried out,
initializing a PBFT consensus network, setting PBFT consensus timeout time, and setting the credit value of each consensus node to be 1;
step two, the PBFT consensus network receives a request of an application program SDK software development kit, each node calls a verifiable random function to generate a random number within the range of 0-65535, the ranking score of the node is the product of the reputation value and the random number, ranking is carried out according to the ranking score of each node, 4 nodes with the largest ranking score are selected to participate in the PBFT consensus, and when the ranking scores of the nodes are equal, one node is selected to participate in the PBFT consensus;
step three, the node with the highest ranking score obtained in the step two is a main node commonly identified by PBFT, when the node with the highest ranking score is more than one, one of the nodes is selected as the main node, and the other nodes are replica nodes;
step four, the main node initiates a consensus request to the PBFT consensus network, after three-stage consensus, the main node completes consensus after receiving 2f +1 confirmation messages within the PBFT consensus timeout time set in the step one, wherein f is a Byzantine node;
step five, counting whether the nodes in the PBFT consensus network return confirmation messages or not by using a consensus algorithm, wherein the nodes successfully return the confirmation messages, and the reputation values of the nodes are unchanged; the node does not return a confirmation message, and the credit value of the node is updated to be one half of the original value;
and step six, after the consensus is achieved, the main node sends the block to the Fabric network, and the peer in the Fabric network writes the block into a local account book to complete a transaction process.
In the fourth step, if the master node does not receive 2f +1 confirmation messages within the set PBFT consensus timeout time, the master node needs to reselect the node to participate in the PBFT consensus for ordering the transactions.
After the six main nodes send the blocks to the Fabric network, anchor nodes broadcast to leader nodes of all organizations in the same channel, the leader nodes receive the blocks sent by the orderer sequencing nodes and then conduct reading and writing set versions, transaction formats, repetition or not and sufficient endorsement verification or not, and after the blocks pass the verification, peer nodes write the blocks into a local account book.
The leader node is used for broadcasting verified blocks in an organization; the anchor node is used for cross-organizing broadcast blocks; the peer node is used for writing the received block into the account, informing the client application that the transaction proposal is written into the block chain and whether the transaction proposal is valid.
Through the design scheme, the invention can bring the following beneficial effects: a block chain consensus algorithm based on an improved PBFT Internet of things is disclosed, wherein a block chain platform adopts a currently well-developed Fabric platform, an improved PBFT consensus algorithm is designed for the Fabric platform, a verifiable random function and a proxy node design are added on the basis of the PBFT consensus algorithm, the defect that Byzantine fault tolerance is not supported in a Fabric consensus network can be overcome, and meanwhile, the problem that communication traffic is increased greatly when the PBFT consensus network is expanded is solved.
The invention has the further beneficial effects that the credit value of each consensus node is set to be 1, whether the node can participate in the current consensus depends on the sorting score of the node, the sorting score is obtained by multiplying the credit value by the random number generated by the node through the verifiable random function, and the range of the random number of the verifiable random function is 0-65535, so that the situation that the sorting scores of the consensus nodes are the same can be avoided to a certain extent, and the node can be conveniently selected in the step two.
The credit degree updating rule means that in the PBFT consensus network, if the node successfully completes the current round of consensus, the credit degree of the node is unchanged; when the node fails to complete the current round of consensus, updating the credit degree of the node to be one half of the original credit degree; if the node generates a byzantine error once, the byzantine error is more likely to occur again compared with other nodes, so that the credibility of the node is reduced when the node does not complete message confirmation, and the reduction of the credibility of the node influences the next participation of the node in the PBFT consensus.
Drawings
The invention is further described with reference to the following figures and detailed description:
fig. 1 is a schematic flow chart of an improved PBFT-based block chain consensus algorithm for internet of things according to the present invention.
Fig. 2 is a schematic flow chart of a credit value updating rule based on an improved PBFT internet of things block chain consensus algorithm of the present invention.
Detailed Description
An improved PBFT (physical binary Fourier transform) based block chain consensus algorithm for Internet of things, as shown in figure 1, comprises the following steps
The method comprises the following steps: after the Fabric network is started, the PBFT consensus network carries out initialization operation, the time of PBFT consensus overtime is set, and initial credit values are set to be 1 for all consensus nodes.
Step two: after the PBFT consensus network is initialized successfully, waiting for an application program SDK to send a transaction request to the PBFT consensus network, and after the PBFT consensus network receives a request message, generating a random number by each node through a verifiable random function, wherein the public message is the current view number of the PBFT consensus network, and then calculating a ranking score, and the ranking score calculation rule is the product of the random number and a node reputation value. And sequencing the PBFT consensus nodes according to the sequencing fraction, and taking the four nodes with the largest sequencing fraction as proxy nodes to participate in the PBFT consensus in the current round. And if the reputation values of a plurality of nodes are equal when the four nodes are selected, randomly selecting the nodes to participate in the PBFT consensus in the current round.
Step three: and in the second step, the nodes participating in the PBFT consensus in the current round are successfully selected, the node with the highest ranking score is used as the main node of the PBFT consensus in the current round, and then the conventional PBFT consensus process is carried out.
Step four: in the PBFT consensus of the current round, the master node sends a consensus request until after receiving 2f +1 confirmation messages, the consensus is completed, wherein f is a Byzantine node.
In the process of the PBFT consensus algorithm, C is a client, 0,1,2,3 is four PBFT consensus nodes, and a complete consensus needs to pass through request, pre-Prepare, commit, and reply processes. In the algorithm, the node with the highest ranking score is used as the main node of the PBFT consensus in the current round. In the Pre-preparation (Pre-preparation) stage: the master node verifies the request message and broadcasts the request message to other nodes if the request message passes the verification; in the preparation (Prepare) phase: the other nodes verify whether the Pre-Prepare message is valid, and if so, broadcast the Prepare message to the other nodes. After receiving 2f +1 Prepare messages, the node broadcasts a Commit message; in the Commit (Commit) phase: after receiving 2f +1 valid Commit acknowledge messages, the master node completes the consensus of the round.
Step five: as shown in fig. 2, after completing the PBFT consensus of the current round, the system updates the reputation value of the node participating in the PBFT consensus of the current round according to the received confirmation message.
At Fabric network startup, the initial reputation value of the node is set. After the consensus process is completed once, the credit value of the node is updated to be one half of the original credit value if the confirmation message of the PBFT consensus node is not received. In this case, it may be a failure of the primary node, and the reputation values of all nodes participating in the PBFT consensus of the current round need to be updated to one-half of the original reputation values. The reason for this is that nodes participating in the PBFT consensus in the current round may have byzantine nodes more than or equal to one, and network communication between nodes may be problematic, and these nodes also have a probability of failing to complete the consensus when participating in the subsequent PBFT consensus, so that the reputation values of the nodes participating in the PBFT consensus in the current round are all updated to be one-half of the original reputation values. The other condition is that confirmation messages of all nodes are received, which indicates that all nodes in the PBFT consensus of the round successfully complete three-stage consensus, namely the three stages of Pre-Prepare, preprepare and Commit can be regarded as good nodes, so the reputation value of the node of the round is not updated. The advantage of this is to try to get good nodes to participate in the PBFT consensus. After the reputation value update is complete, the node may wait to participate in the next consensus.
Step six: and the main node in the PBFT consensus of the current round sends a block to the Fabric network, and the peer node writes the block into a local account book to complete a transaction flow.
After the PBFT consensus network finishes consensus, a transaction block is created and broadcasted to all organized leader nodes in the same channel, and the leader nodes verify after receiving the block sent by the orderer node: reading and writing the set version, the transaction format, whether the set version is repeated or not, whether the set version is sufficient for endorsement or not, and writing the block into a local account book if the block passes verification. leader nodes broadcast verified blocks within the organization, and anchor nodes are responsible for broadcasting blocks across the organization. The peer node writes the received block into the account, informs the client application that the transaction proposal has been written into the block chain, and whether the transaction proposal is valid.
The blockchain platform used in the invention is HyperhedgerFaric under Linux foundation, the Fabric is an open-source enterprise-oriented blockchain platform, and not only has the characteristics of decentralization, non-tampering and traceability of a common blockchain platform, but also has an enterprise-level access mechanism, can block unauthorized access of an attacker, and has higher transaction speed compared with bitcoin and EtherFang.
The invention designs an improved PBFT-based Internet of things block chain consensus algorithm, which is improved based on a Hyperhedge Fabric platform commonly used by Internet of things block chain services.
The above description is directed to the specific embodiments of the present invention, but the scope of the present invention is not limited thereto, and those skilled in the art will readily appreciate that various modifications and substitutions can be made. Therefore, the protection scope of the present invention is subject to the protection scope of the claims.
Claims (4)
1. An improved PBFT (physical layer transmission) based block chain consensus algorithm for an Internet of things is characterized in that: comprises the following steps which are sequentially carried out,
initializing a PBFT practical Byzantine fault-tolerant algorithm consensus network, setting PBFT consensus timeout time, and setting the credit value of each consensus node to be 1;
step two, the PBFT consensus network receives a request of an application program SDK software development kit, each node calls a verifiable random function to generate a random number within the range of 0-65535, the ranking score of the node is the product of the reputation value and the random number, ranking is carried out according to the ranking score of each node, 4 nodes with the largest ranking score are selected to participate in the PBFT consensus, and when the ranking scores of the nodes are equal, one node is selected to participate in the PBFT consensus;
step three, the node with the highest ranking score obtained in the step two is a main node commonly identified by PBFT, when the node with the highest ranking score is more than one, one of the nodes is selected as the main node, and the other nodes are replica nodes;
step four, the main node initiates a consensus request to the PBFT consensus network, after three-stage consensus, the main node completes consensus after receiving 2f +1 confirmation messages within the PBFT consensus timeout time set in the step one, wherein f is a Byzantine node;
step five, counting whether the nodes in the PBFT consensus network return confirmation messages or not by using a consensus algorithm, wherein the nodes successfully return the confirmation messages, and the reputation values of the nodes are unchanged; the node does not return a confirmation message, and the credit value of the node is updated to be one half of the original value;
and step six, after the consensus is achieved, the main node sends the block to the Fabric network, and the peer in the Fabric network writes the block into a local account book to complete a transaction process.
2. The improved PBFT (physical layer transform) Internet of things block chain consensus algorithm as claimed in claim 1, wherein: in the fourth step, if the master node does not receive 2f +1 confirmation messages within the set PBFT consensus timeout time, the master node needs to reselect the node to participate in the PBFT consensus for ordering the transactions.
3. The improved PBFT (physical layer transform) Internet of things block chain consensus algorithm as claimed in claim 1, wherein: after the six main nodes send the blocks to the Fabric network, anchor nodes broadcast the blocks to leader nodes of all organizations in the same channel, the leader nodes perform reading and writing set versions, transaction formats, repetition or not and sufficient endorsement verification or not after receiving the blocks sent by orderer sequencing nodes, and after the blocks pass the verification, peer nodes write the blocks into a local account book.
4. The improved PBFT (physical layer transform) Internet of things block chain consensus algorithm as claimed in claim 3, wherein: the leader node is used for broadcasting verified blocks in the organization; the anchor node is used for cross-organizing broadcast blocks; the peer node is used for writing the received block into the account, informing the client application that the transaction proposal is written into the block chain and whether the transaction proposal is valid.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211560127.XA CN115633035B (en) | 2022-12-07 | 2022-12-07 | Improved PBFT (physical layer transmission) based block chain consensus algorithm for Internet of things |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211560127.XA CN115633035B (en) | 2022-12-07 | 2022-12-07 | Improved PBFT (physical layer transmission) based block chain consensus algorithm for Internet of things |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115633035A CN115633035A (en) | 2023-01-20 |
| CN115633035B true CN115633035B (en) | 2023-03-17 |
Family
ID=84910567
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211560127.XA Active CN115633035B (en) | 2022-12-07 | 2022-12-07 | Improved PBFT (physical layer transmission) based block chain consensus algorithm for Internet of things |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115633035B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117527266B (en) * | 2024-01-05 | 2024-05-17 | 杭州趣链科技有限公司 | Asynchronous network consensus method, device, electronic equipment and readable storage medium |
| CN117745433B (en) * | 2024-02-19 | 2024-05-28 | 成都理工大学 | Energy block chain link point consensus method based on improved PBFT consensus mechanism |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110784346A (en) * | 2019-10-18 | 2020-02-11 | 深圳供电局有限公司 | Reputation value-based PBFT consensus system and method |
| CN113343311A (en) * | 2021-06-04 | 2021-09-03 | 北京邮电大学 | Block chain consensus method and system based on reputation model and digital signature mechanism |
| CN113676541A (en) * | 2021-08-23 | 2021-11-19 | 南昌航空大学 | Improved PBFT consensus method |
| CN114003584A (en) * | 2021-11-02 | 2022-02-01 | 贵州大学 | Byzantine fault-tolerant consensus method based on evolutionary game |
| WO2022095780A1 (en) * | 2020-11-06 | 2022-05-12 | 深圳前海微众银行股份有限公司 | Bft-based blockchain consensus method and device |
| CN114785803A (en) * | 2022-04-20 | 2022-07-22 | 浙江工业大学 | Block chain PBFT consensus optimization method suitable for charging pile management |
Family Cites Families (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11689372B2 (en) * | 2019-01-04 | 2023-06-27 | New York University | Secure, energy-efficient public blockchain |
| CN112039964B (en) * | 2020-08-24 | 2022-01-04 | 大连理工大学 | Node reputation consensus method based on block chain |
| CN112163856A (en) * | 2020-10-09 | 2021-01-01 | 北京邮电大学 | Consensus method and system for block chain and Internet of things fusion scene |
| CN113438084B (en) * | 2021-06-23 | 2022-11-29 | 国网北京市电力公司 | Green power source tracing method and system based on R-PBFT consensus algorithm and timestamp |
| CN114978650A (en) * | 2022-05-16 | 2022-08-30 | 中国石油大学(华东) | Improved practical Byzantine fault-tolerant algorithm based on credit value and verifiable random function |
| CN115022326B (en) * | 2022-06-17 | 2023-05-16 | 中国人民解放军战略支援部队信息工程大学 | Block chain Bayesian-court fault tolerance consensus method based on collaborative filtering recommendation |
| CN115378604B (en) * | 2022-08-11 | 2024-05-28 | 重庆邮电大学 | Identity authentication method of edge computing terminal equipment based on reputation value mechanism |
-
2022
- 2022-12-07 CN CN202211560127.XA patent/CN115633035B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110784346A (en) * | 2019-10-18 | 2020-02-11 | 深圳供电局有限公司 | Reputation value-based PBFT consensus system and method |
| WO2022095780A1 (en) * | 2020-11-06 | 2022-05-12 | 深圳前海微众银行股份有限公司 | Bft-based blockchain consensus method and device |
| CN113343311A (en) * | 2021-06-04 | 2021-09-03 | 北京邮电大学 | Block chain consensus method and system based on reputation model and digital signature mechanism |
| CN113676541A (en) * | 2021-08-23 | 2021-11-19 | 南昌航空大学 | Improved PBFT consensus method |
| CN114003584A (en) * | 2021-11-02 | 2022-02-01 | 贵州大学 | Byzantine fault-tolerant consensus method based on evolutionary game |
| CN114785803A (en) * | 2022-04-20 | 2022-07-22 | 浙江工业大学 | Block chain PBFT consensus optimization method suitable for charging pile management |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115633035A (en) | 2023-01-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN115633035B (en) | Improved PBFT (physical layer transmission) based block chain consensus algorithm for Internet of things | |
| CN110784346B (en) | Reputation value-based PBFT consensus system and method | |
| CN111311414B (en) | Block chain multiparty consensus method based on consistent hash algorithm | |
| CN108737375B (en) | Block chain consensus method and system | |
| US10944624B2 (en) | Changing a master node in a blockchain system | |
| CN109151013B (en) | Logistics industry information platform based on alliance block chain | |
| CN109218391B (en) | Block chain based distributed storage system auditing and decentralizing method | |
| CN110298754B (en) | Consensus method applied to block chain | |
| Zhan et al. | DRBFT: Delegated randomization Byzantine fault tolerance consensus protocol for blockchains | |
| CN110945548A (en) | Computer-implemented system and method for managing large distributed storage pools in a blockchain network | |
| CN112883114A (en) | Transaction processing method and device applied to block chain | |
| CN111092896B (en) | Food source tracing distributed data synchronization method based on optimized PAXOS | |
| CN111090892A (en) | Block chain consensus method and device based on VRF and threshold signature | |
| CN112329051A (en) | Safe and efficient consensus mechanism implementation method and system | |
| CN112540926A (en) | Resource allocation fairness federal learning method based on block chain | |
| CN112651830B (en) | Block chain consensus method applied to power resource sharing network | |
| CN113612604B (en) | Asynchronous network-oriented safe distributed random number generation method and device | |
| KR20200081533A (en) | Blockchain Consensus Method based Improved Dynamic Blind Voting for Internet of Things Environment | |
| CN112217683A (en) | Cross-heterogeneous-chain data reachability processing method, system, medium, device and terminal | |
| CN109919760A (en) | Byzantine failure tolerance common recognition algorithm based on voting mechanism | |
| CN111694895A (en) | Block chain remote data auditing method and system | |
| CN111798234B (en) | Lightweight block chain system and construction method | |
| Le et al. | A lightweight block validation method for resource-constrained iot devices in blockchain-based applications | |
| CN114503143A (en) | Unifying protocol consensus | |
| Xu et al. | Improved PBFT algorithm based on vague sets |
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 |