A combinatorial-probabilistic analysis of bitcoin attacks

DOI10.1080/10236198.2018.1555247MaRDI QIDQ4626006zbMATH OpenOpenAlexWikidataFDO

Authors Evangelos Georgiadis, Doron Zeilberger

Publication date 26 February 2019

Published in Journal of Difference Equations and Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1808.05255

zbMATH Keywords

bitcoin protocolcombinatoricscryptographydouble-spend attacknegative binomial distributionsymbolic-probabilistic computationWilf-Zeilberger algorithmic proof theory

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Applications of hypergeometric functions (33C90) Applications of difference equations (39A60) Symbolic computation and algebraic computation (68W30) Cryptography (94A60)

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.

Recommendations

• Double spend races
• On profitability of Nakamoto double spend
• A note on optimal double spending attacks
• Fraud risk assessment within blockchain transactions
• Modeling and analysis of block arrival times in the Bitcoin blockchain

Cites work

• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• Impossibility of distributed consensus with one faulty process
• Symbol-crunching with the gambler's ruin problem
• The method of creative telescoping

Cited in

(13)

• A note on optimal double spending attacks
• Assessing security of cryptocurrencies with attack-defense trees: proof of concept and future directions
• Double spend races
• “Large” versus “Small” Players: A Closer Look at the Dynamics of Speculative Attacks
• Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies
• On profitability of Nakamoto double spend
• BLOCKCHAIN DOUBLE-SPEND ATTACK DURATION
• Fraud risk assessment within blockchain transactions
• Estimating the number of fork projects of bitcoin based on a birth-death-immigration process
• Probability of double spend attack for network with non-zero time delay
• Research on actual or industrial applications of difference equations: a chimerical task?
• Profit lag and alternate network mining
• A denial of service attack against fair computations using bitcoin deposits

Describes a project that uses

Uses Software

• Asyrec
• EKHAD

This page was built for publication: A combinatorial-probabilistic analysis of bitcoin attacks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4626006)