Privacy-Preserving PBFT Based on a New BFT Asynchronous Verifiable Secret Sharing

Many types of research on PBFT in the past focused on improving the efficiency of the algorithm, but with the development of the times, people have higher requirements for data privacy, which poses new challenges to the design of the PBFT algorithm. Considering the issue of data privacy, a natural idea is to use the method of secret sharing to let each node only store the secret share locally, and use the binding between the secret share and the polynomial to ensure the consistency of the system. In this line, integrating VSS into the BFT algorithm is a common method, but we found that when the traditional VSS is integrated into the BFT algorithm, there is a problem that the misbehavior of the data writer cannot be identified. To solve this problem, we design a new BFT AVSS based on ZKIPCP. Our scheme itself is not excellent, but it is a good choice when integrated into the BFT algorithm, and it can solve the problem that traditional schemes cannot identify malicious data writers. We describe how to integrate our BFT AVSS scheme into the PBFT algorithm for data privacy protection. Finally, we implemented our privacy-preserving PBFT and proves through experiments that it can meet our original purpose, that is, privacy protection and malicious data writer identification.