Optimized Denial-of-Service Threats on the Scalability of LT Coded Blockchains

Harikrishnan K., J. Harshan, Anwitaman Datta
{"title":"Optimized Denial-of-Service Threats on the Scalability of LT Coded Blockchains","authors":"Harikrishnan K., J. Harshan, Anwitaman Datta","doi":"arxiv-2402.05620","DOIUrl":null,"url":null,"abstract":"Coded blockchains have acquired prominence in the recent past as a promising\napproach to slash the storage costs as well as to facilitate scalability.\nWithin this class, Luby Transform (LT) coded blockchains are an appealing\nchoice for scalability in heterogeneous networks owing to the availability of a\nwide range of low-complexity LT decoders. While these architectures have been\nstudied from the aspects of storage savings and scalability, not much is known\nin terms of their security vulnerabilities. Pointing at this research gap, in\nthis work, we present novel denial-of-service (DoS) threats on LT coded\nblockchains that target nodes with specific decoding capabilities, thereby\npreventing them from joining the network. Our proposed threats are\nnon-oblivious in nature, wherein adversaries gain access to the archived\nblocks, and choose to execute their threat on a subset of them based on\nunderlying coding scheme. We show that our optimized threats can achieve the\nsame level of damage as that of blind attacks, however, with limited amount of\nresources. This is the first work of its kind that opens up new questions on\ndesigning coded blockchains to jointly provide storage savings, scalability and\nresilience to optimized threats.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"11 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2402.05620","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Coded blockchains have acquired prominence in the recent past as a promising approach to slash the storage costs as well as to facilitate scalability. Within this class, Luby Transform (LT) coded blockchains are an appealing choice for scalability in heterogeneous networks owing to the availability of a wide range of low-complexity LT decoders. While these architectures have been studied from the aspects of storage savings and scalability, not much is known in terms of their security vulnerabilities. Pointing at this research gap, in this work, we present novel denial-of-service (DoS) threats on LT coded blockchains that target nodes with specific decoding capabilities, thereby preventing them from joining the network. Our proposed threats are non-oblivious in nature, wherein adversaries gain access to the archived blocks, and choose to execute their threat on a subset of them based on underlying coding scheme. We show that our optimized threats can achieve the same level of damage as that of blind attacks, however, with limited amount of resources. This is the first work of its kind that opens up new questions on designing coded blockchains to jointly provide storage savings, scalability and resilience to optimized threats.
LT 编码区块链可扩展性上的优化拒绝服务威胁
在这一类别中,卢比变换(Luby Transform,LT)编码区块链是在异构网络中实现可扩展性的一个有吸引力的选择,因为有大量低复杂度的 LT 解码器可用。虽然人们已经从节省存储和可扩展性方面对这些架构进行了研究,但对其安全漏洞却知之甚少。针对这一研究空白,我们在这项工作中提出了针对 LT 编码区块链的新型拒绝服务(DoS)威胁,这些威胁以具有特定解码能力的节点为目标,从而阻止它们加入网络。我们提出的威胁本质上是无私的,即对手获得存档块的访问权限,并根据基础编码方案选择对其中的一个子集实施威胁。我们的研究表明,经过优化的威胁可以在资源有限的情况下实现与盲目攻击相同的破坏程度。这是首个同类研究成果,它为设计编码区块链以共同提供存储节省、可扩展性和对优化威胁的复原力提出了新的问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信