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

• Zaptos: Towards Optimal Blockchain Latency [52.30047458198369]
  We introduce Zaptos, a parallel pipelined architecture designed to minimize end-to-end latency. Zaptos achieves a throughput of 20,000 transactions per second with sub-second latency.
  arXiv  Detail & Related papers  (2025-01-18T00:22:22Z)
• Digital Twin-Assisted Federated Learning with Blockchain in Multi-tier Computing Systems [67.14406100332671]
  In Industry 4.0 systems, resource-constrained edge devices engage in frequent data interactions. This paper proposes a digital twin (DT) and federated digital twin (FL) scheme. The efficacy of our proposed cooperative interference-based FL process has been verified through numerical analysis.
  arXiv  Detail & Related papers  (2024-11-04T17:48:02Z)
• 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)
• 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)
• Model Supply Chain Poisoning: Backdooring Pre-trained Models via Embedding Indistinguishability [61.549465258257115]
  We propose a novel and severer backdoor attack, TransTroj, which enables the backdoors embedded in PTMs to efficiently transfer in the model supply chain. Experimental results show that our method significantly outperforms SOTA task-agnostic backdoor attacks.
  arXiv  Detail & Related papers  (2024-01-29T04:35:48Z)
• Security, Latency, and Throughput of Proof-of-Work Nakamoto Consensus [4.738177482027387]
  This paper investigates the fundamental trade-offs between block safety, confirmation latency, and transaction throughput of proof-of-work protocols. New upper and lower bounds are derived for the probability of block safety violations as a function of honest and adversarial mining rates. The study uncovers a fundamental trade-off between transaction throughput and confirmation latency, ultimately determined by the desired fault tolerance and the rate at which block propagation delay increases with block size.
  arXiv  Detail & Related papers  (2023-12-09T09:03:14Z)
• 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.