Zero-Knowledge IOPs Approaching Witness Length

被引:0
|
作者
Ron-Zewi, Noga [1 ]
Weiss, Mor [2 ]
机构
[1] Univ Haifa, Haifa, Israel
[2] Bar Ilan Univ, Ramat Gan, Israel
来源
关键词
PRODUCTS;
D O I
10.1007/978-3-031-68403-6_4
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Interactive Oracle Proofs (IOPs) allow a probabilistic verifier interacting with a prover to verify the validity of an NP statement while reading only few bits from the prover messages. IOPs generalize standard Probabilistically-Checkable Proofs (PCPs) to the interactive setting, and in the few years since their introduction have already exhibited major improvements in main parameters of interest (such as the proof length and prover and verifier running times), which in turn led to significant improvements in constructions of succinct arguments. Zero-Knowledge (ZK) IOPs additionally guarantee that the view of any query-bounded (possibly malicious) verifier can be efficiently simulated. ZK-IOPs are the main building block of succinct ZK arguments which use the underlying cryptographic object (e.g., a collision-resistant hash function) as a black box. In this work, we construct the first ZK-IOPs approaching the witness length for a natural NP problem. More specifically, we design constantquery and constant-round IOPs for 3SAT in which the total communication is (1 +gamma)m, where m is the number of variables and gamma > 0 is an arbitrarily small constant, and ZK holds against verifiers querying m(beta) bits from the prover's messages, for a constant beta > 0. This gives a ZK variant of a recent result of Ron-Zewi and Rothblum (FOCS '20), who construct (non-ZK) IOPs approaching the witness length for a large class of NP languages. Previous constructions of ZK-IOPs incurred an (unspecified) large constant multiplicative overhead in the proof length, even when restricting to ZK against the honest verifier. We obtain our ZK-IOPs by improving the two main building blocks underlying most ZK-IOP constructions, namely ZK codes and ZK-IOPs for sumcheck. More specifically, we give the first ZK-IOPs for sumcheck that achieve both sublinear communication for sumchecking a general tensor code, and a ZK guarantee. We also show a strong ZK preservation property for tensors of ZK codes, which extends a recent result of Bootle, Chiesa, and Liu (EC '22). Given the central role of these objects in designing ZK-IOPs, these results might be of independent interest.
引用
收藏
页码:105 / 137
页数:33
相关论文
共 50 条
  • [21] Local Proofs Approaching the Witness Length
    Ron-Zewi, Noga
    Rothblum, Ron
    JOURNAL OF THE ACM, 2024, 71 (03)
  • [22] ON THE KNOWLEDGE TIGHTNESS OF ZERO-KNOWLEDGE PROOFS
    ITOH, T
    KAWAKUBO, A
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1994, E77A (01) : 47 - 55
  • [23] The Knowledge Tightness of Parallel Zero-Knowledge
    Chung, Kai-Min
    Pass, Rafael
    Tseng, Wei-Lung Dustin
    THEORY OF CRYPTOGRAPHY (TCC 2012), 2012, 7194 : 512 - 529
  • [24] Unifying Zero-Knowledge Proofs of Knowledge
    Maurer, Ueli
    PROGRESS IN CRYPTOLOGY - AFRICACRYPT 2009, 2009, 5580 : 272 - 286
  • [25] Zero-knowledge and code obfuscation
    Hada, S
    ADVANCES IN CRYPTOLOGY ASIACRYPT 2000, PROCEEDINGS, 2000, 1976 : 443 - 457
  • [26] A GENERAL ZERO-KNOWLEDGE SCHEME
    BURMESTER, MVD
    DESMEDT, Y
    PIPER, F
    WALKER, M
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 434 : 122 - 133
  • [27] Zero-Knowledge: Abstract of a tutorial
    Goldreich, O
    FOCS 2002: 43RD ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2002, : 3 - 3
  • [28] ZERO-KNOWLEDGE UNDENIABLE SIGNATURES
    CHAUM, D
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 473 : 458 - 464
  • [29] ACHIEVING ZERO-KNOWLEDGE ROBUSTLY
    KILIAN, J
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 537 : 313 - 325
  • [30] Zero-knowledge proofs of retrievability
    Yan Zhu
    HuaiXi Wang
    ZeXing Hu
    Gail-Joon Ahn
    HongXin Hu
    Science China Information Sciences, 2011, 54 : 1608 - 1617