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

Lights nodes are commonly used in blockchain systems to combat the storage burden. However, light nodes are known to be vulnerable to data availability (DA) attacks where they accept an invalid block with unavailable portions. Previous works have used LDPC codes with Merkle Trees to mitigate DA attacks. However, LDPC codes have issues in the finite length due to the NP-hardness of ascertaining the minimum stopping set size, and in the asymptotic regime due to probabilistic guarantees on code performance. We circumvent both issues by proposing the novel Polar Coded Merkle Tree (PCMT) which is a Merkle Tree built from the encoding graphs of polar codes. We provide a specialized polar code construction called Sampling-Efficient Freezing that efficiently calculates the minimum stopping set size, thus simplifying design. PCMT performs well in detecting DA attacks for large transaction block sizes.

[1]  Sreeram Kannan,et al.  Coded Merkle Tree: Solving Data Availability Attacks in Blockchains , 2019, IACR Cryptol. ePrint Arch..

[2]  Sreeram Kannan,et al.  ACeD: Scalable Data Availability Oracle , 2021, Financial Cryptography.

[3]  Liping Li,et al.  On the encoding complexity of systematic polar codes , 2015, 2015 28th IEEE International System-on-Chip Conference (SOCC).

[4]  Hossein Pishro-Nik,et al.  On Finite-Length Performance of Polar Codes: Stopping Sets, Error Floor, and Concatenated Design , 2012, IEEE Transactions on Communications.

[5]  Kannan Ramchandran,et al.  SeF: A Secure Fountain Architecture for Slashing Storage Costs in Blockchains , 2019, ArXiv.

[6]  Nikolay Teslya,et al.  Blockchain-based platform architecture for industrial IoT , 2017, 2017 21st Conference of Open Innovations Association (FRUCT).

[7]  Vaneet Aggarwal,et al.  Secure Regenerating Codes for Reducing Storage and Bootstrap Costs in Sharded Blockchains , 2020, 2020 IEEE International Conference on Blockchain (Blockchain).

[8]  Lara Dolecek,et al.  Overcoming Data Availability Attacks in Blockchain Systems: LDPC Code Design for Coded Merkle Tree , 2021, ArXiv.

[9]  Lara Dolecek,et al.  Communication-Efficient LDPC Code Design for Data Availability Oracle in Side Blockchains , 2021, 2021 IEEE Information Theory Workshop (ITW).

[10]  Michael Gastpar,et al.  On LP decoding of polar codes , 2010, 2010 IEEE Information Theory Workshop.

[11]  Kannan Ramchandran,et al.  CoVer: Collaborative Light-Node-Only Verification and Data Availability for Blockchains , 2020, 2020 IEEE International Conference on Blockchain (Blockchain).

[12]  Lara Dolecek,et al.  Concentrated Stopping Set Design for Coded Merkle Tree: Improving Security Against Data Availability Attacks in Blockchain Systems , 2020, ArXiv.

[13]  S. Nakamoto,et al.  Bitcoin: A Peer-to-Peer Electronic Cash System , 2008 .

[14]  Erdal Arikan,et al.  Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels , 2008, IEEE Transactions on Information Theory.

[15]  Yi Mu,et al.  Achieving Intelligent Trust-Layer for Internet-of-Things via Self-Redactable Blockchain , 2020, IEEE Transactions on Industrial Informatics.

[16]  Jaekyun Moon,et al.  Scalable Network-Coded PBFT Consensus Algorithm , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

[17]  Jérôme Lacan,et al.  Erasure Code-Based Low Storage Blockchain Node , 2018, 2018 IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData).

[18]  Shi Jin,et al.  A Low Storage Room Requirement Framework for Distributed Ledger in Blockchain , 2018, IEEE Access.

[19]  David E. Muller,et al.  Application of Boolean algebra to switching circuit design and to error detection , 1954, Trans. I R E Prof. Group Electron. Comput..

[20]  Erdal Arikan,et al.  Systematic Polar Coding , 2011, IEEE Communications Letters.

[21]  Matthias Mettler,et al.  Blockchain technology in healthcare: The revolution starts here , 2016, 2016 IEEE 18th International Conference on e-Health Networking, Applications and Services (Healthcom).

[22]  Netanel Raviv,et al.  Low Latency Cross-Shard Transactions in Coded Blockchain , 2020, 2021 IEEE International Symposium on Information Theory (ISIT).

[23]  David Tse,et al.  Information Dispersal with Provable Retrievability for Rollups , 2021, IACR Cryptol. ePrint Arch..

[24]  Lara Dolecek,et al.  Patterned Erasure Correcting Codes for Low Storage-Overhead Blockchain Systems , 2019, 2019 53rd Asilomar Conference on Signals, Systems, and Computers.

[25]  A. E. Pusane,et al.  An integer programming-based search technique for error-prone structures of LDPC codes , 2014 .

[26]  Priti Shankar,et al.  Computing the Stopping Distance of a Tanner Graph Is NP-Hard , 2007, IEEE Transactions on Information Theory.

[27]  Khaled Salah,et al.  Blockchain for AI: Review and Open Research Challenges , 2019, IEEE Access.

[28]  Vitalik Buterin,et al.  Fraud and Data Availability Proofs: Detecting Invalid Blocks in Light Clients , 2021, Financial Cryptography.

[29]  Daniel Davis Wood,et al.  ETHEREUM: A SECURE DECENTRALISED GENERALISED TRANSACTION LEDGER , 2014 .

[30]  Rüdiger L. Urbanke,et al.  Modern Coding Theory , 2008 .

[31]  Sreeram Kannan,et al.  PolyShard: Coded Sharding Achieves Linearly Scaling Efficiency and Security Simultaneously , 2018, IEEE Transactions on Information Forensics and Security.

[32]  Evangelos Eleftheriou,et al.  Regular and irregular progressive edge-growth tanner graphs , 2005, IEEE Transactions on Information Theory.

[33]  Shengli Zhang,et al.  Downsampling and Transparent Coding for Blockchain , 2019, IEEE Transactions on Network Science and Engineering.

[34]  V. Lalitha,et al.  Secure Raptor Encoder and Decoder for Low Storage Blockchain , 2021, 2021 International Conference on COMmunication Systems & NETworkS (COMSNETS).