114.11.20 演講公告
資工系專題演講(Lecture)
日期(date)/時間(time)：114年11月20日(四/Thu)13:10~15:00
地點(location)：電綜大樓B101演講廳
演講者(speaker)：王聲葦 副教授
服務單位(job)：國立聯合大學 電子工程學系
講題(topic)：Reward Analysis in Proof-of-Work Blockchains with Multiple Selfish Miners
摘要(summary)：
Selfish mining poses significant security challenges to Proof-of-Work (PoW) blockchains by allowing strategic miners to gain disproportionate rewards through protocol deviation.
While the impact of a single selfish miner has been extensively studied, the security implications of multiple independent selfish miners remain insufficiently understood.
This talk presents an accurate and efficient analytical model for security evaluation of PoW blockchains under multiple independent selfish mining behaviors. The blockchain dynamics are modeled as a Markov chain with a novel state aggregation approximation, enabling closed-form estimation of miner rewards. Numerical results show that the proposed model achieves high accuracy, with deviations typically less than 5.09% compared to simulations in a blockchain with two selfish miners. In a blockchain with more than two selfish miners, the proposed analytical model yields more accuracy approximation leading to less than 2% error. We also propose a truncation mechanism to reduce the number of states in the proposed Markov chain. Numerical results show that the proposed analytical model with truncation significantly reduce the computation time while the accuracy is still maintained. The proposed model provides a practical framework for quantifying incentive-driven security risks and evaluating their impact on blockchain fairness and decentralization.
與工程認證核心能力關聯性：
▓ 認識時事議題，瞭解資訊工程技術對環境、社會及全球的影響
日期(date)/時間(time)：114年11月20日(四/Thu)13:10~15:00
地點(location)：電綜大樓B101演講廳
演講者(speaker)：王聲葦 副教授
服務單位(job)：國立聯合大學 電子工程學系
講題(topic)：Reward Analysis in Proof-of-Work Blockchains with Multiple Selfish Miners
摘要(summary)：
Selfish mining poses significant security challenges to Proof-of-Work (PoW) blockchains by allowing strategic miners to gain disproportionate rewards through protocol deviation.
While the impact of a single selfish miner has been extensively studied, the security implications of multiple independent selfish miners remain insufficiently understood.
This talk presents an accurate and efficient analytical model for security evaluation of PoW blockchains under multiple independent selfish mining behaviors. The blockchain dynamics are modeled as a Markov chain with a novel state aggregation approximation, enabling closed-form estimation of miner rewards. Numerical results show that the proposed model achieves high accuracy, with deviations typically less than 5.09% compared to simulations in a blockchain with two selfish miners. In a blockchain with more than two selfish miners, the proposed analytical model yields more accuracy approximation leading to less than 2% error. We also propose a truncation mechanism to reduce the number of states in the proposed Markov chain. Numerical results show that the proposed analytical model with truncation significantly reduce the computation time while the accuracy is still maintained. The proposed model provides a practical framework for quantifying incentive-driven security risks and evaluating their impact on blockchain fairness and decentralization.
與工程認證核心能力關聯性：
▓ 認識時事議題，瞭解資訊工程技術對環境、社會及全球的影響