51. Avoiding Deadlocks in Payment Channel Networks
- Author
-
Aviv Zohar and Shira Werman
- Subjects
0301 basic medicine ,Cryptocurrency ,business.industry ,Computer science ,media_common.quotation_subject ,Payment ,Graph ,03 medical and health sciences ,030104 developmental biology ,0302 clinical medicine ,Ask price ,030220 oncology & carcinogenesis ,business ,Computer network ,media_common ,Communication channel ,Payment transaction - Abstract
Payment transaction channels are one of the main proposed approaches to scaling cryptocurrency payment systems. Recent work by Malavolta et al. [7] has shown that the privacy of the protocol may conflict with its concurrent nature and may lead to deadlocks. In this paper we ask the natural question: can payments in routing networks be routed so as to avoid deadlocks altogether? Our results show that it is in general NP-complete to determine whether a deadlock-free routing exists in a given payment graph. On the other hand, Given some fixed routing, we propose another way to resolve the problem of deadlocks. We offer a modification of the protocols in lightning network and in Fulgor [7] that pre-locks edges in an order that guarantees progress, while still maintaining the protocol’s privacy requirements.
- Published
- 2018
- Full Text
- View/download PDF