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
Proceedings ArticleDOI

Optimal Fee Structure for Efficient Lightning Networks

TL;DR: A good compromise is to have fees proportional to the square root of the channel capacity, such that reasonably short path lengths and overall balanced channel capacities can be achieved that makes the operation of the LN more sustainable.
Proceedings ArticleDOI

Bridging Paxos and Blockchain Consensus

TL;DR: A case for bridging the gap between blockchain consensus and a classical consensus protocol, Paxos, is made and more extensive use of formal methods in modeling the blockchains and smartcontracts are suggested.
Book ChapterDOI

Optimal Security Reductions for Unique Signatures: Bypassing Impossibilities with a Counterexample

TL;DR: In this article, it was shown that under a non-interactive hard assumption, any security reduction (with or without random oracles) for a unique signature scheme or an efficiently re-randomizable signature scheme must loose a factor of at least q s in the security model of existential unforgeability against chosen-message attacks (EU-CMA), where q s denotes the number of signature queries.
Journal ArticleDOI

Blockchain State Sharding With Space-Aware Representations

TL;DR: In this article, the tradeoff between the size of the mapping of data to shards and the required transaction processing time is discussed and algorithms for finding memory-light sharding of low cross-shard rate are proposed.
Posted Content

Parasite Chain Detection in the IOTA Protocol

TL;DR: This paper presents a detection mechanism for a Parasite Chain attack that attempts to revert the history stored in the DAG structure, also called the Tangle, and shows that due to a form of the parasite Chain that is different from the main Tangle it is possible to detect certain types of malicious chains.
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)