4.7 Article

A scalable private Bitcoin payment channel network with privacy guarantees

期刊

出版社

ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD
DOI: 10.1016/j.jnca.2021.103021

关键词

Blockchain; Bitcoin; Payment channel networks; Shortest path; Lightning network

资金

  1. National Science Foundation [NSF-CNS-1663051]

向作者/读者索取更多资源

This paper discusses the challenges of using Bitcoin in micropayments and proposes a solution by creating a private payment channel network to improve payment robustness and privacy. Using a heuristic approach and the k-shortest path algorithm, the paper provides a solution that comes close to an optimal outcome.
While Bitcoin heavily dominates the cryptocurrency markets, its use in micropayments is still a challenge due to long transaction confirmation times and high fees. Recently, the concept of off-chain transactions is introduced that led to the idea of establishing a payment channel network called Lightning Network (LN), which utilizes multi-hop payments. Off-chain links provide the ability to make instant payments without a need to writing to Blockchain. However, LN's design still favors fees, and it is creating hub nodes or relays that defeat the purpose of Blockchain. In addition, it is still not reliable, as not all transactions are guaranteed to be delivered to their destinations. These issues hinder its wide adoption by retailers. To address this issue, in this paper, we argue that the retailers could create a private payment channel network among them to serve their business needs, just like the concept of private Blockchains. The goal is to build a pure peer-to-peer topology that will prevent the formation of hub nodes while also eliminating the need for any relays to increase the robustness of the payments. Assuming off-chain links as edges and retailers as nodes, we formulate the problem as a multi-flow commodity problem where transactions represent the commodities from various sources to destinations. As the multi-flow commodity problem is NP-Complete, we propose a heuristic approach that utilizes Dijkstra's shortest path algorithm for payments in a dynamic way by updating the edge weights when new paths need to be found. The order of transactions is randomized to provide fairness among the retailers. We further extend this approach to guarantee the privacy of payments by forcing all the payments to travel at least three hops. We utilized k-shortest path algorithm to choose from k options that will meet our criterion. The evaluations indicate that the proposed heuristic comes close to an optimal solution while providing scalability and guaranteeing user privacy.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据