Trusted-Committee- Based Secure and Scalable BFT Consensus for Consortium Blockchain

Abstract

Compared with public blockchain, consortium blockchain is more secure and controllable deployed in an enterprise scenario. Byzantine fault tolerance (BFT) consensus is widely applied in consortium blockchain. Although PBFT is the most classic practical BFT consensus with message complexity O(n2), it still faces some security threats and has low consensus efficiency. To address these issues, we propose a secure and trusted BFT (S2BFT) consensus based on trusted committees. S2BFT generates a trusted anonymous number using trust execution environment (TEE) for each server node and selects committees by pseudo-random algorithm. S2BFT can efficiently reach consensus by the committees with an O(m*n) message complexity. In addition, correctness analysis proves that S2BFT can resist more attacks than traditional BFT consensus and tolerate 1/2 byzantine server nodes. Results further demonstrate the efficiency of the simulated S2BFT implementation.