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
Efficient High Performance FPGA based NoSQL Caching System for Blockchain Scalability and Throughput Improvement
TL;DR: An efficient high performance system for caching the blockchain data in the FPGA network interface controller (NIC) for improving scalability and throughput of blockchain applications and design a customized SHA-256 hash core specific for efficient blockchain caching to save hashing executions and improve the performance.
Proceedings ArticleDOI
Replicated state machines without replicated execution
TL;DR: This paper builds Piperine, a system that makes the proof machinery profitable in the context of RSMs, and demonstrates that, for a payment service, employing Piperine is more profitable than naive reexecution of transactions as long as there are > 104 nodes.
Journal ArticleDOI
A Proof of Work: Securing Majority-Attack in Blockchain Using Machine Learning and Algorithmic Game Theory
TL;DR: This paper proposes a methodology where intelligent software agents can be used to monitor the activity of stakeholders in the blockchain networks to detect anomaly such as collusion, using supervised machine learning algorithm and algorithmic game theory and stop the majority attack from taking place.
Journal ArticleDOI
A Reliable Storage Partition for Permissioned Blockchain
TL;DR: A novel storage engine, called BFT-Store, to enhance storage scalability by integrating erasure coding with Byzantine Fault Tolerance (BFT) consensus protocol is proposed and an efficient online re-encoding protocol for storage scale-out and a hybrid replication scheme to enhance reading performance is designed.
Proceedings ArticleDOI
Blackchain: scalability for resource-constrained accountable vehicle-to-x communication
TL;DR: A distributed ledger solution provides an accountable revocation mechanism without requiring trust in a single misbehavior authority, instead allowing a collaborative and transparent decision making process through Blackchain, an attractive alternative to existing solutions for revocation in a Security Credential Management System.
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.