Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Huan Yan 0001

dblp:87/1372-1 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
4since 2021 · last 2026
0009-0000-0016-6324ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Security and privacy · 2 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
2 papers
Blockchain and cryptocurrency security · 100%
Theoretical computer science
2 papers
Algorithmic game theory and mechanism design · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Blockchain and cryptocurrency security › mining attack
selfish mining
1.922026
Novel Bribery Mining Attacks: Impacts on Mining Ecosystem and the "Bribery Miner's Dilemma" in the Nakamoto-Style Blockchain System · IEEE Trans. Dependable Secur. Comput. 2026
The Halt Game: Sometimes Rewards Cannot Cover Expenses in the PoW-Based Blockchain · IEEE Trans. Inf. Forensics Secur. 2025
Blockchain and cryptocurrency security
mining attack
1.012026
Novel Bribery Mining Attacks: Impacts on Mining Ecosystem and the "Bribery Miner's Dilemma" in the Nakamoto-Style Blockchain System · IEEE Trans. Dependable Secur. Comput. 2026
Blockchain and cryptocurrency security
incentive mechanism
0.912025
The Halt Game: Sometimes Rewards Cannot Cover Expenses in the PoW-Based Blockchain · IEEE Trans. Inf. Forensics Secur. 2025
Blockchain and cryptocurrency security
proof-of-work blockchain
0.912025
The Halt Game: Sometimes Rewards Cannot Cover Expenses in the PoW-Based Blockchain · IEEE Trans. Inf. Forensics Secur. 2025
Algorithmic game theory and mechanism design › solution concepts in games › equilibrium concepts
nash equilibrium
0.312026
Novel Bribery Mining Attacks: Impacts on Mining Ecosystem and the "Bribery Miner's Dilemma" in the Nakamoto-Style Blockchain System · IEEE Trans. Dependable Secur. Comput. 2026

Methods — techniques the papers use, named apart from their topics

simulation · 2.0quantitative analysis · 2.0game-theoretic analysis · 1.7dynamic incentive model · 1.7
YearPublicationVenuePosition
2026 WANN-DPC: Density peaks finding clustering based on Weighted Adaptive Nearest Neighbors
Juanying Xie, Huan Yan 0001, Mingzhao Wang, Phil W. Grant, Witold Pedrycz
Pattern Recognit.2
2026 Novel Bribery Mining Attacks: Impacts on Mining Ecosystem and the "Bribery Miner's Dilemma" in the Nakamoto-Style Blockchain System
abstract
Mining attacks allow adversaries to obtain a disproportionate share of the mining reward by deviating from the honest mining strategy in the Bitcoin system. Among them, the most well-known are selfish mining (SM), block withholding (BWH), fork after withholding (FAW) and bribery mining. In this paper, we propose two novel mining attacks: bribery semiselfish mining (BSSM) and bribery stubborn mining (BSM). Unlike prior work (e.g., selfish mining, block withholding), these attacks integrate bribery mechanisms to strategically influence miner behavior, leading to a 6% higher relative extra reward for adversaries in BSSM compared to semi-selfish mining and a 2% increase in BSM compared to selfish mining. This creates a novel “bribery miner's dilemma” where target miners face a Nash equilibrium conflict: individually optimal to accept bribes, but globally optimal to reject them, directly impacting the decentralization and reward distribution of the mining ecosystem. Furthermore, quantitative analysis and simulation have verified our theoretical analysis. We propose practical measures to mitigate more advanced mining attack strategies based on bribery mining and provide new ideas for addressing bribery mining attacks in the future. However, how to completely and effectively prevent these attacks is still needed on further research.
Huan Yan 0001, Chunxiang Xu
IEEE Trans. Dependable Secur. Comput.2
2025 The Halt Game: Sometimes Rewards Cannot Cover Expenses in the PoW-Based Blockchain
abstract
Proof-of-work (PoW) blockchain relies on incentive mechanisms to ensure the security and correctness of its underlying consensus protocol. Most research about it, based on a static model only considering coin-base rewards and transaction fee rewards, fails to accurately describe the complex real-world blockchain ecosystem. We propose a generic selfish mining attack applicable to arbitrary PoW blockchain systems and introduce a dynamic PoW blockchain incentive model. This model takes into account static basic rewards, dynamic whale rewards related to network protocol, and expenditures tied to players’ strategies. Unlike traditional incentive models that assume players continuously mine by default, we find players prefer to halt mining at the beginning of each mining cycle to reduce operational expenses and then resume mining at an appropriate time to enhance their rewards. We further prove players’ optimal strategy exists and it is determined by reward parameters. We implement a modified PoW blockchain system simulator and comprehensively validate these results using 256 full nodes in it of three mainstream PoW blockchains: Bitcoin, Ethereum 1.x, and Bitcoin Cash. We finally discuss the impact of different parameters on the security of PoW blockchain systems and propose practical mitigating measures for the mining halt.
Huan Yan 0001, Na Ruan, Jianhua Li 0001
IEEE Trans. Inf. Forensics Secur.2
2024 ANN-DPC: Density peak clustering by finding the adaptive nearest neighbors
Huan Yan 0001, Mingzhao Wang, Juanying Xie
Knowl. Based Syst.1