A scalable private Bitcoin payment channel network with privacy guarantees
A scalable private Bitcoin payment channel network with privacy guarantees
复制标题
具有隐私保证的可扩展私人比特币支付通道网络
DOI：
10.1016/j.jnca.2021.103021
复制
发表时间：
2021
影响因子：
8.7
通讯作者：
Uluagac, Selcuk
中科院分区：
文献类型：
--
作者：
Erdin, Enes;Cebe, Mumin;Akkaya, Kemal;Bulut, Eyuphan;Uluagac, Selcuk
尽管比特币在加密货币市场中占据主导地位，但由于交易确认时间长且费用高，其在小额支付中的使用仍然是一个挑战。最近，链下交易的概念被引入，引发了建立名为闪电网络（LN）的支付通道网络的想法，该网络利用多跳支付。链下链接提供了即时支付的能力，无需写入区块链。然而，LN 的设计仍然偏向于收费，并且它正在创建违背区块链目的的中心节点或中继。此外，它仍然不可靠，因为并非所有交易都能保证传送到目的地。这些问题阻碍了零售商的广泛采用。为了解决这个问题，在本文中，我们认为零售商可以在他们之间创建一个私人支付渠道网络来满足他们的业务需求，就像私人区块链的概念一样。目标是建立一个纯粹的点对点拓扑，防止形成中心节点，同时消除任何中继的需要，以提高支付的稳健性。假设链下链接为边，零售商为节点，我们将问题表述为多流商品问题，其中交易代表从不同来源到目的地的商品。由于多流商品问题是 NP 完全问题，我们提出了一种启发式方法，通过在需要找到新路径时更新边权重，利用 Dijkstra 的最短路径算法以动态方式进行支付。交易顺序是随机的，以提供零售商之间的公平性。我们进一步扩展了这种方法，通过强制所有支付至少经过三跳来保证支付的隐私。我们利用k-最短路径算法从k个满足我们标准的选项中进行选择。评估表明，所提出的启发式方法接近最佳解决方案，同时提供可扩展性并保证用户隐私。
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 utilizedk-shortest path algorithm to choose fromkoptions 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.
路径路由 – 第 2 部分：启发法
影响因子：
2.9
作者：
E. Bouillet;G. Ellinas;Jean;R. Ramamurthy
通讯作者：
R. Ramamurthy
DOI：
10.1145/3321705.3329812
发表时间：
2019
期刊：
Proceedings of the 2019 ACM Asia Conference on Computer and Communications Security
影响因子：
--
作者：
J. Herrera;G. Navarro;Alejandro Ranchal;Cristina Pérez;Joaquín García
通讯作者：
Joaquín García