An n/2 byzantine node tolerate blockchain sharding approach
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Traditional Blockchain Sharding approaches can only tolerate up to n/3 of nodes being adversary because they rely on the hyper-geometric 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.
|Titel||35th Annual ACM Symposium on Applied Computing, SAC 2020|
|Forlag||Association for Computing Machinery, Inc|
|Publikationsdato||30 mar. 2020|
|Status||Udgivet - 30 mar. 2020|
|Begivenhed||35th Annual ACM Symposium on Applied Computing, SAC 2020 - Brno, Tjekkiet|
Varighed: 30 mar. 2020 → 3 apr. 2020
|Konference||35th Annual ACM Symposium on Applied Computing, SAC 2020|
|Periode||30/03/2020 → 03/04/2020|
|Sponsor||ACM Special Interest Group on Applied Computing (SIGAPP)|
|Navn||Proceedings of the ACM Symposium on Applied Computing|
© 2020 Owner/Author.