PartitionChain: A Scalable and Reliable Data Storage Strategy for Permissioned Blockchain
Open Access
- 20 December 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 35 (4) , 4124-4136
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.Keywords
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:
- A new certificateless aggregate signature schemeComputer Communications, 2009
- Round robin scheduling – a surveyEuropean Journal of Operational Research, 2008
- Hierarchical Web caching systems: modeling, design and experimental resultsIEEE Journal on Selected Areas in Communications, 2002
- Practical byzantine fault tolerance and proactive recoveryACM Transactions on Computer Systems, 2002
- Identity-Based Cryptosystems and Signature Schemes2000
- Practical Threshold Signatures2000
- Byzantine quorum systemsDistributed Computing, 1998
- Efficient signature generation by smart cardsJournal of Cryptology, 1991
- Efficient Gaussian Elimination Method for Symbolic Determinants and Linear SystemsACM Transactions on Mathematical Software, 1982
- How to share a secretCommunications of the ACM, 1979