arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1903.12243cs.CCcs.CRcs.ITmath.IT
收藏

DEEP-FRI:开箱即用的采样提高了可靠性

DEEP-FRI: Sampling outside the box improves soundness

Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf

摘要:

出于对可扩展和简洁的零知识参数的追求,我们重新审视了线性空间的最坏情况到平均情况约简,由[Rothblum,Vadhan,Wigderson,STOC 2013]提出。我们首先展示一个定理的精确的定量形式,该定理说,如果仿射空间$U$是$δ$ -远离线性码$V$的相对汉明距离-这是最坏情况的假设-那么$U$的大多数元素几乎是$δ$ -远离$V$ -这是平均情况。这导致对[Ben-Sasson,et.al.,eprint 2018],用于证明接近Reed-Solomon码。为了进一步提高可靠性,我们在盒子外取样。我们提出了一个新的协议,要求证明人的多项式的值在域外的里德-所罗门代码的评价点。我们将这种技术称为Domain Extending for Eliminating Pretenders(DEEP)。我们使用DEEP技术设计了两个新的协议:(1)一个交互式的Oracle Proof of Proximity(IOPP)的RS码,称为DEEP-FRI。该协议在保持线性算法证明复杂度和对数验证器算法复杂度的同时,提高了FRI协议的可靠性。(2)在[Ben-Sasson等人,eprint 2018]。新协议称为DEEP-ALI,将这一关键步骤的可靠性从一个小常数$< 1/8$提高到一个任意接近$1$的常数。

英文摘要:

Motivated by the quest for scalable and succinct zero knowledge arguments, we revisit worst-case-to-average-case reductions for linear spaces, raised by [Rothblum, Vadhan, Wigderson, STOC 2013]. We first show a sharp quantitative form of a theorem which says that if an affine space $U$ is $δ$-far in relative Hamming distance from a linear code $V$ - this is the worst-case assumption - then most elements of $U$ are almost $δ$-far from $V$ - this is the average case. This leads to an optimal analysis of the soundness of the FRI protocol of [Ben-Sasson, et.al., eprint 2018] for proving proximity to Reed-Solomon codes. To further improve soundness, we sample outside the box. We suggest a new protocol which asks a prover for values of a polynomial at points outside the domain of evaluation of the Reed-Solomon code. We call this technique Domain Extending for Eliminating Pretenders (DEEP). We use the DEEP technique to devise two new protocols: (1) An Interactive Oracle Proof of Proximity (IOPP) for RS codes, called DEEP-FRI. This soundness of the protocol improves upon that of the FRI protocol while retaining linear arithmetic proving complexity and logarithmic verifier arithmetic complexity. (2) An Interactive Oracle Proof (IOP) for the Algebraic Linking IOP (ALI) protocol used to construct zero knowledge scalable transparent arguments of knowledge (ZK-STARKs) in [Ben-Sasson et al., eprint 2018]. The new protocol, called DEEP-ALI, improves soundness of this crucial step from a small constant $< 1/8$ to a constant arbitrarily close to $1$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑