论文标题
极地编码的默克尔树：改进区块链系统中数据可用性攻击的检测
Polar Coded Merkle Tree: Improved Detection of Data Availability Attacks in Blockchain Systems
论文作者
论文摘要
已知区块链系统中的光节点容易受到数据可用性（DA）攻击的影响，在该攻击中，他们接受了无效部分的无效块。先前的工作使用了LDPC和2-D REED所罗门（2D-RS）代码，并使用Merkle树来减轻DA攻击。尽管这些代码表明在多种指标（例如DA检测概率）上的性能提高了，但由于大型代码长度（LDPC），大型解码复杂性（2DD-RS）或大型编码欺诈尺寸（2DD-RS），它们很难应用于具有大块的区块链。我们通过提出新颖的极地编码的默克尔树（PCMT）来解决这些问题，该树是由极地代码的编码图和称为采样高效冻结（SEF）的专门极地代码构建（SEF）构建的默克尔树。我们证明，具有SEF极性代码的PCMT在检测大型大小的DA攻击方面表现良好。
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 codelengths (LDPC), large decoding complexity (2D-RS), or large coding fraud proof sizes (2D-RS). We address these issues by proposing the novel Polar Coded Merkle Tree (PCMT) which is a Merkle Tree built from the encoding graphs of polar codes and a specialized polar code construction called Sampling-Efficient Freezing (SEF). We demonstrate that the PCMT with SEF polar codes performs well in detecting DA attacks for large block sizes.
