CFT and BFT

Transforming a Deterministic CFT algorithm to a BFT algorithm. Let $A$ be any deterministic distributed algorithm designed for non-synchronous systems that tolerates crash faults. The following two mechanisms are necessary and sufficient to transform $A$ to an algorithm that tolerates Byzantine faults without increasing the number of processes: (1) a mechanism to prevent equivocation, and (2) a mechanism to ensure the transferable authentication of network messages (e.g., using digital signatures) [ref].