Optimizing Parallel Proof of Vote Consensus Based on Mimic Security in Consortium Blockchains.

Some Byzantine fault tolerant (BFT) consensus algorithm in consortium blockchains have lots of message broadcast to encroach bandwidth, which greatly affect the efficiency of consensus execution. Although reducing the number of global consensus nodes can help, it is also at the cost of reduced security. Based on the idea of Mimic Defense, this paper proposes a consensus framework for BFT consensus and takes the Parallel Proof of Vote (PPoV) algorithm as an example to design a randomized node sharding and role partitioning scheme to improve security of the consensus process without affecting efficiency much. In addition, the multimode adjudication group composed of the shard leaders can replace the single leader to complete voting statistics to improve the reliability of consensus results. Through theoretical analysis, it is known that the BFT consensus framework based on mimic security, taking PPoV as an example, has a strong defense effect against eclipse attacks and selfish mining. A simulation experiment is also designed to prove that through efficient iteration and dynamic threshold design, the adjudication group greatly improves the reliability of the results and the robustness of the algorithm.