This study analyzes the security implications of Proof-of-Work blockchains with respect to the stale block rate and the lack of a block verification process. The stale block rate is a crucial security metric that quantifies the proportion of rejected blocks in the blockchain network. The absence of a block verification process represents another critical security concern, as it permits the potential for invalid transactions within the network. In this article, we propose and implement a quantitative and analytical model to capture the primary operations of Proof-of-Work blockchains utilizing the Performance Evaluation Process Algebra. The proposed model can assist blockchain designers, architects, and analysts in achieving the ideal security level for blockchain systems by determining the proper network and consensus settings. We conduct extensive experiments to determine the sensitivity of security to four aspects: the number of active miners and their mining hash rates, the duration between blocks, the latency in block propagation, and the time required for block verification, all of which have been shown to influence the outcomes. We contribute to the findings of the existing research by conducting the first analysis of how the number of miners affects the frequency of stale block results, as well as how the delay in block propagation influences the incentives received by rational miners who choose to avoid the block verification process.
Mobile ad hoc networks (MANETs) are wireless multi-hop networks that do not rely on any fixed infrastructure, unlike traditional networks. Nodes in MANETs are formed dynamically and are free to move in any direction at variable speeds. The special characteristics of MANETs make them vulnerable to flooding attacks, which can have a negative impact on their performance. Moreover, due to their nature, employing solutions designed for traditional networks is not feasible. One potential solution to enhance the performance of MANETs in the face of network attacks is to implement trust management. This paper evaluates the performance of Ad hoc On-Demand Distance Vector (AODV) Routing in the presence of a flooding attack. We propose a direct trust management scheme to detect and isolate malicious nodes and implement this scheme on AODV. We name the modified protocol Trusted AODV (TAODV) and, finally, compare the performance of AODV and TAODV when both are under a flooding attack to measure the improvement achieved by our suggested scheme.