An n/2 Byzantine node tolerate blockchain sharding approach

Xu, Yibin and Yangyu, Huang An n/2 Byzantine node tolerate blockchain sharding approach. Presented at: The 35th ACM/SIGAPP Symposium on Applied Computing (SAC ’20), Brno, Czech Republic, March 30-April 3, 2020. The 35th ACM/SIGAPP Symposium on Applied Computing (SAC ’20), March 30-April 3, 2020, Brno, Czech Republic. ACM, 10.1145/3341105.3374069

Preview

PDF - Accepted Post-Print Version Download (174kB) | Preview

Abstract

Traditional Blockchain Sharding approaches can only tolerate up to n/3 of nodes being adversary because they rely on the hypergeometric distribution to make a failure (an adversary does not have n/3 of nodes globally but can manipulate the consensus of a Shard) hard to happen. The system must maintain a large Shard size (the number of nodes inside a Shard) to sustain the low failure probability so that only a small number of Shards may exist. In this paper, we present a new approach of Blockchain Sharding that can withstand up to n/2 of nodes being bad. We categorise the nodes into different classes, and every Shard has a fixed number of nodes from different classes. We prove that this design is much more secure than the traditional models (only have one class) and the Shard size can be reduced significantly. In this way, many more Shards can exist, and the transaction throughput can be largely increased. The improved Blockchain Sharding approach is promising to serve as the foundation for decentralised autonomous organisations and decentralised database.

Item Type:	Conference or Workshop Item (Paper)
Status:	Published
Schools:	Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA76 Computer software
Publisher:	ACM
ISBN:	97814536866
Date of First Compliant Deposit:	25 March 2020
Last Modified:	20 Mar 2021 02:33
URI:	https://orca.cardiff.ac.uk/id/eprint/130489

Citation Data

Cited 8 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item