Payment channel networks are a promising approach to improve the scalability of cryptocurrencies: they allow to perform transactions in a peer-to-peer fashion, along multi-hop routes in the network, without requiring consensus on the blockchain. However, during the discovery of cost-efficient routes for the transaction, critical information may be revealed about the transacting entities. This paper initiates the study of privacy-preserving route discovery mechanisms for payment channel networks. In particular, we present LightPIR, an approach which allows a source to efficiently discover a shortest path to its destination without revealing any information about the endpoints of the transaction. The two main observations which allow for an efficient solution in LightPIR are that: (1) surprisingly, hub labelling algorithms - which were developed to preprocess "street network like" graphs so one can later efficiently compute shortest paths - also work well for the graphs underlying payment channel networks, and that (2) hub labelling algorithms can be directly combined with private information retrieval. LightPIR relies on a simple hub labeling heuristic on top of existing hub labeling algorithms which leverages the specific topological features of cryptocurrency networks to further minimize storage and bandwidth overheads. In a case study considering the Lightning network, we show that our approach is an order of magnitude more efficient compared to a privacy-preserving baseline based on using private information retrieval on a database that stores all pairs shortest paths.
翻译:支付渠道网络是改善加密路径的可扩展性的一个很有希望的方法:它们允许在网络多点线路上,在网络多点线路上,以同行对同行的方式进行交易,而不需要在链条上达成共识。然而,在发现具有成本效益的交易路径过程中,可能会披露关于交易实体的关键信息。本文件启动了对支付渠道网络的隐私保护路径发现机制的研究。特别是,我们介绍了LightPIR,这一方法使来源能够高效率地发现通往其目的地的最短路径,而不会透露交易终点的任何信息。允许在 LightPIR 中高效解决方案的两大主要观察意见是:(1) 出乎意料的是,中心标签算法――这些算法是预处理“街头网络如”图的,因此可以随后高效地折算最短路径。(2) 中心标签算法可以直接与私人信息检索相结合。 LightPIR 依赖于一个简单的中心分类算法的顶部,该算出任何有关交易终点点的任何信息端点标签法的顶端,从而在 LightPIR 中能够利用最短的存储服务器数据库的顶部功能,我们通过一个最短的顶级数据库进行最起码的存储式的存储式的存储。