Security Analysis of Majority and Selfish Mining Attacks in a Blockchain with Sharding

Sharding is a promising technology to enhance the scalability of a Proof-of-Work (PoW) blockchain by dividing the nodes or miners into multiple disjoint groups (shards). Each shard processes a subset of transactions so that the throughput can be significantly improved. However, since the number of nodes or the total mining rate in a shard becomes much smaller, previous works claimed that sharding mechanisms decrease security level of a blockchain. In this paper, we mathematically show that the claim is not necessarily true for all types of attacks. We consider both the majority and selfish mining attacks in a sharded blockchain. Three key metrics are generally utilized to evaluate the effectiveness of security attacks, namely, the probability of single shard takeover (<tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$P_{S S T}$</tex>) for majority attack, expected fraction of rewards earned by selfish miners <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$(E R)$</tex> and profitable threshold <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$(P T)$</tex> for selfish mining attack. These metrics are formulated and obtained via mathematical analyses, numerical methods, or simulations. We show that the security level decreases with the increasing number of shards in terms of <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$P_{S S T}$</tex> in majority attacks and <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$P T$</tex> in selfish mining attacks. However, in the case of selfish mining attacks, increasing the number of shards does not necessarily reduce the security level of a sharded blockchain, as measured by <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$E R$</tex>.

Authors

Institutions

Publication Details

Published
2025-06-08
DOI
https://doi.org/10.1109/icc52391.2025.11161767
Primary Topic
Blockchain Technology Applications and Security
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Security Analysis of Majority and Selfish Mining Attacks in a Blockchain with Sharding

Sheng‐Wei Wang, Show‐Shiow Tzeng
Blockchain Technology Applications and Security
article

Security Analysis of Majority and Selfish Mining Attacks in a Blockchain with Sharding

Sheng‐Wei Wang, Show‐Shiow Tzeng
article en

Abstract

Sharding is a promising technology to enhance the scalability of a Proof-of-Work (PoW) blockchain by dividing the nodes or miners into multiple disjoint groups (shards). Each shard processes a subset of transactions so that the throughput can be significantly improved. However, since the number of nodes or the total mining rate in a shard becomes much smaller, previous works claimed that sharding mechanisms decrease security level of a blockchain. In this paper, we mathematically show that the claim is not necessarily true for all types of attacks. We consider both the majority and selfish mining attacks in a sharded blockchain. Three key metrics are generally utilized to evaluate the effectiveness of security attacks, namely, the probability of single shard takeover (<tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$P_{S S T}$</tex>) for majority attack, expected fraction of rewards earned by selfish miners <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$(E R)$</tex> and profitable threshold <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$(P T)$</tex> for selfish mining attack. These metrics are formulated and obtained via mathematical analyses, numerical methods, or simulations. We show that the security level decreases with the increasing number of shards in terms of <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$P_{S S T}$</tex> in majority attacks and <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$P T$</tex> in selfish mining attacks. However, in the case of selfish mining attacks, increasing the number of shards does not necessarily reduce the security level of a sharded blockchain, as measured by <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$E R$</tex>.

National United University (TW), National Kaohsiung Normal University (TW)
Openalex Percentile: Top 62%
Blockchain Technology Applications and Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.