Enhancing the efficiency and scalability of blockchain through probabilistic verification and clustering

被引:15
作者
Li, Mengya [1 ]
Qin, Yang [1 ]
Liu, Bing [1 ]
Chu, Xiaowen [2 ]
机构
[1] Harbin Inst Technol, Coll Comp Sci & Technol, Shenzhen, Peoples R China
[2] Hong Kong Baptist Univ, Dept Comp Sci, Hong Kong, Peoples R China
关键词
Blockchain; Fork; Security; Storage limitation; Clustering; Node collaboration;
D O I
10.1016/j.ipm.2021.102650
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Blockchain is a disruptive technique that finds many applications in FinTech, IoT, and token economy. 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. Participates are about to face the problem of storage limitation. 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 analysed 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. 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. It aims to solve the storage pressure by reducing the amount data that each participate need to store and reduce communication overhead by collaboratively storing and verifying blocks through in-cluster nodes. 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.
引用
收藏
页数:19
相关论文
共 26 条
[1]  
Ali M, 2016, PROCEEDINGS OF USENIX ATC '16: 2016 USENIX ANNUAL TECHNICAL CONFERENCE, P181
[2]  
Babaioff M., 2012, P 13 ACM C EL COMM, P56, DOI DOI 10.1145/2229012.2229022
[3]  
Baliga A., 2020, Persistent Systems Ltd. Tech. Report
[4]  
Bamert T, 2013, IEEE INT CONF PEER
[5]  
Bentov I., 2014, ACM SIGMETRICS Performance Evaluation Review, V42, P34, DOI DOI 10.1145/2695533.2695545
[6]   SoK: Research Perspectives and Challenges for Bitcoin and Cryptocurrencies [J].
Bonneau, Joseph ;
Miller, Andrew ;
Clark, Jeremy ;
Narayanan, Arvind ;
Kroll, Joshua A. ;
Felten, Edward W. .
2015 IEEE SYMPOSIUM ON SECURITY AND PRIVACY SP 2015, 2015, :104-121
[7]  
Decker Christian, 2015, Stabilization, Safety and Security of Distributed Systems. 17th International Symposium, SSS 2015. Proceedings: LNCS 9212, P3, DOI 10.1007/978-3-319-21741-3_1
[8]   Information Propagation in the Bitcoin Network [J].
Decker, Christian ;
Wattenhofert, Roger .
13TH IEEE INTERNATIONAL CONFERENCE ON PEER-TO-PEER COMPUTING (P2P), 2013,
[9]  
Eyal I, 2016, 13TH USENIX SYMPOSIUM ON NETWORKED SYSTEMS DESIGN AND IMPLEMENTATION (NSDI '16), P45
[10]   Majority Is Not Enough: Bitcoin Mining Is Vulnerable [J].
Eyal, Ittay ;
Sirer, Emin Guen .
FINANCIAL CRYPTOGRAPHY AND DATA SECURITY, FC 2014, 2014, 8437 :436-454