A Combinatorial-Probabilistic Analysis of Bitcoin Attacks

08/15/2018
by   Evangelos Georgiadis, et al.
0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

02/27/2018

CCP: Conflicts Check Protocol for Bitcoin Block Security

In this work, we present our early stage results on a Conflicts Check Pr...
02/10/2019

Exploring Spatial, Temporal, and Logical Attacks on the Bitcoin Network

In this paper, we explore the partitioning attacks on the Bitcoin networ...
01/16/2022

Algorithmic Authority: The Case of Bitcoin

In this paper, I propose a new concept for understanding the role of alg...
01/07/2020

A Prevention and a Traction System for Ransomware Attacks

Over the past three years, especially following WannaCry malware, ransom...
10/05/2018

The Looming Threat of China: An Analysis of Chinese Influence on Bitcoin

As Bitcoin's popularity has grown over the decade since its creation, it...
07/02/2020

Proofs of Useless Work – Positive and Negative Results for Wasteless Mining Systems

Many blockchain systems today, including Bitcoin, rely on Proof of Work ...
05/13/2020

Boom, Bust, and Bitcoin: Bitcoin-Bubbles As Innovation Accelerators

Bitcoin represents one of the most interesting technological breakthroug...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.