Related papers: 4-Swap: Achieving Grief-Free and Bribery-Safe Atomic Swaps Using Four Transactions

4-Swap: Achieving Grief-Free and Bribery-Safe Atomic Swaps Using Four Transactions

URL: http://arxiv.org/abs/2508.04641v1
Date: Wed, 06 Aug 2025 17:06:55 GMT
Title: 4-Swap: Achieving Grief-Free and Bribery-Safe Atomic Swaps Using Four Transactions
Authors: Kirti Singh, Vinay J. Ribeiro, Susmita Mandal,
Abstract summary: This paper presents 4-Swap, the first cross-chain atomic swap protocol that is both grief-free and bribery-safe.<n>By combining the griefing premium and principal into a single transaction per chain, 4-Swap reduces on-chain transactions.<n>It is fully compatible with Bitcoin and operates without the need for any new opcodes.
Score: 0.10226894006814743
License: http://creativecommons.org/licenses/by/4.0/
Abstract: Cross-chain asset exchange is crucial for blockchain interoperability. Existing solutions rely on trusted third parties and risk asset loss, or use decentralized alternatives like atomic swaps, which suffer from grief attacks. Griefing occurs when a party prematurely exits, locking the counterparty's assets until a timelock expires. Hedged Atomic Swaps mitigate griefing by introducing a penalty premium; however, they increase the number of transactions from four (as in Tier Nolan's swap) to six, which in turn introduces new griefing risks. Grief-Free (GF) Swap reduces this to five transactions by consolidating assets and premiums on a single chain. However, no existing protocol achieves grief-free asset exchange in just four transactions. This paper presents 4-Swap, the first cross-chain atomic swap protocol that is both grief-free and bribery-safe, while completing asset exchange in just four transactions. By combining the griefing premium and principal into a single transaction per chain, 4-Swap reduces on-chain transactions, leading to faster execution compared to previous grief-free solutions. It is fully compatible with Bitcoin and operates without the need for any new opcodes. A game-theoretic analysis shows that rational participants have no incentive to deviate from the protocol, ensuring robust compliance and security.

Related papers

Epass: Efficient and Privacy-Preserving Asynchronous Payment on Blockchain [39.093148638790346]
Buy Now Pay Later (BNPL) is a rapidly proliferating e-commerce model, offering consumers to get the product immediately and defer payments.<n>Emerging blockchain technologies endow BNPL platforms with digital currency transactions, allowing BNPL platforms to integrate with digital wallets.<n>However, the transparency of transactions causes critical privacy concerns because malicious participants may derive consumers' financial statuses from on-chain asynchronous payments.
arXiv Detail & Related papers (2025-06-11T04:32:54Z)
First-Spammed, First-Served: MEV Extraction on Fast-Finality Blockchains [0.0]
This research analyzes the economics of spam-based arbitrage strategies on fast-finality blockchains.<n>We show that splitting a profitable MEV opportunity into multiple small transactions is the optimal strategy for CEX-DEX arbitrageurs.<n>We find that reverted transactions cluster at the very top of blocks on fast rollups like Arbitrum and ZKsync, indicating an intense latency race and revealing the fragility of fee-based ordering.
arXiv Detail & Related papers (2025-06-02T09:18:53Z)
Demystifying Private Transactions and Their Impact in PoW and PoS Ethereum [43.548299433042835]
Private transactions, a specialized transaction type employed to evade public Peer-to-Peer (P2P) network broadcasting, remain largely unexplored.<n>We analyze large-scale datasets comprising 14,810,392 private transactions within a 15.5-month Proof-of-Work (PoW) dataset and 30,062,232 private transactions within a 15.5-month Proof-of-Stake (PoS) dataset.
arXiv Detail & Related papers (2025-03-30T16:45:18Z)
Enabling High-Frequency Trading with Near-Instant, Trustless Cross-Chain Transactions via Pre-Signing Adaptor Signatures [0.0]
This white paper will introduce a protocol for atomic swaps that eliminates the need for an intermediary currency or centralized trusted third party.<n>It will reduce transaction times between Bitcoin and swaps to approximately 15 seconds for a market maker.
arXiv Detail & Related papers (2025-03-17T01:15:33Z)
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)
AsyncSC: An Asynchronous Sidechain for Multi-Domain Data Exchange in Internet of Things [38.94331838546716]
Current state-of-the-art (SOTA) schemes for IoT multi-domain data exchange are constrained by the need for synchronous networks.<n>In this paper, we propose AsyncSC, a novel asynchronous sidechain construction.<n>Results show that AsyncSC outperforms SOTA schemes, improving throughput by an average of 1.21 to 3.96 times, reducing transaction latency by 59.76% to 83.61%, and maintaining comparable resource overhead.
arXiv Detail & Related papers (2024-12-17T09:43:37Z)
MECURY: Practical Cross-Chain Exchange via Trusted Hardware [22.99870575331708]
We present MERCURY, a practical cryptocurrency exchange that is trust-minimized and efficient without online-client requirements. We show that MERCURY significantly reduces on-chain costs by approximately 67.87%, 45.01%, and 47.70%, respectively.
arXiv Detail & Related papers (2024-09-23T00:52:13Z)
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)
A Multi-Party, Multi-Blockchain Atomic Swap Protocol with Universal Adaptor Secret [2.850220538113752]
This paper presents a novel multi-party atomic swap protocol that operates almost entirely off-chain. By addressing key challenges such as collusion attacks and malicious dropouts, our protocol significantly enhances the security and efficiency of multi-party atomic swaps.
arXiv Detail & Related papers (2024-06-24T17:33:03Z)
Cuttlefish: Expressive Fast Path Blockchains with FastUnlock [4.483666331132052]
Cuttlefish addresses limitations of existing consensus-less and consensus-minimized decentralized ledgers. Key insight of Cuttlefish is that consensus is necessary due to contention, rather than multiple owners of an asset as suggested by prior work. Cuttlefish introduces collective objects and multi-owner transactions that can offer most of the functionality of classic blockchains.
arXiv Detail & Related papers (2023-09-22T08:56:32Z)
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)
TxAllo: Dynamic Transaction Allocation in Sharded Blockchain Systems [37.22526235663589]
This paper focuses on the transaction allocation problem to reduce the number of cross-shard transactions. A deterministic and fast allocation scheme TxAllo is proposed to dynamically infer the allocation of accounts. For a blockchain with 60 shards, TxAllo reduces the cross-shard transaction ratio from 98% to about 12%.
arXiv Detail & Related papers (2022-12-22T10:22:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.