SIM:通过将 "自私战略 "融入 "无辜采矿 "实现高利润

IF 4.7 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Jiaze Shang;Tianbo Lu;Pengfei Zhao
{"title":"SIM:通过将 \"自私战略 \"融入 \"无辜采矿 \"实现高利润","authors":"Jiaze Shang;Tianbo Lu;Pengfei Zhao","doi":"10.1109/TNSM.2024.3435869","DOIUrl":null,"url":null,"abstract":"Selfish mining, one of the most renowned attack in Bitcoin, involves a selfish miner withholding discovered blocks and broadcasting them at an opportune moment to gain higher rewards than honest mining. However, selfish mining and its variants rely on two assumptions: the attacker solely engages in infiltration mining within the victim pool (attack assumption) and the system operates in a perfect network environment (network assumption). In this paper, we propose a novel attack called Selfish in Innocent Mining (SIM). SIM expands the range of attacker’s behaviors by incorporating selfish mining into the traditional framework of innocent and infiltration mining, without increasing the attacker’s computational power. Initially, we analyze all possible states of chains in the system and their transition probabilities in the context of the SIM attack using Markov Chain. We determine the attacker’s rewards in one victim pool, multiple victim pools, and the miner’s dilemma within different cases. Subsequently, we examine the impact of an imperfect network environment on the attacker’s rewards within the SIM framework, focusing on the influence of unintentional fork rates on rewards. Our quantitative analysis demonstrates that the attacker’s rewards in SIM exceed those in power-adjusting withholding (PAW) by \n<inline-formula> <tex-math>$1.9\\times $ </tex-math></inline-formula>\n and \n<inline-formula> <tex-math>$2.7\\times $ </tex-math></inline-formula>\n in different network environments, respectively. The attacker’s rewards threshold reduced to 12.38% compared to other benchmarks.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"21 6","pages":"6153-6173"},"PeriodicalIF":4.7000,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"SIM: Achieving High Profit Through Integration of Selfish Strategy Into Innocent Mining\",\"authors\":\"Jiaze Shang;Tianbo Lu;Pengfei Zhao\",\"doi\":\"10.1109/TNSM.2024.3435869\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Selfish mining, one of the most renowned attack in Bitcoin, involves a selfish miner withholding discovered blocks and broadcasting them at an opportune moment to gain higher rewards than honest mining. However, selfish mining and its variants rely on two assumptions: the attacker solely engages in infiltration mining within the victim pool (attack assumption) and the system operates in a perfect network environment (network assumption). In this paper, we propose a novel attack called Selfish in Innocent Mining (SIM). SIM expands the range of attacker’s behaviors by incorporating selfish mining into the traditional framework of innocent and infiltration mining, without increasing the attacker’s computational power. Initially, we analyze all possible states of chains in the system and their transition probabilities in the context of the SIM attack using Markov Chain. We determine the attacker’s rewards in one victim pool, multiple victim pools, and the miner’s dilemma within different cases. Subsequently, we examine the impact of an imperfect network environment on the attacker’s rewards within the SIM framework, focusing on the influence of unintentional fork rates on rewards. Our quantitative analysis demonstrates that the attacker’s rewards in SIM exceed those in power-adjusting withholding (PAW) by \\n<inline-formula> <tex-math>$1.9\\\\times $ </tex-math></inline-formula>\\n and \\n<inline-formula> <tex-math>$2.7\\\\times $ </tex-math></inline-formula>\\n in different network environments, respectively. The attacker’s rewards threshold reduced to 12.38% compared to other benchmarks.\",\"PeriodicalId\":13423,\"journal\":{\"name\":\"IEEE Transactions on Network and Service Management\",\"volume\":\"21 6\",\"pages\":\"6153-6173\"},\"PeriodicalIF\":4.7000,\"publicationDate\":\"2024-07-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Network and Service Management\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10614329/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network and Service Management","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10614329/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

本文章由计算机程序翻译,如有差异,请以英文原文为准。
SIM: Achieving High Profit Through Integration of Selfish Strategy Into Innocent Mining
Selfish mining, one of the most renowned attack in Bitcoin, involves a selfish miner withholding discovered blocks and broadcasting them at an opportune moment to gain higher rewards than honest mining. However, selfish mining and its variants rely on two assumptions: the attacker solely engages in infiltration mining within the victim pool (attack assumption) and the system operates in a perfect network environment (network assumption). In this paper, we propose a novel attack called Selfish in Innocent Mining (SIM). SIM expands the range of attacker’s behaviors by incorporating selfish mining into the traditional framework of innocent and infiltration mining, without increasing the attacker’s computational power. Initially, we analyze all possible states of chains in the system and their transition probabilities in the context of the SIM attack using Markov Chain. We determine the attacker’s rewards in one victim pool, multiple victim pools, and the miner’s dilemma within different cases. Subsequently, we examine the impact of an imperfect network environment on the attacker’s rewards within the SIM framework, focusing on the influence of unintentional fork rates on rewards. Our quantitative analysis demonstrates that the attacker’s rewards in SIM exceed those in power-adjusting withholding (PAW) by $1.9\times $ and $2.7\times $ in different network environments, respectively. The attacker’s rewards threshold reduced to 12.38% compared to other benchmarks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Network and Service Management
IEEE Transactions on Network and Service Management Computer Science-Computer Networks and Communications
CiteScore
9.30
自引率
15.10%
发文量
325
期刊介绍: IEEE Transactions on Network and Service Management will publish (online only) peerreviewed archival quality papers that advance the state-of-the-art and practical applications of network and service management. Theoretical research contributions (presenting new concepts and techniques) and applied contributions (reporting on experiences and experiments with actual systems) will be encouraged. These transactions will focus on the key technical issues related to: Management Models, Architectures and Frameworks; Service Provisioning, Reliability and Quality Assurance; Management Functions; Enabling Technologies; Information and Communication Models; Policies; Applications and Case Studies; Emerging Technologies and Standards.
×
引用
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学术官方微信