Proceedings ArticleDOI
A Secure Sharding Protocol For Open Blockchains
Loi Luu,Viswesh Narayanan,Chaodong Zheng,Kunal Baweja,Seth Gilbert,Prateek Saxena +5 more
- pp 17-30
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
Coordinate Routing in the Lightning Network
TL;DR: This thesis designs a routing algorithm for the Lightning Network that builds upon the key ideas found in the previous work and provides design solutions for computing transaction fees and communicating errors in a privacy-preserving manner.
Journal ArticleDOI
A two-layer consortium blockchain with transaction privacy protection based on sharding technology
Optimistic Fast Confirmation While Tolerating Malicious Majority in Blockchains
Ruomu Hou,Haifeng Yu +1 more
TL;DR: Flint as mentioned in this paper is a blockchain that tolerates a small fraction of adversarial power and can give optimistic execution whenever f is relatively small, which can reduce the confirmation latency of blockchains.
Proceedings ArticleDOI
GeoChain: A Locality-Based Sharding Protocol for Permissioned Blockchains
Chunyu Mao,Wojciech Golab +1 more
TL;DR: Geochain this article is a locality-based sharding protocol that achieves high scalability by clustering participants using their geographical properties, locality is also employed to decide the transaction placement which results in a low ratio of cross-shard transactions for applications.
Proceedings ArticleDOI
Research on blockchain scalability based on sharding strategy
TL;DR: Wang et al. as mentioned in this paper improved the Byzantine consensus protocol and improved the throughput of a single shard; on this basis, an efficient shard formation protocol is designed, which can safely assign nodes to shards.
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
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
Miguel Castro,Barbara Liskov +1 more
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.