TY - GEN
T1 - Pool Block Withholding Attack with Rational Miners
AU - Yang, Ni
AU - Wang, Chenhao
AU - Li, Bo
N1 - Funding Information:
by The Hong Kong Polytechnic University (Grant No.
Publisher Copyright:
© 2022, Springer Nature Switzerland AG.
PY - 2022/3
Y1 - 2022/3
N2 - We revisit pool block withholding (PBW) attack in this work, while taking miners’ rationality into consideration. It has been shown that a malicious mining pool in Bitcoin may attack other pools by sending some dummy miners who do not reveal true solutions but obtain reward portions from attacked pools. This result assumes that the infiltrating miners are always loyal and behave as the malicious pool desires; but why? In this work, we study rational infiltrating miners who behave by maximizing their own utilities. We characterize the infiltrating miners’ optimal strategies for two kinds of betraying behaviors depending on whether they return to the original pool or not. Our characterizations show that the infiltrating miners’ optimal strategy is simple and binary: they either betray or stay loyal all together, which depends on the total amount of them sent out by the malicious pool. Accordingly, we further compute the pool’s optimal attacking strategy given the miners’ strategic behaviors. Our experiments also show that by launching PBW attacks, the benefit to a pool is actually incremental.
AB - We revisit pool block withholding (PBW) attack in this work, while taking miners’ rationality into consideration. It has been shown that a malicious mining pool in Bitcoin may attack other pools by sending some dummy miners who do not reveal true solutions but obtain reward portions from attacked pools. This result assumes that the infiltrating miners are always loyal and behave as the malicious pool desires; but why? In this work, we study rational infiltrating miners who behave by maximizing their own utilities. We characterize the infiltrating miners’ optimal strategies for two kinds of betraying behaviors depending on whether they return to the original pool or not. Our characterizations show that the infiltrating miners’ optimal strategy is simple and binary: they either betray or stay loyal all together, which depends on the total amount of them sent out by the malicious pool. Accordingly, we further compute the pool’s optimal attacking strategy given the miners’ strategic behaviors. Our experiments also show that by launching PBW attacks, the benefit to a pool is actually incremental.
UR - http://www.scopus.com/inward/record.url?scp=85126532423&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-97099-4_1
DO - 10.1007/978-3-030-97099-4_1
M3 - Conference article published in proceeding or book
AN - SCOPUS:85126532423
SN - 9783030970987
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 3
EP - 22
BT - Frontiers of Algorithmics - International Joint Conference, IJTCS-FAW 2021, Proceedings
A2 - Chen, Jing
A2 - Li, Minming
A2 - Zhang, Guochuan
PB - Springer Science and Business Media Deutschland GmbH
T2 - 15th International Workshop on Frontiers in Algorithmics, FAW 2021, held in conjunction with 2nd International Joint Conference on Theoretical Computer Science, IJTCS-FAW 2021
Y2 - 16 August 2021 through 19 August 2021
ER -