Building blocks of sharding blockchain systems: concepts, approaches, and open problems

DOI10.1016/J.COSREV.2022.100513arXiv2102.13364OpenAlexW3135442746MaRDI QIDQ6158770FDOQ6158770

Authors:

Publication date: 20 June 2023

Published in: Computer Science Review (Search for Journal in Brave)

Abstract: Sharding is the prevalent approach to breaking the trilemma of simultaneously achieving decentralization, security, and scalability in traditional blockchain systems, which are implemented as replicated state machines relying on atomic broadcast for consensus on an immutable chain of valid transactions. Sharding is to be understood broadly as techniques for dynamically partitioning nodes in a blockchain system into subsets (shards) that perform storage, communication, and computation tasks without fine-grained synchronization with each other. Despite much recent research on sharding blockchains, much remains to be explored in the design space of these systems. Towards that aim, we conduct a systematic analysis of existing sharding blockchain systems and derive a conceptual decomposition of their architecture into functional components and the underlying assumptions about system models and attackers they are built on. The functional components identified are node selection, epoch randomness, node assignment, intra-shard consensus, cross-shard transaction processing, shard reconfiguration, and motivation mechanism. We describe interfaces, functionality, and properties of each component and show how they compose into a sharding blockchain system. For each component, we systematically review existing approaches, identify potential and open problems, and propose future research directions. We focus on potential security attacks and performance problems, including system throughput and latency concerns such as confirmation delays. We believe our modular architectural decomposition and in-depth analysis of each component, based on a comprehensive literature study, provides a systematic basis for conceptualizing state-of-the-art sharding blockchain systems, proving or improving security and performance properties of components, and developing new sharding blockchain system designs.

Full work available at URL: https://arxiv.org/abs/2102.13364

zbMATH Keywords

scalabilityconsensusmodular decompositionthroughputByzantine fault tolerancesharding blockchain

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Computer science (68-XX)

Cites Work

• Fast Software Encryption
• How to share a secret
• Efficient signature generation by smart cards
• Merkle-Damgård Revisited: How to Construct a Hash Function
• Nash Equilibrium and Welfare Optimality
• Concentration of Measure for the Analysis of Randomized Algorithms
• Impossibility of distributed consensus with one faulty process
• On the minimal synchronism needed for distributed consensus
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
• Secure distributed key generation for discrete-log based cryptosystems
• Title not available (Why is that?)
• Noninteractive Zero-Knowledge
• Title not available (Why is that?)
• Synchronous Byzantine quorum systems
• Publicly verifiable secret sharing
• Title not available (Why is that?)
• ID-Based Blind Signature and Ring Signature from Pairings
• Blind Signature System
• Title not available (Why is that?)
• Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
• Transaction protection by beacons
• The Bitcoin Backbone Protocol: Analysis and Applications
• SoK: a consensus taxonomy in the blockchain era
• Compact multi-signatures for smaller blockchains
• Verifiable delay functions
• Efficient Byzantine Fault-Tolerance
• Analysis of the Blockchain Protocol in Asynchronous Networks
• Thunderella: blockchains with optimistic instant confirmation
• Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
• Ouroboros: a provably secure proof-of-stake blockchain protocol
• Secure high-rate transaction processing in bitcoin
• FruitChains: a fair blockchain
• Efficient statically-secure large-universe multi-authority attribute-based encryption
• Bootstrapping the blockchain, with applications to consensus and fast PKI setup
• Title not available (Why is that?)
• PoW-based distributed cryptography with no trusted setup
• Asymptotically Optimal Validated Asynchronous Byzantine Agreement
• HotStuff
• SCRAPE: scalable randomness attested by public entities
• ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing
• Hybrid consensus: efficient consensus in the permissionless model
• Atomic Cross-Chain Swaps
• SoK: communication across distributed ledgers
• piChain: when a blockchain meets Paxos
• Dumbo-MVBA: Optimal Multi-Valued Validated Asynchronous Byzantine Agreement, Revisited

This page was built for publication: Building blocks of sharding blockchain systems: concepts, approaches, and open problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6158770)