Abstract
Blockchain technology has aroused wide interests and become a hot topic in the real world. Nevertheless, the increasingly heavy storage consumption brought by the full-replication data storage mechanism, becomes a bottleneck to the system scalability. To address this problem, a reliable storage scheme named BFT-Store, integrating erasure coding with Byzantine Fault Tolerance (BFT), was proposed recently. While, three critical problems are still left open: (i) The complex re-initialization process of the blockchain when the number of nodes varies; (ii) The high computational overload of downloading data; (iii) The massive communication on the network. This paper proposes a blockchain storage scheme termed PartitionChain which addresses the above three problems, maintaining the merits of BFT-Store. Firstly, our scheme allows the original nodes to merely update a single aggregate signature in the re-initialization. Secondly, the computational complexity of retrieving data by decoding is greatly reduced. Thirdly, the amount of transmitted data for recovering data is reduced from O(n) (assuming n is the number of nodes) to O(1). Furthermore, this paper introduces a reputation ranking system where the malicious behaviors of the nodes can be detected, enabling PartitionChain to expel the nodes with misbehavior to the specific extent.
Funding Information
  • NSFC-ISF (61961146004)
  • Innovation Program of Shanghai Municipal Education Commission (2021-01-07-00-08-E00101)

This publication has 33 references indexed in Scilit: