Feasibility of Cross-Chain Payment with Success Guarantees

Rob van Glabbeek; Vincent Gramoli; Pierre Tholoniat

doi:10.1145/3350755.3400264

Feasibility of Cross-Chain Payment with Success Guarantees

Rob van Glabbeek, Vincent Gramoli, Pierre Tholoniat

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

We consider the problem of cross-chain payment whereby customers of different escrows---implemented by a bank or a blockchain smart contract---successfully transfer digital assets without trusting each other. Prior to this work, cross-chain payment problems did not require this success, or any form of progress. We demonstrate that it is possible to solve this problem when assuming synchrony, in the sense that each message is guaranteed to arrive within a known amount of time, but impossible to solve without assuming synchrony. Yet, we solve a weaker variant of this problem, where success is conditional on the patience of the participants, without assuming synchrony, and in the presence of Byzantine failures. We also discuss the relation with the recently defined cross-chain deals.

Original language	English
Title of host publication	Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures
Place of Publication	New York, NY, USA
Publisher	Association for Computing Machinery, Inc
Pages	579–581
Number of pages	3
ISBN (Electronic)	9781450369350
DOIs	https://doi.org/10.1145/3350755.3400264
Publication status	Published - 9 Jul 2020
Event	The 32nd ACM Symposium on Parallelism in Algorithms and Architectures 2020 - Online Duration: 14 Jul 2020 → 16 Jul 2020 Conference number: 32 https://spaa.acm.org/2020/

Publication series

Name	SPAA '20
Publisher	Association for Computing Machinery

Symposium

Symposium	The 32nd ACM Symposium on Parallelism in Algorithms and Architectures 2020
Abbreviated title	SPAA 2020
Period	14/07/20 → 16/07/20
Internet address	https://spaa.acm.org/2020/

Keywords / Materials (for Non-textual outputs)

partial synchrony
timed automata
liveness
distributed algorithms
cross-chain payment
blockchain

Access to Document

10.1145/3350755.3400264Licence: All Rights Reserved

https://dl.acm.org/doi/10.1145/3350755.3400264Licence: All Rights Reserved

Cite this

@inproceedings{e90cd009bf05409580da3b594c1a58fa,

title = "Feasibility of Cross-Chain Payment with Success Guarantees",

abstract = "We consider the problem of cross-chain payment whereby customers of different escrows---implemented by a bank or a blockchain smart contract---successfully transfer digital assets without trusting each other. Prior to this work, cross-chain payment problems did not require this success, or any form of progress. We demonstrate that it is possible to solve this problem when assuming synchrony, in the sense that each message is guaranteed to arrive within a known amount of time, but impossible to solve without assuming synchrony. Yet, we solve a weaker variant of this problem, where success is conditional on the patience of the participants, without assuming synchrony, and in the presence of Byzantine failures. We also discuss the relation with the recently defined cross-chain deals.",

keywords = "partial synchrony, timed automata, liveness, distributed algorithms, cross-chain payment, blockchain",

author = "{van Glabbeek}, Rob and Vincent Gramoli and Pierre Tholoniat",

year = "2020",

month = jul,

day = "9",

doi = "10.1145/3350755.3400264",

language = "English",

series = "SPAA '20",

publisher = "Association for Computing Machinery, Inc",

pages = "579–581",

booktitle = "Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures",

note = "The 32nd ACM Symposium on Parallelism in Algorithms and Architectures 2020<br/>, SPAA 2020 ; Conference date: 14-07-2020 Through 16-07-2020",

url = "https://spaa.acm.org/2020/",

}

van Glabbeek, R, Gramoli, V & Tholoniat, P 2020, Feasibility of Cross-Chain Payment with Success Guarantees. in Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures. SPAA '20, Association for Computing Machinery, Inc, New York, NY, USA, pp. 579–581, The 32nd ACM Symposium on Parallelism in Algorithms and Architectures 2020
, 14/07/20. https://doi.org/10.1145/3350755.3400264

Feasibility of Cross-Chain Payment with Success Guarantees. / van Glabbeek, Rob; Gramoli, Vincent; Tholoniat, Pierre.
Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures. New York, NY, USA: Association for Computing Machinery, Inc, 2020. p. 579–581 (SPAA '20).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Feasibility of Cross-Chain Payment with Success Guarantees

AU - van Glabbeek, Rob

AU - Gramoli, Vincent

AU - Tholoniat, Pierre

N1 - Conference code: 32

PY - 2020/7/9

Y1 - 2020/7/9

N2 - We consider the problem of cross-chain payment whereby customers of different escrows---implemented by a bank or a blockchain smart contract---successfully transfer digital assets without trusting each other. Prior to this work, cross-chain payment problems did not require this success, or any form of progress. We demonstrate that it is possible to solve this problem when assuming synchrony, in the sense that each message is guaranteed to arrive within a known amount of time, but impossible to solve without assuming synchrony. Yet, we solve a weaker variant of this problem, where success is conditional on the patience of the participants, without assuming synchrony, and in the presence of Byzantine failures. We also discuss the relation with the recently defined cross-chain deals.

AB - We consider the problem of cross-chain payment whereby customers of different escrows---implemented by a bank or a blockchain smart contract---successfully transfer digital assets without trusting each other. Prior to this work, cross-chain payment problems did not require this success, or any form of progress. We demonstrate that it is possible to solve this problem when assuming synchrony, in the sense that each message is guaranteed to arrive within a known amount of time, but impossible to solve without assuming synchrony. Yet, we solve a weaker variant of this problem, where success is conditional on the patience of the participants, without assuming synchrony, and in the presence of Byzantine failures. We also discuss the relation with the recently defined cross-chain deals.

KW - partial synchrony

KW - timed automata

KW - liveness

KW - distributed algorithms

KW - cross-chain payment

KW - blockchain

U2 - 10.1145/3350755.3400264

DO - 10.1145/3350755.3400264

M3 - Conference contribution

T3 - SPAA '20

SP - 579

EP - 581

BT - Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures

PB - Association for Computing Machinery, Inc

CY - New York, NY, USA

T2 - The 32nd ACM Symposium on Parallelism in Algorithms and Architectures 2020<br/>

Y2 - 14 July 2020 through 16 July 2020

ER -

Feasibility of Cross-Chain Payment with Success Guarantees

Abstract

Publication series

Symposium

Keywords / Materials (for Non-textual outputs)

Access to Document

Fingerprint

Cite this