PoW Security-Latency under Random Delays and the Effect of Transaction Fees
- URL: http://arxiv.org/abs/2405.04526v2
- Date: Fri, 10 May 2024 02:41:03 GMT
- Title: PoW Security-Latency under Random Delays and the Effect of Transaction Fees
- Authors: Mustafa Doger, Sennur Ulukus, Nail Akar,
- Abstract summary: Recent studies have shown that PoW protocol is secure under random delay models as well.
We analyze the security-latency problem, i.e., how secure a block is, after it becomes k-deep in the blockchain.
- Score: 33.689236895881216
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Safety guarantees and security-latency problem of Nakamoto consensus have been extensively studied in the last decade with a bounded delay model. Recent studies have shown that PoW protocol is secure under random delay models as well. In this paper, we analyze the security-latency problem, i.e., how secure a block is, after it becomes k-deep in the blockchain, under general random delay distributions. We provide tight and explicit bounds which only require determining the distribution of the number of Poisson arrivals during the random delay. We further consider potential effects of recent Bitcoin halving on the security-latency problem by extending our results.
Related papers
- The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols.
Existing approaches for threshold cryptosystems introduce a latency overhead of at least one message delay for running the threshold cryptographic protocol.
We propose a mechanism to eliminate this overhead for blockchain-native threshold cryptosystems with tight thresholds.
arXiv Detail & Related papers (2024-07-16T20:53:04Z) - Larger-scale Nakamoto-style Blockchains Don't Necessarily Offer Better Security [1.2644625435032817]
Research on Nakamoto-style consensus protocols has shown that network delays degrade the security of these protocols.
This contradicts the very foundation of blockchains, namely that decentralization improves security.
We take a closer look at how the network scale affects security of Nakamoto-style blockchains.
arXiv Detail & Related papers (2024-04-15T16:09:41Z) - Enhancing Trust and Privacy in Distributed Networks: A Comprehensive Survey on Blockchain-based Federated Learning [51.13534069758711]
Decentralized approaches like blockchain offer a compelling solution by implementing a consensus mechanism among multiple entities.
Federated Learning (FL) enables participants to collaboratively train models while safeguarding data privacy.
This paper investigates the synergy between blockchain's security features and FL's privacy-preserving model training capabilities.
arXiv Detail & Related papers (2024-03-28T07:08:26Z) - Transaction Capacity, Security and Latency in Blockchains [35.16231062731263]
We analyze how secure a block is after the block becomes k-deep, i.e., security-latency, for Nakamoto consensus.
We compare our results for Nakamoto consensus under bounded network delay models and obtain analogous bounds for safety violation threshold.
arXiv Detail & Related papers (2024-02-15T17:43:13Z) - Generative AI-enabled Blockchain Networks: Fundamentals, Applications,
and Case Study [73.87110604150315]
Generative Artificial Intelligence (GAI) has emerged as a promising solution to address challenges of blockchain technology.
In this paper, we first introduce GAI techniques, outline their applications, and discuss existing solutions for integrating GAI into blockchains.
arXiv Detail & Related papers (2024-01-28T10:46:17Z) - Trade-off of Security, Latency, and Throughput of the Nakamoto Consensus [4.738177482027387]
This paper delves into the fundamental trade-off between security, latency, and throughput in proof-of-work (PoW) longest-chain-latency-choice protocols, also known as the PoW Nakamoto consensus.
New upper and lower bounds on the probability of violating transaction safety are derived as a function of honest and adversarial mining rates, an upper bound on block propagation delays, and transaction confirmation latency, both in time and in block depth.
The paper reveals a fundamental trade-off between transaction throughput and confirmation latency, ultimately determined by the desired fault tolerance and the growth of block propagation delay as block size increases.
arXiv Detail & Related papers (2023-12-09T09:03:14Z) - Refined Bitcoin Security-Latency Under Network Delay [35.16231062731263]
We study how secure a block is after it becomes $k$-deep in the chain.
We analyze 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, Ren; AFT 2022] when a target block becomes $k$-deep in the chain.
arXiv Detail & Related papers (2022-12-02T18:54:30Z) - Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's
Post-Quantum Security [67.06003361150228]
A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task.
In this work, we examine the hardness of finding such chain of PoWs against quantum strategies.
We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
arXiv Detail & Related papers (2020-12-30T18:03:56Z) - Stochastic bandits with arm-dependent delays [102.63128271054741]
We propose a simple but efficient UCB-based algorithm called the PatientBandits.
We provide both problems-dependent and problems-independent bounds on the regret as well as performance lower bounds.
arXiv Detail & Related papers (2020-06-18T12:13:58Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.