论文标题

Hushrelay:一种保护链付款的隐私,高效和可扩展的路由算法

HushRelay: A Privacy-Preserving, Efficient, and Scalable Routing Algorithm for Off-Chain Payments

论文作者

Mazumdar, Subhra, Ruj, Sushmita, Singh, Ram Govind, Pal, Arindam

论文摘要

支付通道网络(PCN)用于加密货币,以增强链交易的性能和可扩展性。除了打开和关闭付款渠道外,PCN接受的其他交易请求没有记录在区块链中。只有开放渠道的当事方才能知道给定瞬间留下的确切基金。在实际情况下,可能没有单个路径可以实现高价值支付的转移。对于这种情况,将多个路径上的交易值分开是一种更好的方法。尽管存在几种通过几条路径路由交易路线的方法,但此类技术效率很低,因为必须在路由算法的初始阶段做出拆分数量的决定(例如,Speedymurmur [42])。不考虑网络中每个通道的剩余容量的算法易于失败。其他方法泄漏敏感信息,并且在计算上很昂贵[28]。据我们所知,我们提出的计划Hushrelay是一个有效的隐私保护路由算法,同时考虑到每个渠道中留下的资金,同时将交易价值分配在几个路径上。将我们的算法的性能与现有的真实实例(例如波纹网络)的现有路由方案进行比较,我们观察到Hushrelay的成功率为1,执行时间为2.4秒。然而,Speedymurmur [42]的成功率为0.98,当地标数为6时,其成功率为4.74秒。测试我们在闪电网络上提议的路由算法时,可观察到0.99的成功率为0.99,执行时间为0.15秒,比Speedymurmur所采用的时间小12倍。

Payment channel networks (PCN) are used in cryptocurrencies to enhance the performance and scalability of off-chain transactions. Except for opening and closing of a payment channel, no other transaction requests accepted by a PCN are recorded in the Blockchain. Only the parties which have opened the channel will know the exact amount of fund left at a given instant. In real scenarios, there might not exist a single path which can enable transfer of high value payments. For such cases, splitting up the transaction value across multiple paths is a better approach. While there exists several approaches which route transactions via several paths, such techniques are quite inefficient, as the decision on the number of splits must be taken at the initial phase of the routing algorithm (e.g., SpeedyMurmur [42]). Algorithms which do not consider the residual capacity of each channel in the network are susceptible to failure. Other approaches leak sensitive information, and are quite computationally expensive [28]. To the best of our knowledge, our proposed scheme HushRelay is an efficient privacy preserving routing algorithm, taking into account the funds left in each channel, while splitting the transaction value across several paths. Comparing the performance of our algorithm with existing routing schemes on real instances (e.g., Ripple Network), we observed that HushRelay attains a success ratio of 1, with an execution time of 2.4 sec. However, SpeedyMurmur [42] attains a success ratio of 0.98 and takes 4.74 sec when the number of landmarks is 6. On testing our proposed routing algorithm on the Lightning Network, a success ratio of 0.99 is observed, having an execution time of 0.15 sec, which is 12 times smaller than the time taken by SpeedyMurmur.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源