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