Towards Stronger Blockchains: Security Against Front-Running Attacks

• URL: http://arxiv.org/abs/2311.10253v1
• Date: Fri, 17 Nov 2023 00:50:49 GMT
• Title: Towards Stronger Blockchains: Security Against Front-Running Attacks
• Authors: Anshuman Misra, Ajay D. Kshemkalyani,
• Abstract summary: We show that total ordering is not strong enough to preserve application semantics under Byzantine fault model. This is due to the fact that malicious miners and clients can collaborate to add their own transactions ahead of correct clients' transactions in order to gain application level and financial advantages. We propose preserving causality preserving total order as a solution.
• Score: 10.220888127527152
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Blockchains add transactions to a distributed shared ledger by arriving at consensus on sets of transactions contained in blocks. This provides a total ordering on a set of global transactions. However, total ordering is not enough to satisfy application semantics under the Byzantine fault model. This is due to the fact that malicious miners and clients can collaborate to add their own transactions ahead of correct clients' transactions in order to gain application level and financial advantages. These attacks fall under the umbrella of front-running attacks. Therefore, total ordering is not strong enough to preserve application semantics. In this paper, we propose causality preserving total order as a solution to this problem. The resulting Blockchains will be stronger than traditional consensus based blockchains and will provide enhanced security ensuring correct application semantics in a Byzantine setting.

Related papers

• BlockFound: Customized blockchain foundation model for anomaly detection [47.04595143348698]
  BlockFound is a customized foundation model for anomaly blockchain transaction detection. We introduce a series of customized designs to model the unique data structure of blockchain transactions. BlockFound is the only method that successfully detects anomalous transactions on Solana with high accuracy.
  arXiv  Detail & Related papers  (2024-10-05T05:11:34Z)
• 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)
• Proof of Diligence: Cryptoeconomic Security for Rollups [19.10751432868712]
  We introduce an incentivized watchtower network designed to serve as the first line of defense for rollups. Our main contribution is a Proof of Diligence'' protocol that requires watchtowers to continuously provide a proof that they have verified L2 assertions.
  arXiv  Detail & Related papers  (2024-02-11T16:40:33Z)
• 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)
• A Two-Layer Blockchain Sharding Protocol Leveraging Safety and Liveness for Enhanced Performance [5.344231997803284]
  Existing protocols overlook diverse adversarial attacks, limiting transaction throughput. This paper presents Reticulum, a groundbreaking sharding protocol addressing this issue. It comprises "control" and "process" shards in two layers.
  arXiv  Detail & Related papers  (2023-10-17T16:15:28Z)
• Cuttlefish: Expressive Fast Path Blockchains with FastUnlock [4.483666331132052]
  Cuttlefish addresses limitations of existing consensus-less and consensus-minimized decentralized ledgers. Key insight of Cuttlefish is that consensus is necessary due to contention, rather than multiple owners of an asset as suggested by prior work. Cuttlefish introduces collective objects and multi-owner transactions that can offer most of the functionality of classic blockchains.
  arXiv  Detail & Related papers  (2023-09-22T08:56:32Z)
• Masquerade: Simple and Lightweight Transaction Reordering Mitigation in Blockchains [5.690884793952696]
  We propose an MEV aware protocol design called Masquerade to increase user satisfaction and confidence in the system. We introduce the notion of a "token" to mitigate the actions taken by an adversary in an attack scenario.
  arXiv  Detail & Related papers  (2023-08-29T14:42:43Z)
• TxAllo: Dynamic Transaction Allocation in Sharded Blockchain Systems [37.22526235663589]
  This paper focuses on the transaction allocation problem to reduce the number of cross-shard transactions. A deterministic and fast allocation scheme TxAllo is proposed to dynamically infer the allocation of accounts. For a blockchain with 60 shards, TxAllo reduces the cross-shard transaction ratio from 98% to about 12%.
  arXiv  Detail & Related papers  (2022-12-22T10:22:31Z)
• Quantum-resistance in blockchain networks [46.63333997460008]
  This paper describes the work carried out by the Inter-American Development Bank, the IDB Lab, LACChain, Quantum Computing (CQC), and Tecnologico de Monterrey to identify and eliminate quantum threats in blockchain networks. The advent of quantum computing threatens internet protocols and blockchain networks because they utilize non-quantum resistant cryptographic algorithms.
  arXiv  Detail & Related papers  (2021-06-11T23:39:25Z)
• 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)

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.