Cross-chain deals and adversarial commerce

Modern distributed data management systems face a new challenge: how can autonomous, mutually-distrusting parties cooperate safely and effectively? Addressing this challenge brings up questions familiar from classical distributed systems: how to combine multiple steps into a single atomic action, how to recover from failures, and how to synchronize concurrent access to data. Nevertheless, each of these issues requires rethinking when participants are autonomous and potentially adversarial. We propose the notion of a *cross-chain deal*, a new way to structure complex distributed computations that manage assets in an adversarial setting. Deals are inspired by classical atomic transactions, but are necessarily different, in important ways, to accommodate the decentralized and untrusting nature of the exchange. We describe novel safety and liveness properties, along with two alternative protocols for implementing cross-chain deals in a system of independent blockchain ledgers. One protocol, based on synchronous communication, is fully decentralized, while the other, based on semi-synchronous communication, requires a globally shared ledger.

[1]  Ethan Heilman,et al.  The Arwen Trading Protocols , 2020, Financial Cryptography.

[2]  Rainer Böhme,et al.  Rationality is Self-Defeating in Permissionless Systems , 2019, ArXiv.

[3]  Andreas Reuter,et al.  Principles of transaction-oriented database recovery , 1983, CSUR.

[4]  Christian Decker,et al.  A Fast and Scalable Payment Network with Bitcoin Duplex Micropayment Channels , 2015, SSS.

[5]  Aggelos Kiayias,et al.  Proofs of Proofs of Work with Sublinear Complexity , 2016, Financial Cryptography Workshops.

[6]  Nancy A. Lynch,et al.  Consensus in the presence of partial synchrony , 1988, JACM.

[7]  Michael Dahlin,et al.  BAR primer , 2008, 2008 IEEE International Conference on Dependable Systems and Networks With FTCS and DCC (DSN).

[8]  Miguel Oom Temudo de Castro,et al.  Practical Byzantine fault tolerance , 1999, OSDI '99.

[9]  Michael Dahlin,et al.  BAR fault tolerance for cooperative services , 2005, SOSP '05.

[10]  Silvio Micali,et al.  Algorand: Scaling Byzantine Agreements for Cryptocurrencies , 2017, IACR Cryptol. ePrint Arch..

[11]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1985, JACM.

[12]  George Danezis,et al.  Chainspace: A Sharded Smart Contracts Platform , 2017, NDSS.

[13]  Satoshi Nakamoto Bitcoin : A Peer-to-Peer Electronic Cash System , 2009 .

[14]  Maurice Herlihy,et al.  Atomic Cross-Chain Swaps , 2018, PODC.

[15]  Angelo De Caro,et al.  Channels: Horizontal Scaling and Confidentiality on Permissioned Blockchains , 2018, ESORICS.

[16]  Aggelos Kiayias,et al.  Non-Interactive Proofs of Proof-of-Work , 2020, IACR Cryptol. ePrint Arch..

[17]  Divyakant Agrawal,et al.  Atomic commitment across blockchains , 2019, Proc. VLDB Endow..

[18]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1983, PODS '83.

[19]  Daniel Davis Wood,et al.  ETHEREUM: A SECURE DECENTRALISED GENERALISED TRANSACTION LEDGER , 2014 .

[20]  Ittai Abraham,et al.  Hot-Stuff the Linear, Optimal-Resilience, One-Message BFT Devil , 2018, ArXiv.

[21]  Can Kisagun,et al.  Enigma Catalyst : A machine-based investing platform and infrastructure for crypto-assets , 2017 .

[22]  Marko Vukolic,et al.  Hyperledger fabric: a distributed operating system for permissioned blockchains , 2018, EuroSys.

[23]  Stephanie Alexander,et al.  Augur: a decentralized oracle and prediction market platform , 2015 .

[24]  David Wolinsky,et al.  Decentralizing Authorities into Scalable Strongest-Link Cothorities , 2015, ArXiv.

[25]  Philipp Jovanovic,et al.  OmniLedger: A Secure, Scale-Out, Decentralized Ledger via Sharding , 2018, 2018 IEEE Symposium on Security and Privacy (SP).

[26]  Jens Lechtenbörger Two-Phase Commit Protocol , 2009, Encyclopedia of Database Systems.

[27]  Matthew Green,et al.  Bolt: Anonymous Payment Channels for Decentralized Currencies , 2017, CCS.