TY - GEN
T1 - A Secure and Decentralized Reconfiguration Protocol for Sharding Blockchains
AU - Liu, Yizhong
AU - Xia, Yu
AU - Liu, Jianwei
AU - Hei, Yiming
N1 - Publisher Copyright:
© 2021 IEEE.
PY - 2021/5
Y1 - 2021/5
N2 - Most present reconfiguration methods in sharding blockchains rely on a secure randomness, whose generation might be complicated. Besides, a reference committee is usually in charge of the reconfiguration, making the process not decentralized. To address the above issues, this paper proposes a secure and decentralized shard reconfiguration protocol, which allows each shard to complete the selection and confirmation of its own shard members in turn. The PoW mining puzzle is calculated using the public key hash value in the member list confirmed by the last shard. Through the mining and shard member list commitment process, each shard can update its members safely and efficiently once in a while. Furthermore, it is proved that our protocol satisfies the safety, consistency, liveness, and decentralization properties. The honest member proportion in each confirmed shard member list is guaranteed to exceed a certain safety threshold, and all honest nodes have an identical view on the list. The reconfiguration is ensured to make progress, and each node has the same right to participate in the process. Our secure and decentralized shard reconfiguration protocol could be applied to all committee-based sharding blockchains.
AB - Most present reconfiguration methods in sharding blockchains rely on a secure randomness, whose generation might be complicated. Besides, a reference committee is usually in charge of the reconfiguration, making the process not decentralized. To address the above issues, this paper proposes a secure and decentralized shard reconfiguration protocol, which allows each shard to complete the selection and confirmation of its own shard members in turn. The PoW mining puzzle is calculated using the public key hash value in the member list confirmed by the last shard. Through the mining and shard member list commitment process, each shard can update its members safely and efficiently once in a while. Furthermore, it is proved that our protocol satisfies the safety, consistency, liveness, and decentralization properties. The honest member proportion in each confirmed shard member list is guaranteed to exceed a certain safety threshold, and all honest nodes have an identical view on the list. The reconfiguration is ensured to make progress, and each node has the same right to participate in the process. Our secure and decentralized shard reconfiguration protocol could be applied to all committee-based sharding blockchains.
KW - Byzantine fault tolerance
KW - decentralization
KW - proof-of-work
KW - reconfiguration
KW - sharding blockchain
UR - https://www.scopus.com/pages/publications/85113770033
U2 - 10.1109/BigDataSecurityHPSCIDS52275.2021.00030
DO - 10.1109/BigDataSecurityHPSCIDS52275.2021.00030
M3 - 会议稿件
AN - SCOPUS:85113770033
T3 - Proceedings - 2021 7th IEEE International Conference on Big Data Security on Cloud, IEEE International Conference on High Performance and Smart Computing, and IEEE International Conference on Intelligent Data and Security, BigDataSecurity/HPSC/IDS 2021
SP - 111
EP - 116
BT - Proceedings - 2021 7th IEEE International Conference on Big Data Security on Cloud, IEEE International Conference on High Performance and Smart Computing, and IEEE International Conference on Intelligent Data and Security, BigDataSecurity/HPSC/IDS 2021
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 7th IEEE International Conference on Big Data Security on Cloud, 7th IEEE International Conference on High Performance and Smart Computing, and 6th IEEE International Conference on Intelligent Data and Security, BigDataSecurity/HPSC/IDS 2021
Y2 - 15 May 2021 through 17 May 2021
ER -