Polar Coded Merkle Tree: Improved Detection of Data Availability Attacks in Blockchain Systems

  title={Polar Coded Merkle Tree: Improved Detection of Data Availability Attacks in Blockchain Systems},
  author={Debarnab Mitra and Lev Tauz and Lara Dolecek},
  journal={2022 IEEE International Symposium on Information Theory (ISIT)},
Light nodes in blockchain systems are known to be vulnerable to data availability (DA) attacks where they accept an invalid block with unavailable portions. Previous works have used LDPC and 2-D Reed Solomon (2D-RS) codes with Merkle Trees to mitigate DA attacks. While these codes have demonstrated improved performance across a variety of metrics such as DA detection probability, they are difficult to apply to blockchains with large blocks due to generally intractable code guarantees for large… 

Figures and Tables from this paper


Concentrated Stopping Set Design for Coded Merkle Tree: Improving Security Against Data Availability Attacks in Blockchain Systems
A more specialized LDPC code design is demonstrated that focuses on concentrating stopping sets to a small group of variable nodes rather than only eliminating stopping sets and demonstrates a higher probability of detecting DA attacks and allows for good codes at short lengths.
Overcoming Data Availability Attacks in Blockchain Systems: LDPC Code Design for Coded Merkle Tree
It is demonstrated that a suitable co-design of specialized LDPC codes and the light node sampling strategy can improve the probability of detection of data availability (DA) attacks.
Coded Merkle Tree: Solving Data Availability Attacks in Blockchains
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
Optimization of a Reed-Solomon code-based protocol against blockchain data availability attacks
This paper introduces a much simpler model for such a protocol, which additionally supports the use of codes with arbitrary rate, which makes blockchains implementing ASBK much easier to design and optimize.
Communication-Efficient LDPC Code Design for Data Availability Oracle in Side Blockchains
This paper provides a tailored dispersal protocol and specialized LDPC code construction based on the Progressive Edge growth algorithm, called the dispersal-efficient PEG (DE-PEG) algorithm, aimed to reduce the communication cost associated with the new dispersal Protocol.
Patterned Erasure Correcting Codes for Low Storage-Overhead Blockchain Systems
This work observes that node failures in the network can occur periodically, and takes advantage of this property to develop a coding scheme which corrects a predefined set of possible node erasure patterns, which achieve the minimum average storage per node under the given assumptions.
SeF: A Secure Fountain Architecture for Slashing Storage Costs in Blockchains
The proposed "Secure Fountain (SeF)" architecture can achieve a near-optimal trade-off between the storage savings per node and the 'bootstrap cost' in terms of the number of (honest) storage-constrained nodes a new node needs to contact to recover the blockchain.
Low Latency Cross-Shard Transactions in Coded Blockchain
This paper proposes a novel 2-Dimensional Sharding strategy, which inherently supports cross-shard transactions, alleviating the need for complicated inter-sharding communication protocols, and incorporates polynomial cryptographic primitives of low degree, which brings coded blockchain techniques into the realm of feasible real-world parameters.
Secure Regenerating Codes for Reducing Storage and Bootstrap Costs in Sharded Blockchains
The proposed blockchain protocol, Secure-Repair-Blockchain (SRB), achieves lower storage than those that do not use coding, and achieves lower bootstrapping cost as compared to the different baselines.
Secure Raptor Encoder and Decoder for Low Storage Blockchain
  • Aayush Tiwari, V. Lalitha
  • Computer Science
    2021 International Conference on COMmunication Systems & NETworkS (COMSNETS)
  • 2021
This paper presents Secure Raptor Encoder and Decoder (S-RED) built on Raptor Codes, which in addition to reducing storage costs, also has constant decoding time with respect to k (number of input blocks), and presents error-resilient double-peeling decoder that can recover original blocks with a high probability, even under the presence of adversaries.