Title: PartitionChain: A Scalable and Reliable Data Storage Strategy for Permissioned Blockchain
Conference (TKDE’23): Link
Journal (): Link
This work proposes PartitionChain to address BFT-Store’s problem, where the computation overhead and network transmission overhead are high for blockchain initialization and re-encoding. In addition, it enhances security, as BFT-Store does not implement the security check (e.g., measuring malicious behaviors).
For this paper, I merely focus on the storage overhead reduction
Protocol: also PBFT + RS code
Encoding: similar to BFT-Store, but the coding is performed on a per-block basis; it also applies CLAS(Certificate Aggregate Signature) to enhance security for BFT.
Decoding: it’s also similar to BFT-Store. It needs election of a leader that’s likely to be honest, and it will decode the block by retrieving valid pieces (from both honest and malicious nodes) of original blocks.
Scaling: in my opinion, the scaling process for data re-encoding is the same as BFT-Store. The difference is the data verification process (in other words, PartitionChain verifies the data integrity of the original block before scaling).
PartitionChain out-performs over BFT-Store mainly from the security aspect
The re-initialization overhead of PartitionChain is reduced from BFT-Store, as some nodes doe snot need to re-encode all data