Paper 2024/704
Fully Automated Selfish Mining Analysis in Efficient Proof Systems Blockchains
Abstract
We study selfish mining attacks in longest-chain blockchains like Bitcoin, but where the proof of work is replaced with efficient proof systems -- like proofs of stake or proofs of space -- and consider the problem of computing an optimal selfish mining attack which maximizes expected relative revenue of the adversary, thus minimizing the chain quality. To this end, we propose a novel selfish mining attack that aims to maximize this objective and formally model the attack as a Markov decision process (MDP). We then present a formal analysis procedure which computes an
Metadata
- Available format(s)
-
PDF
- Category
- Applications
- Publication info
- Published elsewhere. Minor revision. PODC
- Keywords
- BlockchainFormal MethodsEfficient Proof SystemsSelfish MiningMarkov Decision Process
- Contact author(s)
-
krishnendu chatterjee @ ist ac at
ebrahimzadeh amirali @ gmail com
mehrdad karrabi @ ist ac at
krzysztof pietrzak @ ist ac at
mxyeo @ nus edu sg
dzikelic @ smu edu sg - History
- 2024-05-10: approved
- 2024-05-07: received
- See all versions
- Short URL
- https://ia.cr/2024/704
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/704, author = {Krishnendu Chatterjee and Amirali Ebrahim-Zadeh and Mehrdad Karrabi and Krzysztof Pietrzak and Michelle Yeo and Djordje Zikelic}, title = {Fully Automated Selfish Mining Analysis in Efficient Proof Systems Blockchains}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/704}, year = {2024}, url = {https://eprint.iacr.org/2024/704} }