skip to main content
10.1145/3558535.3559779acmotherconferencesArticle/Chapter ViewAbstractPublication PagesaftConference Proceedingsconference-collections
research-article
Open Access

SyncPCN/PSyncPCN: Payment Channel Networks without Blockchain Synchrony

Published:05 July 2023Publication History

ABSTRACT

Payment channel networks (PCNs) enhance the scalability of block-chains by allowing parties to conduct transactions off-chain, i.e, without broadcasting every transaction to all blockchain participants. To conduct transactions, a sender and a receiver can either establish a direct payment channel with a funding blockchain transaction or leverage existing channels in a multi-hop payment. The security of PCNs usually relies on the synchrony of the underlying blockchain, i.e., evidence of misbehavior needs to be published on the blockchain within a time limit. Alternative payment channel proposals that do not require blockchain synchrony rely on quorum certificates and use a committee to register the transactions of a channel. However, these proposals do not support multi-hop payments, a limitation we aim to overcome.

In this paper, we demonstrate that it is in fact impossible to design a multi-hop payment protocol with both network asynchrony and faulty channels, i.e., channels that may not correctly follow the protocol. We then detail two committee-based multi-hop payment protocols that respectively assume synchronous communications and possibly faulty channels, or asynchronous communication and correct channels. The first protocol relies on possibly faulty committees instead of the blockchain to resolve channel disputes, and enforces privacy properties within a synchronous network. The second one relies on committees that contain at most f faulty members out of 3f +1 and successively delegate to each other the role of eventually completing a multi-hop payment. We show that both protocols satisfy the security requirements of a multi-hop payment and compare their communication complexity and latency.

References

  1. 1ml.com. 2021. Real-Time Lightning Network Statistics. Available at: https://1ml.com/statistics.Google ScholarGoogle Scholar
  2. N. Asokan, Victor Shoup, and Michael Waidner. 1998. Asynchronous Protocols for Optimistic Fair Exchange. In S&P.Google ScholarGoogle Scholar
  3. Lukas Aumayr, Matteo Maffei, Oguzhan Ersoy, Andreas Erwig, Sebastian Faust, Siavash Riahi, Kristina Hostáková, and Pedro Moreno-Sanchez. 2021. Bitcoin-Compatible Virtual Channels. In IEEE S&P.Google ScholarGoogle Scholar
  4. Lukas Aumayr, Pedro Moreno-Sanchez, Aniket Kate, and Matteo Maffei. 2021. Blitz: Secure Multi-Hop Payments Without Two-Phase Commits. In USENIX Security.Google ScholarGoogle Scholar
  5. Alex Auvolat, Davide Frey, Michel Raynal, and François Taïani. 2020. Money transfer made simple: a specification, a generic algorithm, and its proof. arXiv preprint arXiv:2006.12276 (2020).Google ScholarGoogle Scholar
  6. Georgia Avarikioti, Eleftherios Kokoris Kogias, Roger Wattenhofer, and Dionysis Zindros. 2021. Brick: Asynchronous Payment Channels. FC.Google ScholarGoogle Scholar
  7. Edward Bortnikov, Maxim Gurevich, Idit Keidar, Gabriel Kliot, and Alexander Shraer. 2009. Brahms: Byzantine resilient random membership sampling. Computer Networks 53, 13 (2009), 2340--2359.Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Gabriel Bracha and Sam Toueg. 1985. Asynchronous consensus and broadcast protocols. JACM 32, 4 (1985), 824--840.Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Ferdinand Brasser, Urs Müller, Alexandra Dmitrienko, Kari Kostiainen, Srdjan Capkun, and Ahmad-Reza Sadeghi. 2017. Software Grand Exposure: {SGX} Cache Attacks Are Practical. In WOOT.Google ScholarGoogle Scholar
  10. Miguel Castro, Barbara Liskov, et al. 1999. Practical byzantine fault tolerance. In OSDI, Vol. 99. 173--186.Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Tushar Deepak Chandra, Vassos Hadzilacos, and Sam Toueg. 1996. The weakest failure detector for solving consensus. JACM 43, 4 (1996), 685--722.Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Pierre Civit, Seth Gilbert, and Vincent Gramoli. 2021. Polygraph: Accountable byzantine agreement. In 2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS). IEEE, 403--413.Google ScholarGoogle ScholarCross RefCross Ref
  13. Daniel Collins, Rachid Guerraoui, Jovan Komatovic, Petr Kuznetsov, Matteo Monti, Matej Pavlovic, Yvonne-Anne Pignolet, Dragos-Adrian Seredinschi, Andrei Tonkikh, and Athanasios Xygkis. 2020. Online payments by merely broadcasting messages. In 2020 50th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN). IEEE, 26--38.Google ScholarGoogle ScholarCross RefCross Ref
  14. George Danezis and Ian Goldberg. 2009. Sphinx: A compact and provably secure mix format. In S&P.Google ScholarGoogle Scholar
  15. Christian Decker and Roger Wattenhofer. 2015. A fast and scalable payment network with bitcoin duplex micropayment channels. In SSS.Google ScholarGoogle Scholar
  16. Jérémie Decouchant, David Kozhaya, Vincent Rahli, and Jiangshan Yu. 2022. DAMYSUS: streamlined BFT consensus leveraging trusted components. In EuroSys. 1--16.Google ScholarGoogle Scholar
  17. Thaddeus Dryja and Scaling Bitcoin Milano. 2016. Unlinkable outsourced channel monitoring. Scaling Bitcoin Milan (2016).Google ScholarGoogle Scholar
  18. Stefan Dziembowski, Lisa Eckey, Sebastian Faust, Julia Hesse, and Kristina Hostáková. 2019. Multi-party Virtual State Channels. In Eurocrypt.Google ScholarGoogle Scholar
  19. Stefan Dziembowski, Lisa Eckey, Sebastian Faust, and Daniel Malinowski. 2019. Perun: Virtual Payment Hubs over Cryptocurrencies. In IEEE S&P.Google ScholarGoogle Scholar
  20. Lisa Eckey, Sebastian Faust, Kristina Hostáková, and Stefanie Roos. 2020. Splitting Payments Locally While Routing Interdimensionally. Cryptol. ePrint Arch. (2020).Google ScholarGoogle Scholar
  21. Michael J Fischer, Nancy A Lynch, and Michael S Paterson. 1985. Impossibility of distributed consensus with one faulty process. JACM 32, 2 (1985), 374--382.Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. David Galindo, Jia Liu, Mihair Ordean, and Jin-Mann Wong. 2021. Fully Distributed Verifiable Random Functions and their Application to Decentralised Random Beacons. In EuroS&P.Google ScholarGoogle Scholar
  23. Juan Garay, Aggelos Kiayias, and Nikos Leonardos. 2015. The bitcoin backbone protocol: Analysis and applications. In Annual international conference on the theory and applications of cryptographic techniques. 281--310.Google ScholarGoogle ScholarCross RefCross Ref
  24. Yossi Gilad, Rotem Hemo, Silvio Micali, Georgios Vlachos, and Nickolai Zeldovich. 2017. Algorand: Scaling Byzantine Agreements for Cryptocurrencies. In SOSP.Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Lewis Gudgeon, Pedro Moreno-Sanchez, Stefanie Roos, Patrick McCorry, and Arthur Gervais. 2020. Sok: Layer-two blockchain protocols. In FC.Google ScholarGoogle Scholar
  26. Rachid Guerraoui, Petr Kuznetsov, Matteo Monti, Matej Pavlovič, and Dragos-Adrian Seredinschi. 2019. The consensus number of a cryptocurrency. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. 307--316.Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Saurabh Gupta. 2016. A non-consensus based decentralized financial transaction processing model with support for efficient auditing. Arizona State University.Google ScholarGoogle Scholar
  28. Abdelatif Hafid, Abdelhakim Senhaji Hafid, and Mustapha Samih. 2019. New Mathematical Model to Analyze Security of Sharding-Based Blockchain Protocols. IEEE Access 7 (2019), 185447--185457.Google ScholarGoogle ScholarCross RefCross Ref
  29. Jona Harris and Aviv Zohar. 2020. Flood & loot: A systemic attack on the lightning network. In ACM AFT.Google ScholarGoogle Scholar
  30. Aggelos Kiayias, Alexander Russell, Bernardo David, and Roman Oliynykov. 2017. Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol. In Crypto.Google ScholarGoogle Scholar
  31. Eleftherios Kokoris Kogias, Dahlia Malkhi, and Alexander Spiegelman. 2020. Asynchronous Distributed Key Generation for Computationally-Secure Randomness, Consensus, and Threshold Signatures.. In CCS.Google ScholarGoogle Scholar
  32. David Kozhaya, Jérémie Decouchant, and Paulo Esteves-Verissimo. 2018. RT-ByzCast: Byzantine-resilient real-time reliable broadcast. IEEE Trans. Comput. 68, 3 (2018), 440--454.Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. David Kozhaya, Jérémie Decouchant, Vincent Rahli, and Paulo Esteves-Verissimo. 2021. PISTIS: An Event-Triggered Real-Time Byzantine-Resilient Protocol Suite. IEEE Transactions on Parallel and Distributed Systems 32, 9 (2021), 2277--2290.Google ScholarGoogle ScholarCross RefCross Ref
  34. Satwik Prabhu Kumble, Dick Epema, and Stefanie Roos. 2021. How Lightning's Routing Diminishes its Anonymity. In ARES.Google ScholarGoogle Scholar
  35. Joshua Lind, Oded Naor, Ittay Eyal, Florian Kelbert, Emin Gün Sirer, and Peter R. Pietzuch. 2019. Teechain: a secure payment network with asynchronous blockchain access. In SOSP.Google ScholarGoogle Scholar
  36. Giulio Malavolta, Pedro Moreno-Sanchez, Aniket Kate, Matteo Maffei, and Srivatsan Ravi. 2017. Concurrency and Privacy with Payment-Channel Networks. In CCS.Google ScholarGoogle Scholar
  37. Giulio Malavolta, Pedro Moreno-Sanchez, Clara Schneidewind, Aniket Kate, and Matteo Maffei. 2019. Anonymous Multi-Hop Locks for Blockchain Scalability and Interoperability. In NDSS.Google ScholarGoogle Scholar
  38. Andrew Miller, Iddo Bentov, Surya Bakshi, Ranjit Kumaresan, and Patrick McCorry. 2019. Sprites and State Channels: Payment Networks that Go Faster Than Lightning. In FC.Google ScholarGoogle Scholar
  39. Ayelet Mizrahi and Aviv Zohar. 2020. Congestion attacks in payment channel networks. arXiv preprint arXiv:2002.06564 (2020).Google ScholarGoogle Scholar
  40. Pedro Moreno-Sanchez, Aniket Kate, and Matteo Maffei. 2018. Silentwhispers: Enforcing security and privacy in decentralized credit networks. In NDSS.Google ScholarGoogle Scholar
  41. Achour Mostéfaoui, Hamouma Moumen, and Michel Raynal. 2015. Signature-free asynchronous binary Byzantine consensus with t< n/3, O (n2) messages, and O (1) expected time. JACM 62, 4 (2015), 1--21.Google ScholarGoogle ScholarDigital LibraryDigital Library
  42. Oded Naor and Idit Keidar. 2022. On Payment Channels in Asynchronous Money Transfer Systems. CoRR abs/2202.06693 (2022).Google ScholarGoogle Scholar
  43. Raiden Network. 2022. Raiden network. Retrieved 31/01/2022 from https://raiden.network/Google ScholarGoogle Scholar
  44. Utz Nisslmueller, Klaus-Tycho Foerster, Stefan Schmid, and Christian Decker. 2020. Toward active and passive confidentiality attacks on cryptocurrency off-chain networks. arXiv preprint arXiv:2003.00003 (2020).Google ScholarGoogle Scholar
  45. Henning Pagnia and Felix C Gärtner. 1999. On the impossibility of fair exchange without a trusted third party. Technical Report. TU Darmstadt.Google ScholarGoogle Scholar
  46. Rafael Pass, Lior Seeman, and Abhi Shelat. 2017. Analysis of the Blockchain Protocol in Asynchronous Networks. In Eurocrypt.Google ScholarGoogle Scholar
  47. Jordan Pearson. 2015. WikiLeaks Is Now a Target In the Massive Spam Attack on Bitcoin. Available at: https://www.vice.com/en/article/ezvw7z/wikileaks-is-now-a-target-in-the-massive-spam-attack-on-bitcoin.Google ScholarGoogle Scholar
  48. Joseph Poon and Thaddeus Dryja. 2016. The bitcoin lightning network: Scalable off-chain instant payments.Google ScholarGoogle Scholar
  49. Michael K Reiter. 1994. Secure agreement protocols: Reliable and atomic group multicast in Rampart. In CCS.Google ScholarGoogle Scholar
  50. Wenhao Wang, Guoxing Chen, Xiaorui Pan, Yinqian Zhang, XiaoFeng Wang, Vincent Bindschaedler, Haixu Tang, and Carl A Gunter. 2017. Leaky cauldron on the dark land: Understanding memory side-channel hazards in SGX. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. 2421--2434.Google ScholarGoogle ScholarDigital LibraryDigital Library
  51. Maofan Yin, Dahlia Malkhi, Michael K Reiter, Guy Golan Gueta, and Ittai Abraham. 2019. HotStuff: BFT consensus with linearity and responsiveness. In PODC.Google ScholarGoogle ScholarDigital LibraryDigital Library
  52. Joseph Young. 2017. Analyst: Suspicious Bitcoin Mempool Activity, Transaction Fees Spike to 16. Available at: https://cointelegraph.com/news/analyst-suspicious-bitcoin-mempool-activity-transaction-fees-spike-to-16.Google ScholarGoogle Scholar
  53. Jiangshan Yu, David Kozhaya, Jérémie Decouchant, and Paulo Esteves-Verissimo. 2019. Repucoin: Your reputation is your power. IEEE Trans. Comput. 68, 8 (2019), 1225--1237.Google ScholarGoogle ScholarDigital LibraryDigital Library
  54. Alexei Zamyatin, Mustafa Al-Bassam, Dionysis Zindros, Eleftherios Kokoris-Kogias, Pedro Moreno-Sanchez, Aggelos Kiayias, and William J Knottenbelt. 2019. SoK: communication across distributed ledgers. Cryptology ePrint Archive (2019).Google ScholarGoogle Scholar

Index Terms

  1. SyncPCN/PSyncPCN: Payment Channel Networks without Blockchain Synchrony

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Other conferences
        AFT '22: Proceedings of the 4th ACM Conference on Advances in Financial Technologies
        September 2022
        330 pages
        ISBN:9781450398619
        DOI:10.1145/3558535

        Copyright © 2022 Owner/Author(s)

        This work is licensed under a Creative Commons Attribution International 4.0 License.

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 5 July 2023

        Check for updates

        Qualifiers

        • research-article
      • Article Metrics

        • Downloads (Last 12 months)158
        • Downloads (Last 6 weeks)17

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader