FPBFT: A Fast PBFT Protocol for Private Blockchains

Riahi, Kenza; Brahmia, Mohamed-el-Amine; Abouaïssa, Abdelhafid; Idoumghar, Lhassane

doi:10.1109/iotsms58070.2022.10062170

2022 9th International Conference on Internet of Things: Systems, Management and Security (IOTSMS) 2022

DOI: 10.1109/iotsms58070.2022.10062170

|View full text |Cite

FPBFT: A Fast PBFT Protocol for Private Blockchains

Kenza Riahi¹,

Mohamed-el-Amine Brahmia²,

Abdelhafid Abouaïssa

et al.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

2024

Publication Types

Select...

Article2

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

BW-PBFT: Practical byzantine fault tolerance consensus algorithm based on credit bidirectionally waning

Wang,

Liu,

Wang

et al. 2023

Peer-to-Peer Netw. Appl.

View full text Add to dashboard Cite

The consensus algorithm, as one of the cores of blockchain technology, plays a very critical role. As one of the mainstream consensus methods, PBFT has the advantages such as low energy consumption and large throughput. However, the traditional PBFT algorithm also has disadvantages, such as high network bandwidth occupation, for PBFT needs broadcasting information for all nodes in stage 3 and 4; limited expandability. With the increase of nodes, the bandwidth overhead of the blockchain network will increase significantly, which leads to a decrease in throughput, so that cause a crash of the blockchain network. We proposed an improved PBFT consensus based on a credit value bidirectionally waning, named BW-PBFT. The algorithm first elects some nodes to form a committee according to the ballot and the credit value, and then the committee nodes use the PBFT algorithm for consensus, and calculate the credit value of the nodes according to the performance in the consensus process. If nodes do not get punishment anymore, their credit value will approach 50 with the increase of the blockchain height. Theoretical analysis and experiments prove that the proposed algorithm can effectively improve the quality of the nodes involved in the consensus.

show abstract

BW-PBFT: Practical byzantine fault tolerance consensus algorithm based on credit bidirectionally waning

Wang,

Liu,

Wang

et al. 2023

Peer-to-Peer Netw. Appl.

View full text Add to dashboard Cite

show abstract

A Reputation Awareness Randomization Consensus Mechanism in Blockchain Systems

Zhang,

Sun,

Guo

et al. 2024

IEEE Internet Things J.

View full text Add to dashboard Cite

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

FPBFT: A Fast PBFT Protocol for Private Blockchains

Cited by 2 publications

References 15 publications

BW-PBFT: Practical byzantine fault tolerance consensus algorithm based on credit bidirectionally waning

BW-PBFT: Practical byzantine fault tolerance consensus algorithm based on credit bidirectionally waning

A Reputation Awareness Randomization Consensus Mechanism in Blockchain Systems

Contact Info

Product

Resources

About