Quantitative Comparison of Two Chain-Selection Protocols Under Selfish Mining Attack
【Author】 Yang, Runkai; Chang, Xiaolin; Misic, Jelena; Misic, Vojislav B.; Kang, Hongyue
【Source】IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT
【影响因子】4.758
【Abstract】The longest-chain and Greedy Heaviest Observed Subtree (GHOST) protocols are the two most famous chain-selection protocols to address forking in Proof-of-Work (PoW) blockchain systems. Inclusive protocol was proposed to lower the loss of miners who produce stale blocks and increase the blockchain throughput. This paper aims to make an analytical-model-based quantitative comparison of their capabilities against selfish mining attack. Analytical models have been developed for the longest-chain protocol but less to the GHOST protocol. However, the blockchain dynamics and evolution are different when adopting different chain-selection protocols. Therefore, the corresponding analytical models and/or the formulas of calculating metrics (such as miner profitability and system throughput) may be different. To address these challenges, this paper first develops a novel Markov model and the formulas of evaluation metrics, in order to analyze a GHOST-based blockchain system under selfish mining attack. Then extensive experiments are conducted for comparison and we observe that: (i) The GHOST protocol is more resistant to selfish mining attack than the longest-chain protocol from the aspect of relative revenue of selfish miners. (ii) Inclusive protocol can promote the security (evaluated in terms of miner profitability) improvement of the system which has little total computational power or a high forking probability. Additionally, the longest-chain protocol is more sensitive to inclusive protocol than GHOST protocol. (iii) It is hard for each of the two common-used difficulty adjustment algorithms to achieve higher system throughput and security.
【Keywords】Protocols; Blockchains; Throughput; Analytical models; Security; Measurement; Profitability; Analytical model; blockchain; GHOST protocol; inclusive protocol; proof of work; selfish mining
【发表时间】2022 JUN
【收录时间】2022-06-22
【文献类型】实证性文章
【主题类别】
区块链治理-技术治理-挖矿检测
wangjiaxin
今日有1篇链上数据分析相关的文章：https://doi.org/10.1109/TNSM.2022.3151083发表在IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT。 文章对于Greedy Heaviest Observed Subtree (GHOST) 链的分叉问题进行研究。开发了一种新的Markov 模型和评估指标公式，以分析自私挖掘攻击下基于GHOST的区块链系统。然后进行了大量实验进行比较，得出三条结论。（i）从自私矿工的相对收入角度来看，GHOST协议比最长链协议更能抵抗自私挖掘攻击。（ii）包容性协议可以促进总计算能力小或分叉概率高的系统的安全性改进。此外，最长链协议比GHOST协议对包含协议更敏感。（iii）两种常用的难度调整算法都难以实现更高的系统吞吐量和安全性。
回复