Settling Payments Fast and Private: Efficient Decentralized Routing for Path-Based Transactions
Stefanie Roos, Pedro Moreno-Sanchez, Aniket Kate, Ian Goldberg
摘要
1 Decentralized path-based transaction (PBT) networks maintain local payment channels between participants. Pairs of users leverage these channels to settle payments via a path of intermediaries without the need to record all transactions in a global blockchain. PBT networks such as Bitcoin's Lightning Network and Ethereum's Raiden Network are the most prominent examples of this emergent area of research. Both networks overcome scalability issues of widely used cryptocurrencies by replacing expensive and slow on-chain blockchain operations with inexpensive and fast off-chain transfers. At the core of a decentralized PBT network is a routing algorithm that discovers transaction paths between sender and receiver. In recent years, a number of routing algorithms have been proposed, including landmark routing, utilized in the decentralized IOU credit network SilentWhispers, and Flare, a link state algorithm for the Lightning Network. However, the existing efforts lack either efficiency or privacy, as well as the comprehensive analysis that is indispensable to ensure the success of PBT networks in practice. In this work, we first identify several efficiency concerns in existing routing algorithms for decentralized PBT networks. Armed with this knowledge, we design and evaluate SpeedyMurmurs, a novel routing algorithm for decentralized PBT networks using efficient and flexible embedding-based path discovery and on-demand efficient stabilization to handle the dynamics of a PBT network. Our simulation study, based on real-world data from the currently deployed Ripple credit network, indicates that SpeedyMurmurs reduces the overhead of stabilization by up to two orders of magnitude and the overhead of routing a transaction by more than a factor of two. Furthermore, using SpeedyMurmurs maintains at least the same success ratio as decentralized landmark routing, while providing lower delays. Finally, SpeedyMurmurs achieves key privacy goals for routing in decentralized PBT networks.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper11
- General State Channel NetworksStefan Dziembowski, Sebastian Faust, Kristina HostákováCCS 2018 · 被引用 249 次
- Atomic Multi-Channel Updates with Constant Collateral in Bitcoin-Compatible Payment-Channel NetworksChristoph Egger, Pedro Moreno-Sanchez, Matteo MaffeiCCS 2019 · 被引用 108 次
- Blitz: Secure Multi-Hop Payments Without Two-Phase CommitsLukas Aumayr, Pedro Moreno-Sanchez, Aniket Kate, Matteo MaffeiUSENIX Security 2021 · 被引用 63 次
- Bitcoin-Compatible Virtual ChannelsLukas Aumayr, Matteo Maffei, Oguzhan Ersoy, Andreas Erwig 等S&P 2021 · 被引用 62 次
- High Throughput Cryptocurrency Routing in Payment Channel NetworksVibhaalakshmi Sivaraman, Shaileshh Bojja Venkatakrishnan, Kathleen Ruan, Parimarjan Negi 等NSDI 2020 · 被引用 61 次
它引用的顶会 Paper1
相关 Paper
- Shaduf: Non-Cycle Payment Channel RebalancingZhonghui Ge, Yi Zhang, Yu Long, Dawu GuNDSS 2022
- Payout Races and Congested Channels: A Formal Analysis of Security in the Lightning NetworkBen Weintraub, Satwik Prabhu Kumble, Cristina Nita-Rotaru, Stefanie RoosCCS 2024 · 被引用 5 次
- Perun: Virtual Payment Hubs over CryptocurrenciesStefan Dziembowski, Lisa Eckey, Sebastian Faust, Daniel MalinowskiS&P 2019 · 被引用 222 次
- Unlocking Superior Performance in Reconfigurable Data Center Networks with Credit-Based TransportFederico De Marchi, Jialong Li, Ying Zhang, Wei Bai 等SIGCOMM 2025 · 被引用 2 次
- REPS: Recycled Entropy Packet Spraying for Adaptive Load Balancing and Failure MitigationTommaso Bonato, Abdul Kabbani, Ahmad Ghalayini, Michael Papamichael 等EuroSys 2026 · 被引用 12 次
