Decentralized Exchange that Mitigate a Bribery Attack

• URL: http://arxiv.org/abs/2510.20645v1
• Date: Thu, 23 Oct 2025 15:20:53 GMT
• Title: Decentralized Exchange that Mitigate a Bribery Attack
• Authors: Nitin Awathare,
• Abstract summary: We present a miner-collusion bribery attack with implementation and game-theoretic analysis.<n>We propose prot, a game-theoretically secure HTLC protocol resistant to all bribery scenarios.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Despite the popularity of Hashed Time-Locked Contracts (HTLCs) because of their use in wide areas of applications such as payment channels, atomic swaps, etc, their use in exchange is still questionable. This is because of its incentive incompatibility and susceptibility to bribery attacks. State-of-the-art solutions such as MAD-HTLC (Oakland'21) and He-HTLC (NDSS'23) address this by leveraging miners' profit-driven behaviour to mitigate such attacks. The former is the mitigation against passive miners; however, the latter works against both active and passive miners. However, they consider only two bribing scenarios where either of the parties involved in the transfer collude with the miner. In this paper, we expose vulnerabilities in state-of-the-art solutions by presenting a miner-collusion bribery attack with implementation and game-theoretic analysis. Additionally, we propose a stronger attack on MAD-HTLC than He-HTLC, allowing the attacker to earn profits equivalent to attacking naive HTLC. Leveraging our insights, we propose \prot, a game-theoretically secure HTLC protocol resistant to all bribery scenarios. \prot\ employs a two-phase approach, preventing unauthorized token confiscation by third parties, such as miners. In Phase 1, parties commit to the transfer; in Phase 2, the transfer is executed without manipulation. We demonstrate \prot's efficiency in transaction cost and latency via implementations on Bitcoin and Ethereum.

Related papers

• Incentive Attacks in BTC: Short-Term Revenue Changes and Long-Term Efficiencies [45.776687601070705]
  Bitcoin's Difficulty Adjustment Algorithm (DAA) has been a source of vulnerability for incentive attacks such as selfish mining, block withholding and coin hopping strategies.<n>We study the short-term revenue change per hashpower of the adversarial and honest miners for these incentive attacks.<n>For block withholding strategies, it turns out, the honest miners outside the pool profit from the attack, usually even more than the attacker both in the short-term and the long-term.
  arXiv  Detail & Related papers  (2025-11-14T18:18:17Z)
• $\ extit{Agents Under Siege}$: Breaking Pragmatic Multi-Agent LLM Systems with Optimized Prompt Attacks [45.74758377276353]
  Multi-agent Large Language Model (LLM) systems create novel adversarial risks because their behavior depends on communication between agents and decentralized reasoning.<n>In this work, we innovatively focus on attacking pragmatic systems that have constrains such as limited token bandwidth, latency between message delivery, and defense mechanisms.<n>We design a $textitpermutation-invariant adversarial attack$ that optimize prompt distribution across latency and bandwidth-constraint network topologies to bypass distributed safety mechanisms.
  arXiv  Detail & Related papers  (2025-03-31T20:43:56Z)
• Real AI Agents with Fake Memories: Fatal Context Manipulation Attacks on Web3 Agents [36.49717045080722]
  This paper investigates the vulnerabilities of AI agents within blockchain-based financial ecosystems when exposed to adversarial threats in real-world scenarios.<n>We introduce the concept of context manipulation -- a comprehensive attack vector that exploits unprotected context surfaces.<n>Using ElizaOS, we showcase that malicious injections into prompts or historical records can trigger unauthorized asset transfers and protocol violations.
  arXiv  Detail & Related papers  (2025-03-20T15:44:31Z)
• Phantom Events: Demystifying the Issues of Log Forgery in Blockchain [31.570414211726888]
  We present the first in-depth security analysis of transaction log forgery in EVM-based blockchains.<n>We propose a tool designed to detect event forgery vulnerabilities in smart contracts.<n>We have successfully identified real-world instances for all five types of attacks across multiple decentralized applications.
  arXiv  Detail & Related papers  (2025-02-19T08:07:26Z)
• When Should Selfish Miners Double-Spend? [35.16231062731263]
  We construct a strategy where the attacker acts stubborn until its private branch reaches a certain length and then switches to act selfish.<n>We show that, at each attack cycle, if the level of stubbornness is higher than $k$, there is a risk of double-spending which comes at no-cost to the adversary.
  arXiv  Detail & Related papers  (2025-01-06T18:59:26Z)
• Maximal Extractable Value Mitigation Approaches in Ethereum and Layer-2 Chains: A Comprehensive Survey [1.2453219864236247]
  MEV arises when miners or validators manipulate transaction ordering to extract additional value. This not only affects user experience by introducing unpredictability and potential financial losses but also threatens the underlying principles of decentralization and trust. This paper presents a comprehensive survey of MEV mitigation techniques as applied to both protocolss L1 and various L2 solutions.
  arXiv  Detail & Related papers  (2024-07-28T19:51:22Z)
• 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)
• Rolling in the Shadows: Analyzing the Extraction of MEV Across Layer-2 Rollups [14.369191644932954]
  Decentralized finance embraces a series of exploitative economic practices known as Maximal Extractable Value (MEV)<n>In this paper, we investigate the prevalence and impact of MEV on prominent rollups such as Arbitrum, and zkSync over a nearly three-year period.<n>While our findings did not detect any sandwiching activity on popular rollups, we did identify the potential for cross-layer sandwich attacks.
  arXiv  Detail & Related papers  (2024-04-30T18:34:32Z)
• Your Trust, Your Terms: A General Paradigm for Near-Instant Cross-Chain Transfer [26.61748905524824]
  We introduce the Delegated Ownership Transfer (DOT) paradigm to enable secure, high-performance cross-chain payments.<n>DOT decouples key ownership from value ownership to enable secure, high-performance cross-chain payments.<n>Our prototype shows that cross-chain payments complete in under 16.70 ms and atomic swaps in under 33.09 ms, with costs fully decoupled from Layer-1 gas fees.
  arXiv  Detail & Related papers  (2024-03-22T13:21:09Z)
• 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)
• New intelligent defense systems to reduce the risks of Selfish Mining and Double-Spending attacks using Learning Automata [0.43512163406551996]
  We introduce a new attack that combines double-spending and selfish mining attacks. We develop two models, namely the SDTLA and WVBM, which can effectively defend against selfish mining attacks. Our findings highlight the potential of SDTLA and WVBM as promising solutions for enhancing the security and efficiency of blockchain networks.
  arXiv  Detail & Related papers  (2023-07-02T09:46:05Z)
• BERT4ETH: A Pre-trained Transformer for Ethereum Fraud Detection [29.518411879700263]
  BERT4ETH is a pre-trained Transformer account representation extractor for detecting various fraud behaviors. BERT4ETH features the superior modeling capability of Transformer to capture the dynamic sequential patterns inherent in transactions. Our empirical evaluation demonstrates that BERT4ETH outperforms state-of-the-art methods with significant enhancements in terms of the phishing account detection and de-anonymization tasks.
  arXiv  Detail & Related papers  (2023-03-29T20:30:52Z)
• Securing Consensus from Long-Range Attacks through Collaboration [6.090550359575682]
  We present the design of our Power-of-Collaboration protocol, which guards existing PoS/BFT blockchains against long-range attacks.<n>PoC guarantees fairness and accountability and only marginally degrades the throughput of the underlying system.
  arXiv  Detail & Related papers  (2023-02-05T07:33:57Z)
• Uniswap Liquidity Provision: An Online Learning Approach [49.145538162253594]
  Decentralized Exchanges (DEXs) are new types of marketplaces leveraging technology. One such DEX, Uniswap v3, allows liquidity providers to allocate funds more efficiently by specifying an active price interval for their funds. This introduces the problem of finding an optimal strategy for choosing price intervals. We formalize this problem as an online learning problem with non-stochastic rewards.
  arXiv  Detail & Related papers  (2023-02-01T17:21:40Z)
• 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.