scispace - formally typeset
Proceedings ArticleDOI

A Secure Sharding Protocol For Open Blockchains

TLDR
ELASTICO is the first candidate for a secure sharding protocol with presence of byzantine adversaries, and scalability experiments on Amazon EC2 with up to $1, 600$ nodes confirm ELASTICO's theoretical scaling properties.
Abstract
Cryptocurrencies, such as Bitcoin and 250 similar alt-coins, embody at their core a blockchain protocol --- a mechanism for a distributed network of computational nodes to periodically agree on a set of new transactions. Designing a secure blockchain protocol relies on an open challenge in security, that of designing a highly-scalable agreement protocol open to manipulation by byzantine or arbitrarily malicious nodes. Bitcoin's blockchain agreement protocol exhibits security, but does not scale: it processes 3--7 transactions per second at present, irrespective of the available computation capacity at hand. In this paper, we propose a new distributed agreement protocol for permission-less blockchains called ELASTICO. ELASTICO scales transaction rates almost linearly with available computation for mining: the more the computation power in the network, the higher the number of transaction blocks selected per unit time. ELASTICO is efficient in its network messages and tolerates byzantine adversaries of up to one-fourth of the total computational power. Technically, ELASTICO uniformly partitions or parallelizes the mining network (securely) into smaller committees, each of which processes a disjoint set of transactions (or "shards"). While sharding is common in non-byzantine settings, ELASTICO is the first candidate for a secure sharding protocol with presence of byzantine adversaries. Our scalability experiments on Amazon EC2 with up to $1, 600$ nodes confirm ELASTICO's theoretical scaling properties.

read more

Citations
More filters
Journal ArticleDOI

Scaling Blockchain via Layered Sharding

TL;DR: PYRAMID as discussed by the authors is a layered sharding system that allows the nodes with better hardware to participate in multiple shards and store the blockchains of these shards thus they can validate and execute the cross-shard transactions without splitting.
Posted Content

ACeD: Scalable Data Availability Oracle

TL;DR: ACeD is a scalable solution to this data availability problem with $O(1)$ communication efficiency, the first to the best of the authors' knowledge, and is implemented with full functionality in 6000 lines of Rust code.
Journal ArticleDOI

ESS: An Efficient Storage Scheme for Improving the Scalability of Bitcoin Network

TL;DR: In this article , the authors proposed an efficient storage scheme (ESS) based on the distribution characteristics of the unspent transaction outputs in Bitcoin network, which dynamically prunes the blocks which have lower query frequency, improving the scalability of Bitcoin network.
Proceedings ArticleDOI

Scalable Blockchain Implementation for Edge-based Internet of Things Platform

TL;DR: This work designs and implements an edge-based blockchain network, where a set of edge nodes are incorporated to serve the requests of field devices, and achieves the fundamental security properties and addresses the transaction scalability issue.
Journal ArticleDOI

A Flexible n/2 Adversary Node Resistant and Halting Recoverable Blockchain Sharding Protocol

TL;DR: An improved Blockchain sharding approach that can withstand n/2 adversarial nodes and recover from deadlocks is presented and a performance analysis suggests the approach has a high performance (transaction throughput) while requiring little bandwidth for synchronization.
References
More filters
Journal ArticleDOI

The Byzantine Generals Problem

TL;DR: The Albanian Generals Problem as mentioned in this paper is a generalization of Dijkstra's dining philosophers problem, where two generals have to come to a common agreement on whether to attack or retreat, but can communicate only by sending messengers who might never arrive.
Book ChapterDOI

The Byzantine generals problem

TL;DR: In this article, a group of generals of the Byzantine army camped with their troops around an enemy city are shown to agree upon a common battle plan using only oral messages, if and only if more than two-thirds of the generals are loyal; so a single traitor can confound two loyal generals.
Book ChapterDOI

The Sybil Attack

TL;DR: It is shown that, without a logically centralized authority, Sybil attacks are always possible except under extreme and unrealistic assumptions of resource parity and coordination among entities.
Book

Distributed algorithms

Nancy Lynch
TL;DR: This book familiarizes readers with important problems, algorithms, and impossibility results in the area, and teaches readers how to reason carefully about distributed algorithms-to model them formally, devise precise specifications for their required behavior, prove their correctness, and evaluate their performance with realistic measures.
Proceedings ArticleDOI

Practical Byzantine fault tolerance

TL;DR: A new replication algorithm that is able to tolerate Byzantine faults that works in asynchronous environments like the Internet and incorporates several important optimizations that improve the response time of previous algorithms by more than an order of magnitude.
Related Papers (5)