On the Difficulty of Hiding the Balance of Lightning Network Channels

被引:52
作者
Herrera-Joancomarti, Jordi [1 ]
Navarro-Arribas, Guillermo [1 ]
Ranchal-Pedrosa, Alejandro [2 ]
Perez-Sola, Cristina [1 ]
Garcia-Alfaro, Joaquin [2 ]
机构
[1] Univ Autonoma Barcelona, Cybercat, Barcelona, Spain
[2] Inst Polytech Paris, CNRS, SAMOVAR, Telecom SudParis, Paris, France
来源
PROCEEDINGS OF THE 2019 ACM ASIA CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (ASIACCS '19) | 2019年
基金
欧盟地平线“2020”;
关键词
D O I
10.1145/3321705.3329812
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The Lightning Network is a second layer technology running on top of Bitcoin and other Blockchains. It is composed of a peer-to-peer network, used to transfer raw information data. Some of the links in the peer-to-peer network are identified as payment channels, used to conduct payments between two Lightning Network clients (i.e., the two nodes of the channel). Payment channels are created with a fixed credit amount, the channel capacity. The channel capacity, together with the IP address of the nodes, is published to allow a routing algorithm to find an existing path between two nodes that do not have a direct payment channel. However, to preserve users' privacy, the precise balance of the pair of nodes of a given channel (i.e. the bandwidth of the channel in each direction), is kept secret. Since balances are not announced, second-layer nodes probe routes iteratively, until they find a successful route to the destination for the amount required, if any. This feature makes the routing discovery protocol less efficient but preserves the privacy of channel balances. In this paper, we present an attack to disclose the balance of a channel in the Lightning Network. Our attack is based on performing multiple payments ensuring that none of them is finalized, minimizing the economical cost of the attack. We present experimental results that validate our claims, and countermeasures to handle the attack.
引用
收藏
页码:602 / 612
页数:11
相关论文
共 36 条
[1]  
Androulaki Elli, 2014, Trust and Trustworthy Computing. 7th International Conference, TRUST 2014. Proceedings: LNCS 8564, P161, DOI 10.1007/978-3-319-08593-7_11
[2]  
Androulaki E., 2013, LNCS, V7859, P34, DOI [DOI 10.1007/978-3-642-39884-1, 10.1007/978-3-642-39884-14, DOI 10.1007/978-3-642-39884-14]
[3]  
[Anonymous], 2013, P 2013 ECRIME RES SU, DOI DOI 10.1109/ECRS.2013.6805780
[4]  
[Anonymous], 2014, Data privacy management, autonomous spontaneous security, and security assurance
[5]   Differentially Private Smart Metering with Battery Recharging [J].
Backes, Michael ;
Meiser, Sebastian .
DATA PRIVACY MANAGEMENT AND AUTONOMOUS SPONTANEOUS SECURITY, DPM 2013, 2014, 8247 :194-212
[6]   Provably Secure and Practical Onion Routing [J].
Backes, Michael ;
Goldberg, Ian ;
Kate, Aniket ;
Mohammadi, Esfandiar .
2012 IEEE 25TH COMPUTER SECURITY FOUNDATIONS SYMPOSIUM (CSF), 2012, :369-385
[7]  
Bar-Yehuda R., 1985, Analysis and Design of Algorithms for Combinatorial Problems, Udine, 1982,, V109, P27
[8]  
Ben Jaballah W, 2018, CONSUM COMM NETWORK
[9]   Zerocash: Decentralized Anonymous Payments from Bitcoin [J].
Ben-Sasson, Eli ;
Chiesa, Alessandro ;
Garmant, Christina ;
Green, Matthew ;
Miers, Ian ;
Tromer, Eran ;
Virza, Madars .
2014 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP 2014), 2014, :459-474
[10]  
Bissias G., 2014, Proceedings of the 13th Workshop on Privacy in the Electronic Society, WPES 2014, Scottsdale, AZ, USA, November 3, 2014, P149, DOI DOI 10.1145/2665943.2665955