Probability of double spend attack for network with non-zero time delay

DOI10.5486/PMD.2022.SUPPL.4MaRDI QIDQ5886160zbMATH OpenFDO

Authors L. Kovalchuk, M. Rodinko, Roman Oliynykov, Dmytro Kaidalov

Publication date 30 March 2023

Published in Publicationes Mathematicae Debrecen (Search for Journal in Brave)

Full work available at URL https://doi.org/10.5486/PMD.2022.SUPPL.4

zbMATH Keywords

Bitcoinblockchainconsensus protocoldouble spend attackProof-of-Work

Mathematics Subject Classification ID

Computational methods for problems pertaining to probability theory (60-08) Information storage and retrieval of data (68P20)

Recommendations

• Double spend races
• A combinatorial-probabilistic analysis of bitcoin attacks
• Security of the blockchain against long delay attack
• On profitability of Nakamoto double spend
• Fraud risk assessment within blockchain transactions

Cited in

(4)

• The impact of network delay on Nakamoto consensus mechanism
• BLOCKCHAIN DOUBLE-SPEND ATTACK DURATION
• Determining the number of confirmation blocks in a two-level blockchain with proof-of-proof consensus protocol for different consensus types in mainchain/sidechain to prevent double spend attack. I: PoS in mainchain and PoW in sidechain
• Determining the number of confirmation blocks in a two-level blockchain with proof-of-proof consensus protocol for different consensus types in mainchain/sidechain to prevent double-spending attack. II: PoW in mainchain/PoS in sidechain

This page was built for publication: Probability of double spend attack for network with non-zero time delay

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