Warning! The Timeout T Cannot Protect You From Losing Coins: PipeSwap: Forcing the Timely Release of a Secret for Atomic Cross-Chain Swaps
Peifang Ni, Anqi Tian, Jing Xu
摘要
Atomic cross-chain swaps mitigate the interoper-ability challenges faced by current cryptocurrencies, thereby facilitating inter-currency exchange and trading between the distrusting users. Although numerous atomic swaps protocols utilizing Hash Timelock Contracts have been deployed and put into practice, they are substantially far from universality due to their inherent dependence of rich scripting language supported by the underlying blockchains. The recently proposed Universal Atomic Swaps protocol [IEEE S&P'22] represents a significant advancement in the field of scriptless cross-chain swaps by ingeniously delegating scripting functionalities to cryptographic locking mechanisms, particularly the adaptor signatures and timed commitment schemes. However, we identify a new form of attack termed the double-claiming attack that leverages these scriptless functionalities to undermine atomicity with a high probability. This attack is inherent to the designs adopted by the existing scriptless cross-chain swaps protocols as well as the payment channel networks. We further quantify the severity of this attack based on real-word swap transactions processed by the most widely deployed decentralized exchange platforms, highlighting the critical challenges in designing universal atomic swaps. To address the double-claiming attack while ensuring both security and practical universality, we also present a cross-chain swaps protocol called PipeSwap. Specifically, PipeSwap protects the frozen coins from being double-claimed by a novelly designed paradigm of pipelined coins flow that utilizes the techniques of two-hop swap and two-hop refund. In addition to a comprehensive security analysis in the Universal Composability framework, we develop a proof-of-concept implementation of PipeSwap with Schnorr/ECDSA signatures, and conduct extensive experiments to evaluate the overhead. The experimental results show that PipeSwap can be performed in less than 1.7 seconds while maintaining less than 7 kb of communication overhead on commodity machines.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper18
- Concurrency and Privacy with Payment-Channel NetworksGiulio Malavolta, Pedro Moreno-Sanchez, Aniket Kate, Matteo Maffei 等CCS 2017 · 被引用 307 次
- Anonymous Multi-Hop Locks for Blockchain Scalability and InteroperabilityGiulio Malavolta, Pedro Moreno-Sanchez, Clara Schneidewind, Aniket Kate 等NDSS 2019 · 被引用 305 次
- Revive: Rebalancing Off-Blockchain Payment NetworksRami Khalil, Arthur GervaisCCS 2017 · 被引用 259 次
- General State Channel NetworksStefan Dziembowski, Sebastian Faust, Kristina HostákováCCS 2018 · 被引用 249 次
- FairSwap: How To Fairly Exchange Digital GoodsStefan Dziembowski, Lisa Eckey, Sebastian FaustCCS 2018 · 被引用 229 次
相关 Paper
- Parallelizing Universal Atomic Swaps for Multi-Chain Cryptocurrency ExchangesDanlei Xiao, Chuan Zhang, Haotian Deng, Jinwen Liang 等USENIX Security 2025
- Universal Atomic Swaps: Secure Exchange of Coins Across All BlockchainsSri Aravinda Krishnan Thyagarajan, Giulio Malavolta, Pedro Moreno-SanchezS&P 2022 · 被引用 112 次
- XCLAIM: Trustless, Interoperable, Cryptocurrency-Backed AssetsAlexei Zamyatin, Dominik Harz, Joshua Lind, Panayiotis Panayiotou 等S&P 2019 · 被引用 222 次
- Atomic Commitment Across BlockchainsVictor Zakhary, Divy Agrawal, Amr El AbbadiVLDB 2020 · 被引用 107 次
- LedgerLocks: A Security Framework for Blockchain Protocols Based on Adaptor SignaturesErkan Tairi, Pedro Moreno-Sanchez, Clara SchneidewindCCS 2023 · 被引用 10 次
