A Hierarchy Byzantine Fault Tolerance Consensus Protocol Based on Node Reputation

Wang, Xixi; Guan, Yepeng

doi:10.3390/s22155887

Cited by 10 publications

(3 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, there exist a number of different methods for implementing reputation systems based on blockchain data (e.g. [33], [34], [35], etc. ), to distinguish honest nodes from faulty ones, and to provide additional rewards and benefits to participants with the best reputations while restricting or even eliminating those with the worst reputations.…”

Section: Literature Overviewmentioning

confidence: 99%

Multi-objective optimization of committee selection for hierarchicalByzantine fault tolerance-basedconsensus protocols

Mazurok¹,

Leonchyk²,

Grybniak³

et al. 2023

HAIT

View full text Add to dashboard Cite

Decentralized platforms like blockchain have been attracting significant attention in recent years, especially in the context of financial and payment systems. They are designed to provide a transparent, secure, and reliable environment for digital transactions without the need for a central authority. The core of a decentralized platform like blockchain is a consensus layer that allows all participants (called Workers), who properly operate and follow all network protocols and have access to the same state of the distributed ledger, to coordinate their actions and arrive at the same decisions. However, some Workers may be temporarily offline at their own discretion, without any confirmation, or their work may be faulty due to technical circumstances, resulting in unpredictable behavior. The goal of this article is to present an approach for multi-objective optimizing of Byzantine fault tolerance (BFT)-based consensus protocols, to reduce the impact on the network of faulty participants. Two criteria were considered – minimization of the number of sent service messages, and maximization of the mathematical expectation of the number of produced blocks. The result is a method to determine the optimal committee size and distribution of Workers, depending on their total number in the network and the expected proportion of Byzantine faulty nodes. All protocol amendments presented in this work are tested with corresponding simulation models and have demonstrated notable enhancements in the performance of the system and decreased the load on network nodes. These improvements will be implemented to the consensus protocol Gozalandia on the Waterfall platform, enhancing its overall reliability, performance, and security. In addition, the presented optimizing algorithm can be applied to a wide range of consensus protocols in blockchains, where blocks must be signed by randomly selected committees to confirm their validity

show abstract

Section: Literature Overviewmentioning

confidence: 99%

Multi-objective optimization of committee selection for hierarchicalByzantine fault tolerance-basedconsensus protocols

Mazurok¹,

Leonchyk²,

Grybniak³

et al. 2023

HAIT

View full text Add to dashboard Cite

show abstract

“…More precisely, the IoT node with better computational capability is more likely to be elected as the new leader. [29] also proposes a new blockchain consensus protocol whereby the participating IoT nodes are ranked in a hierarchical manner for their reputation according to a novel methodology that the authors develop. [30] utilizes blockchain to store and trade information between the IoT nodes of an air to ground IoT network.…”

Section: Related Workmentioning

confidence: 99%

Countering Active Attacks on RAFT-Based IoT Blockchain Networks

et al. 2023

View full text Add to dashboard Cite

This paper considers an Internet of Things (IoT) blockchain wireless network consisting of a leader node and various follower nodes which together implement the RAFT consensus protocol to verify a blockchain transaction, as requested by a blockchain client. Further, two kinds of active attacks, i.e., jamming and impersonation, are considered on the IoT blockchain network due to the presence of multiple active malicious nodes in the close vicinity. When the IoT network is under a jamming attack, we utilize the stochastic geometry tool to derive the closed-form expressions for the coverage probabilities for both uplink and downlink IoT transmissions (which eventually translate to blockchain transaction success rate). On the other hand, when the IoT network is under an impersonation attack, we propose a novel method that enables a receive IoT node to exploit the pathloss of a transmit IoT node as its fingerprint to implement a binary hypothesis test for transmit node identification. To this end, we also provide the closed-form expressions for the probabilities of false alarm, missed detection, and miss-classification. Finally, we present detailed simulation results that indicate the following: i) the coverage probability (and hence blockchain transaction success rate) improves as the jammers' locations move away from the IoT network, ii) the three error probabilities decrease (i.e., chances of corruption of the blockchain ledger data due to false data injection by malicious node decrease) as a function of the quality of the link between the transmit and receive IoT node.

show abstract

“…From these, a default response can be generated if the majority of nodes respond with the same value. In a network conformed by 3m + 1 nodes, a consensus on the state of a transaction can be reached if at most m nodes are faulty [79], [80], i.e., more than two-thirds of the total number of nodes should be honest. This consensus procedure does not require mining.…”

Section: ) Practical Bizantine Fault Tolerance (Pbft)mentioning

confidence: 99%

Survey on Decentralized Auctioning Systems

2023

View full text Add to dashboard Cite

An electronic auction (e-auction) is an efficient negotiation model that allows multiple sellers or buyers to compete for assets or rights. Such systems have become increasingly popular with the evolution of the internet for commerce. In centralized auctioning systems, the presence of a governing third party has been a major trust concern, as such a party may not always be trustworthy or create transaction fees for the hosted auctions. Distributed and decentralized systems based on blockchain for auctions of nonphysical assets have been suggested as a means to distribute and establish trust among peers, and manage disputes and concurrent entries. Although a blockchain system provides attractive features such as decentralized trust management and fraud prevention, it cannot alone support dispute resolutions and adjudications for physical assets. In this paper, we compare blockchain and non-blockchain decentralized auctioning systems based on the identified functional needs and quality attributes. We contrast these needs and attributes with the stateof-the-art models and other implementations of auctioning systems, and discuss the associated trade-offs. We further analyze the gaps in the existing decentralized approaches and propose design approaches for decentralized auctioning systems, for both physical and nonphysical assets, that support dispute resolution and adjudication based on collected evidence, and dispute prevention based on distributed consensus algorithms.

show abstract

A Hierarchy Byzantine Fault Tolerance Consensus Protocol Based on Node Reputation

Cited by 10 publications

References 34 publications

Multi-objective optimization of committee selection for hierarchicalByzantine fault tolerance-basedconsensus protocols

Multi-objective optimization of committee selection for hierarchicalByzantine fault tolerance-basedconsensus protocols

Countering Active Attacks on RAFT-Based IoT Blockchain Networks

Survey on Decentralized Auctioning Systems

Contact Info

Product

Resources

About