In a previous post, we show that State Machine Replication for any $f<n$ failures is possible in the synchronous model when the adversary can only cause parties to crash. In this post, we show that omission failures are more challenging. Implementing SMR requires at most $f<n/2$ omission failures, even in...| decentralizedthoughts.github.io
After we fix the communication model, synchrony, asynchrony, or partial synchrony, and a threshold adversary we still have 5 important modeling decisions about the adversary power: The type of corruption (passive, crash, omission, or Byzantine). The computational power of the adversary (unbounded, computational, or fine-grained). The adaptivity of the adversary...| decentralizedthoughts.github.io
In this post we explore adversary failure models that are in between crash and omission: Send Omissions (SO): the adversary can corrupt a party and decide to block any message that the party sends. The corrupted party is not aware that it is corrupted or that the message it wanted...| decentralizedthoughts.github.io