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.
[1]
Christian Decker,et al.
A Fast and Scalable Payment Network with Bitcoin Duplex Micropayment Channels
,
2015,
SSS.
[2]
Florian Tschorsch,et al.
Towards a Concurrent and Distributed Route Selection for Payment Channel Networks
,
2017,
DPM/CBT@ESORICS.
[3]
Ian Goldberg,et al.
Settling Payments Fast and Private: Efficient Decentralized Routing for Path-Based Transactions
,
2017,
NDSS.
[4]
Giulio Malavolta,et al.
Concurrency and Privacy with Payment-Channel Networks
,
2017,
IACR Cryptol. ePrint Arch..
[5]
Ramesh Govindan,et al.
Liquidity in credit networks: a little trust goes a long way
,
2010,
EC '11.