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
Proceedings ArticleDOI
Cost-Effective Data Feeds to Blockchains via Workload-Adaptive Data Replication
TL;DR: This work presents GRuB, a cost-effective data feed that dynamically replicates data between the blockchain and off-chain cloud storage that monitors the current workload and makes data-replication decisions in a workload-adaptive fashion.
Journal ArticleDOI
Systematic Review on AI-Blockchain Based E-Healthcare Records Management Systems
Alaa S. Al – Haddad,Mohamed Hadi Habaebi,Md. Rafiqul Islam,Nurul Fadzlin Hasbullah,Suriza Ahmad Zabidi +4 more
TL;DR: The SLR has illustrated that blockchain technology has the potential to deliver decentralization, security, and privacy that are frequently lacking in traditional EHRs.
Posted Content
Boros: Secure Cross-Channel Transfers via Channel Hub.
TL;DR: A new protocol named Boros is design and developed to perform secure off-chain cross-channel transfers through the channel hub, which is an extension of the payment hub to allows transferring coins directly from one payment channel to another within the same hub.
Posted Content
Efficient Cross-Shard Transaction Execution in Sharded Blockchains
TL;DR: Rivet is presented, a new paradigm for blockchain sharding that achieves lower latency and higher throughput for cross-shard transactions, and obviates the need for consensus within each worker shard, and as a result, tolerates more failures within a shard and lowers communication overhead.
Book ChapterDOI
Generic Superlight Client for Permissionless Blockchains
Yuan Lu,Qiang Tang,Guiling Wang +2 more
TL;DR: In this paper, a light-client protocol for permissionless blockchains is proposed, where full nodes and light clients are rational and the computational cost of the light client to predicate the (non)existence of a transaction in the blockchain becomes a small constant.
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.