{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,13]],"date-time":"2026-09-13T12:56:39Z","timestamp":1789304199549,"version":"build-2803163510"},"reference-count":39,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2020,6,9]],"date-time":"2020-06-09T00:00:00Z","timestamp":1591660800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"the Franz Family Fund"},{"DOI":"10.13039\/100014718","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CIF-1705007, CCF-1927712"],"award-info":[{"award-number":["CIF-1705007, CCF-1927712"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]},{"name":"IC3"},{"name":"Input Output Hong Kong"},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF- 17-S-0002"],"award-info":[{"award-number":["W911NF- 17-S-0002"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Meas. Anal. Comput. Syst."],"published-print":{"date-parts":[[2020,6,9]]},"abstract":"<jats:p>Payment channel networks (PCNs) are viewed as one of the most promising scalability solutions for cryptocurrencies today. Roughly, PCNs are networks where each node represents a user and each directed, weighted edge represents funds escrowed on a blockchain; these funds can be transacted only between the endpoints of the edge. Users efficiently transmit funds from node A to B by relaying them over a path connecting A to B, as long as each edge in the path contains enough balance (escrowed funds) to support the transaction. Whenever a transaction succeeds, the edge weights are updated accordingly. In deployed PCNs, channel balances (i.e., edge weights) are not revealed to users for privacy reasons; users know only the initial weights at time 0. Hence, when routing transactions, users typically first guess a path, then check if it supports the transaction. This guess-and-check process dramatically reduces the success rate of transactions. At the other extreme, knowing full channel balances can give substantial improvements in transaction success rate at the expense of privacy. In this work, we ask whether a network can reveal noisy channel balances to trade off privacy for utility. We show fundamental limits on such a tradeoff, and propose noise mechanisms that achieve the fundamental limit for a general class of graph topologies. Our results suggest that in practice, PCNs should operate either in the low-privacy or low-utility regime; it is not possible to get large gains in utility by giving up a little privacy, or large gains in privacy by sacrificing a little utility.<\/jats:p>","DOI":"10.1145\/3392147","type":"journal-article","created":{"date-parts":[[2020,6,9]],"date-time":"2020-06-09T22:10:12Z","timestamp":1591740612000},"page":"1-39","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["Privacy-Utility Tradeoffs in Routing Cryptocurrency over Payment Channel Networks"],"prefix":"10.1145","volume":"4","author":[{"given":"Weizhao","family":"Tang","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weina","family":"Wang","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Giulia","family":"Fanti","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sewoong","family":"Oh","sequence":"additional","affiliation":[{"name":"University of Washington, Seattle, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,6,12]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Lightning network daemon. https:\/\/github.com\/lightningnetwork\/lnd.  Lightning network daemon. https:\/\/github.com\/lightningnetwork\/lnd."},{"key":"e_1_2_1_2_1","unstructured":"Raiden network. https:\/\/raiden.network\/.  Raiden network. https:\/\/raiden.network\/."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1086\/671754"},{"key":"e_1_2_1_4_1","volume-title":"Forbes","author":"Bambrough Billy","year":"2019","unstructured":"Billy Bambrough . Bitcoin just crossed a huge adoption milestone . Forbes , 2019 . Billy Bambrough. Bitcoin just crossed a huge adoption milestone. Forbes, 2019."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.econlet.2012.04.077"},{"key":"e_1_2_1_6_1","volume-title":"Secure and privacy-preserving communication in hybrid ad hoc networks. Technical report","author":"Capkun Srdjan","year":"2004","unstructured":"Srdjan Capkun , Jean-Pierre Hubaux , and Markus Jakobsson . Secure and privacy-preserving communication in hybrid ad hoc networks. Technical report , 2004 . Srdjan Capkun, Jean-Pierre Hubaux, and Markus Jakobsson. Secure and privacy-preserving communication in hybrid ad hoc networks. Technical report, 2004."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/54235.54239"},{"key":"e_1_2_1_8_1","volume-title":"Optimal attack and reinforcement of a network. Journal of the ACM (JACM), 32(3):549--561","author":"Cunningham William H","year":"1985","unstructured":"William H Cunningham . Optimal attack and reinforcement of a network. Journal of the ACM (JACM), 32(3):549--561 , 1985 . William H Cunningham. Optimal attack and reinforcement of a network. Journal of the ACM (JACM), 32(3):549--561, 1985."},{"key":"e_1_2_1_9_1","volume-title":"Naval Research Lab Washington DC","author":"Dingledine Roger","year":"2004","unstructured":"Roger Dingledine , Nick Mathewson , and Paul Syverson . Tor : The second-generation onion router. Technical report , Naval Research Lab Washington DC , 2004 . Roger Dingledine, Nick Mathewson, and Paul Syverson. Tor: The second-generation onion router. Technical report, Naval Research Lab Washington DC, 2004."},{"key":"e_1_2_1_10_1","volume-title":"Celer network: Bring internet scale to every blockchain. arXiv preprint arXiv:1810.00037","author":"Dong Mo","year":"2018","unstructured":"Mo Dong , Qingkai Liang , Xiaozhou Li , and Junda Liu . Celer network: Bring internet scale to every blockchain. arXiv preprint arXiv:1810.00037 , 2018 . Mo Dong, Qingkai Liang, Xiaozhou Li, and Junda Liu. Celer network: Bring internet scale to every blockchain. arXiv preprint arXiv:1810.00037, 2018."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-5906-5_752"},{"key":"e_1_2_1_12_1","volume-title":"Dynamically protecting privacy, under uncertainty. arXiv preprint arXiv:1911.08875","author":"Erturk Mine Su","year":"2019","unstructured":"Mine Su Erturk and Kuang Xu . Dynamically protecting privacy, under uncertainty. arXiv preprint arXiv:1911.08875 , 2019 . Mine Su Erturk and Kuang Xu. Dynamically protecting privacy, under uncertainty. arXiv preprint arXiv:1911.08875, 2019."},{"key":"e_1_2_1_13_1","first-page":"45","volume-title":"Emin G\u00fcn Sirer, and Robbert Van Renesse. Bitcoin-ng: A scalable blockchain protocol. In 13th $$USENIX$$ Symposium on Networked Systems Design and Implementation ($$NSDI$$ 16)","author":"Eyal Ittay","year":"2016","unstructured":"Ittay Eyal , Adem Efe Gencer , Emin G\u00fcn Sirer, and Robbert Van Renesse. Bitcoin-ng: A scalable blockchain protocol. In 13th $$USENIX$$ Symposium on Networked Systems Design and Implementation ($$NSDI$$ 16) , pages 45 -- 59 , 2016 . Ittay Eyal, Adem Efe Gencer, Emin G\u00fcn Sirer, and Robbert Van Renesse. Bitcoin-ng: A scalable blockchain protocol. In 13th $$USENIX$$ Symposium on Networked Systems Design and Implementation ($$NSDI$$ 16), pages 45--59, 2016."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2017.2696960"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2745844.2745866"},{"key":"e_1_2_1_16_1","volume-title":"Investopedia","author":"Floyd David","year":"2018","unstructured":"David Floyd . Lightning network : What is it and can it solve bitcoin's scaling problem ? Investopedia , March 2018 . David Floyd. Lightning network: What is it and can it solve bitcoin's scaling problem? Investopedia, March 2018."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/586110.586137"},{"key":"e_1_2_1_18_1","volume-title":"Bitcoinist","author":"Gil-Pulgar Julio","year":"2018","unstructured":"Julio Gil-Pulgar . Atomic Multi-Path to help Bitcoin become a formidable payment instrument . Bitcoinist , February 2018 . Julio Gil-Pulgar. Atomic Multi-Path to help Bitcoin become a formidable payment instrument. Bitcoinist, February 2018."},{"key":"e_1_2_1_19_1","volume-title":"Herbivore: A scalable and efficient protocol for anonymous communication. Technical report","author":"Goel Sharad","year":"2003","unstructured":"Sharad Goel , Mark Robson , Milo Polte , and Emin Sirer . Herbivore: A scalable and efficient protocol for anonymous communication. Technical report , Cornell University , 2003 . Sharad Goel, Mark Robson, Milo Polte, and Emin Sirer. Herbivore: A scalable and efficient protocol for anonymous communication. Technical report, Cornell University, 2003."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1947915.1947917"},{"key":"e_1_2_1_21_1","first-page":"5","volume-title":"Proc. of the 2nd international icst conference on game theory for networks, gamenets","volume":"11","author":"Gueye Assane","year":"2011","unstructured":"Assane Gueye , Jean C Walrand , and Venkat Anantharam . A network topology design game: How to choose communication links in an adversarial environment . In Proc. of the 2nd international icst conference on game theory for networks, gamenets , volume 11 , page 5 , 2011 . Assane Gueye, Jean C Walrand, and Venkat Anantharam. A network topology design game: How to choose communication links in an adversarial environment. In Proc. of the 2nd international icst conference on game theory for networks, gamenets, volume 11, page 5, 2011."},{"key":"e_1_2_1_22_1","first-page":"2879","volume-title":"Advances in neural information processing systems","author":"Kairouz Peter","year":"2014","unstructured":"Peter Kairouz , Sewoong Oh , and Pramod Viswanath . Extremal mechanisms for local differential privacy . In Advances in neural information processing systems , pages 2879 -- 2887 , 2014 . Peter Kairouz, Sewoong Oh, and Pramod Viswanath. Extremal mechanisms for local differential privacy. In Advances in neural information processing systems, pages 2879--2887, 2014."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134033"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2017.23448"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134096"},{"key":"e_1_2_1_26_1","volume-title":"Hot Topics in Privacy Enhancing Technologies Symposium","author":"Nandi Animesh","year":"2011","unstructured":"Animesh Nandi , Armen Aghasaryan , and Makram Bouzid . P3 : A privacy preserving personalization middleware for recommendation-based services . In Hot Topics in Privacy Enhancing Technologies Symposium , 2011 . Animesh Nandi, Armen Aghasaryan, and Makram Bouzid. P3: A privacy preserving personalization middleware for recommendation-based services. In Hot Topics in Privacy Enhancing Technologies Symposium, 2011."},{"key":"e_1_2_1_27_1","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/978-3-030-00305-0_5","volume-title":"Data Privacy Management, Cryptocurrencies and Blockchain Technology","author":"Piatkivskyi Dmytro","year":"2018","unstructured":"Dmytro Piatkivskyi and Mariusz Nowostawski . Split payments in payment networks . In Data Privacy Management, Cryptocurrencies and Blockchain Technology , pages 67 -- 75 . Springer , 2018 . Dmytro Piatkivskyi and Mariusz Nowostawski. Split payments in payment networks. In Data Privacy Management, Cryptocurrencies and Blockchain Technology, pages 67--75. Springer, 2018."},{"key":"e_1_2_1_28_1","volume-title":"The bitcoin lightning network: Scalable off-chain instant payments","author":"Poon Joseph","year":"2016","unstructured":"Joseph Poon and Thaddeus Dryja . The bitcoin lightning network: Scalable off-chain instant payments , 2016 . Joseph Poon and Thaddeus Dryja. The bitcoin lightning network: Scalable off-chain instant payments, 2016."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/293411.293778"},{"key":"e_1_2_1_30_1","volume-title":"Settling payments fast and private: Efficient decentralized routing for path-based transactions. arXiv preprint arXiv:1709.05748","author":"Roos Stefanie","year":"2017","unstructured":"Stefanie Roos , Pedro Moreno-Sanchez , Aniket Kate , and Ian Goldberg . Settling payments fast and private: Efficient decentralized routing for path-based transactions. arXiv preprint arXiv:1709.05748 , 2017 . Stefanie Roos, Pedro Moreno-Sanchez, Aniket Kate, and Ian Goldberg. Settling payments fast and private: Efficient decentralized routing for path-based transactions. arXiv preprint arXiv:1709.05748, 2017."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/1140814.1140816"},{"key":"e_1_2_1_32_1","volume-title":"HotNets","author":"Sivaraman Vibhaalakshmi","year":"2019","unstructured":"Vibhaalakshmi Sivaraman , Shaileshh Bojja Venkatakrishnan , Mohammad Alizadeh , Giulia Fanti , and Pramod Viswanath . Routing cryptocurrency with the spider network . In HotNets , 2019 . Vibhaalakshmi Sivaraman, Shaileshh Bojja Venkatakrishnan, Mohammad Alizadeh, Giulia Fanti, and Pramod Viswanath. Routing cryptocurrency with the spider network. In HotNets, 2019."},{"key":"e_1_2_1_33_1","volume-title":"NSDI","author":"Sivaraman Vibhaalakshmi","year":"2020","unstructured":"Vibhaalakshmi Sivaraman , Shaileshh Bojja Venkatakrishnan , Kathleen Ruan , Parimarjan Negi , Lei Yang , Radhika Mittal , Giulia Fanti , and Mohammad Alizadeh . High throughput cryptocurrency routing in payment channel networks . In NSDI , 2020 . Vibhaalakshmi Sivaraman, Shaileshh Bojja Venkatakrishnan, Kathleen Ruan, Parimarjan Negi, Lei Yang, Radhika Mittal, Giulia Fanti, and Mohammad Alizadeh. High throughput cryptocurrency routing in payment channel networks. In NSDI, 2020."},{"key":"e_1_2_1_34_1","article-title":"Lightning network better than sidechains for scaling bitcoin","author":"Torpey Kyle","year":"2016","unstructured":"Kyle Torpey . Greg maxwell : Lightning network better than sidechains for scaling bitcoin . Bitcoin Magazine , April 2016 . Kyle Torpey. Greg maxwell: Lightning network better than sidechains for scaling bitcoin. Bitcoin Magazine, April 2016.","journal-title":"Bitcoin Magazine"},{"key":"e_1_2_1_35_1","volume-title":"Stress test prepares visanet for the most wonderful time of the year. http: stress-test-prepares-visanet-for-the-most-wonderful-time-of-the-year\/ \/\/www.visa.com\/blogarchives\/us\/2013\/10\/10\/ index.html","author":"Trillo Manny","year":"2013","unstructured":"Manny Trillo . Stress test prepares visanet for the most wonderful time of the year. http: stress-test-prepares-visanet-for-the-most-wonderful-time-of-the-year\/ \/\/www.visa.com\/blogarchives\/us\/2013\/10\/10\/ index.html , 2013 . Manny Trillo. Stress test prepares visanet for the most wonderful time of the year. http: stress-test-prepares-visanet-for-the-most-wonderful-time-of-the-year\/ \/\/www.visa.com\/blogarchives\/us\/2013\/10\/10\/ index.html, 2013."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2017.1682"},{"key":"e_1_2_1_37_1","volume-title":"Hard Fork","author":"Varshney Neel","year":"2018","unstructured":"Neel Varshney . Lightning network has 1 percent success rate with transactions larger than $200, controversial research says . Hard Fork , June 2018 . Neel Varshney. Lightning network has 1 percent success rate with transactions larger than $200, controversial research says. Hard Fork, June 2018."},{"key":"e_1_2_1_38_1","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/978-3-030-00305-0_13","volume-title":"Data Privacy Management, Cryptocurrencies and Blockchain Technology","author":"Werman Shira","year":"2018","unstructured":"Shira Werman and Aviv Zohar . Avoiding deadlocks in payment channel networks . In Data Privacy Management, Cryptocurrencies and Blockchain Technology , pages 175 -- 187 . Springer , 2018 . Shira Werman and Aviv Zohar. Avoiding deadlocks in payment channel networks. In Data Privacy Management, Cryptocurrencies and Blockchain Technology, pages 175--187. Springer, 2018."},{"key":"e_1_2_1_39_1","volume-title":"Ohie: Blockchain scaling made simple. arXiv preprint arXiv:1811.12628","author":"Yu Haifeng","year":"2018","unstructured":"Haifeng Yu , Ivica Nikolic , Ruomu Hou , and Prateek Saxena . Ohie: Blockchain scaling made simple. arXiv preprint arXiv:1811.12628 , 2018 . Haifeng Yu, Ivica Nikolic, Ruomu Hou, and Prateek Saxena. Ohie: Blockchain scaling made simple. arXiv preprint arXiv:1811.12628, 2018."}],"container-title":["Proceedings of the ACM on Measurement and Analysis of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3392147","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3392147","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3392147","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:49Z","timestamp":1750199929000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3392147"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,9]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6,9]]}},"alternative-id":["10.1145\/3392147"],"URL":"https:\/\/doi.org\/10.1145\/3392147","relation":{},"ISSN":["2476-1249"],"issn-type":[{"value":"2476-1249","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,9]]},"assertion":[{"value":"2020-06-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}