Blockchain (e.g., Bitcoin and Ethereum) has drawn much attention and has been widely-deployed in recent years. However, blockchain scalability is emerging as a challenging issue. This paper outlines the existing solutions to blockchain scalability, which can be classified into two categories: first layer and second layer solutions . First layer solutions propose modifications to the blockchain (i.e., changing the blockchain structure, such as block size) while second layer solutions propose mechanisms that are implemented outside of the blockchain. In particular, we focus on sharding as a promising first layer solution to the scalability issue; the basic idea behind sharding is to divide the blockchain network into multiple committees, each processing a separate set of transactions. More specifically, (a) we propose a taxonomy based on committee formation and intra-committee consensus; and (b) we compare the main existing sharding-based blockchain protocols. We also present a performance-based comparative analysis (i.e., throughput and latency), of the advantages, and disadvantages in existing scalability solutions.
7 June 2022 in IEEE Transactions on Emerging Topics in Computing
Blockchain like Bitcoin and Ethereum suffer from scalability issues. Sharding is one of the most promising and leading solutions to scale blockchain. The basic idea behind sharding is to divide the blockchain network into multiple committees, where each processing a separate set of transactions, rather than the entire network processes all transactions. In this paper, we propose a probabilistic approach to analyze the security of sharding-based blockchain protocols. Based on this approach, we investigate the threat of Sybil attacks in these protocols. The key contribution of our paper is a tractable probabilistic approach to accurately compute the failure probability that at least one committee fails and ultimately compute the probability of a successful attack. To show the effectiveness of our approach, we conduct a numerical and comparative analysis of the proposed approach with existing approaches.
Cryptocurrencies (e.g., Bitcoin and Ethereum), which promise to become the future of money transactions, are mainly implemented with blockchain technology. However, blockchain suffers from scalability issues. Sharding is the leading solution for blockchain scalability. Sharding splits the blockchain network into sub-chains called shards/committees. Each shard processes a sub-set of transactions, rather than the entire network processing all transactions. This raises security issues for sharding-based blockchain protocols. In this paper, we propose a novel methodology to analyze the security of these protocols (e.g., OmniLedger and RapidChain). In particular, this methodology estimates the failure probability of one sharding round taking into consideration the failure probabilities of all shards. To illustrate the effectiveness of the estimated failure probability, we conduct a numerical analysis of our methodology based on a huge number of trials. Finally, we compute confidence intervals to accurately estimate the failure probability and compare our methodology with existing approaches.
The rise of the Internet of Medical Things (IoMT) has enhanced healthcare delivery but also exposed critical cybersecurity vulnerabilities. Detecting attacks in such environments demands accurate, interpretable, and cost-efficient models. This paper addresses the critical challenges in network security, particularly in IoMT, through advanced machine learning (ML) approaches. We propose a high-performance cybersecurity framework leveraging a carefully fine-tuned XGBoost classifier to detect malicious attacks with superior predictive accuracy while maintaining interpretability. Our comprehensive evaluation compares the proposed model with a well-regularized Logistic Regression baseline using key performance metrics. Additionally, we analyze the security-cost trade-off in designing ML systems for threat detection and employ SHAP (SHapley Additive exPlanations) to identify key features driving predictions. We further introduce a late fusion approach based on max voting that effectively combines the strengths of both models. Results demonstrate that while XGBoost achieves higher accuracy (0.97) and recall (1.00) compared to Logistic Regression, our late fusion model provides a more balanced performance with improved precision (0.98) and reduced false negatives, making it particularly suitable for security-sensitive applications. This work contributes to developing robust, interpretable, and efficient ML solutions for addressing evolving cybersecurity challenges in networked environments.
Blockchain technology has been gaining great interest from a variety of sectors including healthcare, supply chain, and cryptocurrencies. However, Blockchain suffers from a limited ability to scale (i.e., low throughput and high latency). Several solutions have been proposed to tackle this. In particular, sharding has proved to be one of the most promising solutions to Blockchain’s scalability issue. Sharding can be divided into two major categories: (1) Sharding-based Proof-of-Work (PoW) Blockchain protocols, and (2) Sharding-based Proof-of-Stake (PoS) Blockchain protocols. The two categories achieve good performances (i.e., good throughput with a reasonable latency), but raise security issues. This article focuses on the second category. In this paper, we start by introducing the key components of sharding-based PoS Blockchain protocols. We then briefly introduce two consensus mechanisms, namely PoS and practical Byzantine Fault Tolerance (pBFT), and discuss their use and limitations in the context of sharding-based Blockchain protocols. Next, we provide a probabilistic model to analyze the security of these protocols. More specifically, we compute the probability of committing a faulty block and measure the security by computing the number of years to fail. We achieve a number of years to fail of approximately 4000 in a network of 4000 nodes, 10 shards, and a shard resiliency of 33%.
The explosive growth of the Internet of Things (IoT) has significantly increased networked devices within distributed and heterogeneous networks. Due to these networks’ inherent vulnerabilities and diversity, the proliferation of IoT devices presents substantial security challenges. Traditional security solutions face challenges in keeping up with the constantly changing threats in dynamic situations. This article reviews the application of distributed Reinforcement Learning approaches to enhance IoT security in dispersed and heterogeneous networks. This paper provides a comprehensive overview of the fundamental theories reinforcing IoT security. It also explores the basis of Distributed Reinforcement Learning and discuss its benefits and drawbacks for IoT security. Then, the focus is given on how Distributed Reinforcement Learning might address these issues and offer details on the design factors to consider when implementing Distributed Reinforcement Learning-based solutions into practice. The paper outlines case studies and experiments that show how Distributed Reinforcement Learning may enhance IoT security. It also addresses performance analysis and evaluation measures to compare Distributed Reinforcement Learning-based approaches with conventional security methods. Finally, the paper highlights the possible uses of Distributed Reinforcement Learning in IoT security and suggest future directions, emerging trends, and unresolved challenges.