DeepAI AI Chat
Log In Sign Up

Free2Shard: Adaptive-adversary-resistant sharding via Dynamic Self Allocation

05/19/2020
by   Ranvir Rana, et al.
0

Propelled by the growth of large-scale blockchain deployments, much recent progress has been made in designing sharding protocols that achieve throughput scaling linearly in the number of nodes. However, existing protocols are not robust to an adversary adaptively corrupting a fixed fraction of nodes. In this paper, we propose Free2Shard – a new architecture that achieves near-linear scaling while being secure against a fully adaptive adversary. The focal point of this architecture is a dynamic self-allocation algorithm that lets users allocate themselves to shards in response to adversarial action, without requiring a central or cryptographic proof. This architecture has several attractive features unusual for sharding protocols, including: (a) the ability to handle the regime of large number of shards (relative to the number of nodes); (b) heterogeneous shard demands; (c) requiring only a small minority to follow the self-allocation; (d) asynchronous shard rotation; (e) operation in a purely identity-free proof-of-work setting. The key technical contribution is a deep mathematical connection to the classical work of Blackwell in dynamic game theory.

READ FULL TEXT

page 1

page 2

page 3

page 4

10/15/2020

PoSAT: Proof-of-Work Availability andUnpredictability, without the Work

An important feature of Proof-of-Work (PoW) blockchains is full dynamic ...
05/16/2018

On the Significance of Quiescent Protocols for Asynchronous Perfectly Secure Message Transmission

We consider the problem of perfect (information-theoretically) secure me...
11/18/2020

Experimental implementation of secure anonymous protocols on an eight-user quantum network

Anonymity in networked communication is vital for many privacy-preservin...
01/15/2020

An n/2 Byzantine node tolerate Blockchain Sharding approach

Traditional Blockchain Sharding approaches can only tolerate up to n/3 o...
11/16/2018

Deciding Indistinguishability

Computational indistinguishability is a key property in cryptography and...
05/15/2021

Byzantine-Resilient Population Protocols

Population protocols model information spreading in networks where pairw...
09/03/2019

A Generic Sharding Scheme for Blockchain Protocols

This thesis introduces a formal general framework for scaling blockchain...