A flexible n/2 adversary node resistant and halting recoverable blockchain sharding protocol
Publikation: Bidrag til tidsskrift › Tidsskriftartikel › fagfællebedømt
Standard
A flexible n/2 adversary node resistant and halting recoverable blockchain sharding protocol. / Xu, Yibin; Huang, Yangyu; Shao, Jianhua; Theodorakopoulos, George.
I: Concurrency and Computation: Practice and Experience, Bind 32, Nr. 19, e5773, 10.10.2020.Publikation: Bidrag til tidsskrift › Tidsskriftartikel › fagfællebedømt
Harvard
APA
Vancouver
Author
Bibtex
}
RIS
TY - JOUR
T1 - A flexible n/2 adversary node resistant and halting recoverable blockchain sharding protocol
AU - Xu, Yibin
AU - Huang, Yangyu
AU - Shao, Jianhua
AU - Theodorakopoulos, George
N1 - Publisher Copyright: © 2020 The Authors. Concurrency and Computation: Practice and Experience published by John Wiley & Sons, Ltd.
PY - 2020/10/10
Y1 - 2020/10/10
N2 - Blockchain sharding is a promising approach to solving the dilemma between decentralization and high performance (transaction throughput) for blockchain. The main challenge of blockchain sharding systems is how to reach a decision on a statement among a subgroup (shard) of people while ensuring the whole population recognizes this statement. Namely, the challenge is to prevent an adversary who does not have the majority of nodes globally but have the majority of nodes inside a shard. Most blockchain sharding approaches can only reach a correct consensus inside a shard with at most n/3 evil nodes in a n node system. There is a blockchain sharding approach which can prevent an incorrect decision to be reached when the adversary does not have n/2 nodes globally. However, the system can be stopped from reaching consensus (become deadlocked) if the adversary controls a smaller number of nodes. In this article, we present an improved Blockchain sharding approach that can withstand n/2 adversarial nodes and recover from deadlocks. The recovery is made by dynamically adjusting the number of shards and the shard size. A performance analysis suggests our approach has a high performance (transaction throughput) while requiring little bandwidth for synchronization.
AB - Blockchain sharding is a promising approach to solving the dilemma between decentralization and high performance (transaction throughput) for blockchain. The main challenge of blockchain sharding systems is how to reach a decision on a statement among a subgroup (shard) of people while ensuring the whole population recognizes this statement. Namely, the challenge is to prevent an adversary who does not have the majority of nodes globally but have the majority of nodes inside a shard. Most blockchain sharding approaches can only reach a correct consensus inside a shard with at most n/3 evil nodes in a n node system. There is a blockchain sharding approach which can prevent an incorrect decision to be reached when the adversary does not have n/2 nodes globally. However, the system can be stopped from reaching consensus (become deadlocked) if the adversary controls a smaller number of nodes. In this article, we present an improved Blockchain sharding approach that can withstand n/2 adversarial nodes and recover from deadlocks. The recovery is made by dynamically adjusting the number of shards and the shard size. A performance analysis suggests our approach has a high performance (transaction throughput) while requiring little bandwidth for synchronization.
KW - blockchain sharding
KW - distributed ledger
KW - halting
UR - http://www.scopus.com/inward/record.url?scp=85083323561&partnerID=8YFLogxK
U2 - 10.1002/cpe.5773
DO - 10.1002/cpe.5773
M3 - Journal article
AN - SCOPUS:85083323561
VL - 32
JO - Concurrency Computation Practice and Experience
JF - Concurrency Computation Practice and Experience
SN - 1532-0626
IS - 19
M1 - e5773
ER -
ID: 300913953