Erasure code-based low storage blockchain node

Perard, Doriane; Lacan, Jérôme; Bachy, Yann; Detchart, Jonathan

doi:10.48550/arxiv.1805.00860

Cited by 1 publication

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This work was inspired by pioneering research in [9], which proposes succinct fraud proofs and 2D-RS based data availability solution. Besides this work, coding also improves scalability of blockchains in other areas: [27] studies the coding efficiency of distributed storage systems [8,14,13,29]. In a related vein, [28] uses a combination of Shamir's secret sharing [31] (for storing the headers and the encryption keys) and private distributed storage (for the blocks) to reduce the storage overhead while guaranteeing data integrity and confidentiality.…”

Section: Introductionmentioning

confidence: 99%

Coded Merkle Tree: Solving Data Availability Attacks in Blockchains

Sahraei

et al. 2019

Preprint

View full text Add to dashboard Cite

In this paper, we propose coded Merkle tree (CMT), a novel hash accumulator that offers a constant-cost protection against data availability attacks in blockchains, even if the majority of the network nodes are malicious. A CMT is constructed using a family of sparse erasure codes on each layer, and is recovered by iteratively applying a peeling-decoding technique that enables a compact proof for data availability attack on any layer. Our algorithm enables any node to verify the full availability of any data block generated by the system by just downloading a Θ(1) byte block hash commitment and randomly sampling Θ(log b) bytes, where b is the size of the data block. With the help of only one connected honest node in the system, our method also allows any node to verify any tampering of the coded Merkle tree by just downloading Θ(log b) bytes. We provide a modular library for CMT in Rust and Python and demonstrate its efficacy inside the Parity Bitcoin client.

show abstract

Section: Introductionmentioning

confidence: 99%

Coded Merkle Tree: Solving Data Availability Attacks in Blockchains

Sahraei

et al. 2019

Preprint

View full text Add to dashboard Cite

show abstract

Erasure code-based low storage blockchain node

Cited by 1 publication

References 0 publications

Coded Merkle Tree: Solving Data Availability Attacks in Blockchains

Coded Merkle Tree: Solving Data Availability Attacks in Blockchains

Contact Info

Product

Resources

About