Abstract
The fundamental component of Blockchain technology, the consensus algorithm, is employed to guarantee data consistency among Blockchain nodes. Because it is resistant to Byzantine errors, consortium chains frequently use the Practical Byzantine Fault Tolerance (PBFT) consensus mechanism. Nevertheless, the current PBFT still has issues with high node communication complexity and random master node selection. This study proposes the IBFT consensus mechanism, which is based on the aggregate signature of Boneh-Lynn-Shacham (BLS) and node trust value. Multi-level indications in IBFT are made to determine each node's trust value. A few very reliable nodes are chosen to serve as consensus nodes. Whichever node has the highest trust value is selected as the master node. Afterwards, BLS aggregated signatures are used to optimize the consensus flow of PBFT. As a result, information sent between nodes is kept secure and node communication complexity is decreased. The simulation experiment results show that when compared to the PBFT, the IBFT consensus approach improves transaction throughputs by 61% and lowers latency by 13%.
Keywords
Blockchain, Boneh Lynn Shacham (BLS), Consensus Algorithm, Practical Byzantine Fault Tolerance (PBFT), Trust Value
Article Type
Special Issue Article
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.
How to Cite this Article
Zhang, Dayong; Abdul Wahab, Nur Haliza; and Zin, Adi Wira Mohd
(2024)
"Optimizing Blockchain Consensus: Incorporating Trust Value in the Practical Byzantine Fault Tolerance Algorithm with Boneh-Lynn-Shacham Aggregate Signature,"
Baghdad Science Journal: Vol. 21:
Iss.
2, Article 36.
DOI: https://doi.org/10.21123/bsj.2024.9735
