Byzantine fault-tolerant (BFT) protocols allow a group of replicas to come to consensus even
when some of the replicas are Byzantine faulty. There exist multiple BFT protocols to …

Partially synchronous Byzantine consensus protocols typically structure their execution into
a sequence of views, each with a designated leader process. The key to guaranteeing …

This paper introduces secure network provenance (SNP), a novel technique that enables
networked systems to explain to their operators why they are in a certain state--eg, why a …

Partial failures occur frequently in cloud systems and can cause serious damage including
inconsistency and data loss. Unfortunately, these failures are not well understood. Nor can …

In this paper, we introduce Polygraph, the first accountable Byzantine consensus algorithm.
If among n users t<n/3 are malicious then it ensures consensus; otherwise (if t≧n/3), it …

For applications of Byzantine fault tolerant (BFT) consensus protocols where the participants
are economic agents, recent works highlighted the importance of accountability: the ability to …

Real-world distributed systems suffer unavailability due to various types of failure. But,
despite enormous effort, many failures, especially gray failures, still escape detection. In this …

We analyze bribing attacks in Proof-of-Stake distributed ledgers from a game theoretic
perspective. In bribing attacks, an adversary offers participants a reward in exchange for …

Byzantine state-machine replication (SMR) ensures the consistency of replicated state in the
presence of malicious replicas and lies at the heart of the modern blockchain technology …

In a non-synchronous system with n processes, no t 0-resilient (deterministic or probabilistic)
Byzantine consensus protocol can prevent a disagreement among correct processes if the …