Timestamp Manipulation: Timestamp-based Nakamoto-style Blockchains are Vulnerable

• URL: http://arxiv.org/abs/2505.05328v3
• Date: Thu, 22 May 2025 07:08:51 GMT
• Title: Timestamp Manipulation: Timestamp-based Nakamoto-style Blockchains are Vulnerable
• Authors: Junjie Hu, Na Ruan, Sisi Duan,
• Abstract summary: 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.
• Score: 12.5487593380479
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Nakamoto consensus are the most widely adopted decentralized consensus mechanism in cryptocurrency systems. Since it was proposed in 2008, many studies have focused on analyzing its security. Most of them focus on maximizing the profit of the adversary. Examples include the selfish mining attack [FC '14] and the recent riskless uncle maker (RUM) attack [CCS '23]. In this work, we introduce the Staircase-Unrestricted Uncle Maker (SUUM), the first block withholding attack targeting the timestamp-based Nakamoto-style blockchain. 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, indefinitely exploiting rewards from honest participants. This creates a self-reinforcing cycle that threatens the security of blockchains. We conduct a comprehensive and systematic evaluation of SUUM, including the attack conditions, its impact on blockchains, and the difficulty risks. Finally, we further discuss four feasible mitigation measures against SUUM.

Related papers

• Rational Censorship Attack: Breaking Blockchain with a Blackboard [0.25782420501870296]
  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.
  arXiv  Detail & Related papers  (2025-07-02T08:12:12Z)
• Cannot See the Forest for the Trees: Invoking Heuristics and Biases to Elicit Irrational Choices of LLMs [83.11815479874447]
  We propose a novel jailbreak attack framework, inspired by cognitive decomposition and biases in human cognition.<n>We employ cognitive decomposition to reduce the complexity of malicious prompts and relevance bias to reorganize prompts.<n>We also introduce a ranking-based harmfulness evaluation metric that surpasses the traditional binary success-or-failure paradigm.
  arXiv  Detail & Related papers  (2025-05-03T05:28:11Z)
• 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)
• Asymmetric Mempool DoS Security: Formal Definitions and Provable Secure Designs [17.06992341258962]
  This paper introduces secure blockchain-mempool designs capable of defending against any form of asymmetric eviction DoS attacks. Our proposed secure transaction admission algorithm, named textscsaferAd-CP, ensures eviction-security by providing a provable lower bound on the cost of executing eviction DoS attacks.
  arXiv  Detail & Related papers  (2024-07-03T23:28:35Z)
• A Novel Classification of Attacks on Blockchain Layers: Vulnerabilities, Attacks, Mitigations, and Research Directions [0.8540657305162735]
  This survey proposes a novel classification of blockchain attacks and an in-depth investigation of blockchain data security. We reveal the deep dynamics of these security concerns by closely investigating the fundamental causes of attacks at various blockchain tiers. We also discuss the implications of quantum computing in blockchain and the weaknesses in the current technology that can be exploited in the future.
  arXiv  Detail & Related papers  (2024-04-28T06:40:50Z)
• Model Supply Chain Poisoning: Backdooring Pre-trained Models via Embedding Indistinguishability [61.549465258257115]
  We propose a novel and severer backdoor attack, TransTroj, which enables the backdoors embedded in PTMs to efficiently transfer in the model supply chain.<n> Experimental results show that our method significantly outperforms SOTA task-agnostic backdoor attacks.
  arXiv  Detail & Related papers  (2024-01-29T04:35:48Z)
• 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)
• Longest-chain Attacks: Difficulty Adjustment and Timestamp Verifiability [1.414642081068942]
  We study an adversary who attacks a Proof-of-Work (POW) blockchain by selfishly constructing an alternative longest chain. We characterize optimal strategies employed by the adversary when a difficulty adjustment rule ala Bitcoin applies. We conclude that an adversary who faces a difficulty adjustment rule will find a longest-chain attack very challenging when timestamps are verifiable.
  arXiv  Detail & Related papers  (2023-08-29T13:59:42Z)
• Understanding the Vulnerability of Skeleton-based Human Activity Recognition via Black-box Attack [53.032801921915436]
  Human Activity Recognition (HAR) has been employed in a wide range of applications, e.g. self-driving cars. Recently, the robustness of skeleton-based HAR methods have been questioned due to their vulnerability to adversarial attacks. We show such threats exist, even when the attacker only has access to the input/output of the model. We propose the very first black-box adversarial attack approach in skeleton-based HAR called BASAR.
  arXiv  Detail & Related papers  (2022-11-21T09:51:28Z)
• Bitcoin-Enhanced Proof-of-Stake Security: Possibilities and Impossibilities [45.90740335615872]
  Bitcoin is the most secure blockchain in the world, supported by the immense hash power of its Proof-of-Work miners.<n>Proof-of-Stake chains are energy-efficient, have fast finality but face several security issues.<n>We show that these security issues are inherent in any PoS chain without an external trusted source.<n>We propose a new protocol, Babylon, where an off-the-shelf PoS protocol checkpoints onto Bitcoin to resolve these issues.
  arXiv  Detail & Related papers  (2022-07-18T06:01:25Z)
• 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)
• Learning from History for Byzantine Robust Optimization [52.68913869776858]
  Byzantine robustness has received significant attention recently given its importance for distributed learning. We show that most existing robust aggregation rules may not converge even in the absence of any Byzantine attackers.
  arXiv  Detail & Related papers  (2020-12-18T16:22:32Z)
• Pump and Dumps in the Bitcoin Era: Real Time Detection of Cryptocurrency Market Manipulations [50.521292491613224]
  We perform an in-depth analysis of pump and dump schemes organized by communities over the Internet. We observe how these communities are organized and how they carry out the fraud. We introduce an approach to detect the fraud in real time that outperforms the current state of the art.
  arXiv  Detail & Related papers  (2020-05-04T21:36:18Z)

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.