Upper bound probability of double spend attack on SPECTRE

2Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We obtained analytical expressions of upper estimates for success probability of a double spend attack on DAG-based consensus protocol SPECTRE, depending on network parameters. Using such estimates, it is possible to evaluate the number of confirmation blocks that is sufficient for prevention of such attacks.

Cite

CITATION STYLE

APA

Kovalchuk, L., Rodinko, M., & Oliynykov, R. (2020). Upper bound probability of double spend attack on SPECTRE. In CRYBLOCK 2020 - Proceedings of the 3rd Workshop on Cryptocurrencies and Blockchains for Distributed Systems, Part of MobiCom 2020 (pp. 18–22). Association for Computing Machinery. https://doi.org/10.1145/3410699.3413792

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free