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

Blockchain for decentralized multi-drone to combat COVID-19 and future pandemics: Framework and proposed solutions

TL;DR: End to End delivery application of combination blockchain and multi‐drone in combating COVID‐19 and beyond future pandemics is discussed and the challenges and opportunities of the proposed framework are highlighted.
Proceedings ArticleDOI

OptChain: Optimal Transactions Placement for Scalable Blockchain Sharding

TL;DR: A new sharding paradigm is proposed, called OptChain, in which cross-shard transactions are minimized, resulting in almost twice faster confirmation time and throughput, and when combined with Omniledger sharding protocol, OptChain delivers a 6000 transactions per second throughput with 10.5s confirmation time.
Journal ArticleDOI

NormaChain: A Blockchain-Based Normalized Autonomous Transaction Settlement System for IoT-Based E-Commerce

TL;DR: By proving NormaChain is secure against chosen ciphertext attacks and against the stealing of the secret key, it is shown that Norma chain prevents a legitimate user’s privacy from being violated by banks, supervisors or malicious adversaries.
Proceedings ArticleDOI

The Balance Attack or Why Forkable Blockchains are Ill-Suited for Consortium

TL;DR: This paper identifies a new form of attack, called the Balance attack, against these forkable blockchain systems, and captures the tradeoff between the network delay and the mining power of the attacker needed to double-spend in the GHOST protocol.
Proceedings ArticleDOI

Red Belly: A Secure, Fair and Scalable Open Blockchain

TL;DR: Red Belly Blockchain (RBBC) as mentioned in this paper is the first secure blockchain whose throughput scales to hundreds of geodistributed consensus participants by defining the Set Byzantine Con-sensus problem of agreeing on a superblock of all proposed blocks instead of a single block.
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)