The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Concurrency and Privacy with Payment-Channel Networks
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Impossibility of distributed consensus with one faulty process
Fischer, M. J., Lynch, N. A., & Paterson, M. S. (1985) · Journal of the ACM · doi:10.1145/3149.214121 · Cited by 4,579
Universally composable security: a new paradigm for cryptographic protocols
Canetti, R. (2001) · Proceedings 42nd IEEE Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959888 · Cited by 3,309
Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts
Kosba, A., Miller, A., Shi, E., Wen, Z., & Papamanthou, C. (2016) · 2016 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2016.55 · Cited by 2,227 · cited 1×
“Note that our model for a blockchain is a coarse grained abstraction of the reality and that more accurate formalizations are known in the literature, see [44].”
MethodAlpern, B., & Schneider, F. B. (1985) · Information Processing Letters · doi:10.1016/0020-0190(85)90056-0 · Cited by 1,038
The serializability of concurrent database updates
Papadimitriou, C. H. (1979) · Journal of the ACM · doi:10.1145/322154.322158 · Cited by 1,021
A fistful of bitcoins: characterizing payments among men with no names
Meiklejohn, S., Pomarole, M., Jordan, G., Levchenko, K., McCoy, D., Voelker, G. M., & Savage, S. (2013) · Proceedings of the 2013 conference on Internet measurement conference · doi:10.1145/2504730.2504747 · Cited by 1,017
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Welch, J. L., & Attiya, H. (1998) · Medical Entomology and Zoology · Cited by 925
Evaluating user privacy in bitcoin
Androulaki, E., Karame, G. O., Roeschlin, M., Scherer, T., & Capkun, S. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-39884-1_4 · Cited by 700
An Analysis of Anonymity in the Bitcoin System
Reid, F., & Harrigan, M. (2013) · Security and Privacy in Social Networks · doi:10.1007/978-1-4614-4139-7_10 · Cited by 691
(2010) · Cited by 662
Cited by
A Survey on Security and Privacy Issues of Bitcoin
Conti, M., Sandeep Kumar, E., Lal, C., & Ruj, S. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2842460 · Cited by 1,116
“However, these payment channel networks cause a new set of challenges related to routing [43], processing concurrent payments [44], and user privacy [45], [46].”
BackgroundA Comprehensive Survey of Blockchain: From Theory to IoT Applications and Beyond
Wu, M., Wang, K., Cai, X., Guo, S., Guo, M., & Rong, C. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2019.2922538 · Cited by 285
Blockchain Access Privacy: Challenges and Directions
Henry, R., Herzberg, A., & Kate, A. (2018) · IEEE Security & Privacy · doi:10.1109/msp.2018.3111245 · Cited by 273
Self-citationAnonymous Multi-Hop Locks for Blockchain Scalability and Interoperability
Malavolta, G., Moreno-Sanchez, P., Schneidewind, C., Kate, A., & Maffei, M. (2019) · Proceedings 2019 Network and Distributed System Security Symposium · doi:10.14722/ndss.2019.23330 · Cited by 270
Self-citationSoK: Layer-Two Blockchain Protocols
Gudgeon, L., Moreno-Sanchez, P., Roos, S., McCorry, P., & Gervais, A. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-51280-4_12 · Cited by 263
Self-citation
Metadata
- Authors
- Malavolta, G., Moreno-Sanchez, P., Kate, A., Maffei, M., & Ravi, S.
- Venue
- Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security
- Publisher
- ACM
- Published
- 2017-10-30
- Pages
- 455-471
- OpenAlex
- W2767101501
- Cited by
- 284
- References
- 34
- FWCI
- 18.00
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Concurrency and Privacy with Payment-Channel Networks. https://app.cochat.ai/papers/10.1145/3133956.3134096
- The paper
- Malavolta, G., Moreno-Sanchez, P., Kate, A., Maffei, M., & Ravi, S. (2017). Concurrency and Privacy with Payment-Channel Networks. Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. https://doi.org/10.1145/3133956.3134096
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.