CommTLC:减少闪电网络中htlc攻击面的一种替代方案

IET Blockchain Pub Date : 2025-03-01 DOI:10.1049/blc2.70005
Prerna Arote, Joy Kuri
{"title":"CommTLC:减少闪电网络中htlc攻击面的一种替代方案","authors":"Prerna Arote,&nbsp;Joy Kuri","doi":"10.1049/blc2.70005","DOIUrl":null,"url":null,"abstract":"<p>The Payment Channel Network is widely recognized as one of the most effective solutions for handling off-chain transactions and addressing blockchain scalability challenges. In the Lightning Network, a popular off-chain mechanism, multi-hop payments are facilitated through Hashed Time-Locked Contracts (HTLCs). However, despite its broad adoption, HTLCs are susceptible to various attacks, such as Fakey, Griefing, and Wormhole attacks. In these attacks, adversaries aim to disrupt transaction throughput by exhausting channel capacity or stealing routing fees from honest nodes along the payment path. We propose a scheme called CommTLC, which leverages Pedersen commitments and signatures to detect and punish/prevent adversaries in Fakey, Griefing and Wormhole attacks. We implement the proposed scheme and analyse its security within the universal composability (UC) framework. Additionally, we compare the performance of CommTLC with the latest schemes, MAPPCN-OR and EAMHL+. The results demonstrate that CommTLC outperforms both MAPPCN-OR and EAMHL+ in communication overhead, with only a slight increase in computational overhead compared to MAPPCN-OR. Furthermore, the adversary detection time for Fakey, Griefing and Wormhole attacks using CommTLC is reduced to just a few milliseconds—specifically, less than 112 ms for a payment path involving five users.</p>","PeriodicalId":100650,"journal":{"name":"IET Blockchain","volume":"5 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/blc2.70005","citationCount":"0","resultStr":"{\"title\":\"CommTLC: An Alternative to Reduce the Attack Surface of HTLCs in Lightning Networks\",\"authors\":\"Prerna Arote,&nbsp;Joy Kuri\",\"doi\":\"10.1049/blc2.70005\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>The Payment Channel Network is widely recognized as one of the most effective solutions for handling off-chain transactions and addressing blockchain scalability challenges. In the Lightning Network, a popular off-chain mechanism, multi-hop payments are facilitated through Hashed Time-Locked Contracts (HTLCs). However, despite its broad adoption, HTLCs are susceptible to various attacks, such as Fakey, Griefing, and Wormhole attacks. In these attacks, adversaries aim to disrupt transaction throughput by exhausting channel capacity or stealing routing fees from honest nodes along the payment path. We propose a scheme called CommTLC, which leverages Pedersen commitments and signatures to detect and punish/prevent adversaries in Fakey, Griefing and Wormhole attacks. We implement the proposed scheme and analyse its security within the universal composability (UC) framework. Additionally, we compare the performance of CommTLC with the latest schemes, MAPPCN-OR and EAMHL+. The results demonstrate that CommTLC outperforms both MAPPCN-OR and EAMHL+ in communication overhead, with only a slight increase in computational overhead compared to MAPPCN-OR. Furthermore, the adversary detection time for Fakey, Griefing and Wormhole attacks using CommTLC is reduced to just a few milliseconds—specifically, less than 112 ms for a payment path involving five users.</p>\",\"PeriodicalId\":100650,\"journal\":{\"name\":\"IET Blockchain\",\"volume\":\"5 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2025-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1049/blc2.70005\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IET Blockchain\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1049/blc2.70005\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET Blockchain","FirstCategoryId":"1085","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1049/blc2.70005","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

支付通道网络被广泛认为是处理链下交易和解决区块链可扩展性挑战的最有效解决方案之一。在流行的链下机制闪电网络中,多跳支付是通过哈希时间锁定合同(htlc)实现的。然而,尽管它被广泛采用,htlc很容易受到各种攻击,如Fakey, Griefing和Wormhole攻击。在这些攻击中,攻击者的目标是通过耗尽通道容量或窃取支付路径上诚实节点的路由费用来破坏交易吞吐量。我们提出了一种称为CommTLC的方案,它利用Pedersen承诺和签名来检测和惩罚/防止Fakey, Griefing和虫洞攻击中的对手。我们实现了该方案,并在通用可组合性(UC)框架下分析了其安全性。此外,我们还比较了CommTLC与最新方案MAPPCN-OR和EAMHL+的性能。结果表明,CommTLC在通信开销方面优于MAPPCN-OR和EAMHL+,与MAPPCN-OR相比,计算开销仅略有增加。此外,对手对Fakey, Griefing和Wormhole攻击的检测时间使用CommTLC减少到几毫秒-具体来说,对于涉及五个用户的支付路径,不到112毫秒。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

CommTLC: An Alternative to Reduce the Attack Surface of HTLCs in Lightning Networks

CommTLC: An Alternative to Reduce the Attack Surface of HTLCs in Lightning Networks

The Payment Channel Network is widely recognized as one of the most effective solutions for handling off-chain transactions and addressing blockchain scalability challenges. In the Lightning Network, a popular off-chain mechanism, multi-hop payments are facilitated through Hashed Time-Locked Contracts (HTLCs). However, despite its broad adoption, HTLCs are susceptible to various attacks, such as Fakey, Griefing, and Wormhole attacks. In these attacks, adversaries aim to disrupt transaction throughput by exhausting channel capacity or stealing routing fees from honest nodes along the payment path. We propose a scheme called CommTLC, which leverages Pedersen commitments and signatures to detect and punish/prevent adversaries in Fakey, Griefing and Wormhole attacks. We implement the proposed scheme and analyse its security within the universal composability (UC) framework. Additionally, we compare the performance of CommTLC with the latest schemes, MAPPCN-OR and EAMHL+. The results demonstrate that CommTLC outperforms both MAPPCN-OR and EAMHL+ in communication overhead, with only a slight increase in computational overhead compared to MAPPCN-OR. Furthermore, the adversary detection time for Fakey, Griefing and Wormhole attacks using CommTLC is reduced to just a few milliseconds—specifically, less than 112 ms for a payment path involving five users.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.80
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信