Breaking the Balance of Power: Commitment Attacks on Ethereum's Reward Mechanism

• URL: http://arxiv.org/abs/2407.19479v1
• Date: Sun, 28 Jul 2024 12:17:17 GMT
• Title: Breaking the Balance of Power: Commitment Attacks on Ethereum's Reward Mechanism
• Authors: Roozbeh Sarenche, Ertem Nusret Tas, Barnabe Monnot, Caspar Schwarz-Schilling, Bart Preneel,
• Abstract summary: We show a series of commitment attacks on LMD GHOST, a core part of the consensus mechanism. These attacks disrupt the intended balance of power between proposers and voters. We introduce a novel reward mechanism that restores the voters' role as a check against proposer power.
• Score: 4.524180577541776
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Validators in permissionless, large-scale blockchains (e.g., Ethereum) are typically payoff-maximizing, rational actors. Ethereum relies on in-protocol incentives, like rewards for validators delivering correct and timely votes, to induce honest behavior and secure the blockchain. However, external incentives, such as the block proposer's opportunity to capture maximal extractable value (MEV), may tempt validators to deviate from honest protocol participation. We show a series of commitment attacks on LMD GHOST, a core part of Ethereum's consensus mechanism. We demonstrate how a single adversarial block proposer can orchestrate long-range chain reorganizations by manipulating Ethereum's reward system for timely votes. These attacks disrupt the intended balance of power between proposers and voters: by leveraging credible threats, the adversarial proposer can coerce voters from previous slots into supporting blocks that conflict with the honest chain, enabling a chain reorganization at no cost to the adversary. In response, we introduce a novel reward mechanism that restores the voters' role as a check against proposer power. Our proposed mitigation is fairer and more decentralized -- not only in the context of these attacks -- but also practical for implementation in Ethereum.

Related papers

• Securing Proof of Stake Blockchains: Leveraging Multi-Agent Reinforcement Learning for Detecting and Mitigating Malicious Nodes [0.2982610402087727]
  MRL-PoS+ is a novel consensus algorithm to enhance the security of PoS blockchains. We show that MRL-PoS+ significantly improves the attack resilience of PoS blockchains.
  arXiv  Detail & Related papers  (2024-07-30T17:18:03Z)
• The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
  We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols. Existing approaches for threshold cryptosystems introduce a latency overhead of at least one message delay for running the threshold cryptographic protocol. We propose a mechanism to eliminate this overhead for blockchain-native threshold cryptosystems with tight thresholds.
  arXiv  Detail & Related papers  (2024-07-16T20:53:04Z)
• Flashback: Enhancing Proposer-Builder Design with Future-Block Auctions in Proof-of-Stake Ethereum [27.386337024680245]
  Auction mechanisms used between searchers, builders and proposers are crucial to the overall health of the blockchain. In this paper, we consider PBS design in as a game between searchers, builders and proposers. A key novelty in our design is the inclusion of future block proposers, as all proposers of an epoch are decided ahead of time in proof-of-stake (PoS) Our analysis shows the existence of alternative auction mechanisms that result in a better equilibrium to players compared to state-of-the-art.
  arXiv  Detail & Related papers  (2024-05-15T15:58:21Z)
• Blockchains for Internet of Things: Fundamentals, Applications, and Challenges [38.29453164670072]
  Not every blockchain system is suitable for specific IoT applications. Public blockchains are not suitable for storing sensitive data. We explore the blockchain's application in three pivotal IoT areas: edge AI, communications, and healthcare.
  arXiv  Detail & Related papers  (2024-05-08T04:25:57Z)
• Byzantine Attacks Exploiting Penalties in Ethereum PoS [0.0]
  This paper investigates the implications of the inactivity leak on safety within the blockchain. Our findings uncover how penalizing inactive nodes can compromise blockchain properties.
  arXiv  Detail & Related papers  (2024-04-25T06:54:35Z)
• Generative AI-enabled Blockchain Networks: Fundamentals, Applications, and Case Study [73.87110604150315]
  Generative Artificial Intelligence (GAI) has emerged as a promising solution to address challenges of blockchain technology. In this paper, we first introduce GAI techniques, outline their applications, and discuss existing solutions for integrating GAI into blockchains.
  arXiv  Detail & Related papers  (2024-01-28T10:46:17Z)
• SoK: Security of Cross-chain Bridges: Attack Surfaces, Defenses, and Open Problems [43.80265187232706]
  Cross-chain bridges are used to facilitate token and data exchanges across blockchains. Although bridges are becoming increasingly popular, they are still in their infancy and have been attacked multiple times recently. This paper analyzes the security landscape of cross-chain bridges in a holistic manner.
  arXiv  Detail & Related papers  (2023-12-19T20:13:21Z)
• Parallel Proof-of-Work with DAG-Style Voting and Targeted Reward Discounting [0.0]
  We present parallel proof-of-work with DAG-style voting, a novel proof-of-work cryptocurrency protocol. It provides better consistency guarantees, higher transaction throughput, lower transaction confirmation latency, and higher resilience against incentive attacks. An interesting by-product of our analysis is that parallel proof-of-work without reward discounting is less resilient to incentive attacks than Bitcoin in some realistic network scenarios.
  arXiv  Detail & Related papers  (2023-12-05T20:14:33Z)
• How Hard is Takeover in DPoS Blockchains? Understanding the Security of Coin-based Voting Governance [10.452241620239814]
  Delegated-Proof-of-Stake (DPoS) blockchains are governed by a committee of block producers elected via a coin-based voting system. This paper presents the first large-scale empirical study of the passive takeover resistance of EOSIO, Steem and TRON.
  arXiv  Detail & Related papers  (2023-10-28T05:22:54Z)
• Quantum-resistance in blockchain networks [46.63333997460008]
  This paper describes the work carried out by the Inter-American Development Bank, the IDB Lab, LACChain, Quantum Computing (CQC), and Tecnologico de Monterrey to identify and eliminate quantum threats in blockchain networks. The advent of quantum computing threatens internet protocols and blockchain networks because they utilize non-quantum resistant cryptographic algorithms.
  arXiv  Detail & Related papers  (2021-06-11T23:39:25Z)
• Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's Post-Quantum Security [67.06003361150228]
  A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task. In this work, we examine the hardness of finding such chain of PoWs against quantum strategies. We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
  arXiv  Detail & Related papers  (2020-12-30T18:03:56Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.