Atomic Cross-Chain Swaps

DOI10.1145/3212734.3212736MaRDI QIDQ5197690zbMATH OpenOpenAlexFDO

Authors Maurice Herlihy

Publication date 19 September 2019

Published in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1801.09515

zbMATH Keywords

atomic swapblockchain

Mathematics Subject Classification ID

Network protocols (68M12) Graph theory (including graph drawing) in computer science (68R10) Cryptography (94A60)

Abstract: An atomic cross-chain swap is a distributed coordination task where multiple parties exchange assets across multiple blockchains, for example, trading bitcoin for ether. An atomic swap protocol guarantees (1) if all parties conform to the protocol, then all swaps take place, (2) if some coalition deviates from the protocol, then no conforming party ends up worse off, and (3) no coalition has an incentive to deviate from the protocol. A cross-chain swap is modeled as a directed graph $calD$, whose vertexes are parties and whose arcs are proposed asset transfers. For any pair $(calD,L)$, where $calD=(V,A)$ is a strongly-connected directed graph and $LsubsetV$ a feedback vertex set for $calD$, we give an atomic cross-chain swap protocol for $calD$, using a form of hashed timelock contracts, where the vertexes in $L$ generate the hashlocked secrets. We show that no such protocol is possible if $calD$ is not strongly connected, or if $calD$ is strongly connected but $L$ is not a feedback vertex set. The protocol has time complexity $O(diam(calD))$ and space complexity (bits stored on all blockchains) $O(|A{|}^2)$.

Recommendations

• Atomic cross-chain swaps with improved space, time and local time complexities
• scientific article; zbMATH DE number 4084989
• Hybrid atomicity for nested transactions
• Reconfigurable Atomic Transaction Commit
• Efficient ECDSA-based adaptor signature for batched atomic swaps

Cited in

(17)

• The fault-tolerant cluster-sending problem
• Timelocked bribing
• SoK: communication across distributed ledgers
• A game-theoretic analysis of cross-ledger swaps with packetized payments
• SoK: algorithmic incentive manipulation attacks on permissionless PoW cryptocurrencies
• Atomic cross-chain swaps with improved space, time and local time complexities
• Suborn channels: incentives against timelock bribes
• On fair designs of c<scp>ross‐chain</scp> exchange for cryptocurrencies via Monte Carlo simulation
• Cross-chain payment protocols with success guarantees
• Quantum blockchain-enabled exchange protocol model for decentralized systems
• Invited paper: Cross-chain state machine replication
• Building blocks of sharding blockchain systems: concepts, approaches, and open problems
• Atomic cross-chain swaps with improved space and local time complexity
• BTLE: atomic swaps with time-lock puzzles
• Byzantine-tolerant distributed grow-only sets: specification and applications
• On HTLC-based protocols for multi-party cross-chain swaps
• About blockchain interoperability

This page was built for publication: Atomic Cross-Chain Swaps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5197690)