A Combinatorial-Probabilistic Analysis of Bitcoin Attacks
This work addresses security analysis for Bitcoin users and researchers, but appears incremental as it extends existing methods to a more congenial formulation.
The paper tackles the problem of analyzing the probability and duration of successful Bitcoin attacks by reformulating it as a two-phase soccer match, building on prior work by Rosenfeld, Grunspan, and Perez-Marco. It uses Wilf-Zeilberger algorithmic proof theory to conduct a combinatorial-probabilistic analysis, but no concrete results or numbers are provided in the abstract.
Using Wilf-Zeilberger algorithmic proof theory, we continue pioneering work of Meni Rosenfeld (followed up by interesting work by Cyril Grunspan and Ricardo Perez-Marco) and study the probability and duration of successful bitcoin attacks, but using an equivalent, and much more congenial, formulation as a certain two-phase soccer match.