Byzantine Attacks Exploiting Penalties in Ethereum PoS

• URL: http://arxiv.org/abs/2404.16363v2
• Date: Thu, 6 Jun 2024 16:27:39 GMT
• Title: Byzantine Attacks Exploiting Penalties in Ethereum PoS
• Authors: Ulysse Pavloff, Yackolley Amoussou-Genou, Sara Tucci-Piergiovanni,
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In May 2023, the Ethereum blockchain experienced its first inactivity leak, a mechanism designed to reinstate chain finalization amid persistent network disruptions. This mechanism aims to reduce the voting power of validators who are unreachable within the network, reallocating this power to active validators. This paper investigates the implications of the inactivity leak on safety within the Ethereum blockchain. Our theoretical analysis reveals scenarios where actions by Byzantine validators expedite the finalization of two conflicting branches, and instances where Byzantine validators reach a voting power exceeding the critical safety threshold of one-third. Additionally, we revisit the probabilistic bouncing attack, illustrating how the inactivity leak can result in a probabilistic breach of safety, potentially allowing Byzantine validators to exceed the one-third safety threshold. Our findings uncover how penalizing inactive nodes can compromise blockchain properties, particularly in the presence of Byzantine validators capable of coordinating actions.

Related papers

• Blockchain Economic Denial of Sustainability Attack: Exploiting Latency Optimization in Ethereum Transaction Forwarding [13.13413794919346]
  Economic Denial of Sustainability (EDoS) attack can cause financial losses in traffic costs for operators of modified nodes. We show that an attacker can amplify network traffic at modified nodes by a factor of 3,600, and cause economic damages 13,800 times greater than the amount needed to carry out the attack.
  arXiv  Detail & Related papers  (2024-08-02T18:06:33Z)
• Breaking the Balance of Power: Commitment Attacks on Ethereum's Reward Mechanism [4.524180577541776]
  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.
  arXiv  Detail & Related papers  (2024-07-28T12:17:17Z)
• 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)
• Towards a Formal Foundation for Blockchain Rollups [9.760484165522005]
  ZK-Rollups aim to address challenges by processing transactions off-chain and validating them on the main chain. This work presents a formal analysis using the Alloy specification language to examine and design key Layer 2 functionalities. We propose enhanced models to strengthen security and censorship resistance, setting new standards for the security of rollups.
  arXiv  Detail & Related papers  (2024-06-23T21:12:19Z)
• Larger-scale Nakamoto-style Blockchains Don't Necessarily Offer Better Security [1.2644625435032817]
  Research on Nakamoto-style consensus protocols has shown that network delays degrade the security of these protocols. This contradicts the very foundation of blockchains, namely that decentralization improves security. We take a closer look at how the network scale affects security of Nakamoto-style blockchains.
  arXiv  Detail & Related papers  (2024-04-15T16:09:41Z)
• Enhancing Trust and Privacy in Distributed Networks: A Comprehensive Survey on Blockchain-based Federated Learning [51.13534069758711]
  Decentralized approaches like blockchain offer a compelling solution by implementing a consensus mechanism among multiple entities. Federated Learning (FL) enables participants to collaboratively train models while safeguarding data privacy. This paper investigates the synergy between blockchain's security features and FL's privacy-preserving model training capabilities.
  arXiv  Detail & Related papers  (2024-03-28T07:08:26Z)
• 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)
• Tikuna: An Ethereum Blockchain Network Security Monitoring System [0.0]
  This paper focuses on protecting the lowest level layer in the blockchain, particularly the P2P network that allows the nodes to communicate and share information. The P2P network layer may be vulnerable to several families of attacks, such as Distributed Denial of Service (DDoS), eclipse attacks, or Sybil attacks. We introduce Tikuna, an open-source tool for monitoring and detecting potential attacks on the blockchain P2P network, at an early stage.
  arXiv  Detail & Related papers  (2023-10-13T15:39:50Z)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)
• 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)
• Byzantine-resilient Decentralized Stochastic Gradient Descent [85.15773446094576]
  We present an in-depth study towards the Byzantine resilience of decentralized learning systems. We propose UBAR, a novel algorithm to enhance decentralized learning with Byzantine Fault Tolerance.
  arXiv  Detail & Related papers  (2020-02-20T05:11:04Z)

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.