当前位置: X-MOL 学术Theor. Comput. Sci. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP
Theoretical Computer Science ( IF 0.9 ) Pub Date : 2021-06-03 , DOI: 10.1016/j.tcs.2021.05.030
Oded Goldreich , Tom Gur

Universal locally testable codes (universal-LTCs), recently introduced in our companion paper (CJTCS, 2018), are codes that admit local tests for membership in numerous subcodes, allowing for testing properties of the encoded message. Unfortunately, universal-LTCs suffer strong limitations, which motivate us to initiate, in this work, the study of the “NP analogue” of these codes, wherein the testing procedures are also given free access to a short proof, akin the MA proofs of proximity of Gur and Rothblum (Computational Complexity 2018). We call such codes “universal locally verifiable codes” (universal-LVCs).

A universal-LVC C:{0,1}k{0,1}η for a family of functions F={fi:{0,1}k{0,1}}i[M] is a code such that, for every i[M], membership in the subcode {C(x):fi(x)=1} can be verified locally using explicit access to a short (sublinear length) proof. A universal-LVC can be viewed as providing an encoding of inputs under which a large family of properties of the encoded inputs can be locally testable using a short proof.

We show universal-LVCs of block length O˜(n2) for the family of all functions expressible by t-ary constraint satisfaction problems (t-CSP) over n constraints and k variables, with proof length and query complexity O˜(n2/3), where t=O(1) and nk. In addition, we prove a lower bound of pq=Ω˜(k) for every polynomial length universal-LVC, having proof complexity p and query complexity q, for such CSP functions.

We give an application of universal-LVCs for interactive proofs of proximity (IPP), introduced by Rothblum, Vadhan, and Wigderson (STOC 2013), which are interactive proof systems wherein the verifier queries only a sublinear number of input bits to the end of asserting that, with high probability, the input is close to an accepting input. Specifically, we show a 3-round IPP for the set of assignments that satisfy fixed CSP instances, with sublinear communication and query complexity, which we derive from our universal-LVC for CSP functions.



中文翻译:

CSP 的通用本地可验证代码和 3 轮交互式邻近证明

通用本地可测试代码(普遍的——LTCs),最近在我们的配套论文 ( CJTCS , 2018) 中引入,是允许对众多子代码中的成员资格进行本地测试的代码,允许测试编码消息的属性。很遗憾,普遍的——LTCs 受到很大的限制,这促使我们在这项工作中开始研究这些代码的“NP 类似物”,其中测试程序也可以免费访问一个简短的证明,类似于 Gur 和 Rothblum 接近的证明(计算复杂性2018)。我们称此类代码为“通用本地可验证代码”(普遍的——LVCs)。

一种 普遍的——LVC C{0,1}{0,1}η 对于函数族 F={F一世{0,1}{0,1}}一世[] 是这样的代码,对于每个 一世[], 子代码中的成员资格 {C(X)F一世(X)=1}可以使用对短(次线性长度)证明的显式访问在本地进行验证。一种普遍的——LVC可以被视为提供输入的编码,在这种编码下,可以使用简短的证明在本地测试编码输入的一大类属性。

我们展示 普遍的——LVC块长度 s (n2)为家庭的所有功能可表达由进制约束满足问题(-csp)超过Ñ约束和ķ变量,以及证明长度和复杂性的查询(n2/3), 在哪里 =(1)n. 此外,我们证明了下界q=Ω() 对于每个多项式长度 普遍的——LVC,对于此类 CSP 函数,具有证明复杂度p和查询复杂度q

我们给出一个应用 普遍的——LVCs 用于邻近性的交互式证明独立计划),由 Rothblum、Vadhan 和 Wigderson ( STOC 2013)引入,它们是交互式证明系统,其中验证器仅查询次线性数量的输入位,直到断言很可能输入接近接受输入. 具体来说,我们展示了一个 3 轮独立计划 对于满足固定 CSP 实例的一组分配,具有亚线性通信和查询复杂性,我们从我们的 普遍的——LVC 用于 CSP 功能。

更新日期:2021-07-13
down
wechat
bug