USENIX Security2025Top-tier venue
Parallelizing Universal Atomic Swaps for Multi-Chain Cryptocurrency Exchanges
Danlei Xiao, Chuan Zhang, Haotian Deng, Jinwen Liang, Licheng Wang, Liehuang Zhu
Abstract
Universal atomic swap is an emerging technique for secure cryptocurrency exchanges across diverse blockchains, eliminating the need for custom scripting language support from blockchains. While existing schemes primarily focus on exchanges among two users, extending these to multiple users across multiple blockchains incurs significant overheads due to the need for performing multiple two-party swaps serially. An intuitive insight is to parallelize the universal processes, but this idea still faces two technical challenges: (i) avoid asset theft during parallel asset locking; (ii) ensure atomicity by preventing partial execution of transactions with a uniform refund time used to avoid asset deadlock in parallel. In this paper, we present ParaSwap, the first framework to parallelize universal atomic swaps for cryptocurrency exchanges among multiple users across multiple blockchains. We replace the serial multiple two-party swaps with a concurrent mechanism, where each participant concurrently locks and withdraws coins, achieving parallel execution. To prevent asset theft, the necessary witness for swaps is collaboratively determined by all participants. Then we introduce a novel re-lock approach to ensure atomicity with a uniform refund time, allowing participants to re-lock their assets to new addresses when the remaining time is insufficient to complete their withdrawal. Notably, ParaSwap employs adaptor signatures and verifiable timed discrete logarithm (VTD) technology, relying only on the bare minimum ability of blockchain to verify transaction signatures. We implement ParaSwap on four public blockchain test networks: Bitcoin, Ethereum, Avalanche, and Binance Smart Chain. Our evaluation demonstrates that ParaSwap reduces the exchange time complexity from O(n) to O(1), where n is the number of participants, and lowers gas costs by 26.2x to 46.8x, compared to existing methods.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 29047ae4-14b3-4e29-9c2d-acd76d407489Builds on11
- Flash Boys 2.0: Frontrunning in Decentralized Exchanges, Miner Extractable Value, and Consensus InstabilityPhilip Daian, Steven Goldfeder, Tyler Kell, Yunqi Li et al.S&P 2020 · 607 citations
- On the Instability of Bitcoin Without the Block RewardMiles Carlsten, Harry A. Kalodner, S. Matthew Weinberg, Arvind NarayananCCS 2016 · 387 citations
- Anonymous Multi-Hop Locks for Blockchain Scalability and InteroperabilityGiulio Malavolta, Pedro Moreno-Sanchez, Clara Schneidewind, Aniket Kate et al.NDSS 2019 · 305 citations
- Zero-Knowledge Contingent Payments Revisited: Attacks and Payments for ServicesMatteo Campanelli, Rosario Gennaro, Steven Goldfeder, Luca NizzardoCCS 2017 · 170 citations
- A Tale of Two Worlds: Assessing the Vulnerability of Enclave Shielding RuntimesJo Van Bulck, David F. Oswald, Eduard Marin, Abdulla Aldoseri et al.CCS 2019 · 159 citations
Related papers
- Universal Atomic Swaps: Secure Exchange of Coins Across All BlockchainsSri Aravinda Krishnan Thyagarajan, Giulio Malavolta, Pedro Moreno-SanchezS&P 2022 · 112 citations
- Warning! The Timeout T Cannot Protect You From Losing Coins: PipeSwap: Forcing the Timely Release of a Secret for Atomic Cross-Chain SwapsPeifang Ni, Anqi Tian, Jing XuS&P 2025
- Atomic Commitment Across BlockchainsVictor Zakhary, Divy Agrawal, Amr El AbbadiVLDB 2020 · 107 citations
- Sweep-UC: Swapping Coins PrivatelyLucjan Hanzlik, Julian Loss, Sri Aravinda Krishnan Thyagarajan, Benedikt WagnerS&P 2024 · 15 citations
- XCLAIM: Trustless, Interoperable, Cryptocurrency-Backed AssetsAlexei Zamyatin, Dominik Harz, Joshua Lind, Panayiotis Panayiotou et al.S&P 2019 · 222 citations
