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
Book ChapterDOI

Sharding-Based Scalable Consortium Blockchain

TL;DR: Meepo as discussed by the authors enhances cross-shard efficiency via the cross-epoch and cross-call, and a partial crosscall merging strategy is designed to handle the multi-state dependency in contract calls.
Proceedings ArticleDOI

Secure Sharding Scheme of Blockchain Based on Reputation

TL;DR: In this paper , a blockchain sharding scheme based on Verifiable Random Functions (VRF) and node reputation is proposed, where nodes are randomly assigned to each shard by VRF, and the nodes are encouraged to work actively through the reputation score of the in-shard nodes.
Journal ArticleDOI

Optimizing Blockchains Structures Based on Entropy and TOPSIS Model

TL;DR: A simple perspective of blockchain in IoT which is flexible with high throughput in sensor networks and contains some areas in security, such as privacy policy and delay versus the value of the task to be processed is proposed.
Peer Review

International Journal of Social Sciences and Management Review

TL;DR: In this article , a model of poverty alleviation that is anchored on the perceptions, views and aspirations of the rural people was presented, which represents a shift from a conventional top-bottom approach where the urban elite occupied the top role in the poverty alleviations schemes to put the rural folks at the top.
Journal ArticleDOI

Technical Report: Analytical Modeling and Throughput Computation of Blockchain Sharding

Pourya Soltani, +1 more
- 19 Sep 2022 - 
TL;DR: The extent of sharding in different domains plays a significant role in scalability, and new queueing-theoretic models to derive the maximum throughput of sharded blockchains are proposed.
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)