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

Reputation‐based partition scheme for IoT security

TL;DR: In this paper , an effective reputation-based partition scheme (RSPC) is proposed to solve the issues in the development of crowdsensing such as platform security and privacy protection, which calculates the optimal partition size by combining the node reputation value and divides the node into several disjoint partitions.
Proceedings ArticleDOI

A Concurrent Weighted Communication Scheme for Blockchain Transaction

TL;DR: This paper proposes a concurrent weighted communication tree algorithm for blockchain transaction (called WFT), which comprehensively considers the communication weight and the node communication link number to improve the concurrency and efficiency.
Book ChapterDOI

Building Protocols for Scalable Decentralized Applications

TL;DR: An overview of mechanisms that have been proposed to overcome these limitations can be found in this article , where the authors describe novel consensus protocols, sharding mechanisms, state and payment channels, subchains, and federated protocols.
Journal ArticleDOI

ABBA: Advance Block Body Agreement for Scaling Blockchain Networks

TL;DR: An ABBA-enabled blockchain network has a significantly higher throughput and lower transient forks than an original base blockchain network and can be used with any consensus protocol without changing consensus or its application layer.
Journal ArticleDOI

Approaches to Overpower Proof-of-Work Blockchains Despite Minority

TL;DR: In this article , the authors present several approaches that can be used to undermine/overpower PoW-based blockchains, even with minority miners, and discuss those BCs taking Bitcoin as a representative application, where needed.
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)