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
Book ChapterDOI
Formalizing Delayed Adaptive Corruptions and the Security of Flooding Networks
TL;DR: In this article , the authors show that a sufficiently delayed adversary can corrupt any constant fraction of the nodes in a gossip network, but not all nodes in the gossip network at the same time.
Proceedings ArticleDOI
Tiny Groups Tackle Byzantine Adversaries
TL;DR: In this article, the authors consider an attacker that controls a constant fraction of the total computational resources in the system and demonstrate how to reduce the group size exponentially to O(log log n) while maintaining strong security guarantees.
Journal ArticleDOI
On the Blockchain-Based Decentralized Data Sharing for Event Based Encryption to Combat Adversarial Attacks
TL;DR: This research proposes a variant of Attribute-Based Encryption (ABE), called EBE, that will help avoid adversarial attacks and introduces a decentralized data sharing network powered by the blockchain technology that ensures data undergoes a thorough vetting process before it is accepted to the network.
Journal ArticleDOI
Scalable blockchain storage systems: research progress and models
TL;DR: The study finds that the key to realizing scalable Blockchain storage systems is to deal with the contradiction between data redundancy and its decentralization characteristic and proposes the node-based scalable model for Blockchain storage system (SMBSS).
Proceedings ArticleDOI
Fusion of Named Data Networking and Blockchain for Resilient Internet-of-Battlefield-Things
TL;DR: This paper investigates an approach that merges blockchain and NDN to efficiently utilize the resources of these resource-constrained nodes by only storing relevant information on each node's ledger and proposes a sharding technique called an Interest Group and introduces a novel consensus mechanism called Proof of Common Interest.
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.