publication . Part of book or chapter of book . 2021

Fast Probabilistic Consensus with Weighted Votes

Sebastian Müller; Andreas Penzkofer; Bartosz Kuśmierz; Darcy Camargo; William J. Buchanan;
Open Access English
  • Published: 01 Nov 2021
  • Publisher: HAL CCSD
  • Country: France
Abstract
The fast probabilistic consensus (FPC) is a voting consensus protocol that is robust and efficient in Byzantine infrastructure. We propose an adaption of the FPC to a setting where the voting power is proportional to the nodes reputations. We model the reputation using a Zipf law and show using simulations that the performance of the protocol in Byzantine infrastructure increases with the Zipf exponent. Moreover, we propose several improvements of the FPC that decrease the failure rates significantly and allow the protocol to withstand adversaries with higher weight. We distinguish between cautious and berserk strategies of the adversaries and propose an efficient method to detect the more harmful berserk strategies. Our study refers at several points to a specific implementation of the IOTA protocol, but the principal results hold for general implementations of reputation models.
Persistent Identifiers
Subjects
free text keywords: [MATH.MATH-PR]Mathematics [math]/Probability [math.PR], Probabilistic logic, Principal (computer security), Reputation, media_common.quotation_subject, media_common, Protocol (object-oriented programming), Sybil attack, Zipf's law, Implementation, Computer science, Theoretical computer science, Voting
Any information missing or wrong?Report an Issue