Sharding Blockchain

Chow, Sherman S. M.; Lai, Ziliang; Liu, Chris; Lo, Eric; Zhao, Yongjun

doi:10.1109/cybermatics_2018.2018.00277

Cited by 17 publications

(3 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, these proposed solutions cannot make significant performance gains without sacrificing decentralization or security, or both. In particular, the scalability solution that preserves both decentralization and security is sharding, which creates multiple groups (called shards) of validators and lets them process transactions in parallel [25].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Comprehensive Survey on Sharding in Blockchains

Zou

et al. 2021

Mobile Information Systems

View full text Add to dashboard Cite

Blockchain technology has been widely used in many fields, such as smart cities, smart health care, and smart manufacturing, due to its anonymity, decentralization, and tamper resistance in peer-to-peer (P2P) networks. However, poor scalability has severely affected the widespread adoption of traditional blockchain technology in high-throughput and low-latency applications. Therefore, based on the three-layer architecture, this study presents a variety of solutions to improve the scalability of the blockchain. As the scale of the network expands, one of the most practical ways to achieve horizontal scalability is sharding, where the network is divided into multiple subnetworks to avoid repeated communication overhead, storage, and calculations. This study provides a systematic and comprehensive introduction to blockchain sharding, along with a detailed comparison and evaluation for primarily considered sharding mechanisms. We also provide the detailed calculations and then analyze the characteristics of existing solutions along with our insights.

show abstract

Section: Introductionmentioning

confidence: 99%

“…New blockchain-based sharding solutions have been proposed in recent studies [10,[25][26][27][28]. Surveys of blockchain scalability [29][30][31][32][33][34] that only focused on vertical scaling and reducing overhead have been gradually taking blockchain sharding into account.…”

Section: Introductionmentioning

confidence: 99%

A Comprehensive Survey on Sharding in Blockchains

Zou

et al. 2021

Mobile Information Systems

View full text Add to dashboard Cite

show abstract

“…It achieved a consensus mechanism different from the main chain. Ethereum achieved multi-chain structure by slicing technology which was considered to be an effective solution for the scalability problem of blockchain 4 Hyperledger generated a private "subnet" for communication between two or more members by multichannel technology, and different members needed to complete identification and authorization before trading. 5 In the research of multichain partition, Li et al 6 proposed a community clustering partition algorithm in which the nodes of system were divided according to the relationship of communication tightness.…”

Section: Introductionmentioning

confidence: 99%

Privacy budget management and noise reusing in multichain environment

Jiang

et al. 2021

Int J of Intelligent Sys

View full text Add to dashboard Cite

To solve the problem of query restriction in supply‐chain financial blockchain system, this paper proposes a privacy budget management and noise reusing method in multichain blockchain environment based on Hyperledger multichannel technology and community clustering algorithm. A historical record book is established to manage the privacy budget according to historical query types, and a differential privacy protection algorithm based on noise reusing is used to generate and reusing noise. In the experiments, we tested the privacy budget loss, data utility and system performance based on the business data‐set from chemical supply chain. The experimental results show that the blockchain system with multichain structure based on community clustering algorithm reduces the system data storage space and decreases request processing time effectively. The privacy budget loss of the proposed method is about 1/3 of that of the pure Gaussian mechanism method. After 100 queries, the total amount of noise is about 8% less than that of pure Gaussian mechanism. Besides that, the noise reusing algorithm reduces the loss of the privacy budget and breaks through the query limitation caused by privacy budget wasting.

show abstract