Transaction Capacity, Security and Latency in Blockchains
- URL: http://arxiv.org/abs/2402.10138v1
- Date: Thu, 15 Feb 2024 17:43:13 GMT
- Title: Transaction Capacity, Security and Latency in Blockchains
- Authors: Mustafa Doger, Sennur Ulukus,
- Abstract summary: 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.
- Score: 35.16231062731263
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We analyze how secure a block is after the block becomes k-deep, i.e., security-latency, for Nakamoto consensus under an exponential network delay model. We give parameter regimes for which transactions are safe when sufficiently deep in the chain. We compare our results for Nakamoto consensus under bounded network delay models and obtain analogous bounds for safety violation threshold. Next, modeling the blockchain system as a batch service queue with exponential network delay, we connect the security-latency analysis to sustainable transaction rate of the queue system. As our model assumes exponential network delay, batch service queue models give a meaningful trade-off between transaction capacity, security and latency. As adversary can attack the queue service to hamper the service process, we consider two different attacks for adversary. In an extreme scenario, we modify the selfish-mining attack for this purpose and consider its effect on the sustainable transaction rate of the queue.
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) - Asymmetric Mempool DoS Security: Formal Definitions and Provable Secure Designs [17.06992341258962]
This paper introduces secure blockchain-mempool designs capable of defending against any form of asymmetric eviction DoS attacks.
Our proposed secure transaction admission algorithm, named textscsaferAd-CP, ensures eviction-security by providing a provable lower bound on the cost of executing eviction DoS attacks.
arXiv Detail & Related papers (2024-07-03T23:28:35Z) - Maximizing Blockchain Performance: Mitigating Conflicting Transactions through Parallelism and Dependency Management [0.18641315013048293]
"Conflicting transactions" contribute to high network latency and transaction failures.
We present a novel scheme that integrates transaction parallelism and an intelligent dependency manager.
Results show that our scheme outperforms both existing parallel and non-parallel Hyperledger Fabric blockchain networks.
arXiv Detail & Related papers (2024-07-01T16:17:33Z) - PoW Security-Latency under Random Delays and the Effect of Transaction Fees [33.689236895881216]
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.
arXiv Detail & Related papers (2024-05-07T17:57:31Z) - 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) - Graph Attention Network-based Block Propagation with Optimal AoI and Reputation in Web 3.0 [59.94605620983965]
We design a Graph Attention Network (GAT)-based reliable block propagation optimization framework for blockchain-enabled Web 3.0.
To achieve the reliability of block propagation, we introduce a reputation mechanism based on the subjective logic model.
Considering that the GAT possesses the excellent ability to process graph-structured data, we utilize the GAT with reinforcement learning to obtain the optimal block propagation trajectory.
arXiv Detail & Related papers (2024-03-20T01:58:38Z) - 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 longest-chain-wins protocols, also known as the 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) - Blockchain Large Language Models [65.7726590159576]
This paper presents a dynamic, real-time approach to detecting anomalous blockchain transactions.
The proposed tool, BlockGPT, generates tracing representations of blockchain activity and trains from scratch a large language model to act as a real-time Intrusion Detection System.
arXiv Detail & Related papers (2023-04-25T11:56:18Z) - 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.