Exploiting Liquidity Exhaustion Attacks in Intent-Based Cross-Chain Bridges

• URL: http://arxiv.org/abs/2602.17805v1
• Date: Thu, 19 Feb 2026 20:13:36 GMT
• Title: Exploiting Liquidity Exhaustion Attacks in Intent-Based Cross-Chain Bridges
• Authors: André Augusto, Christof Ferreira Torres, André Vasconcelos, Miguel Correia,
• Abstract summary: Cross-chain bridges let off-chain entities (emphsolvers) to immediately fulfill users' orders by fronting their own liquidity.<n>While improving user experience, this approach introduces new systemic risks, such as solver liquidity concentration and delayed settlement.<n>We propose a new class of attacks called emphliquidity exhaustion attacks and a replay-based parameterized attack simulation framework.
• Score: 5.543794703214136
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Intent-based cross-chain bridges have emerged as an alternative to traditional interoperability protocols by allowing off-chain entities (\emph{solvers}) to immediately fulfill users' orders by fronting their own liquidity. While improving user experience, this approach introduces new systemic risks, such as solver liquidity concentration and delayed settlement. In this paper, we propose a new class of attacks called \emph{liquidity exhaustion attacks} and a replay-based parameterized attack simulation framework. We analyze 3.5 million cross-chain intents that moved \$9.24B worth of tokens between June and November 2025 across three major protocols (Mayan Swift, Across, and deBridge), spanning nine blockchains. For rational attackers, our results show that protocols with higher solver profitability, such as deBridge, are vulnerable under current parameters: 210 historical attack instances yield a mean net profit of \$286.14, with 80.5\% of attacks profitable. In contrast, Across remains robust in all tested configurations due to low solver margins and very high liquidity, while Mayan Swift is generally secure but becomes vulnerable under stress-test conditions. Under byzantine attacks, we show that it is possible to suppress availability across all protocols, causing dozens of failed intents and solver profit losses of up to \$978 roughly every 16 minutes. Finally, we propose an optimized attack strategy that exploits patterns in the data to reduce attack costs by up to 90.5\% compared to the baseline, lowering the barrier to liquidity exhaustion attacks.

Related papers

• ASAS-BridgeAMM: Trust-Minimized Cross-Chain Bridge AMM with Failure Containment [5.151910664667141]
  Cross-chain bridges constitute the single largest vector of systemic risk in Decentralized Finance (DeFi)<n>We present ASAS-BridgeAMM, a bridge-coupled automated market maker that introduces Contained Degradation.
  arXiv  Detail & Related papers  (2026-01-18T14:40:26Z)
• One Token Embedding Is Enough to Deadlock Your Large Reasoning Model [91.48868589442837]
  We present the Deadlock Attack, a resource exhaustion method that hijacks an LRM's generative control flow.<n>Our method achieves a 100% attack success rate across four advanced LRMs.
  arXiv  Detail & Related papers  (2025-10-12T07:42:57Z)
• Fast Proxies for LLM Robustness Evaluation [48.53873823665833]
  We compare the ability of fast proxy metrics to predict the real-world robustness of an LLM against a simulated attacker ensemble.<n>This allows us to estimate a model's robustness to computationally expensive attacks without requiring runs of the attacks themselves.
  arXiv  Detail & Related papers  (2025-02-14T11:15:27Z)
• Following Devils' Footprint: Towards Real-time Detection of Price Manipulation Attacks [10.782846331348379]
  Price manipulation attacks are one of the notorious threats in decentralized finance (DeFi) applications.<n>We propose SMARTCAT, a novel approach for identifying price manipulation attacks in the pre-attack stage proactively.<n>We show that SMARTCAT significantly outperforms existing baselines with 91.6% recall and 100% precision.
  arXiv  Detail & Related papers  (2025-02-06T02:11:24Z)
• Safeguarding Blockchain Ecosystem: Understanding and Detecting Attack Transactions on Cross-chain Bridges [3.07869141026886]
  Attacks on cross-chain bridges have resulted in losses of nearly 4.3 billion dollars since 2021.<n>This paper collects the largest number of cross-chain bridge attack incidents to date, including 49 attacks that occurred between June 2021 and September 2024.<n>We propose the BridgeGuard tool to detect attacks against cross-chain business logic.
  arXiv  Detail & Related papers  (2024-10-18T14:25:05Z)
• Blockchain Amplification Attack [13.13413794919346]
  We show that an attacker can amplify network traffic at modified nodes by a factor of 3,600, and cause economic damages of approximately 13,800 times the amount needed to carry out the attack.<n>Despite these risks, aggressive latency reduction may still be profitable enough for various providers to justify the existence of modified nodes.
  arXiv  Detail & Related papers  (2024-08-02T18:06:33Z)
• Advancing Generalized Transfer Attack with Initialization Derived Bilevel Optimization and Dynamic Sequence Truncation [49.480978190805125]
  Transfer attacks generate significant interest for black-box applications. Existing works essentially directly optimize the single-level objective w.r.t. surrogate model. We propose a bilevel optimization paradigm, which explicitly reforms the nested relationship between the Upper-Level (UL) pseudo-victim attacker and the Lower-Level (LL) surrogate attacker.
  arXiv  Detail & Related papers  (2024-06-04T07:45:27Z)
• LookAhead: Preventing DeFi Attacks via Unveiling Adversarial Contracts [15.071155232677643]
  Decentralized Finance (DeFi) has resulted in financial losses exceeding 3 billion US dollars.<n>Current detection tools face significant challenges in identifying attack activities effectively.<n>We propose LookAhead, a new framework for detecting DeFi attacks via unveiling adversarial contracts.
  arXiv  Detail & Related papers  (2024-01-14T11:39:33Z)
• Sparse and Imperceptible Adversarial Attack via a Homotopy Algorithm [93.80082636284922]
  Sparse adversarial attacks can fool deep networks (DNNs) by only perturbing a few pixels. Recent efforts combine it with another l_infty perturbation on magnitudes. We propose a homotopy algorithm to tackle the sparsity and neural perturbation framework.
  arXiv  Detail & Related papers  (2021-06-10T20:11:36Z)
• Transferable Sparse Adversarial Attack [62.134905824604104]
  We introduce a generator architecture to alleviate the overfitting issue and thus efficiently craft transferable sparse adversarial examples. Our method achieves superior inference speed, 700$times$ faster than other optimization-based methods.
  arXiv  Detail & Related papers  (2021-05-31T06:44:58Z)
• Online Adversarial Attacks [57.448101834579624]
  We formalize the online adversarial attack problem, emphasizing two key elements found in real-world use-cases. We first rigorously analyze a deterministic variant of the online threat model. We then propose algoname, a simple yet practical algorithm yielding a provably better competitive ratio for $k=2$ over the current best single threshold algorithm.
  arXiv  Detail & Related papers  (2021-03-02T20:36: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.