Skip to main content

About this Research Topic

Manuscript Submission Deadline 04 January 2023
Manuscript Extension Submission Deadline 03 February 2023

Blockchain consensus is the foundation that determines the security and performance of a blockchain system. System performance, such as throughput and transaction confirmation latency, is largely determined by the consensus mechanism. Blockchain consensus is that all participating nodes reach a final consensus on the block view through certain rules. There are many types of blockchain consensus mechanisms, such as proof-of-work, proof-of-stake, and Byzantine fault tolerant algorithms. Each consensus has its own special rule design and different applicable scenarios. Usually, in the public chain, proof-of-work, proof-of-stake, etc. are used, which can achieve weak consistence, that is, the block needs to reach a certain depth before it can be finally confirmed. In the consortium blockchain, the strong consistency based on BFT is generally adopted, and the block can be confirmed immediately.



How to design a new type of blockchain consensus to improve its security and achieve high performance is an important issue that needs to be solved. Specifically, it includes the following aspects. First, designing an efficient BFT algorithm under a partially synchronous network to improve the scalability of the BFT algorithm. Second, design an efficient BFT algorithm in an asynchronous network environment, and improve the asynchronous common subset protocol and binary Byzantine agreement protocol. Third, an asynchronous dynamic committee update method should be designed to update committee members and their corresponding private keys. Fourth, design a safe and efficient sharding blockchain consensus mechanism to achieve security, scalability, and decentralization. Fifth, design blockchain consensus suitable for different scenarios and apply it, such as combining with 5G and 6G, combining with federated learning, privacy computing, etc.



Authors can submit articles in the following directions or more related directions.

1. Improved PoW consensus

2. Improved PoS consensus

3. Improved BFT consensus under partially synchronous network

4. Improved BFT consensus under asynchronous network

5. Dynamic BFT protocols

6. Emerging sharding consensus

7. Blockchain application in various field

8. Blockchain in 5G/6G

9. Blockchain with federated learning

10. Blockchain and privacy-preserving computing

Keywords: consensus, Byzantine fault tolerance, sharding, access control, authentication


Important Note: All contributions to this Research Topic must be within the scope of the section and journal to which they are submitted, as defined in their mission statements. Frontiers reserves the right to guide an out-of-scope manuscript to a more suitable section or journal at any stage of peer review.

Blockchain consensus is the foundation that determines the security and performance of a blockchain system. System performance, such as throughput and transaction confirmation latency, is largely determined by the consensus mechanism. Blockchain consensus is that all participating nodes reach a final consensus on the block view through certain rules. There are many types of blockchain consensus mechanisms, such as proof-of-work, proof-of-stake, and Byzantine fault tolerant algorithms. Each consensus has its own special rule design and different applicable scenarios. Usually, in the public chain, proof-of-work, proof-of-stake, etc. are used, which can achieve weak consistence, that is, the block needs to reach a certain depth before it can be finally confirmed. In the consortium blockchain, the strong consistency based on BFT is generally adopted, and the block can be confirmed immediately.



How to design a new type of blockchain consensus to improve its security and achieve high performance is an important issue that needs to be solved. Specifically, it includes the following aspects. First, designing an efficient BFT algorithm under a partially synchronous network to improve the scalability of the BFT algorithm. Second, design an efficient BFT algorithm in an asynchronous network environment, and improve the asynchronous common subset protocol and binary Byzantine agreement protocol. Third, an asynchronous dynamic committee update method should be designed to update committee members and their corresponding private keys. Fourth, design a safe and efficient sharding blockchain consensus mechanism to achieve security, scalability, and decentralization. Fifth, design blockchain consensus suitable for different scenarios and apply it, such as combining with 5G and 6G, combining with federated learning, privacy computing, etc.



Authors can submit articles in the following directions or more related directions.

1. Improved PoW consensus

2. Improved PoS consensus

3. Improved BFT consensus under partially synchronous network

4. Improved BFT consensus under asynchronous network

5. Dynamic BFT protocols

6. Emerging sharding consensus

7. Blockchain application in various field

8. Blockchain in 5G/6G

9. Blockchain with federated learning

10. Blockchain and privacy-preserving computing

Keywords: consensus, Byzantine fault tolerance, sharding, access control, authentication


Important Note: All contributions to this Research Topic must be within the scope of the section and journal to which they are submitted, as defined in their mission statements. Frontiers reserves the right to guide an out-of-scope manuscript to a more suitable section or journal at any stage of peer review.

Topic Editors

Loading..

Topic Coordinators

Loading..

Articles

Sort by:

Loading..

Authors

Loading..

views

total views views downloads topic views

}
 
Top countries
Top referring sites
Loading..

Share on

About Frontiers Research Topics

With their unique mixes of varied contributions from Original Research to Review Articles, Research Topics unify the most influential researchers, the latest key findings and historical advances in a hot research area! Find out more on how to host your own Frontiers Research Topic or contribute to one as an author.