Enhancing the efficiency and scalability of blockchain through probabilistic verification and clustering
作者:
Highlights:
• Because of the asynchrony, the competitive mining, and the indeterministic block propagation delay in networks, forks in the blockchain occur frequently, which not only waste a lot of computing resources but also result in potential security issues. This issue will greatly affect the efficiency of blockchain networks. In the meantime, when blockchain networks expand, the storage data for each node will be increasing dramatically so that the blockchain is hard to scale.
• This paper introduced PvScheme, a probabilistic verification scheme that could effectively reduce the block propagation delay and reduce the occurrence of blockchain forks. We further enhanced the security of PvScheme to provide reliable block delivery. We also analyzed the resistance of PvScheme to fake blocks and double spending attacks. Furthermore, we proposed ICIStrategy, a multi-node collaborative storage strategy based on intra-cluster integrity, to enhance the scalability of blockchain. In ICIStrategy, we divided all participates into several clusters. Each cluster requires holding all data of the network, whereas a node within the cluster does not need to maintain data integrity.
• We designed the experiments to study the performance of PvScheme and ICIStrategy. The experiment results illustrated that PvScheme could reduce the propagation delay of the standard protocol by 43.1% when the validation degree was 0.5. And we got the best effect when the validation degree is 0.9. It got a relatively lower forks and a relatively higher security at the same time, which achieved a compromise between the efficiency and security in the blockchain. According to the experimental results, ICIStrategy decreased effectively the storage of each node. And the larger the scale of networks, the less the storage of each node.
摘要
•Because of the asynchrony, the competitive mining, and the indeterministic block propagation delay in networks, forks in the blockchain occur frequently, which not only waste a lot of computing resources but also result in potential security issues. This issue will greatly affect the efficiency of blockchain networks. In the meantime, when blockchain networks expand, the storage data for each node will be increasing dramatically so that the blockchain is hard to scale.•This paper introduced PvScheme, a probabilistic verification scheme that could effectively reduce the block propagation delay and reduce the occurrence of blockchain forks. We further enhanced the security of PvScheme to provide reliable block delivery. We also analyzed the resistance of PvScheme to fake blocks and double spending attacks. Furthermore, we proposed ICIStrategy, a multi-node collaborative storage strategy based on intra-cluster integrity, to enhance the scalability of blockchain. In ICIStrategy, we divided all participates into several clusters. Each cluster requires holding all data of the network, whereas a node within the cluster does not need to maintain data integrity.•We designed the experiments to study the performance of PvScheme and ICIStrategy. The experiment results illustrated that PvScheme could reduce the propagation delay of the standard protocol by 43.1% when the validation degree was 0.5. And we got the best effect when the validation degree is 0.9. It got a relatively lower forks and a relatively higher security at the same time, which achieved a compromise between the efficiency and security in the blockchain. According to the experimental results, ICIStrategy decreased effectively the storage of each node. And the larger the scale of networks, the less the storage of each node.
论文关键词:Blockchain,Fork,Security,Storage limitation,Clustering,Node collaboration
论文评审过程:Received 15 May 2020, Revised 7 May 2021, Accepted 21 May 2021, Available online 29 June 2021, Version of Record 29 June 2021.
论文官网地址:https://doi.org/10.1016/j.ipm.2021.102650