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
Journal ArticleDOI
BOSSA: A Decentralized System for Proofs of Data Retrievability and Replication
TL;DR: This article proposes the first decentralized system for proofs of data retrievability and replication and implements a prototype based ontex-math notation="LaTeX" leveraging the smart contracts of Ethereum blockchain that incorporates privacy-enhancing techniques to prevent decentralized peers from inferring private information about the outsourced data.
Patent
Parallel transaction execution method based on blockchain
TL;DR: In this paper, a parallel transaction execution method based on a blockchain is proposed, where a data unit on the datachain is subjected to index numbering, the parallel transaction of a user needs to provide a data index which needs to be read and written for transaction execution in addition to basic transaction contents.
Book ChapterDOI
You Sank My Battleship! A Case Study to Evaluate State Channels as a Scaling Solution for Cryptocurrencies
TL;DR: The minimal modifications required to deploy the battleship game as a state channel are explored, a new state channel construction is proposed, Kitsune, which combines features from existing constructions and the requirement for unanimous off-chain agreement is introduced.
Book ChapterDOI
Performance Benchmarking and Optimization for Blockchain Systems: A Survey.
TL;DR: The architecture and consensus protocols of the current mainstream blockchain systems are introduced, some open source blockchain benchmarking tools are analyzed, and some blockchain systems optimization methods are summarized to better understand the state-of-art of the blockchain.
Posted Content
A Game-Theoretic Analysis of Cross-Chain Atomic Swaps with HTLCs
TL;DR: This study proposes a game-theoretic framework to study the strategic behaviors of agents taking part in cross-chain atomic swaps implemented with HTLCs, and demonstrates that both agents might decide not to follow the protocol in an attempt to exploit price variations so as to maximize one's own utility.
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.