• Corpus ID: 199372638

Another Look at Byzantine Fault Tolerance

@article{Wang2019AnotherLA,
  title={Another Look at Byzantine Fault Tolerance},
  author={Yongge Wang},
  journal={IACR Cryptol. ePrint Arch.},
  year={2019},
  volume={2019},
  pages={864}
}
  • Yongge Wang
  • Published 2019
  • Computer Science
  • IACR Cryptol. ePrint Arch.
We review several solutions for the Byzantine Fault Tolerance (BFT) problem and discuss some aspects that are frequently overlooked by existing literatures. [] Key Result Thus it is important for developers to be aware of these issues when developing applications (such as blockchains) using these BFT protocols.
View Paper
eprint.iacr.org

References

SHOWING 1-10 OF 18 REFERENCES

HotStuff: BFT Consensus in the Lens of Blockchain

This work presents HotStuff, a leader-based Byzantine fault-tolerant replication protocol for the partially synchronous model that enables a correct leader to drive the protocol to consensus at the pace of actual network delay with communication complexity that is linear in the number of replicas.

State Machine Replication in the Libra Blockchain

The Libra Byzantine Fault Tolerance algorithmic core incorporates a novel round synchronization mechanism that provides bounded commit latency under synchrony and introduces a nil-block vote that allows proposals to commit despite having faulty leaders.

Reaching Agreement in the Presence of Faults

It is shown that the problem is solvable for, and only for, n ≥ 3m + 1, where m is the number of faulty processors and n is the total number and this weaker assumption can be approximated in practice using cryptographic methods.

Perfectly Secure Message Transmission Revisited

The general case with a network modeled by a directed graph is studied, giving necessary and sufficient bounds on the number of channels that are required from sender to receiver given a number of ldquofeedbackrdquo channels from receiver to sender.

The Byzantine Generals Problem

It is shown that, using only oral messages, the problem of a group of generals camped with their troops around an enemy city is solvable if and only if more than two-thirds of the generals are loyal; so a single traitor can confound two loyal generals.

Another Look at ALGORAND

The first attack in this paper shows that a malicious adversary who controls less than 1/3 of the users (or money units) could fork the ALGORAND chain very easily.

On expected constant-round protocols for Byzantine agreement

TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944).

  • R. Friedberg
  • Mathematics
    Proceedings of the National Academy of Sciences of the United States of America
  • 1957
If we have shown that for 1nf < jal, Vhu for sufficiently small h have their L (N2IaI +1)-norms uniformly bounded in h and since the same is true for Vh¶/i and Vh c#I, we may apply relation (3) to v…

Short Signatures from the Weil Pairing

A short signature scheme based on the Computational Diffie–Hellman assumption on certain elliptic and hyperelliptic curves is introduced for systems where signatures are typed in by a human or are sent over a low-bandwidth channel.

Practical byzantine fault tolerance and proactive recovery

A new replication algorithm, BFT, is described that can be used to build highly available systems that tolerate Byzantine faults and is used to implement the first Byzantine-fault-tolerant NFS file system, BFS.