• 9 April 2024
    • preprint
    • Published by HAL in HAL
Abstract
Byzantine Fault Tolerant (BFT) Algorithms have been utilized in distributed systems or blockchains for solving consensus problemsby being reliable, consistent, and ensuring availability. However, in the case of consortium blockchains where the network is moreaccountable with limited participation, there is a need to modify the BFT algorithms while ensuring the existing advantages butimproving upon its scalability and fault tolerance. So in this scenario, we analyze the BFT consensus algorithms performance froma mobility consortium blockchain perspective for data certification and data monetization use cases. We identify the challenges ofmessage complexity and security in the algorithm through this implementation and propose an improved algorithm CUBA (CompetitiveUtilitarian Byzantine Agreement). It achieves better scalability compared to PBFT, IBFT, and QBFT algorithm variants of BFT andremains comparable to Clique. CUBA uses parallelization, reduced communication complexity through quorums, utilitarian actionmeasures, and network evolution to render the system secure and performant. It is analyzed from a performance and a security pointof view to test its resilience against benign or non-benign failures.
All Related Versions

This publication has 12 references indexed in Scilit: