Multi-Node Data Privacy Audit for Blockchain Integrity
A. Shenbaga Bharatha Priya, Sanjaya Kumar Sarangi, S. Balasubramanian, Bhaskar Roy · 2022
Cross-shard transactions in the blockchain sharding scheme are coordinated and processed by multiple shards. In the sharding scheme using the Practical Byzantine Fault Tolerance (PBFT) consensus algorithm, there is a problem that the transaction cannot be verified due to the failure of the shard due to the aggregation of Byzantine nodes in a single bit after sharding. Therefore, to ensure the consistency of data between chips, it is necessary to roll back the partially processed cross-shard transactions, which affects the system’s overall performance. In response to the above problems, a multi-round consensus verification scheme is proposed, which can reduce the rollback probability, support a larger fragmentation scale, and increase the system’s transaction per second (TPS). The advantages and disadvantages of the existing sharding project solutions are briefly described, the probability and rollback probability of cross-sharding transactions are analyzed, and a multi-round consensus verification scheme is proposed. Influence, a reasonable upper limit of the number of rounds is obtained. The comparison experiment with the existing plan shows that the multi-round verification scheme can effectively improve the transaction verification rate, reduce the probability of cross-slice transaction rollback, and improve the overall TPS of the system.