Refined Bitcoin Security-Latency Under Network Delay
IEEE Transactions on Information Theory · 2025-04 · 71 (4) · 3038-3047
DOI: 10.1109/tit.2024.3447576 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Information Theory, 2025-04. Verfasst von Mustafa Doger und 1 weiteren Autor:innen. Die Arbeit wurde bisher 8-mal zitiert (Crossref) und nennt 10 Literaturangaben.
Abstract (Originalsprache)
We study security-latency bounds for Nakamoto consensus, i.e., how secure a block is after it becomes k-deep in the chain. We improve the state-of-the-art bounds by analyzing the race between adversarial and honest chains in three different phases. We find the probability distribution of the growth of the adversarial chains under models similar to those in Guo and Ren (2022) when a target block becomes k-deep in the chain. We analyze certain properties of this race to model each phase with random walks that provide tighter bounds than the existing results. Combining all three phases provides novel upper and lower bounds for blockchains with small $\lambda \Delta $ .
Zitieren
APA
Doger, M., & Ulukus, S. (2025). Refined Bitcoin Security-Latency Under Network Delay. IEEE Transactions on Information Theory, 71(4), 3038-3047. https://doi.org/10.1109/tit.2024.3447576
Vancouver
Doger M, Ulukus S. Refined Bitcoin Security-Latency Under Network Delay. IEEE Transactions on Information Theory. 2025;71(4):3038-3047. doi:10.1109/tit.2024.3447576
BibTeX
@article{Doger2025,
author = {Doger, Mustafa and Ulukus, Sennur},
title = {Refined Bitcoin Security-Latency Under Network Delay},
journal = {IEEE Transactions on Information Theory},
year = {2025},
volume = {71},
number = {4},
pages = {3038--3047},
doi = {10.1109/tit.2024.3447576}
}
EUVIMED