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.
翻译：电灯节点通常用于链锁系统,以克服存储负担。然而,光节点在接受一个没有部件的无效区块时,很容易受到数据可用性(DA)攻击的影响。以前的工作使用与Merkle 树的LDPC代码来减轻DA袭击。然而,由于NP难以确定最低停停位设置大小,LDPC代码的长度有限,以及由于对代码性能的概率性能保障,在无防护制度中也存在问题。我们通过提出新颖的极地码Merkle 树(PCMT)来回避这两个问题,这是从极地代码编码图中建造的默克尔树(Merkle 树 ) 。我们提供了一种名为“ 采样- 有效解冻” 的专门极地代码结构,它能有效计算最小停位定尺寸,从而简化设计。PCMMT在检测大型交易区块大小的DA袭击方面表现良好。
相关内容
微信扫码咨询专知VIP会员