On HTLC-Based Protocols for Multi-Party Cross-Chain Swaps
Abstract: In his 2018 paper, Herlihy introduced an atomic protocol for multi-party asset swaps across different blockchains. His model represents an asset swap by a directed graph whose nodes are the participating parties and edges represent asset transfers, and rational behavior of the participants is captured by a preference relation between a protocol's outcomes. Asset transfers between parties are achieved using smart contracts. These smart contracts are quite involved and they require storage and processing of a large number of paths in the swap digraph, limiting practical significance of his protocol. His paper also describes a different protocol that uses only standard hash time-lock contracts (HTLC's), but this simpler protocol applies only to some special types of digraphs. He left open the question whether there is a simple and efficient protocol for cross-chain asset swaps in arbitrary digraphs. Motivated by this open problem, we conducted a comprehensive study of \emph{HTLC-based protocols}, in which all asset transfers are implemented with HTLCs. Our main contribution is a full characterization of swap digraphs that have such protocols.
- Optimistic protocols for fair exchange. In Proceedings of the 4th ACM Conference on Computer and Communications Security, CCS ’97, pages 7–17, New York, NY, USA, 1997. ACM.
- Optimistic fair exchange of digital signatures. IEEE Journal on Selected Areas in Communications, 18:593–610, 1997.
- A fair protocol for signing contracts. In Wilfried Brauer, editor, Automata, Languages and Programming, pages 43–52, Berlin, Heidelberg, 1985. Springer Berlin Heidelberg.
- Cross-chain swaps with preferences. In 36th IEEE Computer Security Foundations Symposium, CSF 2023, Dubrovnik, Croatia, July 10-14, 2023, pages 261–275. IEEE, 2023.
- Privacy-preserving cross-chain atomic swaps. In International Conference on Financial Cryptography and Data Security, pages 540–549. Springer, 2020.
- Secure group barter: Multi-party fair exchange with semi-trusted neutral parties. In Rafael Hirchfeld, editor, Financial Cryptography, pages 90–102, Berlin, Heidelberg, 1998. Springer Berlin Heidelberg.
- The arwen trading protocols. In International Conference on Financial Cryptography and Data Security, pages 156–173. Springer, 2020.
- Maurice Herlihy. Atomic cross-chain swaps. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, PODC ’18, pages 245–254, New York, NY, USA, 2018. ACM.
- Cross-chain deals and adversarial commerce. arXiv preprint arXiv:1905.09743, 2019.
- Atomic cross-chain swaps with improved space and local time complexity, 2019.
- Subhra Mazumdar. Towards faster settlement in htlc-based cross-chain atomic swaps, 2022.
- Silvio Micali. Simple and fast optimistic protocols for btcwiki electronic exchange. In Proceedings of the Twenty-second Annual Symposium on Principles of Distributed Computing, PODC ’03, pages 12–19, New York, NY, USA, 2003. ACM.
- Universal atomic swaps: Secure exchange of coins across all blockchains. Cryptology ePrint Archive, 2021.
- Tier Nolan. Alt chains and atomic transfers. https://bitcointalk.org/index.php?topic=193281.msg2224949#msg2224949, 2013. [Online; accessed 23-January-2021].
- Hedging against sore loser attacks in cross-chain transactions. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, PODC’21, page 155–164, New York, NY, USA, 2021. Association for Computing Machinery.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.