A flexible n/2 adversary node resistant and halting recoverable blockchain sharding protocol

Publikation: Bidrag til tidsskriftTidsskriftartikelfagfæ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 tidsskriftTidsskriftartikelfagfællebedømt

Harvard

Xu, Y, Huang, Y, Shao, J & Theodorakopoulos, G 2020, 'A flexible n/2 adversary node resistant and halting recoverable blockchain sharding protocol', Concurrency and Computation: Practice and Experience, bind 32, nr. 19, e5773. https://doi.org/10.1002/cpe.5773

APA

Xu, Y., Huang, Y., Shao, J., & Theodorakopoulos, G. (2020). A flexible n/2 adversary node resistant and halting recoverable blockchain sharding protocol. Concurrency and Computation: Practice and Experience, 32(19), [e5773]. https://doi.org/10.1002/cpe.5773

Vancouver

Xu Y, Huang Y, Shao J, Theodorakopoulos G. A flexible n/2 adversary node resistant and halting recoverable blockchain sharding protocol. Concurrency and Computation: Practice and Experience. 2020 okt. 10;32(19). e5773. https://doi.org/10.1002/cpe.5773

Author

Xu, Yibin ; Huang, Yangyu ; Shao, Jianhua ; Theodorakopoulos, George. / A flexible n/2 adversary node resistant and halting recoverable blockchain sharding protocol. I: Concurrency and Computation: Practice and Experience. 2020 ; Bind 32, Nr. 19.

Bibtex

@article{a0ddad83d79140b39582d843a2520f7b,
title = "A flexible n/2 adversary node resistant and halting recoverable blockchain sharding protocol",
abstract = "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.",
keywords = "blockchain sharding, distributed ledger, halting",
author = "Yibin Xu and Yangyu Huang and Jianhua Shao and George Theodorakopoulos",
note = "Publisher Copyright: {\textcopyright} 2020 The Authors. Concurrency and Computation: Practice and Experience published by John Wiley & Sons, Ltd.",
year = "2020",
month = oct,
day = "10",
doi = "10.1002/cpe.5773",
language = "English",
volume = "32",
journal = "Concurrency Computation Practice and Experience",
issn = "1532-0626",
publisher = "Wiley",
number = "19",

}

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