Is Stubborn Mining Severe in Imperfect GHOST Bitcoin-Like Blockchains? Quantitative Analysis

IF 5.8 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Services Computing Pub Date : 2024-07-15 DOI:10.1109/TSC.2024.3428329
Haoran Zhu;Xiaolin Chang;Jelena Mišić;Vojislav B. Mišić;Lei Han;Zhi Chen
{"title":"Is Stubborn Mining Severe in Imperfect GHOST Bitcoin-Like Blockchains? Quantitative Analysis","authors":"Haoran Zhu;Xiaolin Chang;Jelena Mišić;Vojislav B. Mišić;Lei Han;Zhi Chen","doi":"10.1109/TSC.2024.3428329","DOIUrl":null,"url":null,"abstract":"GHOST, like the longest-chain protocol, is a chain selection protocol and its capability in resisting selfish mining attack has been validated in imperfect (delay-existing-) blockchains of Bitcoin and its variants (Bitcoin-like). This paper explores an analytical-model-based approach to investigate the impact of stubborn mining attack in imperfect GHOST Bitcoin-like blockchains. We first quantify chain dynamics based on Markov chain process and then derive the formulas of miner revenue and system throughput. We also propose a new metric, “Hazard Index”, which can be used to evaluate attack threat severity and also assist the adversary in determining whether it is profitable to conduct an attack. The experiment results show that 1) An adversary with more than 30% computing power can get huge profit and extremely downgrade system throughput by launching stubborn mining attack. 2) An adversary should not launch stubborn mining attack if it has less than 25% computing power. 3) Stubborn mining attack causes more damage than selfish mining attack under GHOST. Our work provides insight into stubborn mining attack and is helpful in designing countermeasures.","PeriodicalId":13255,"journal":{"name":"IEEE Transactions on Services Computing","volume":"17 5","pages":"2488-2501"},"PeriodicalIF":5.8000,"publicationDate":"2024-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Services Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10598387/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

GHOST, like the longest-chain protocol, is a chain selection protocol and its capability in resisting selfish mining attack has been validated in imperfect (delay-existing-) blockchains of Bitcoin and its variants (Bitcoin-like). This paper explores an analytical-model-based approach to investigate the impact of stubborn mining attack in imperfect GHOST Bitcoin-like blockchains. We first quantify chain dynamics based on Markov chain process and then derive the formulas of miner revenue and system throughput. We also propose a new metric, “Hazard Index”, which can be used to evaluate attack threat severity and also assist the adversary in determining whether it is profitable to conduct an attack. The experiment results show that 1) An adversary with more than 30% computing power can get huge profit and extremely downgrade system throughput by launching stubborn mining attack. 2) An adversary should not launch stubborn mining attack if it has less than 25% computing power. 3) Stubborn mining attack causes more damage than selfish mining attack under GHOST. Our work provides insight into stubborn mining attack and is helpful in designing countermeasures.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
在不完善的 GHOST 比特币类区块链中,顽固挖矿现象是否严重?定量分析
GHOST与最长链协议一样,是一种链选择协议,其抵御自私挖矿攻击的能力已在比特币及其变种(类比特币)的不完善(延迟存在)区块链中得到验证。本文探讨了一种基于分析模型的方法,以研究顽固挖矿攻击在不完善的 GHOST Bitcoin-like 区块链中的影响。我们首先基于马尔科夫链过程量化链的动态,然后推导出矿工收入和系统吞吐量的公式。我们还提出了一个新指标--"危害指数",可用于评估攻击威胁的严重程度,并帮助对手判断进行攻击是否有利可图。实验结果表明:1)拥有 30% 以上计算能力的对手可以通过发起顽固的挖矿攻击获得巨额利润,并极大地降低系统吞吐量。2)算力低于 25% 的对手不应发起顽固挖矿攻击。3) 在 GHOST 下,顽固挖矿攻击比自私挖矿攻击造成的破坏更大。我们的工作提供了对顽固挖矿攻击的洞察力,有助于设计应对措施。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Services Computing
IEEE Transactions on Services Computing COMPUTER SCIENCE, INFORMATION SYSTEMS-COMPUTER SCIENCE, SOFTWARE ENGINEERING
CiteScore
11.50
自引率
6.20%
发文量
278
审稿时长
>12 weeks
期刊介绍: IEEE Transactions on Services Computing encompasses the computing and software aspects of the science and technology of services innovation research and development. It places emphasis on algorithmic, mathematical, statistical, and computational methods central to services computing. Topics covered include Service Oriented Architecture, Web Services, Business Process Integration, Solution Performance Management, and Services Operations and Management. The transactions address mathematical foundations, security, privacy, agreement, contract, discovery, negotiation, collaboration, and quality of service for web services. It also covers areas like composite web service creation, business and scientific applications, standards, utility models, business process modeling, integration, collaboration, and more in the realm of Services Computing.
期刊最新文献
Radiant: Efficient Timely Large-Scale Scene Analytics Based on Hierarchical Framework Adapting Large Language Models for Encrypted Traffic Analysis Services: An Efficient Realization with Mixture of LoRA Experts EAStream: An Environment-Aware Adaptive Bitrate Algorithm for Reliable Video Streaming Services Service Pattern Fusion: Towards Self-Evolving of Service Ecosystems Client-Cooperative Split Learning
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1