Scholarlink

<p>Data Availability Sampling (DAS) is a pivotal paradigm for addressing scalability challenges in blockchains. However, the predominant DAS schemes rely on KZG commitments, which necessitate a trusted setup. While the recently proposed FRIDA (Crypto’24) offers a transparent, FRI-based alternative, it suffers from large commitment sizes due to its restriction to the unique decoding radius. In this work, we generalize the protocol to the list decoding radius by leveraging the DEEP (Domain Extension for Eliminating Pretenders) technique. We provide a formal proof of the opening-consistency of the DEEP-FRI, established via the notion of <i>mutual correlated agreement</i>, instead of the weighted correlated agreement in the original DEEP-FRI protocol. In terms of efficiency, our scheme reduces the commitment size by a factor of <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(1.2 \sim 1.8\times\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>1.2</mn> <mo>∼</mo> <mn>1.8</mn> <mo>×</mo> </mrow> </math></EquationSource> </InlineEquation> while preserving the computational efficiency of both the prover and the verifier.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Deep-frida: transparent data availability sampling with smaller size

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年4月1日

查看全文
  • Ming Yang,
  • Xinxuan Zhang,
  • Yi Deng

摘要

Data Availability Sampling (DAS) is a pivotal paradigm for addressing scalability challenges in blockchains. However, the predominant DAS schemes rely on KZG commitments, which necessitate a trusted setup. While the recently proposed FRIDA (Crypto’24) offers a transparent, FRI-based alternative, it suffers from large commitment sizes due to its restriction to the unique decoding radius. In this work, we generalize the protocol to the list decoding radius by leveraging the DEEP (Domain Extension for Eliminating Pretenders) technique. We provide a formal proof of the opening-consistency of the DEEP-FRI, established via the notion of mutual correlated agreement, instead of the weighted correlated agreement in the original DEEP-FRI protocol. In terms of efficiency, our scheme reduces the commitment size by a factor of \(1.2 \sim 1.8\times\) 1.2 ∼ 1.8 × while preserving the computational efficiency of both the prover and the verifier.