Robustness and efficiency of leaderless probabilistic consensus protocols within Byzantine infrastructures
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:77EY4F6Erecord.jsonopen to challenge →
classification
cs.DC
math.PR
keywords
byzantineconsensusinfrastructuresleaderlessprotocolsrobustnessamountattack
read the original abstract
This paper investigates leaderless binary majority consensus protocols with low computational complexity in noisy Byzantine infrastructures. Using computer simulations, we show that explicit randomization of the consensus protocol can significantly increase the robustness towards faulty and malicious nodes. We identify the optimal amount of randomness for various Byzantine attack strategies on different kinds of network topologies.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.