FPC-BI: Fast Probabilistic Consensus within Byzantine Infrastructures

@article{Popov2021FPCBIFP,
  title={FPC-BI: Fast Probabilistic Consensus within Byzantine Infrastructures},
  author={Serguei Yu. Popov and William J. Buchanan},
  journal={J. Parallel Distributed Comput.},
  year={2021},
  volume={147},
  pages={77-86}
}
  • S. Popov, W. Buchanan
  • Published 26 May 2019
  • Computer Science, Mathematics
  • J. Parallel Distributed Comput.

Figures from this paper

Tangle 2.0 Leaderless Nakamoto Consensus on the Heaviest DAG
TLDR
The theoretical foundations of the Tangle 2.0 are introduced and a framework to analyse liveness and safety under different communication and adversary models is proposed, allowing providing impossibility results in some edge cases and in the asynchronous communication model.
Fast Probabilistic Consensus with Weighted Votes
TLDR
This study proposes an adaption of the fast probabilistic consensus to a setting where the voting power is proportional to the nodes reputations, and model the reputation using a Zipf law and shows that the performance of the protocol in Byzantine infrastructure increases with the Zipf exponent.
Voting-based probabilistic consensuses and their applications in distributed ledgers
TLDR
The Fast Probabilistic Consensus (FPC) protocol is discussed, which circumvents the problems mentioned above by using external randomness.
Access Control for Distributed Ledgers in the Internet of Things: A Networking Approach
TLDR
This article considers a class of IoT-friendly DLTs based on directed acyclic graphs, rather than a blockchain, and with a reputation system in the place of Proof of Work (PoW), and model the access control problem and presents an algorithm that is fair, efficient, and secure.
Resilience of IOTA Consensus
TLDR
This paper investigates the convergence of two Consensus proposed by IOTA: Fast Probabilistic Consensus and Cellular Consensus, when run on top of various topologies, and investigates their resilience to various types of adversaries.
On Fairness in Voting Consensus Protocols
TLDR
This work investigates effects that may arise from weighted voting, such as loss of anonymity, centralization, scalability, and their relevance to protocol design and implementation, and construction of a fair voting protocol.
A New Attack Method for Malicious Nodes in Tangle Network
TLDR
This article proposes a new possible attack strategy and defense strategy for the Tangle network and simulates the realization of this attack method and proposes a defense strategy.
Blockchain for Mobile Edge Computing: Consensus Mechanisms and Scalability
TLDR
This chapter reviews existing consensus protocols and scalability techniques in both well-established and next-generation blockchain architectures for managing MEC services and evaluates the most suitable solutions and discusses the benefits and drawbacks of the available alternatives.
Committee selection in DAG distributed ledgers and applications
TLDR
This paper proposes several solutions to the committee selection problem among participants of a DAG distributed ledger based on a ledger intrinsic reputation model that serves as a selection criterion, and outlines applications of the proposed protocols.
...
...

References

SHOWING 1-10 OF 34 REFERENCES
Scalable and Probabilistic Leaderless BFT Consensus through Metastability
TLDR
A family of leaderless Byzantine fault tolerance protocols, built around a metastable mechanism via network subsampling, that provide a strong probabilistic safety guarantee in the presence of Byzantine adversaries while their concurrent and leaderless nature enables them to achieve high throughput and scalability.
Snowflake to Avalanche : A Novel Metastable Consensus Protocol Family for Cryptocurrencies Team Rocket
  • Computer Science
  • 2018
TLDR
A new family of leaderless Byzantine fault tolerance protocols, built on a metastable mechanism, that provide a strong probabilistic safety guarantee in the presence of Byzantine adversaries, while their concurrent nature enables them to achieve high throughput and scalability.
HydRand: Practical Continuous Distributed Randomness
TLDR
HydRand is a novel distributed protocol based on publicly-verifiable secret sharing (PVSS) to ensure unpredictability, bias-resistance, and public-verifiability of a continuous sequence of random beacon values and is the first to present a detailed comparison of recently described schemes and protocols that can be used for implementing random beacons.
Asynchronous Byzantine Agreement Protocols
SCRAPE: Scalable Randomness Attested by Public Entities
TLDR
This work presents a coin tossing protocol for an honest majority that allows for any entity to verify that an output was honestly generated by observing publicly available information (even after the execution is complete), while achieving both guaranteed output delivery and scalability.
Scalable Byzantine Consensus via Hardware-Assisted Secret Sharing
TLDR
This paper proposes FastBFT, a fast and scalable BFT protocol that combines hardware-based trusted execution environments (TEEs) with lightweight secret sharing and has better scalability and performance than previous BFT protocols.
HydRand: Efficient Continuous Distributed Randomness
TLDR
This work improves upon previous random beacon approaches with HydRand, a novel distributed protocol based on publicly-verifiable secret sharing (PVSS) to ensure unpredictability, bias-resistance, and public-verifiability of a continuous sequence of random beacon values.
Fast Probabilistic Consensus with Weighted Votes
TLDR
This study proposes an adaption of the fast probabilistic consensus to a setting where the voting power is proportional to the nodes reputations, and model the reputation using a Zipf law and shows that the performance of the protocol in Byzantine infrastructure increases with the Zipf exponent.
DBFT: Efficient Leaderless Byzantine Consensus and its Application to Blockchains
TLDR
This paper presents a new leaderless Byzantine consensus called the Democratic Byzantine Fault Tolerance (DBFT) for blockchains, which can terminate even when its coordinator is faulty and an optimized reduction from multivalue consensus to binary consensus whose fast path terminates in 4 message delays.
The Honey Badger of BFT Protocols
TLDR
HoneyBadgerBFT is presented, the first practical asynchronous BFT protocol, which guarantees liveness without making any timing assumptions, and is based on a novel atomic broadcast protocol that achieves optimal asymptotic efficiency.
...
...