An n/2 byzantine node tolerate blockchain sharding approach
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Standard
An n/2 byzantine node tolerate blockchain sharding approach. / Xu, Yibin; Huang, Yangyu.
35th Annual ACM Symposium on Applied Computing, SAC 2020. Association for Computing Machinery, Inc, 2020. s. 349-352 (Proceedings of the ACM Symposium on Applied Computing).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Harvard
APA
Vancouver
Author
Bibtex
}
RIS
TY - GEN
T1 - An n/2 byzantine node tolerate blockchain sharding approach
AU - Xu, Yibin
AU - Huang, Yangyu
N1 - Publisher Copyright: © 2020 Owner/Author.
PY - 2020/3/30
Y1 - 2020/3/30
N2 - 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.
AB - 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.
KW - Blockchain
KW - Blockchain sharding
KW - Decentralised ledger
KW - PBFT
UR - http://www.scopus.com/inward/record.url?scp=85079796866&partnerID=8YFLogxK
U2 - 10.1145/3341105.3374069
DO - 10.1145/3341105.3374069
M3 - Article in proceedings
AN - SCOPUS:85079796866
T3 - Proceedings of the ACM Symposium on Applied Computing
SP - 349
EP - 352
BT - 35th Annual ACM Symposium on Applied Computing, SAC 2020
PB - Association for Computing Machinery, Inc
T2 - 35th Annual ACM Symposium on Applied Computing, SAC 2020
Y2 - 30 March 2020 through 3 April 2020
ER -
ID: 300914381