SpiralShard: Highly Concurrent and Secure Blockchain Sharding via Linked Cross-shard Endorsement

• URL: http://arxiv.org/abs/2407.08651v1
• Date: Tue, 9 Jul 2024 15:14:44 GMT
• Title: SpiralShard: Highly Concurrent and Secure Blockchain Sharding via Linked Cross-shard Endorsement
• Authors: You Lin, Mingzhe Li, Jin Zhang,
• Abstract summary: Existing sharding systems require large shard sizes to ensure security. We propose SpiralShard to allow the existence of some shards with a larger fraction of malicious nodes. SpiralShard achieves around 19x throughput gain under a large network size with 4,000+ nodes.
• Score: 9.81571913553477
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Blockchain sharding improves the scalability of blockchain systems by partitioning the whole blockchain state, nodes, and transaction workloads into different shards. However, existing blockchain sharding systems generally suffer from a small number of shards, resulting in limited concurrency. The main reason is that existing sharding systems require large shard sizes to ensure security. To enhance the concurrency of blockchain sharding securely, we propose SpiralShard. The intuition is to allow the existence of some shards with a larger fraction of malicious nodes (i.e., corrupted shards), thus reducing shard sizes. SpiralShard can configure more and smaller shards for higher concurrency at the same network size. To ensure security with the existence of corrupted shards, we propose the Linked Cross-shard Endorsement (LCE) protocol. According to our LCE protocol, the blocks of each shard are sequentially verified and endorsed by a group of shards before being finalized. As a result, a corrupted shard can eliminate forks with the help of the other shards. We implement SpiralShard based on Harmony and conduct extensive evaluations. Experimental results show that, compared with Harmony, SpiralShard achieves around 19x throughput gain under a large network size with 4,000+ nodes.

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)
• Optimal Sharding for Scalable Blockchains with Deconstructed SMR [6.432440366479941]
  Arete is an optimally scalable blockchain sharding protocol designed to resolve a size-security dilemma. The key idea of Arete is to improve the security resilience/threshold of shards by dividing the blockchain's State Machine Replication (SMR) process itself. We implement Arete and evaluate it on a AWS environment by running up to 500 nodes, showing that Arete outperforms the state-of-the-art sharding protocol.
  arXiv  Detail & Related papers  (2024-06-12T14:23:53Z)
• SoK: Public Blockchain Sharding [19.82054462793622]
  This study provides a systemization of knowledge of public blockchain sharding. It includes the core components of sharding systems, challenges, limitations, and mechanisms of the latest sharding protocols.
  arXiv  Detail & Related papers  (2024-05-30T22:38:40Z)
• Kronos: A Secure and Generic Sharding Blockchain Consensus with Optimized Overhead [17.387814385763622]
  Sharding enhances blockchain scalability by dividing the network into shards, each managing specific unspent transaction outputs or accounts. Cross-shard transactions pose a critical challenge to the security and efficiency of sharding blockchains. We present Kronos, a secure sharding blockchain consensus achieving optimized overhead.
  arXiv  Detail & Related papers  (2024-03-06T12:26:04Z)
• 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)
• TBDD: A New Trust-based, DRL-driven Framework for Blockchain Sharding in IoT [25.15169926146292]
  Integrating sharded blockchain with IoT presents a solution for trust issues and optimized data flow. Deep Reinforcement Learning adeptly handles dynamic, complex systems and multi-dimensional optimization. textscTbDd discerns node types and performs targeted resharding against potential threats.
  arXiv  Detail & Related papers  (2024-01-01T01:57:28Z)
• 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)
• 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.