Brief Announcement: All-to-All Gradecast using Coding with Byzantine Failures

摘要

Many distributed algorithms require consistent global information in the presence of faulty processes. Forward error correction codes can be used to reduce the message bit complexity when acquiring consistent global information in the presence of faulty processes. The usual method of acquiring consistent: global information in the presence of faults is for every process to broadcast its information; then, every process reb.roadca.sts the broadcasts, The first broadcast is sometimes called first-order information and the second is sometimes referred to as second-order information. Many algorithms that tolerate Byzantine faults require this second-order information. For example, Byzantine consensus, interactive consistency, consistent broadcast, and multiconsensus all require second-order information. In order to perform a fault-tolerant broadcast, second-order knowledge is required.