Paper 2024/1338

Horcrux: Synthesize, Split, Shift and Stay Alive Preventing Channel Depletion via Universal and Enhanced Multi-hop Payments

Anqi Tian, School of Computer Science and Technology, University of Chinese Academy of Sciences, Institute of Software, Chinese Academy of Sciences
Peifang Ni, Institute of Software, Chinese Academy of Sciences, Zhongguancun Laboratory, Beijing, P.R.China
Yingzi Gao, School of Computer Science and Technology, University of Chinese Academy of Sciences, Institute of Software, Chinese Academy of Sciences
Jing Xu, Institute of Software, Chinese Academy of Sciences, Zhongguancun Laboratory, Beijing, P.R.China
Abstract

Payment Channel Networks (PCNs) have been highlighted as viable solutions to address the scalability issues in current permissionless blockchains. They facilitate off-chain transactions, significantly reducing the load on the blockchain. However, the extensive reuse of multi-hop routes in the same direction poses a risk of channel depletion, resulting in involved channels becoming unidirectional or even closing, thereby compromising the sustainability and scalability of PCNs. Even more concerning, existing rebalancing protocol solutions heavily rely on trust assumptions and scripting languages, resulting in compromised universality and reliability. In this paper, we present Horcrux, a universal and efficient multi-party virtual channel protocol without relying on extra trust assumptions, scripting languages, or the perpetual online requirement. Horcrux fundamentally addresses the channel depletion problem using a novel approach termed flow neutrality, which minimizes the impact on channel balance allocations during multi-hop payments (MHPs). Additionally, we formalize the security properties of Horcrux by modeling it within the Global Universal Composability framework and provide a formal security proof. We implement Horcrux on a real Lightning Network dataset, comprising 10,529 nodes and 38,910 channels, and compare it to the state-of-the-art rebalancing schemes such as Shaduf [NDSS'22], Thora [CCS'22], and Revive [CCS'17]. The experimental results demonstrate that (1) the entire process of Horcrux costs less than 1 USD, significantly lower than Shaduf; (2) Horcrux achieves a $12\%$-$30\%$ increase in payment success ratio and reduces user deposits required for channels by $70\%$-$91\%$; (3) the performance of Horcrux improves by $1.2x$-$1.5x$ under long-term operation; and (4) Horcrux maintains a nearly zero channel depletion rate, whereas both Revive and Shaduf result in thousands of depleted channels.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. NDSS 2025
Keywords
payment channel networkchannel depletionvirtual channeluniversalitysustainability
Contact author(s)
anqi2021 @ iscas ac cn
peifang2020 @ iscas ac cn
yingzi2019 @ iscas ac cn
xujing @ iscas ac cn
History
2024-08-30: revised
2024-08-27: received
See all versions
Short URL
https://ia.cr/2024/1338
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2024/1338,
      author = {Anqi Tian and Peifang Ni and Yingzi Gao and Jing Xu},
      title = {Horcrux: Synthesize, Split, Shift and Stay Alive Preventing Channel Depletion via Universal and Enhanced Multi-hop Payments},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/1338},
      year = {2024},
      url = {https://eprint.iacr.org/2024/1338}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.