Feasibility of Cross-Chain Payment with Success Guarantees

July 16, 2020 Β· Declared Dead Β· πŸ› ACM Symposium on Parallelism in Algorithms and Architectures

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Rob van Glabbeek, Vincent Gramoli, Pierre Tholoniat arXiv ID 2007.08152 Category cs.DC: Distributed Computing Cross-listed cs.LO Citations 8 Venue ACM Symposium on Parallelism in Algorithms and Architectures Last Checked 4 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Distributed Computing

Died the same way β€” πŸ‘» Ghosted