We gratefully acknowledge support from
the Simons Foundation and member institutions.
Full-text links:

Download:

Current browse context:

cs.DC

Change to browse by:

cs

References & Citations

Bookmark

(what is this?)
CiteULike logo BibSonomy logo Mendeley logo del.icio.us logo Digg logo Reddit logo

Computer Science > Distributed, Parallel, and Cluster Computing

Title: TRAIL: Cross-Shard Validation for Cryptocurrency Byzantine Shard Protection

Abstract: We present TRAIL: an algorithm that uses a novel consensus procedure to tolerate failed or malicious shards within a blockchain-based cryptocurrency. Our algorithm takes a new approach of selecting validator shards for each transaction from those that previously held the assets being transferred. This approach ensures the algorithm's robustness and efficiency. TRAIL is presented using PBFT for internal shard transaction processing and a modified version of PBFT for external cross-shard validation. We describe TRAIL, prove it correct, analyze its message complexity, and evaluate its performance. We propose various TRAIL optimizations: we describe how it can be adapted to other Byzantine-tolerant consensus algorithms, how a complete system may be built on the basis of it, and how TRAIL can be applied to existing and future sharded blockchains.
Subjects: Distributed, Parallel, and Cluster Computing (cs.DC)
Cite as: arXiv:2405.07146 [cs.DC]
  (or arXiv:2405.07146v1 [cs.DC] for this version)

Submission history

From: Mikhail Nesterenko [view email]
[v1] Sun, 12 May 2024 03:17:21 GMT (330kb,D)

Link back to: arXiv, form interface, contact.