The Availability-Accountability Dilemma and its Resolution via Accountability Gadgets

  title={The Availability-Accountability Dilemma and its Resolution via Accountability Gadgets},
  author={Joachim Neu and Ertem Nusret Tas and DavidN C. Tse},
  booktitle={IACR Cryptology ePrint Archive},
. 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 identify participants who provably violate the protocol. At the same time, being able to reach consensus under dynamic levels of participation is desirable for censorship resistance. We identify an availability-accountability dilemma : in an environment with dynamic participation, no protocol can… 

Basilic: Resilient Optimal Consensus Protocols With Benign and Deceitful Faults

This paper presents a new lower bound on the solvability of the consensus problem by distinguishing deceitful faults violating safety and benign faults violating termination from the more general Byzantine faults, in what they call the Byzantine-deceitful-benign fault model.

ZLB: A Blockchain to Tolerate Colluding Majorities

Zero-Loss Blockchain (ZLB), the first blockchain that tolerates an adversary controlling more than half of the system, is presented, an open blockchain that combines recent theoretical advances in accountable Byzantine agreement to exclude undeniably deceitful replicas.

Two Attacks On Proof-of-Stake GHOST/Ethereum

Two attacks targeting the Proof-of-Stake (PoS) Ethereum consensus protocol are presented, suggesting a fundamental conceptual incompatibility and showing how LMD specifically can be exploited to obtain a new variant of the balancing attack that overcomes a recent protocol addition that was intended to mitigate balancing-type attacks.

Babylon: Reusing Bitcoin Mining to Enhance Proof-of-Stake Security

Babylon is a blockchain platform which combines the best of both worlds by reusing the immense Bitcoin hash power to enhance the security of PoS chains, and has zero additional energy cost.

No More Attacks on Proof-of-Stake Ethereum?

The latest message driven (LMD) greedy heaviest observed sub-tree (GHOST) consensus protocol is presented, and it is proved that it is secure and reorg resilient in synchronous networks with dynamic participation, assuming a majority of the nodes ( validators ) follows the protocol honestly.

Accountable Safety for Rollups

This work provides an accountable rollup design and proves its security, both for the traditional ‘enshrined’ rollups and for sovereign rollups, an emergent alternative built on lazy blockchains, tasked only with ordering and availability of the rollup data.

Player-Replaceability and Forensic Support are Two Sides of the Same (Crypto) Coin

The main result is to construct a new BFT protocol that is player-replaceable and has maximum forensic support, without which it is shown that natural adaptations of extant BFT and longest chain protocols do not lead to the desired goal of si-multaneous player- replaceability and forensic support.

Two More Attacks on Proof-of-Stake GHOST/Ethereum

This work presents two new attack strategies targeting the PoS Ethereum consensus protocol, suggesting a fundamental conceptual incompatibility between PoS and the Greedy Heaviest-Observed Sub-Tree (GHOST) fork choice paradigm employed by PoSthereum.

Bitcoin-Enhanced Proof-of-Stake Security: Possibilities and Impossibilities

It is shown security issues are inherent in any PoS chain without an external trusted source, and a new protocol Babylon is proposed, where an off-the-shelf PoS protocol uses Bitcoin.

Reducing confirmation reversal probability of PoW blockchains using checkpoints

  • Ke WangHyong S. Kim
  • Computer Science, Mathematics
    2022 IEEE International Conference on Blockchain and Cryptocurrency (ICBC)
  • 2022
It is demonstrated that with majority mining power being honest, miners could always select a proper checkpoint period to ensure the assumption of the majority of a committee being honest holds for hundreds of years on average.



Ebb-and-Flow Protocols: A Resolution of the Availability-Finality Dilemma

A new class of flexible consensus protocols, ebb-and-flow protocols, are formulated, which support a full dynamically available ledger in conjunction with a finalized prefix ledger, to resolve the availability-finality dilemma.

GRANDPA: a Byzantine Finality Gadget

This work formally model the finality gadget abstraction, proves that it is impossible to solve it deterministically in full asynchrony (even though it is stronger than consensus), and provides a partially synchronous protocol which is currently securing a major blockchain.

Flexible Byzantine Fault Tolerance

A synchronous BFT protocol in which only the commit step requires to know the network delay bound and thus replicas execute the protocol without any synchrony assumption is introduced, and a notion called Flexible Byzantine Quorums is introduced by dissecting the roles of different quorums in existing consensus protocols.

Consensus Redux: Distributed Ledgers in the Face of Adversarial Supremacy

This work gives the first thorough treatment of self-healing properties of distributed ledgers covering both proof-of-work (PoW) and proof- of-stake (PoS) protocols, and quantifies the vulnerability period that corresponds to an adversarial spike.

Snow White: Robustly Reconfigurable Consensus and Applications to Provably Secure Proof of Stake

It is shown that any consensus protocol satisfying the desired robustness properties can be used to construct proofs-of-stake consensus, as long as money does not switch hands too quickly.

Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback

Ditto is designed, a Byzantine SMR protocol that enjoys the best of both worlds: optimal communication on and off the happy path (linear and quadratic, respectively) and progress guarantee under asynchrony and DDoS attacks.

PeerReview: practical accountability for distributed systems

It is demonstrated that PeerReview is practical by applying it to three different types of distributed systems: a network filesystem, a peer-to-peer system, and an overlay multicast system.

ALGORAND AGREEMENT: Super Fast and Partition Resilient Byzantine Agreement

A simple Byzantine agreement protocol with leader election, that works under > 2/3 honest majority and does not rely on the participants having synchronized clocks, that is resilient to arbitrary network partitions with unknown length, and recovers fast after the partition is resolved and bounded message delay is restored.

Snap-and-Chat Protocols: System Aspects

This paper considers system aspects of snap-and-chat protocols and shows how they can provide two important features: 1) accountability, 2) support of light clients.

The Sleepy Model of Consensus

This work begins a study of distributed protocols in a “sleepy” model of computation where players can be either online (awake) or offline (asleep), and their online status may change at any point during the protocol.