Concurrency and Privacy with Payment-Channel Networks
Giulio Malavolta, Pedro Moreno-Sanchez, Aniket Kate, Matteo Maffei, Srivatsan Ravi
Abstract
Permissionless blockchains protocols such as Bitcoin are inherently limited in transaction throughput and latency. Current efforts to address this key issue focus on off-chain payment channels that can be combined in a Payment-Channel Network (PCN) to enable an unlimited number of payments without requiring to access the blockchain other than to register the initial and final capacity of each channel. While this approach paves the way for low latency and high throughput of payments, its deployment in practice raises several privacy concerns as well as technical challenges related to the inherently concurrent nature of payments that have not been sufficiently studied so far. In this work, we lay the foundations for privacy and concurrency in PCNs, presenting a formal definition in the Universal Composability framework as well as practical and provably secure solutions. In particular, we present Fulgor and Rayo. Fulgor is the first payment protocol for PCNs that provides provable privacy guarantees for PCNs and is fully compatible with the Bitcoin scripting system. However, Fulgor is a blocking protocol and therefore prone to deadlocks of concurrent payments as in currently available PCNs. Instead, Rayo is the first protocol for PCNs that enforces non-blocking progress (i.e., at least one of the concurrent payments terminates). We show through a new impossibility result that non-blocking progress necessarily comes at the cost of weaker privacy. At the core of Fulgor and Rayo is Multi-Hop HTLC, a new smart contract, compatible with the Bitcoin scripting system, that provides conditional payments while reducing running time and communication overhead with respect to previous approaches. Our performance evaluation of Fulgor and Rayo shows that a payment with 10 intermediate users takes as few as 5 seconds, thereby demonstrating their feasibility to be deployed in practice.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext a0219b5d-834e-4bc5-b105-daaaa8b352c0Cited by top-tier papers21
- Anonymous Multi-Hop Locks for Blockchain Scalability and InteroperabilityGiulio Malavolta, Pedro Moreno-Sanchez, Clara Schneidewind, Aniket Kate et al.NDSS 2019 · 305 citations
- General State Channel NetworksStefan Dziembowski, Sebastian Faust, Kristina HostákováCCS 2018 · 249 citations
- Settling Payments Fast and Private: Efficient Decentralized Routing for Path-Based TransactionsStefanie Roos, Pedro Moreno-Sanchez, Aniket Kate, Ian GoldbergNDSS 2018 · 246 citations
- HyperService: Interoperability and Programmability Across Heterogeneous BlockchainsZhuotao Liu, Yangxi Xiang, Jian Shi, Peng Gao et al.CCS 2019 · 128 citations
- Atomic Multi-Channel Updates with Constant Collateral in Bitcoin-Compatible Payment-Channel NetworksChristoph Egger, Pedro Moreno-Sanchez, Matteo MaffeiCCS 2019 · 108 citations
Related papers
- Thora: Atomic and Privacy-Preserving Multi-Channel UpdatesLukas Aumayr, Kasra Abbaszadeh, Matteo MaffeiCCS 2022 · 20 citations
- Bitcoin-Compatible Virtual ChannelsLukas Aumayr, Matteo Maffei, Oguzhan Ersoy, Andreas Erwig et al.S&P 2021 · 62 citations
- Blitz: Secure Multi-Hop Payments Without Two-Phase CommitsLukas Aumayr, Pedro Moreno-Sanchez, Aniket Kate, Matteo MaffeiUSENIX Security 2021 · 63 citations
- A2L: Anonymous Atomic Locks for Scalability in Payment Channel HubsErkan Tairi, Pedro Moreno-Sanchez, Matteo MaffeiS&P 2021 · 96 citations
- Horcrux: Synthesize, Split, Shift and Stay Alive; Preventing Channel Depletion via Universal and Enhanced Multi-hop PaymentsAnqi Tian, Peifang Ni, Yingzi Gao, Jing XuNDSS 2025
