FPC-BI: Fast Probabilistic Consensus within Byzantine Infrastructures

@article{Popov2021FPCBIFP,
  title={FPC-BI: Fast Probabilistic Consensus within Byzantine Infrastructures},
  author={S. Popov and W. Buchanan},
  journal={J. Parallel Distributed Comput.},
  year={2021},
  volume={147},
  pages={77-86}
}
  • S. Popov, W. Buchanan
  • Published 2021
  • Computer Science, Mathematics
  • J. Parallel Distributed Comput.
This paper presents a novel leaderless protocol (FPC-BI: Fast Probabilistic Consensus within Byzantine Infrastructures) with a low communicational complexity and which allows a set of nodes to come to a consensus on a value of a single bit. The paper makes the assumption that part of the nodes are \emph{Byzantine}, and are thus controlled by an adversary who intends to either delay the consensus, or break it. This defines that at least a couple of honest nodes come to different conclusions. We… Expand
Fast Probabilistic Consensus with Weighted Votes
On Fairness in Voting Consensus Protocols
A New Attack Method for Malicious Nodes in Tangle Network
Committee selection in DAG distributed ledgers and applications
On asymptotic fairness in voting with greedy sampling
...
1
2
...

References

SHOWING 1-10 OF 33 REFERENCES
Scalable and Probabilistic Leaderless BFT Consensus through Metastability
Simple and efficient oracle-based consensus protocols for asynchronous Byzantine systems
HydRand: Practical Continuous Distributed Randomness
Asynchronous Byzantine Agreement Protocols
SCRAPE: Scalable Randomness Attested by Public Entities
Scalable Byzantine Consensus via Hardware-Assisted Secret Sharing
HydRand: Efficient Continuous Distributed Randomness
DBFT: Efficient Leaderless Byzantine Consensus and its Application to Blockchains
...
1
2
3
4
...