Rational Censorship Attack: Breaking Blockchain with a Blackboard

• URL: http://arxiv.org/abs/2507.01453v1
• Date: Wed, 02 Jul 2025 08:12:12 GMT
• Title: Rational Censorship Attack: Breaking Blockchain with a Blackboard
• Authors: Michelle Yeo, Haoqian Zhang,
• Abstract summary: We show that if nodes are rational, coordinating this attack just requires a public read and write blackboard.<n>We prove that the strategy to join the rational censorship attack and also for nodes to honestly declare their power is a subgame perfect equilibrium in the corresponding extensive form game induced by our attack.
• Score: 0.25782420501870296
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Censorship resilience is a fundamental assumption underlying the security of blockchain protocols. Additionally, the analysis of blockchain security from an economic and game theoretic perspective has been growing in popularity in recent years. In this work, we present a surprising rational censorship attack on blockchain censorship resilience when we adopt the analysis of blockchain security from a game theoretic lens and assume all users are rational. In our attack, a colluding group with sufficient voting power censors the remainder nodes such that the group alone can gain all the rewards from maintaining the blockchain. We show that if nodes are rational, coordinating this attack just requires a public read and write blackboard and we formally model the attack using a game theoretic framework. Furthermore, we note that to ensure the success of the attack, nodes need to know the total true voting power held by the colluding group. We prove that the strategy to join the rational censorship attack and also for nodes to honestly declare their power is a subgame perfect equilibrium in the corresponding extensive form game induced by our attack. Finally, we discuss the implications of the attack on blockchain users and protocol designers as well as some potential countermeasures.

Related papers

• Timestamp Manipulation: Timestamp-based Nakamoto-style Blockchains are Vulnerable [12.5487593380479]
  We introduce the Staircase-Unrestricted Uncle Maker (SUUM) the first block withholding attack targeting the timestamp-based Nakamoto-style blockchain.<n>Through block withholding, timestamp manipulation, and difficulty risk control, SUUM adversaries are capable of launching persistent attacks with zero cost and minimal difficulty risk characteristics.<n>This creates a self-reinforcing cycle that threatens the security of blockchains.
  arXiv  Detail & Related papers  (2025-05-08T15:20:19Z)
• Examining Attacks on Consensus and Incentive Systems in Proof-of-Work Blockchains: A Systematic Literature Review [0.0]
  Bitcoin's security relies on a decentralized ledger consisting of a consensus and an incentive mechanism. As Bitcoin's acceptance grows, it faces increasing threats from attacks targeting these mechanisms. This paper begins by examining individual attacks executed in isolation and their profitability. It then explores how combining these attacks with each other or with other malicious and non-malicious strategies can enhance their overall effectiveness and profitability.
  arXiv  Detail & Related papers  (2024-11-01T04:18:42Z)
• 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's consensus mechanism.<n>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.<n>Our measurements from the Aptos mainnet show that the optimistic approach reduces latency overhead by 71%.
  arXiv  Detail & Related papers  (2024-07-16T20:53:04Z)
• Nurgle: Exacerbating Resource Consumption in Blockchain State Storage via MPT Manipulation [27.384225875585805]
  We unveil a novel attack surface, i.e., the state storage, in blockchains. Nurgle is the first Denial-of-Service attack targeting the state storage. Nurgle forces blockchains to expend additional resources on state maintenance and verification, impairing their performance.
  arXiv  Detail & Related papers  (2024-06-15T16:47:39Z)
• 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)
• 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)
• Protecting the Decentralized Future: An Exploration of Common Blockchain Attacks and their Countermeasures [1.1499361198674167]
  Rising number of security threats have attracted cybercriminals as a target. This research aims to offer a thorough analysis of mitigating blockchain attacks. The study also highlights how crucial it is to take into account the particular needs of every blockchain application.
  arXiv  Detail & Related papers  (2023-06-20T20:56:06Z)
• 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.