scispace - formally typeset
Proceedings ArticleDOI

A Secure Sharding Protocol For Open Blockchains

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

Rapido: Scaling blockchain with multi-path payment channels

TL;DR: This paper proposes a multi-path off-chain payment mechanism, termed Rapido, which explicitly addresses the overload and privacy leaking issues by splitting and distributing payment to multiple paths and theoretically proves that the VDP (Value Distributing Problem) is NP-hard.
Journal ArticleDOI

LiteZKP: Lightening Zero-Knowledge Proof-Based Blockchains for IoT and Edge Platforms

- 01 Mar 2022 - 
TL;DR: In this article , the authors propose a framework for supporting multiple anonymous payments using a smart contract-based zero-knowledge proof (ZKP) protocol on resource-limited devices, to address challenges related to minimizing the computational overhead and offer a fully anonymous system.
Posted Content

Efficient Algorithms for Broadcast and Consensus Based on Proofs of Work

TL;DR: This work designs protocols for Broadcast and Byzantine agreement that are secure under the assumption that the majority of computing power is controlled by the honest parties and for the first time have expected constant round complexity.
Journal ArticleDOI

A survey of blockchain consensus safety and security: State-of-the-art, challenges, and future work

TL;DR: In this paper , a comprehensive survey focusing on the safety and security of blockchain consensus protocols is provided, where the authors discuss in detail the classification of consensus protocols, the potential safety issues and security problems, safety assurance approaches, and validation methods.
Journal ArticleDOI

SoK: Decentralized Finance (DeFi) Incidents

TL;DR: A common reference frame is introduced to systematically evaluate and compare DeFi incidents and investigates potential defenses, finding that 103 of the attacks are not executed atomically, granting a rescue time frame for defenders.
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

Nancy Lynch
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

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.
Related Papers (5)