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

A Privacy-Preserving Route Leak Protection Mechanism Based on Blockchain

TL;DR: Wang et al. as mentioned in this paper presented a privacy-preserving route leak protection mechanism called RLPchain based on the blockchain and trusted execution environment, each autonomous system maintains a global confidential and tamper-proofing inter-domain routing policy repository, detecting and preventing interdomain routing leaks.
Proceedings ArticleDOI

An improved PBFT consensus mechanism based on quality of service

TL;DR: Wang et al. as mentioned in this paper proposed an improved PBFT consensus based on quality of service, where nodes with high service quality will have a greater chance to participate in the consensus, reducing the probability of low service quality and malicious nodes becoming block producers.
Journal ArticleDOI

Understanding the Benefit of Being Patient in Payment Channel Networks

TL;DR: Wang et al. as mentioned in this paper investigated the routing from a different perspective by answering whether the routing fee of transactions can be saved through being a bit more patient, and they presented two mechanisms, one is periodic transaction processing and the other is purely strategic waiting.
Journal ArticleDOI

Validating pairwise transactions on cryptocurrencies: a novel heuristics and network simulation

TL;DR: The heuristic is based on simulating the participants sending and receiving transactions and concludes that the number of transactions processed per second improves by increasing the block size as well as avoiding file access.
Proceedings ArticleDOI

NoCo: An Efficient Transaction Propagation Protocol for Open Blockchains

TL;DR: A new node count based transaction propagation protocol for less competitive mining called as NoCo that distributes a transaction from a node to the nearby miners based on the node count between them and thereby decreasing the competition, and hence this is beneficial for the miners as well as for the networks scalability.
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)