Skip to main content

Advertisement

Springer Nature Link
Log in

Personalized Privacy-Preserving Routing Mechanism Design in Payment Channel Network

  • Regular Paper
  • Computer Networks and Distributed Computing
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Payment Channel Network (PCN) provides the off-chain settlement of transactions. It is one of the most promising solutions to solve the scalability issue of the blockchain. Many routing techniques in PCN have been proposed. However, both incentive attack and privacy protection have not been considered in existing studies. In this paper, we present an auction-based system model for PCN routing using the Laplace differential privacy mechanism. We formulate the cost optimization problem to minimize the path cost under the constraints of the Hashed Time-Lock Contract (HTLC) tolerance and the channel capacity. We propose an approximation algorithm to find the top \(\cal{K}\) shortest paths constrained by the HTLC tolerance and the channel capacity, i.e., top \(\cal{K}\)-restricted shortest paths. Besides, we design the probability comparison function to find the path with the largest probability of having the lowest path cost among the top \(\cal{K}\)-restricted shortest paths as the final path. Moreover, we apply the binary search to calculate the transaction fee of each user. Through both theoretical analysis and extensive simulations, we demonstrate that the proposed routing mechanism can guarantee the truthfulness and individual rationality with the probabilities of 1/2 and 1/4, respectively. It can also ensure the differential privacy of the users. The experiments on the real-world datasets demonstrate that the privacy leakage of the proposed mechanism is 73.21% lower than that of the unified privacy protection mechanism with only 13.2% more path cost compared with the algorithm without privacy protection on average.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Nakamoto S. Bitcoin: A peer-to-peer electronic cash system. Bitcoin, 2008.

    MATH  Google Scholar 

  2. Buterin V. A next-generation smart contract and decentralized application platform. Etherum, 2014.

    Google Scholar 

  3. Xu J, Wu Y, Luo X, Yang D. Improving the efficiency of blockchain applications with smart contract based cyber-insurance. In Proc. the 2020 IEEE International Conference on Communications (ICC), Jun. 2020. DOI: https://doi.org/10.1109/ICC40277.2020.9149301.

    MATH  Google Scholar 

  4. Decker C, Wattenhofer R. A fast and scalable payment network with bitcoin duplex micropayment channels. In Proc. the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems, Aug. 2015, pp.3–18. DOI: https://doi.org/10.1007/978-3-319-21741-3_1.

    MATH  Google Scholar 

  5. Zhang Y, Yang D, Xue G. CheaPay: An optimal algorithm for fee minimization in blockchain-based payment channel networks. In Proc. the 2019 IEEE International Conference on Communications (ICC), May. 2019. DOI: https://doi.org/10.1109/ICC.2019.8761804.

    MATH  Google Scholar 

  6. Di Stasi G, Avallone S, Canonico R, Ventre G. Routing payments on the lightning network. In Proc. the 2018 IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData), Jul. 30–Aug. 3, 2018, pp.1161–1170. DOI: https://doi.org/10.1109/Cybermatics_2018.2018.00209.

    Google Scholar 

  7. Yu R, Xue G, Kilari V T, Yang D, Tang J. CoinExpress: A fast payment routing mechanism in blockchain-based payment channel networks. In Proc. the 27th International Conference on Computer Communication and Networks (ICCCN), Jul. 30–Aug. 2, 2018. DOI: https://doi.org/10.1109/ICCCN.2018.8487351.

    MATH  Google Scholar 

  8. Wang Z, Li J, Hu J, Ren J, Li Z, Li Y. Towards privacy-preserving incentive for mobile crowdsensing under an untrusted platform. In Proc. the 2019 IEEE Conference on Computer Communications, Apr. 29–May 2, 2019, pp.2053–2061. DOI: https://doi.org/10.1109/INFOCOM.2019.8737594.

    MATH  Google Scholar 

  9. Xu J, Luo Z, Guan C, Yang D, Liu L, Zhang Y. Hiring a team from social network: Incentive mechanism design for two-tiered social mobile crowdsourcing. IEEE Trans. Mobile Computing, 2023, 22(8): 4664–4681. DOI: https://doi.org/10.1109/TMC.2022.3162108.

    Article  MATH  Google Scholar 

  10. Xu J, Rao Z, Xu L, Yang D, Li T. Incentive mechanism for multiple cooperative tasks with compatible users in mobile crowd sensing via online communities. IEEE Trans. Mobile Computing, 2020, 19(7): 1618–1633. DOI: https://doi.org/10.1109/TMC.2019.2911512.

    Article  MATH  Google Scholar 

  11. Lu W, Zhang S, Xu J, Yang D, Xu L. Truthful multi-resource transaction mechanism for P2P task offloading based on edge computing. IEEE Trans. Vehicular Technology, 2021, 70(6): 6122–6135. DOI: https://doi.org/10.1109/TVT.2021.3079258.

    Article  MATH  Google Scholar 

  12. Zhang D, Tan L, Ren J, Awad M, Zhang S, Zhang Y, Wan P. Near-optimal and truthful online auction for computation offloading in green edge-computing systems. IEEE Trans. Mobile Computing, 2020, 19(4): 880–893. DOI: https://doi.org/10.1109/TMC.2019.2901474.

    Article  MATH  Google Scholar 

  13. Cheng K, Wang L, Shen Y, Liu Y, Wang Y, Zheng L. A lightweight auction framework for spectrum allocation with strong security guarantees. In Proc. the 2020 IEEE Conference on Computer Communications, Jul. 2020, pp.1708–1717. DOI: https://doi.org/10.1109/INFOCOM41043.2020.91552-79.

    MATH  Google Scholar 

  14. Xue G, Xu J, Wu H, Lu W, Xu L. Incentive mechanism for rational miners in Bitcoin mining pool. Information Systems Frontiers, 2021, 23(2): 317–327. DOI: https://doi.org/10.1007/s10796-020-10019-2.

    Article  MATH  Google Scholar 

  15. Wang Y, Wang W, Dahlberg T A. Truthful routing for wireless hybrid networks. In Proc. the 2005 IEEE Global Telecommunications Conference, Nov. 28–Dec. 2, 2005, pp.3460–3465. DOI: https://doi.org/10.1109/GLOCOM.2005.1578416.

    MATH  Google Scholar 

  16. McSherry F, Talwar K. Mechanism design via differential privacy. In Proc. the 48th Annual IEEE Symposium on Foundations of Computer Science, Oct. 2007, pp.94–103. DOI: https://doi.org/10.1109/FOCS.2007.66.

    MATH  Google Scholar 

  17. Dwork C. Differential privacy: A survey of results. In Proc. the 5th International Conference on Theory and Applications of Models of Computation, Apr. 2008. DOI: https://doi.org/10.1007/978-3-540-79228-4_1.

    MATH  Google Scholar 

  18. Wallace K A. Anonymity. Ethics and Information Technology, 1999, 1(1): 21–31. DOI: https://doi.org/10.1023/A:1010066509278.

    Article  MathSciNet  MATH  Google Scholar 

  19. Alenezi M N, Alabdulrazzaq H K, Mohammad N Q. Symmetric encryption algorithms: Review and evaluation study. International Journal of Communication Networks and Information Security, 2022, 12(2): 256–272. DOI: https://doi.org/10.17762/ijcnis.v12i2.4698.

    MATH  Google Scholar 

  20. Wang Z, Hu J, Lv R, Wei J, Wang Q, Yang D, Qi H. Personalized privacy-preserving task allocation for mobile crowdsensing. IEEE Trans. Mobile Computing, 2019, 18(6): 1330–1341. DOI: https://doi.org/10.1109/TMC.2018.2861393.

    Article  MATH  Google Scholar 

  21. Zhang X, Shi S, Qian C. Scalable decentralized routing for blockchain payment networks. In Proc. the 3rd International Symposium on Foundations and Applications of Blockchain, May 2020.

    MATH  Google Scholar 

  22. Khalil R, Gervais A. Revive: Rebalancing off-blockchain payment networks. In Proc. the 2017 ACM SIGSAC Conference on Computer and Communications Security, Oct. 2017, pp.439–453. DOI: https://doi.org/10.1145/3133956.3134033.

    Chapter  MATH  Google Scholar 

  23. Zhang Y, Yang D. RobustPay: Robust payment routing protocol in blockchain-based payment channel networks. In Proc. the 27th International Conference on Network Protocols (ICNP), Oct. 2019. DOI: https://doi.org/10.1109/ICNP.2019.8888094.

    Google Scholar 

  24. Tripathy S, Mohanty S K. MAPPCN: Multi-hop anonymous and privacy-preserving payment channel network. In Proc. the 2020 International Conference on Financial Cryptography and Data Security, Feb. 2020, pp.481–495. DOI: https://doi.org/10.1007/978-3-030-54455-3_34.

    MATH  Google Scholar 

  25. Mazumdar S, Ruj S. CryptoMaze: Privacy-preserving splitting of off-chain payments. IEEE Trans. Dependable and Secure Computing, 2023, 20(2): 1060–1073. DOI: https://doi.org/10.1109/TDSC.2022.3148476.

    Article  MATH  Google Scholar 

  26. Yu B, Kermanshahi S K, Sakzad A, Nepal S. Chameleon hash time-lock contract for privacy preserving payment channel networks. In Proc. the 13th International Conference on Provable Security, Oct. 2019, pp.303–318. DOI: https://doi.org/10.1007/978-3-030-31919-9_18.

    Chapter  MATH  Google Scholar 

  27. Herrera-Joancomarti J, Navarro-Arribas G, Ranchal-Pedrosa A, Perez-Sola C, Garcia-Alfaro J. On the difficulty of hiding the balance of lightning network channels. In Proc. the 2019 ACM Asia Conference on Computer and Communications Security, Jul. 2019, pp.602–612. DOI: https://doi.org/10.1145/3321705.3329812.

    Chapter  Google Scholar 

  28. Tang W, Wang W, Fanti G, Oh S. Privacy-utility tradeoffs in routing cryptocurrency over payment channel networks. In Proc. the 2020 ACM on Measurement and Analysis of Computing Systems, Jun. 2020, Article No. 29. DOI: https://doi.org/10.1145/3392147.

    MATH  Google Scholar 

  29. Roos S, Moreno-Sanchez P, Kate A, Goldberg I. Settling payments fast and private: Efficient decentralized routing for path-based transactions. In Proc. the 25th Annual Network and Distributed System Security Symposium, Feb. 2018, pp.455–471. DOI: https://doi.org/10.48550/arXiv.1709.05748.

    MATH  Google Scholar 

  30. Li P, Luo X F, Miyazaki T, Guo S. Privacy-preserving payment channel networks using trusted execution environment. In Proc. the 2020 IEEE International Conference on Communications (ICC), Jun. 2020. DOI: https://doi.org/10.1109/ICC40277.2020.9149447.

    MATH  Google Scholar 

  31. Niu B, Chen Y, Wang B, Cao J, Li F. Utility-aware exponential mechanism for personalized differential privacy. In Proc. the 2020 IEEE Wireless Communications and Networking Conference (WCNC), May 2020. DOI: https://doi.org/10.1109/WCNC45663.2020.9120532.

    Google Scholar 

  32. Jorgensen Z, Yu T, Cormode G. Conservative or liberal? Personalized differential privacy. In Proc. the 31st International Conference on Data Engineering, Apr. 2015, pp.1023–1034. DOI: https://doi.org/10.1109/ICDE.2015.7113353.

    MATH  Google Scholar 

  33. Duchi J C, Jordan M I, Wainwright M J. Local privacy and statistical minimax rates. In Proc. the 54th Annual Symposium on Foundations of Computer Science, Oct. 2013, pp.429–438. DOI: https://doi.org/10.1109/FOCS.2013.53.

    MATH  Google Scholar 

  34. Jin X, Zhang Y. Privacy-preserving crowdsourced spectrum sensing. IEEE/ACM Trans. Networking, 2018, 26(3): 1236–1249. DOI: https://doi.org/10.1109/TNET.2018.2823272.

    Article  MATH  Google Scholar 

  35. Lin J, Yang D, Li M, Xu J, Xue G. Frameworks for privacy-preserving mobile crowdsensing incentive mechanisms. IEEE Trans. Mobile Computing, 2018, 17(8): 1851–1864. DOI: https://doi.org/10.1109/TMC.2017.2780091.

    Article  MATH  Google Scholar 

  36. Lv D, Zhu S. Achieving correlated differential privacy of big data publication. Computers & Security, 2019, 82: 184–195. DOI: https://doi.org/10.1016/j.cose.2018.12.017.

    Article  MATH  Google Scholar 

  37. Wang T, Mei Y, Jia W, Zheng X, Wang G, Xie M. Edge-based differential privacy computing for sensor-cloud systems. Journal of Parallel and Distributed Computing, 2020, 136: 75–85. DOI: https://doi.org/10.1016/j.jpdc.2019.10.009.

    Article  MATH  Google Scholar 

  38. Wei K, Li J, Ding M, Ma C, Yang H H, Farokhi F, Jin S, Quek T Q S, Poor H V. Federated learning with differential privacy: Algorithms and performance analysis. IEEE Trans. Information Forensics and Security, 2020, 15: 3454–3469. DOI: https://doi.org/10.1109/TIFS.2020.2988575.

    Article  MATH  Google Scholar 

  39. Bao T, Xu L, Zhu L, Wang L, Li T. Successive point-of-interest recommendation with personalized local differential privacy. IEEE Trans. Vehicular Technology, 2021, 70(10): 10477–10488. DOI: https://doi.org/10.1109/TVT.2021.3108463.

    Article  MATH  Google Scholar 

  40. Dwork C, Roth A. The algorithmic foundations of differential privacy. Foundations and Trends® in Theoretical Computer Science, 2014, 9(3/4): 211–407. DOI: https://doi.org/10.1561/0400000042.

    MathSciNet  MATH  Google Scholar 

  41. McSherry F D. Privacy integrated queries: An extensible platform for privacy-preserving data analysis. In Proc. the 2009 ACM SIGMOD International Conference on Management of Data, Jun. 2009, pp.19–30. DOI: https://doi.org/10.1145/1559845.1559850.

    Chapter  MATH  Google Scholar 

  42. Hassin R. Approximation schemes for the restricted shortest path problem. Mathematics of Operations Research, 1992, 17(1): 36–42. DOI: https://doi.org/10.1287/moor.17.1.36.

    Article  MathSciNet  MATH  Google Scholar 

  43. Yen J Y. Finding the K shortest loopless paths in a network. Management Science, 1971, 17(11): 712–716. DOI: https://doi.org/10.1287/mnsc.17.11.712.

    Article  MathSciNet  MATH  Google Scholar 

  44. Xue G, Zhang W, Tang J, Thulasiraman K. Polynomial time approximation algorithms for multi-constrained QoS routing. IEEE/ACM Trans. Networking, 2008, 16(3): 656–669. DOI: https://doi.org/10.1109/TNET.2007.900712.

    Article  MATH  Google Scholar 

  45. Singla A, Krause A. Truthful incentives in crowdsourcing tasks using regret minimization mechanisms. In Proc. the 22nd International Conference on World Wide Web, May 2013, pp.1167–1178. DOI: https://doi.org/10.1145/2488388.2488490.

    Chapter  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Jiangsu Key Laboratory of Big Data Security and Intelligent Processing, Nanjing University of Posts and Telecommunications, Nanjing, 210023, China

    Peng-Cheng Zhao  (赵鹏程), Li-Jie Xu  (徐力杰) & Jia Xu  (徐 佳)

Authors
  1. Peng-Cheng Zhao  (赵鹏程)
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Li-Jie Xu  (徐力杰)
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jia Xu  (徐 佳)
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jia Xu  (徐 佳).

Ethics declarations

Conflict of Interest The authors declare that they have no conflict of interest.

Additional information

This work was partially supported by the National Natural Science Foundation of China under Grant Nos. 61872193, 61872191, and 62072254, and the Postgraduate Research and Practice Innovation Program of Jiangsu Province of China under Grant No. KYCX20_0762.

Peng-Cheng Zhao received his M.S. degree from Nanjing Forestry University, Nanjing, in 2019, and his B.S. degree from Chengxian College, Nanjing, in 2015. He is pursuing his Ph.D. degree at Nanjing University of Posts and Telecommunications, Nanjing. His research interests are mainly in the areas of the mobile crowdsensing, edge computing, and blockchain.

Li-Jie Xu received his Ph.D. degree from Nanjing University, Nanjing, in 2014. He is currently an associate professor in the School of Computer Science at Nanjing University of Posts and Telecommunications, Nanjing. His research interests are mainly in the areas of wireless sensor networks, ad-hoc networks, mobile and distributed computing, and graph theory algorithms.

Jia Xu received his M.S. degree from Yangzhou University, Yangzhou, in 2006, and his Ph.D. degree from Nanjing University of Science and Technology, Nanjing, in 2010. He is currently a professor in the School of Computer Science at Nanjing University of Posts and Telecommunications, Nanjing. His main research interests include crowdsourcing, edge computing, and blockchain.

Electronic Supplementary Material

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhao, PC., Xu, LJ. & Xu, J. Personalized Privacy-Preserving Routing Mechanism Design in Payment Channel Network. J. Comput. Sci. Technol. 39, 1380–1400 (2024). https://doi.org/10.1007/s11390-024-2635-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-024-2635-5

Keywords